Lower bounds for the rate of convergence in nonparametric pattern recognition

DOI10.1016/S0304-3975(01)00077-9zbMath0997.68111MaRDI QIDQ1603589

András Antos

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

individual rates of convergencenonparametric pattern recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (1)

Fast learning rates in statistical inference through aggregation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimax theory of image reconstruction
• Consistent nonparametric regression. Discussion
• Risk bounds for model selection via penalization
• Characterizing rational versus exponential learning curves
• Strong minimax lower bounds for learning
• Smooth discrimination analysis
• Optimal global rates of convergence for nonparametric regression
• Another proof of a slow convergence result of Birgé
• Lower bounds on the rate of convergence of nonparametric regression estimates
• On estimating a density using Hellinger distance and some other strange facts
• Any Discrimination Rule Can Have an Arbitrarily Bad Probability of Error for Finite Sample Size
• On arbitrarily slow rates of global convergence in density estimation
• Minimax nonparametric classification .I. Rates of convergence

This page was built for publication: Lower bounds for the rate of convergence in nonparametric pattern recognition