Lower bounds for the rate of convergence in nonparametric pattern recognition
From MaRDI portal
(Redirected from Publication:1603589)
Recommendations
Cites work
- Another proof of a slow convergence result of Birgé
- Any Discrimination Rule Can Have an Arbitrarily Bad Probability of Error for Finite Sample Size
- Characterizing rational versus exponential learning curves
- Consistent nonparametric regression. Discussion
- scientific article; zbMATH DE number 3733065 (Why is no real title available?)
- scientific article; zbMATH DE number 3778550 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- Lower bounds on the rate of convergence of nonparametric regression estimates
- Minimax nonparametric classification .I. Rates of convergence
- Minimax theory of image reconstruction
- On arbitrarily slow rates of global convergence in density estimation
- On estimating a density using Hellinger distance and some other strange facts
- Optimal global rates of convergence for nonparametric regression
- Risk bounds for model selection via penalization
- Smooth discrimination analysis
- Strong minimax lower bounds for learning
Cited in
(4)
This page was built for publication: Lower bounds for the rate of convergence in nonparametric pattern recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603589)