2000 character limit reached
$\ell_{\infty}$ Vector Contraction for Rademacher Complexity
Published 15 Nov 2019 in cs.LG, math.ST, stat.ML, and stat.TH | (1911.06468v1)
Abstract: We show that the Rademacher complexity of any $\mathbb{R}{K}$-valued function class composed with an $\ell_{\infty}$-Lipschitz function is bounded by the maximum Rademacher complexity of the restriction of the function class along each coordinate, times a factor of $\tilde{O}(\sqrt{K})$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.