English

Asymptotic sequential Rademacher complexity of a finite function class

Machine Learning 2016-05-13 v1 Machine Learning

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 GG-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 GG-normal random variable. We illustrate this result by deriving upper and lower bounds for the asymptotic sequential Rademacher complexity.

Keywords

Cite

@article{arxiv.1605.03843,
  title  = {Asymptotic sequential Rademacher complexity of a finite function class},
  author = {Dmitry B. Rokhlin},
  journal= {arXiv preprint arXiv:1605.03843},
  year   = {2016}
}

Comments

10 pages

R2 v1 2026-06-22T13:59:27.681Z