Asymptotic sequential Rademacher complexity of a finite function class
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 11 May 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.