Upper and lower error bounds for active learning

44th Annual Allerton Conference on Communication, Control, and Computing 2006

Volumn 1, Issue , 2006, Pages 225-234

  Castro, Rui M ^a   Nowak, Robert D ^b  

^a Wisconsin Electric Machines and Power Electronics Consortium   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; ERROR ANALYSIS;

ACTIVE-LEARNING ALGORITHM; ADAPTIVE SAMPLING; LEARNING PROBLEM; LEARNING PROCESS; NOISY OBSERVATIONS; PASSIVE LEARNING; SAMPLING PROCESS; THRESHOLD FUNCTIONS;

LEARNING ALGORITHMS;

EID: 84860631341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. N. Balcan, A. Beygelzimer, and J. Langford. Agostic active learning. available at http://hunch.net/-jl/projects/agnostic active/active.pdf.
2. G. Blanchard and D. Geman. Hierarchical testing designs for pattern recognition. to appear in Annals of Statistics, 2005.
3. M. V. Burnashev and K. Sh. Zigangirov. An interval estimation problem for controlled observations. Problems in Information Transmission, 10:223-231, 1974. (Translated from Problemy Peredachi Informatsii, 10(3):51-61, July-September, 1974. Original article submitted June 25, 1973).
4. R. Castro and R. Nowak. Foundations and Applications of Sensor Management, chapter Active Learning and Sampling. Springer-Verlag, 2006. Available at http://homepages.cae.wisc.edu/-rcastro/active sensing chapter.pdf.
5. R. Castro, R. Willett, and R. Nowak. Faster rates in regression via active learning. In Proceedings of Neural Information Processing Systems (NIPS), 2005. longer Technical Report available at http://homepages.cae.wisc.edu/-rcastro/ECE-05-3.pdf.
6. R. M. Castro and R. D. Nowak. Error bounds for active learning. Technical report, University of Wisconsin-Madison, ECE Dept., 2006. (available at http://homepages.cae.wisc.edu/-rcastro/bounds active.pdf).
7. N. Cesa-Bianchi, A. Conconi, and C. Gentile. Learning probabilistic linear-threshold classifiers via selective sampling. In The Sixteenth Annual Conference on Learning Theory. LNAI 2777, Springer, 2003.
8. D. Cohn, Z. Ghahramani, and M. Jordan. Active learning with statistical models. Journal of Artificial Intelligence Research, pages 129-145, 1996.
9. S. Dasgupta. Analysis of a greedy active learning strategy. In Advances in Neural Information Processing (NIPS), 2004.
10. S. Dasgupta. Coarse sample complexity bounds for active learning. In Advances in Neural Information Processing (NIPS), 2005.
11. S. Dasgupta, A. Kalai, and C. Monteleoni. Analysis of perceptronbased active learning. In Eighteen Annual Conference on Learning Theory (COLT), 2005.
12. Y. Freund, H. S. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168, August 1997.
13. G. Golubev and B. Levit. Sequential recovery of analytic periodic edges in the binary image models. Mathematical Methods of Statistics, 12:95-115, 2003.
14. P. Hall and I. Molchanov. Sequential methods for design-adaptive estimation of discontinuities in regression curves and surfaces. The Annals of Statistics, 31(3):921-941, 2003.
15. M. Horstein. Sequential decoding using noiseless feedback. IEEE Trans. Info. Theory, 9(3):136-143, 1963.
16. Matti Kääriäinen. Active learning in the non-realizable case. Personal communication, 2006.
17. D. J. C. Mackay. Information-based objective functions for active data selection. Neural Computation, 4:698-714, 1991.
18. A. Tsybakov. Optimal aggregation of classifiers in statistical learning. The Annals of Statistics, 32(1):135-166, 2004.
19. Alexandre B. Tsybakov. Introduction 'a lestimation non-parametrique. Mathematiques et Applications, 41. Springer, 2004.