Permutation Complexity Bound on Out-Sample Error

Malik Magdon-Ismail

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... (read more)

PDF Abstract

No code implementations yet. Submit your code now