pith. sign in

arxiv: 1605.03843 · v1 · pith:ONUD3IU4new · submitted 2016-05-11 · 💻 cs.LG · stat.ML

Asymptotic sequential Rademacher complexity of a finite function class

classification 💻 cs.LG stat.ML
keywords complexityrademachersequentialasymptoticclassfinitefunctionbounds
0
0 comments X
read the original abstract

For a finite function class we describe the large sample limit of the sequential Rademacher complexity in terms of the viscosity solution of a $G$-heat equation. In the language of Peng's sublinear expectation theory, the same quantity equals to the expected value of the largest order statistics of a multidimensional $G$-normal random variable. We illustrate this result by deriving upper and lower bounds for the asymptotic sequential Rademacher complexity.

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.