Lower bounds for the rate of convergence in nonparametric pattern recognition
type: Item
instance of: scholarly article
title: Lower bounds for the rate of convergence in nonparametric pattern recognition
zbMATH Open document ID: 0997.68111
DOI: 10.1016/S0304-3975(01)00077-9
author: András Antos
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 1767820
zbMATH Keywords: individual rates of convergence
zbMATH Keywords: nonparametric pattern recognition
MaRDI profile type: Publication
cites work: Lower bounds on the rate of convergence of nonparametric regression estimates
cites work: Strong minimax lower bounds for learning
cites work: Risk bounds for model selection via penalization
cites work: On estimating a density using Hellinger distance and some other strange facts
cites work: Any Discrimination Rule Can Have an Arbitrarily Bad Probability of Error for Finite Sample Size
cites work: On arbitrarily slow rates of global convergence in density estimation
cites work: Another proof of a slow convergence result of Birgé
cites work: Q4881152
cites work: Q3920437
cites work: Q3957797
cites work: Minimax theory of image reconstruction
cites work: Smooth discrimination analysis
cites work: Characterizing rational versus exponential learning curves
cites work: Consistent nonparametric regression. Discussion
cites work: Optimal global rates of convergence for nonparametric regression
cites work: Minimax nonparametric classification .I. Rates of convergence
description: scientific article; zbMATH DE number 1767820