Rademacher complexity in Neyman-Pearson classification

DOI10.1007/S10114-008-6210-8zbMath1176.62063OpenAlexW1978448727MaRDI QIDQ1034311

Min Han, Zhaoxu Sun, Di-Rong Chen

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

zbMATH Keywords

Rademacher complexityNeyman-Pearson classificationNeyman-Pearson LemmaVC classes

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Nonparametric inference (62G99)

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

This page was built for publication: Rademacher complexity in Neyman-Pearson classification