Fetching the paper…
Reading the bibliography…
It has been a long-standing problem to efficiently learn a halfspace using as few labels as possible in the presence of noise.
The relaxation method for linear inequalities
TS Motzkin and IJ Schoenberg · 1954
Earlier work this paper cites.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir N. Vapnik and Alexey Ya. Chervonenkis · 1971
Earlier work this paper cites.
Learning from noisy examples
Dana Angluin and Philip Laird · 1988
Earlier work this paper cites.
The hardness of approximate optima in lattices, codes, and systems of linear equations
Sanjeev Arora, László Babai, Jacques Stern, and Z Sweedyk · 1993
Earlier work this paper cites.
Learning in the presence of malicious errors
Michael Kearns and Ming Li · 1993
Earlier work this paper cites.
Active learning using arbitrary binary valued queries
Sanjeev R Kulkarni, Sanjoy K Mitter, and John N Tsitsiklis · 1993
Earlier work this paper cites.
Improving generalization with active learning
David A. Cohn, Les E. Atlas, and Richard E. Ladner · 1994
Earlier work this paper cites.
On the sample complexity of pac learning half-spaces against the uniform distribution
Philip M Long · 1995
Earlier work this paper cites.
Selective sampling using the query by committee algorithm
Y. Freund, H. S. Seung, E. Shamir, and N. Tishby · 1997
Earlier work this paper cites.
A polynomial-time algorithm for learning noisy linear threshold functions
Avrim Blum, Alan M. Frieze, Ravi Kannan, and Santosh Vempala · 1998
Earlier work this paper cites.
An introduction to support vector machines and other kernel-based learning methods
Nello Cristianini and John Shawe-Taylor · 2000
Earlier work this paper cites.
Support vector machine active learning with applications to text classification
Simon Tong and Daphne Koller · 2001
Earlier work this paper cites.
A simple polynomial-time rescaling algorithm for solving linear programs
John Dunagan and Santosh Vempala · 2004
Earlier work this paper cites.
Coarse sample complexity bounds for active learning
S. Dasgupta · 2005
Earlier work this paper cites.
Analysis of perceptron-based active learning
Sanjoy Dasgupta, Adam Tauman Kalai, and Claire Monteleoni · 2005
Earlier work this paper cites.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
New results for learning noisy parities and halfspaces
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, and Ashok Kumar Ponnuswami · 2006
Earlier work this paper cites.
Risk bounds for statistical learning
Pascal Massart and Élodie Nédélec · 2006
Earlier work this paper cites.
Efficient algorithms for general active learning
Claire Monteleoni · 2006
Earlier work this paper cites.
Margin based active learning
M.-F. Balcan, A. Z. Broder, and T. 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.
A bound on the label complexity of agnostic active learning
S. Hanneke · 2007
Cited alongside, same era.
Agnostically learning halfspaces
Adam Tauman Kalai, Adam R Klivans, Yishay Mansour, and Rocco A Servedio · 2008
Cited alongside, same era.
Neural network learning: Theoretical foundations
Martin Anthony and Peter L Bartlett · 2009
Cited alongside, same era.
Agnostic active learning
M.-F. Balcan, A. Beygelzimer, and J. Langford · 2009
Cited alongside, same era.
Importance weighted active learning
Alina Beygelzimer, Sanjoy Dasgupta, and John Langford · 2009
Cited alongside, same era.
Robust bounds for classification via selective sampling
Nicolò Cesa-Bianchi, Claudio Gentile, and erancesco Orabona · 2009
Cited alongside, same era.
Selective sampling and active learning from single and multiple teachers
Ofer Dekel, Claudio Gentile, and Karthik Sridharan · 2012
Later among the works it cites.
Surrogate losses in passive and active learning
Steve Hanneke and Liu Yang · 2012
Later among the works it cites.
Selective sampling algorithms for cost-sensitive multiclass prediction
Alekh Agarwal · 2013
Later among the works it cites.
Active and passive learning of linear separators under log-concave distributions
M.-F. Balcan and P. M. Long · 2013
Later among the works it cites.
Statistical active learning algorithms
Maria-Florina Balcan and Vitaly Feldman · 2013
Later among the works it cites.
Active learning using smooth relative regret approximations with applications
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Andrew Guillory, Erick Chastain, and Jeff Bilmes · 2009
Cited alongside, same era.
Hardness of learning halfspaces with noise
Venkatesan Guruswami and Prasad Raghavendra · 2009
Cited alongside, same era.
Theoretical Foundations of Active Learning
S. Hanneke · 2009
Cited alongside, same era.
Learning halfspaces with malicious noise
Adam R Klivans, Philip M Long, and Rocco A Servedio · 2009
Cited alongside, same era.
The true sample complexity of active learning
Maria-Florina Balcan, Steve Hanneke, and Jennifer Wortman Vaughan · 2010
Cited alongside, same era.
Agnostic active learning without constraints
A. Beygelzimer, D. Hsu, J. Langford, and T. Zhang · 2010
Cited alongside, same era.
Nir Ailon, Ron Begleiter, and Esther Ezra · 2014
Later among the works it cites.
The power of localization for efficiently learning linear separators with noise
Pranjal Awasthi, Maria Florina Balcan, and Philip M Long · 2014
Later among the works it cites.
Theory of disagreement-based active learning
Steve Hanneke · 2014
Later among the works it cites.
Embedding Hard Learning Problems Into Gaussian Space
Adam Klivans and Pravesh Kothari · 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.
Efficient learning of linear separators under bounded noise
Pranjal Awasthi, Maria-Florina Balcan, Nika Haghtalab, and Ruth Urner · 2015
Later among the works it cites.
Complexity theoretic limitations on learning halfspaces
Amit Daniely · 2015
Later among the works it cites.
Learning with a drifting target concept
Steve Hanneke, Varun Kanade, 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.
Learning and 1-bit compressed sensing under asymmetric noise
Pranjal Awasthi, Maria-Florina Balcan, Nika Haghtalab, and Hongyang Zhang · 2016
Later among the works it cites.
Noise-adaptive margin-based active learning and lower bounds under tsybakov noise condition
Yining Wang and Aarti Singh · 2016
Later among the works it cites.
Maria-Florina Balcan and Hongyang Zhang · 2017
Closest in time.
Near-optimal active learning of halfspaces via query synthesis in the noisy setting
Lin Chen, Hamed Hassani, and Amin Karbasi · 2017
Closest in time.
Diameter-based active learning
Christopher Tosh and Sanjoy Dasgupta · 2017
Closest in time.
A hitting time analysis of stochastic gradient langevin dynamics
Yuchen Zhang, Percy Liang, and Moses Charikar · 2017
Closest in time.