Fetching the paper…
Reading the bibliography…
We provide new results concerning label efficient, polynomial time, passive and active learning of linear separators.
On the uniform convergence of relative frequencies of events to their probabilities
V. Vapnik and A. Chervonenkis · 1971
Earlier work this paper cites.
Estimation of Dependencies based on Empirical Data
V. N. Vapnik · 1982
Earlier work this paper cites.
Plongements lipschitziens dans
P. Assouad · 1983
Earlier work this paper cites.
A theory of the learnable
L.G. Valiant · 1984
Earlier work this paper cites.
Rates of growth and sample moduli for weighted empirical processes indexed by sets
K.S. Alexander · 1987
Earlier work this paper cites.
Epsilon nets and simplex range queries
David Haussler and Emo Welzl · 1987
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth · 1989
Earlier work this paper cites.
A general lower bound on the number of examples needed for learning
A. Ehrenfeucht, D. Haussler, M. Kearns, and L. G. Valiant · 1989
Earlier work this paper cites.
Sampling and integration of near log-concave functions
D. Applegate and R. Kannan · 1991
Earlier work this paper cites.
Almost tight bounds on epsilon-nets
J. Komlós, J. Pach, and G. Woeginger · 1992
Earlier work this paper cites.
Active learning using arbitrary binary valued queries
S. R. Kulkarni, S. K. Mitter, and J. N. Tsitsiklis · 1993
Earlier work this paper cites.
Improving generalization with active learning
D. Cohn, L. Atlas, and R. Ladner · 1994
Earlier work this paper cites.
Predicting { 0 , 1 } \{0,1\} -functions on randomly drawn points
D. Haussler, N. Littlestone, and M. K. Warmuth · 1994
Earlier work this paper cites.
An Introduction to Computational Learning Theory
M. Kearns and U. Vazirani · 1994
Earlier work this paper cites.
On the sample complexity of PAC learning halfspaces against the uniform distribution
P. M. Long · 1995
Earlier work this paper cites.
Combinatorial Geometry
J. Pach and P.K. Agarwal · 1995
Earlier work this paper cites.
Weak Convergence and Empirical Processes With Applications to Statistics
A. van der Vaart and J. A. Wellner · 1996
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.
Statistical Learning Theory
V. N. Vapnik · 1998
Cited alongside, same era.
Smooth discrimination analysis
E. Mammen and A.B. Tsybakov · 1999
Cited alongside, same era.
Empirical processes in M-estimation
S. van de Geer · 2000
Cited alongside, same era.
The Brunn-Minkowski inequality
R. J. Gardner · 2002
Cited alongside, same era.
An upper bound on the sample complexity of PAC learning halfspaces with respect to the uniform distribution
P. M. Long · 2003
Cited alongside, same era.
Estimating the performance of kernel classes
S. Mendelson · 2003
Cited alongside, same era.
Local Rademacher complexities
P. L. Bartlett, O. Bousquet, and S. Mendelson · 2005
Improved approximation algorithms for geometric set cover
K. L. Clarkson and K. Varadarajan · 2007
Later among the works it cites.
A general agnostic active learning algorithm
S. Dasgupta, D.J. Hsu, and C. Monteleoni · 2007
Later among the works it cites.
A bound on the label complexity of agnostic active learning
S. Hanneke · 2007
Later among the works it cites.
The geometry of logconcave functions and sampling algorithms
L. Lovasz and S. Vempala · 2007
Later among the works it cites.
The true sample complexity of active learning
M.-F. Balcan, S. Hanneke, and J. Wortman · 2008
Later among the works it cites.
Using the doubling dimension to analyze the generalization of learning algorithms
N. H. Bshouty, Y. Li, and P. M. Long · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Theory of classification: a survey of recent advances
S. Boucheron, O. Bousquet, and G. Lugosi · 2005
Cited alongside, same era.
Coarse sample complexity bounds for active learning
S. Dasgupta · 2005
Cited alongside, same era.
Analysis of perceptron-based active learning
S. Dasgupta, A. Kalai, and C. Monteleoni · 2005
Cited alongside, same era.
Agnostically learning halfspaces
A. Kalai, A. Klivans, Y. Mansour, and R. Servedio · 2005
Cited alongside, same era.
Agnostic active learning
M. F. Balcan, A. Beygelzimer, and J. Langford · 2006
Cited alongside, same era.
Active learning for smooth problems
E. J. Friedman · 2009
Later among the works it cites.
A non-linear lower bound for planar epsilon-nets
N. Alon · 2010
Later among the works it cites.
Agnostic active learning without constraints
A. Beygelzimer, D. Hsu, J. Langford, and T. Zhang · 2010
Later among the works it cites.
Learning noisy linear classifiers via adaptive and selective sampling
N. Cesa-Bianchi, C. Gentile, and L. Zaniboni · 2010
Later among the works it cites.
Rademacher complexities and bounding the excess risk in active learning
V. Koltchinskii · 2010
Later among the works it cites.
Active learning
S. Dasgupta · 2011
Later among the works it cites.
Rates of convergence in active learning
S. Hanneke · 2011
Later among the works it cites.
The Geometry of Generalized Binary Search
R. Nowak · 2011
Later among the works it cites.
Lower bounds for passive and active learning
M. Raginsky and A. Rakhlin · 2011
Later among the works it cites.
Selective sampling and active learning from single and multiple teachers
O. Dekel, C. Gentile, and K. Sridharan · 2012
Closest in time.
Surrogate losses in passive and active learning, 2012
S. Hanneke and L. Yang · 2012
Closest in time.
Efficient pool-based active learning of halfspaces
A. Gonen, S. Sabato, and S. Shalev-Shwartz · 2013
Closest in time.