Fetching the paper…
Reading the bibliography…
In the world of big data, large but costly to label datasets dominate many fields.
An optimum character recognition system using decision functions
Chi-Keung Chow · 1957
Earlier work this paper cites.
On the uniform convergence of relative frequencies of events to their probabilities
Chervonenkis A. Vapnik V · 1971
Earlier work this paper cites.
Theory of pattern recognition, 1974
Vladimir Vapnik and Alexey Chervonenkis · 1974
Earlier work this paper cites.
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chin Yao · 1977
Earlier work this paper cites.
Einige probleme der polyedrischen approximation
JA Wieacker · 1978
Earlier work this paper cites.
A theory of the learnable
L. Valiant · 1984
Earlier work this paper cites.
Queries and concept learning
Dana Angluin · 1988
Earlier work this paper cites.
Approximation of the sphere by polytopes having few vertices
Furedi Z. Barany, I · 1988
Earlier work this paper cites.
Learnability and the vapnik-chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K Warmuth · 1989
Earlier work this paper cites.
Reliable and useful learning with uniform probability distributions
J. Kivinen · 1990
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.
Random points and lattice points in convex bodies
I. Barany · 1994
Earlier work this paper cites.
Learning reliably and with one-sided error
J. Kivinen · 1995
Earlier work this paper cites.
On the sample complexity of pac learning halfspaces against the uniform distribution
P. Long · 1995
Earlier work this paper cites.
Learning complicated concepts reliably and usefully
Sloan R. Rivest, R · 1998
Earlier work this paper cites.
Employing em and pool-based active learning for text classification
Nigam K. McCallum, A · 1998
Earlier work this paper cites.
Sylvester’s question: The probability that n n points are in convex position
Imre Bárány et al · 1999
Earlier work this paper cites.
Noise-tolerant, reliable active classification with comparison queries
Max Hopkins, Daniel Kane, Shachar Lovett, and Gaurav Mahajan · 2001
Cited alongside, same era.
An upper bound on the sample complexity of pac learning halfspaces with respect to the uniform distribution
P. Long · 2003
Cited alongside, same era.
Distance metric learning with application to clustering with side-information
Eric P Xing, Michael I Jordan, Stuart J Russell, and Andrew Y Ng · 2003
Cited alongside, same era.
Point location and active learning: Learning halfspaces almost optimally
Max Hopkins, Daniel M Kane, Shachar Lovett, and Gaurav Mahajan · 2004
Cited alongside, same era.
Learning a distance metric from relative comparisons
Matthew Schultz and Thorsten Joachims · 2004
Cited alongside, same era.
Classification with gaussians and convex loss ii: improving error bounds by noise conditions
DaoHong Xiang · 2011
Later among the works it cites.
Active learning via perfect selective classification
Ran El-Yaniv and Yair Wiener · 2012
Later among the works it cites.
Active and passive learning of linear separators under log-concave distributions
Long P. Balcan, M · 2013
Later among the works it cites.
Active learning from relative queries
Buyue Qian, Xiang Wang, Fei Wang, Hongfei Li, Jieping Ye, and Ian Davidson · 2013
Later among the works it cites.
Optimal rates for stochastic convex optimization under tsybakov noise condition
Aaditya Ramdas and Aarti Singh · 2013
Later among the works it cites.
Reliable and useful learning
Jyrki Kivinen · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Optimal aggregation of classifiers in statistical learning
Alexander B Tsybakov et al · 2004
Cited alongside, same era.
Coarse sample complexity bounds for active learning
Sanjoy Dasgupta · 2006
Cited alongside, same era.
A preference-based recommender system
Benjamin Satzger, Markus Endres, and Werner Kiessling · 2006
Cited alongside, same era.
Ecole d’Ete de Probabilites de Saint-Flour XII, 1982 , volume 1097
Richard M Dudley, Hiroshi Kunita, and François Ledrappier · 2006
Cited alongside, same era.
Risk bounds for statistical learning
Pascal Massart, Élodie Nédélec, et al · 2006
Cited alongside, same era.
The geometry of logconcave functions and sampling algorithms
Vempala S. Lovasz, L · 2007
Cited alongside, same era.
Generalized non-metric multidimensional scaling
Sameer Agarwal, Josh Wills, Lawrence Cayton, Gert Lanckriet, David Kriegman, and Serge Belongie · 2007
Cited alongside, same era.
Theory of disagreement-based active learning
S. Hanneke · 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.
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.
The optimal sample complexity of pac learning
Steve Hanneke · 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.
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.
Sample and computationally efficient learning algorithms under s-concave distributions
Maria-Florina F Balcan and Hongyang Zhang · 2017
Later among the works it cites.
Active classification with comparison queries
Lovett S. Moran S. Zhang J Kane, D · 2017
Later among the works it cites.
Noise-tolerant interactive learning using pairwise comparisons
Yichong Xu, Hongyang Zhang, Kyle Miller, Aarti Singh, and Artur Dubrawski · 2017
Later among the works it cites.
Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness
Igor Carboni Oliveira and Rahul Santhanam · 2017
Later among the works it cites.