Asymptotic sequential Rademacher complexity of a finite function class
From MaRDI portal
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 -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 -normal random variable. We illustrate this result by deriving upper and lower bounds for the asymptotic sequential Rademacher complexity.
Recommendations
Cites work
- scientific article; zbMATH DE number 5014137 (Why is no real title available?)
- scientific article; zbMATH DE number 1325009 (Why is no real title available?)
- scientific article; zbMATH DE number 964350 (Why is no real title available?)
- A new convex objective function for the supervised learning of single-layer neural networks
- Central limit theorem under uncertain linear transformations
- Concentration inequalities. A nonasymptotic theory of independence
- Encyclopedia of machine learning
- Exponentially growing solutions of parabolic Isaacs' equations
- Markov Processes, Gaussian Processes, and Local Times
- Multi-dimensional \(G\)-Brownian motion and related stochastic calculus under \(G\)-expectation
- Online learning via sequential complexities
- Prediction, Learning, and Games
- Sequential complexities and uniform martingale laws of large numbers
- The Generic Chaining
- Uniqueness Results for Second-Order Bellman--Isaacs Equations under Quadratic Growth Assumptions and Applications
- User’s guide to viscosity solutions of second order partial differential equations
- VC dimension, fat-shattering dimension, Rademacher averages, and their applications
This page was built for publication: Asymptotic sequential Rademacher complexity of a finite function class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517475)