Robust bounds for classification via selective sampling
暂无分享,去创建一个
Claudio Gentile | Nicolò Cesa-Bianchi | Francesco Orabona | N. Cesa-Bianchi | C. Gentile | Francesco Orabona
[1] Sanjoy Dasgupta,et al. A General Agnostic Active Learning Algorithm , 2007, ISAIM.
[2] Claudio Gentile,et al. Incremental Algorithms for Hierarchical Classification , 2004, J. Mach. Learn. Res..
[3] Michael L. Littman,et al. Online Linear Regression and Its Application to Model-Based Reinforcement Learning , 2007, NIPS.
[4] Claudio Gentile,et al. Tracking the best hyperplane with a simple budget Perceptron , 2006, Machine Learning.
[5] H. Sebastian Seung,et al. Selective Sampling Using the Query by Committee Algorithm , 1997, Machine Learning.
[6] Adam Tauman Kalai,et al. Analysis of Perceptron-Based Active Learning , 2009, COLT.
[7] David A. Cohn,et al. Training Connectionist Networks with Queries and Selective Sampling , 1989, NIPS.
[8] John Langford,et al. Agnostic active learning , 2006, J. Comput. Syst. Sci..
[9] Thomas J. Walsh,et al. Knows what it knows: a framework for self-aware learning , 2008, ICML '08.
[10] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[11] Claudio Gentile,et al. Worst-Case Analysis of Selective Sampling for Linear Classification , 2006, J. Mach. Learn. Res..
[12] Barbara Caputo,et al. The projectron: a bounded kernel-based Perceptron , 2008, ICML '08.
[13] Maria-Florina Balcan,et al. Margin Based Active Learning , 2007, COLT.
[14] Claudio Gentile,et al. Linear Classification and Selective Sampling Under Low Noise Conditions , 2008, NIPS.
[15] Jason Weston,et al. Online (and Offline) on an Even Tighter Budget , 2005, AISTATS.
[16] Yoram Singer,et al. The Forgetron: A Kernel-Based Perceptron on a Budget , 2008, SIAM J. Comput..