Uniform concentration and symmetrization for weak interactions
classification
🧮 math.ST
cs.LGstat.MLstat.TH
keywords
boundsuniformalgorithmsaveragecasecomplexitiesconcentrationderive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.