Fetching the paper…
Reading the bibliography…
We design an active learning algorithm for cost-sensitive multiclass classification: problems where different errors have different costs.
Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
David Haussler · 1995
Earlier work this paper cites.
Fast approximation algorithms for fractional packing and covering problems
Serge A. Plotkin, David B. Shmoys, and Éva Tardos · 1995
Earlier work this paper cites.
Smooth discrimination analysis
Enno Mammen and Alexandre B. Tsybakov · 1999
Earlier work this paper cites.
Rcv1: A new benchmark collection for text categorization research
David D. Lewis, Yiming Yang, Tony G. Rose, and Fan Li · 2004
Earlier work this paper cites.
Optimal aggregation of classifiers in statistical learning
Alexandre B. Tsybakov · 2004
Earlier work this paper cites.
Faster rates in regression via active learning
Rui Castro, Rebecca Willett, and Robert D. Nowak · 2005
Earlier work this paper cites.
Sensitive error correcting output codes
John Langford and Alina Beygelzimer · 2005
Earlier work this paper cites.
Agnostic active learning
Maria Florina Balcan, Alina Beygelzimer, and John Langford · 2006
Earlier work this paper cites.
Risk bounds for statistical learning
Pascal Massart and Élodie Nédélec · 2006
Earlier work this paper cites.
Margin based active learning
Maria Florina Balcan, Andrei Broder, and Tong Zhang · 2007
Earlier work this paper cites.
A general agnostic active learning algorithm
Sanjoy Dasgupta, Daniel Hsu, and Claire Monteleoni · 2007
Earlier work this paper cites.
Minimax bounds for active learning
R.M. Castro and R.D. Nowak · 2008
Earlier work this paper cites.
Importance weighted active learning
Alina Beygelzimer, Sanjoy Dasgupta, and John Langford · 2009
Earlier work this paper cites.
Search-based structured prediction
Hal Daumé III, John Langford, and Daniel Marcu · 2009
Earlier work this paper cites.
Agnostic active learning without constraints
Alina Beygelzimer, Daniel Hsu, John Langford, and Tong Zhang · 2010
Earlier work this paper cites.
Robust selective sampling from single and multiple teachers
Ofer Dekel, Claudio Gentile, and Karthik Sridharan · 2010
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2010
Cited alongside, same era.
Algorithms for Active Learning
Daniel Hsu · 2010
Cited alongside, same era.
Learning noisy linear classifiers via adaptive and selective sampling
Giovanni Cavallanti, Nicolo Cesa-Bianchi, and Claudio Gentile · 2011
Cited alongside, same era.
Online importance weight aware updates
Nikos Karampatziakis and John Langford · 2011
Cited alongside, same era.
Better algorithms for selective sampling
Francesco Orabona and Nicolo Cesa-Bianchi · 2011
Cited alongside, same era.
A survey of hierarchical classification across different application domains
Carlos N. Silla Jr. and Alex A. Freitas · 2011
Cited alongside, same era.
Reinforcement and imitation learning via interactive no-regret learning
Stephane Ross and J. Andrew Bagnell · 2014
Later among the works it cites.
Beyond disagreement-based agnostic active learning
Chicheng Zhang and Kamalika Chaudhuri · 2014
Later among the works it cites.
Learning to search better than your teacher
Kai-Wei Chang, Akshay Krishnamurthy, Alekh Agarwal, Hal Daumé III, and John Langford · 2015
Later among the works it cites.
Minimax analysis of active learning
Steve Hanneke and Liu Yang · 2015
Later among the works it cites.
Efficient and parsimonious agnostic active learning
Tzu-Kuo Huang, Alekh Agarwal, Daniel Hsu, John Langford, and Robert E. Schapire · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
Surrogate losses in passive and active learning
Steve Hanneke and Liu Yang · 2012
Cited alongside, same era.
Plug-in approach to active learning
Stanislav Minsker · 2012
Cited alongside, same era.
Active learning
Burr Settles · 2012
Cited alongside, same era.
Selective sampling algorithms for cost-sensitive multiclass prediction
Alekh Agarwal · 2013
Cited alongside, same era.
Active and passive learning of linear separators under log-concave distributions
Maria Florina Balcan and Philip M. Long · 2013
Cited alongside, same era.
Tengyuan Liang, Alexander Rakhlin, and Karthik Sridharan · 2015
Later among the works it cites.
Learning where to sample in structured prediction
Tianlian Shi, Jacob Steinhardt, and Percy Liang · 2015
Later among the works it cites.
Going deeper with convolutions
Christian Szegedy, Wei Liu, Yangqing Jia, Pierre Sermanet, Scott E. Reed, Dragomir Anguelov, Dumitru Erhan, Vincent Vanhoucke, and Andrew Rabinovich · 2015
Later among the works it cites.
Efficient algorithms for adversarial contextual learning
Vasilis Syrgkanis, Akshay Krishnamurthy, and Robert E. Schapire · 2016
Later among the works it cites.
Adaptivity to noise parameters in nonparametric active learning
Alexandra Carpentier, Andrea Locatelli, and Samory Kpotufe · 2017
Closest in time.
Active learning for cost-sensitive classification
Akshay Krishnamurthy, Alekh Agarwal, Tzu-Kuo Huang, Hal Daumé, III, and John Langford · 2017
Closest in time.
On equivalence of martingale tail bounds and deterministic regret inequalities
Alexander Rakhlin and Karthik Sridharan · 2017
Closest in time.
Empirical entropy, minimax regret and minimax risk
Alexander Rakhlin, Karthik Sridharan, Alexandre B Tsybakov, et al · 2017
Closest in time.
Deeply AggreVaTeD: Differentiable imitation learning for sequential prediction
Wen Sun, Arun Venkatraman, Geoffrey J. Gordon, Byron Boots, and J. Andrew Bagnell · 2017
Closest in time.
Practical contextual bandits with regression oracles
Dylan Foster, Alekh Agarwal, Miroslav Dudik, Haipeng Luo, and Robert Schapire · 2018
Closest in time.