Timezone: »

Permutation Complexity Bound on Out-Sample Error
Malik Magdon-Ismail

Tue Dec 07 12:00 AM -- 12:00 AM (PST) @

We define a data dependent permutation complexity for a hypothesis set \math{\hset}, which is similar to a Rademacher complexity or maximum discrepancy. The permutation complexity is based like the maximum discrepancy on (dependent) sampling. We prove a uniform bound on the generalization error, as well as a concentration result which means that the permutation estimate can be efficiently estimated.

Author Information

Malik Magdon-Ismail (RPI)

More from the Same Authors