A local Vapnik-Chervonenkis complexity
From MaRDI portal
Publication:2281678
DOI10.1016/j.neunet.2016.07.002zbMath1428.68249OpenAlexW2498765815WikidataQ50495068 ScholiaQ50495068MaRDI QIDQ2281678
Luca Oneto, Davide Anguita, Sandro Ridella
Publication date: 6 January 2020
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2016.07.002
statistical learning theorycomplexity measureslocal Rademacher complexitygeneralization error boundslocal Vapnik-Chervonenkis entropy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- The densest hemisphere problem
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
- Probability inequalities for the sum in sampling without replacement
- The covering number in learning theory
- Robust trainability of single neurons
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Local Rademacher complexities
- A sharp concentration inequality with applications
- Rademacher penalties and structural risk minimization
- Structural risk minimization over data-dependent hierarchies
- 10.1162/153244303321897690
- Probability Inequalities for Sums of Bounded Random Variables
- Learning Theory
- Enumeration of Seven-Argument Threshold Functions
- Theory of Reproducing Kernels
- Some applications of concentration inequalities to statistics
- Model selection and error estimation
This page was built for publication: A local Vapnik-Chervonenkis complexity
