Classification with minimax fast rates for classes of Bayes rules with sparse representation
From MaRDI portal
Publication:1951772
DOI10.1214/07-EJS015zbMath1320.62146arXivmath/0607439OpenAlexW2952803560MaRDI QIDQ1951772
Publication date: 24 May 2013
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0607439
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric estimation (62G05) Minimax procedures in statistical decision theory (62C20)
Related Items (4)
Deep neural network classifier for multidimensional functional data ⋮ Upper bounds and aggregation in bipartite ranking ⋮ Penalized empirical risk minimization over Besov spaces ⋮ Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimax theory of image reconstruction
- Risk bounds for statistical learning
- Fast rates for support vector machines using Gaussian kernels
- Smooth discrimination analysis
- On the Bayes-risk consistency of regularized boosting methods.
- Optimal aggregation of classifiers in statistical learning.
- Optimal rates of aggregation in classification under low noise assumption
- Square root penalty: Adaption to the margin in classification and in edge estimation
- Theory of Classification: a Survey of Some Recent Advances
- Minimax-optimal classification with dyadic decision trees
- Minimax nonparametric classification. II. Model selection for adaptation
- Minimax nonparametric classification .I. Rates of convergence
- 10.1162/1532443041424319
- Function Classes That Approximate the Bayes Risk
- Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition
- Theory of Reproducing Kernels
This page was built for publication: Classification with minimax fast rates for classes of Bayes rules with sparse representation
