Lower bounds for Bayes error estimation

被引:34
作者
Antos, A
Devroye, L
Györfi, L
机构
[1] Hungarian Acad Sci, Comp & Automat Res Inst, H-1518 Budapest, Hungary
[2] McGill Univ, Sch Comp Sci, Montreal, PQ H3A 2K6, Canada
[3] Tech Univ Budapest, Dept Comp Sci & Informat Theory, H-1521 Budapest, Hungary
基金
加拿大自然科学与工程研究理事会;
关键词
discrimination; statistical pattern recognition; nonparametric estimation; Bayes error; lower bounds; rates of convergence;
D O I
10.1109/34.777375
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We give a short proof of the following result. Let (X,Y) be any distribution on N x {0, 1}, and let (X-1,Y-1),...,(X-n,Y-n) be an i.i.d. sample drawn from this distribution. In discrimination. the Bayes error L* = inf(g)P{g(X) not equal Y} is crucial importance. Here we show that without further conditions on the distribution of (X,Y), no rate-of-convergence results can be obtained. Let phi(n)(X-1,Y-1,...,X-n,Y-n) be an estimate of the Bayes error, and let {phi(n)(.)} be a sequence of such estimates. For any sequence {a(n)} of positive numbers converging to zero, a distribution of (X,Y) may be found such that E{\L* - phi(n)(X-1,Y-1,...,X-n, Y-n)\} greater than or equal to a(n) infinitely often.
引用
收藏
页码:643 / 645
页数:3
相关论文
共 11 条