Minimax-optimal bounds for detectors based on estimated prior probabilities

IEEE Transactions on Information Theory

Volumn 58, Issue 9, 2012, Pages 6101-6109

  Jiao, Jiantao ^a   Zhang, Lin ^b   Nowak, Robert D ^c  

^a Stanford University   (United States)

^b TSINGHUA UNIVERSITY   (China)

^c University of Wisconsin Madison   (United States)

Author keywords

Detector; maximum likelihood estimate (MLE); minimax optimality; prior probability; statistical learning theory

Indexed keywords

BAYES ERROR; LIPSCHITZ; MAXIMUM LIKELIHOOD ESTIMATE; OPTIMAL RATE; OPTIMALITY; PRIOR PROBABILITY; RISK FUNCTION; STATISTICAL LEARNING THEORY; TRAINING DATA; TYPICAL VALUES;

DETECTORS; ERRORS; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; RISK PERCEPTION;

PROBABILITY DISTRIBUTIONS;

EID: 84865358407     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2201914     Document Type: Article

References (20)

1. L. Devroye, L. Gyorfi, andG.Lugosi, A Probabilistic Theory of Pattern Recognition. New York: Springer, 1996.
2. V. Vapnik, Statistical Learning Theory. New York: Wiley, 1998.
3. M. Ziaerman, E. Braverman, and L. Rozonoer, Method of Potential Functions in the Theory of Learning Machines (in Russian). Moscow, Russia: Nauka, 1970.
4. V. Vapnik and A. Chervonenkis, Theory of Pattern Recognition (in Russian). Moscow, Russia: Nauka, 1974.
5. V. Vapnik, Estimation of Dependencies Based on Empirical Data. New York: Springer, 1998.
6. L. Breiman, J. Friedman,C. J. Stone, andR.Olshen, Classification and Regression Trees. Belmont, CA: Wadsworth, 1984.
7. M. Anthony and P. Bartlett, Neural Network Learning: Theoretical Foundations. Cambridge, U.K.: Cambridge Univ. Press, 1999.
8. N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines. Cambridge, U.K.: Cambridge Univ. Press, 2000.
9. B. Scholkopf and A. Smola, Learning With Kernels. Cambridge, MA: MIT Press, 2002.
10. E.Mammen and A. Tsybakov, "Smooth discrimination analysis," Ann. Stat., vol. 27, pp. 1808-1829, 1999.
11. V. Koltchinskii, "Local Rademacher complexities and oracle inequalities in risk minimization," Ann. Stat., vol. 34, no. 6, pp. 2593-2656, 2006.
12. I. Steinwart and J. Scovel, "Fast rates for support vector machines using gaussian kernels," Ann. Stat., vol. 35, pp. 575-607, 2007.
13. A. Tsybakov and S. van de Geer, "Square root penalty: Adaptation to the margin in classification and in edge estimation," Ann. Stat., vol. 33, pp. 1203-1224, 2005. (Pubitemid 41137880)
14. P. Massart, "Some applications of concentration inequalities to statistics," Ann. Fac. Sci. Toulouse Math., vol. 9, pp. 245-303, 2000.
15. O. Catoni, Randomized estimators and empirical complexity for pattern recognition and least square regression 2001 [Online]. Available: http://www.proba.jussieu.fr/
16. M. Horvath and G. Lugosi, "Scale-sensitive dimensions and skeleton estimates for classification," Discrete Appl. Math., vol. 86, pp. 37-61, 1998. (Pubitemid 128431756)
17. A. Tsybakov, "Optimal aggregation of classifiers in statistical learning," Ann. Stat., vol. 32, no. 1, pp. 135-166, 2004. (Pubitemid 41449306)
18. J.-Y. Audibert and A. Tsybakov, "Fast learning rates for plug-in classifiers," Ann. Stat., vol. 35, no. 2, pp. 608-633, 2007.
19. A. Tsybakov, Introduction to Nonparametric Estimation., New York: Springer, 2008.
20. I. A. Ibragimov and R. Z. Has'minskii, Statistical Estimation: Asymptotic Theory., New York: Springer-Verlag, 1981.