Fetching the paper…
Reading the bibliography…
We investigate the problem of active learning in the streaming setting in non-parametric regimes, where the labels are stochastically generated from a class of functions on which we make no assumptions whatsoever.
A theory of the learnable
L. G. Valiant · 1984
Earlier work this paper cites.
Improving generalization with active learning
D. Cohn, L. Atlas, and R. Ladner · 1994
Earlier work this paper cites.
A sequential algorithm for training text classifiers
D. D. Lewis and W. A. Gale · 1994
Earlier work this paper cites.
Committee-based sampling for training probabilistic classifiers
I. Dagan and S. P. Engelson · 1995
Earlier work this paper cites.
Smooth discrimination analysis
E. Mammen and A. Tsybakov · 1999
Earlier work this paper cites.
A general agnostic active learning algorithm
S. Dasgupta, D. Hsu, and C. Monteleoni · 2007
Earlier work this paper cites.
A bound on the label complexity of agnostic active learning
S. Hanneke · 2007
Earlier work this paper cites.
The true sample complexity of active learning
N. Balcan, S. Hanneke, and J. Wortman · 2008
Earlier work this paper cites.
Minimax bounds for active learning
R. Castro and R. Nowak · 2008
Earlier work this paper cites.
Agnostic active learning
M. Balcan, A. Beygelzimer, and J. Langford · 2009
Earlier work this paper cites.
Importance weighted active learning
A. Beygelzimer, S. Dasgupta, and J. Langford · 2009
Earlier work this paper cites.
Adaptive rates of convergence in active learning
S. Hanneke · 2009
Earlier work this paper cites.
Active learning literature survey
B. Settles · 2009
Earlier work this paper cites.
Rademacher complexities and bounding the excess risk of active learning
V. Koltchinskii · 2010
Earlier work this paper cites.
Improved algorithms for linear stochastic bandits
Y. Abbasi-yadkori, D. Pál, and C. Szepesvári · 2011
Earlier work this paper cites.
Lower bounds for passive and active learning
M. Raginsky and A. Rakhlin · 2011
Cited alongside, same era.
Selective sampling and active learning from single and multiple teachers
O. Dekel, C. Gentile, and K. Sridharan · 2012
Cited alongside, same era.
Imagenet classification with deep convolutional neural networks
A. Krizhevsky, I. Sutskever, and G. E. Hinton · 2012
Cited alongside, same era.
Plug-in approach to active learning
S. Minsker · 2012
Cited alongside, same era.
Finite-time analysis of kernelised contextual bandits
M. Valko, N. Korda, R. Munos, I. Flaounas, and N. Cristianini · 2013
Cited alongside, same era.
Rates of convergence for nearest neighbor classification
K. Chaudhuri and S. Dasgupta · 2014
Cited alongside, same era.
On exact computation with an infinitely wide neural net
S. Arora, S. S. Du, W. Hu, Z. Li, R. Salakhutdinov, and R. Wang · 2019
Later among the works it cites.
Deep batch active learning by diverse, uncertain gradient lower bounds
J. T. Ash, C. Zhang, A. Krishnamurthy, J. Langford, and A. Agarwal · 2019
Later among the works it cites.
On the inductive bias of neural tangent kernels
A. Bietti and J. Mairal · 2019
Later among the works it cites.
Towards understanding the spectral bias of deep learning
Y. Cao, Z. Fang, Y. Wu, D. Zhou, and Q. Gu · 2019
Later among the works it cites.
Generalization bounds of stochastic gradient descent for wide and deep neural networks
Y. Cao and Q. Gu · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Theory of disagreement-based active learning
S. Hanneke et al · 2014
Cited alongside, same era.
Active nearest-neighbor learning in metric spaces
A. Kontorovich, S. Sabato, and R. Urner · 2016
Cited alongside, same era.
On kernelized multi-armed bandits
S. R. Chowdhury and A. Gopalan · 2017
Cited alongside, same era.
Adaptivity to noise parameters in nonparametric active learning
C. A. Locatelli A. and S. Kpotufe · 2017
Cited alongside, same era.
Active learning for convolutional neural networks: A core-set approach
O. Sener and S. Savarese · 2017
Cited alongside, same era.
Gradient descent learns one-hidden-layer CNN: Don’t be afraid of spurious local minima
S. Du, J. Lee, Y. Tian, A. Singh, and B. Poczos · 2018
Cited alongside, same era.
Gradient descent finds global minima of deep neural networks
S. Du, J. Lee, H. Li, L. Wang, and X. Zhai · 2019
Later among the works it cites.
Batchbald: Efficient and diverse batch acquisition for deep bayesian active learning
A. Kirsch, J. Van Amersfoort, and Y. Gal · 2019
Later among the works it cites.
Diverse mini-batch active learning
F. Zhdanov · 2019
Later among the works it cites.
Maximin active learning in overparameterized model classes
M. Karzand and R. Nowak · 2020
Later among the works it cites.
Regret bound balancing and elimination for model selection in bandits and RL
A. Pacchiano, C. Dann, G. C., and P. Bartlett · 2020
Later among the works it cites.
Model selection in contextual stochastic bandit problems
A. Pacchiano, M. Phan, Y. Abbasi Yadkori, A. Rao, J. Zimmert, T. Lattimore, and C. Szepesvari · 2020
Later among the works it cites.
W. Zhang, D. Zhou, L. Li, and Q. Gu · 2020
Later among the works it cites.
Neural contextual bandits with ucb-based exploration
D. Zhou, L. Li, and Q. Gu · 2020
Later among the works it cites.
Nonparametric adaptive active learning under local smoothness condition
B. Njike and X. Siebert · 2021
Closest in time.