Rademacher complexity in Neyman-Pearson classification
From MaRDI portal
Publication:1034311
DOI10.1007/s10114-008-6210-8zbMath1176.62063MaRDI QIDQ1034311
Di-Rong Chen, Min Han, Zhaoxu Sun
Publication date: 11 November 2009
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-008-6210-8
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68T05: Learning and adaptive systems in artificial intelligence
68T10: Pattern recognition, speech recognition
62G99: Nonparametric inference
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Complexity regularization via localized random penalties
- Local Rademacher complexities
- A Neyman–Pearson Approach to Statistical Learning
- Rademacher penalties and structural risk minimization
- Rademacher averages and phase transitions in Glivenko-Cantelli classes
- 10.1162/153244303321897690
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Convergence of stochastic processes
- Model selection and error estimation