2000 character limit reached
Uniform concentration and symmetrization for weak interactions
Published 5 Feb 2019 in math.ST, cs.LG, stat.ML, and stat.TH | (1902.01911v4)
Abstract: The method to derive uniform bounds with Gaussian and Rademacher complexities is extended to the case where the sample average is replaced by a nonlinear statistic. Tight bounds are obtained for U-statistics, smoothened L-statistics and error functionals of l2-regularized algorithms.
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.