Fetching the paper…
Reading the bibliography…
Online machine learning systems need to adapt to domain shifts.
Improving generalization with active learning
David Cohn, Les Atlas, and Richard Ladner · 1994
Earlier work this paper cites.
Relative loss bounds for on-line density estimation with the exponential family of distributions
Katy S Azoury and Manfred K Warmuth · 2001
Earlier work this paper cites.
Competitive on-line statistics
Volodya Vovk · 2001
Earlier work this paper cites.
Using confidence bounds for exploitation-exploration trade-offs
Peter Auer · 2002
Earlier work this paper cites.
Tracking a small set of experts by mixing past posteriors
Olivier Bousquet and Manfred K Warmuth · 2002
Earlier work this paper cites.
Worst-case analysis of selective sampling for linear classification
Nicolo Cesa-Bianchi, Claudio Gentile, and Luca Zaniboni · 2006
Earlier work this paper cites.
Sampling algorithms for l 2 regression and applications
Petros Drineas, Michael W Mahoney, and Shan Muthukrishnan · 2006
Earlier work this paper cites.
Adaptive algorithms for online decision problems
Elad Hazan and Comandur Seshadhri · 2007
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Earlier work this paper cites.
Covariate shift adaptation by importance weighted cross validation
Masashi Sugiyama, Matthias Krauledat, and Klaus-Robert MÞller · 2007
Earlier work this paper cites.
High-probability regret bounds for bandit online linear optimization
Peter L Bartlett, Varsha Dani, Thomas Hayes, Sham Kakade, Alexander Rakhlin, and Ambuj Tewari · 2008
Earlier work this paper cites.
Hierarchical sampling for active learning
Sanjoy Dasgupta and Daniel Hsu · 2008
Earlier work this paper cites.
A general agnostic active learning algorithm
Sanjoy Dasgupta, Daniel J Hsu, and Claire Monteleoni · 2008
Earlier work this paper cites.
Agnostic active learning
Maria-Florina Balcan, Alina Beygelzimer, and John Langford · 2009
Earlier work this paper cites.
Robust bounds for classification via selective sampling
Nicolo Cesa-Bianchi, Claudio Gentile, and Francesco Orabona · 2009
Earlier work this paper cites.
Gaussian process optimization in the bandit setting: No regret and experimental design
Niranjan Srinivas, Andreas Krause, Sham M Kakade, and Matthias Seeger · 2009
Earlier work this paper cites.
Agnostic active learning without constraints
Alina Beygelzimer, Daniel J 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.
Mnist handwritten digit database
Yann LeCun, Corinna Cortes, and CJ Burges · 2010
Earlier work this paper cites.
Domain adaptation meets active learning
Piyush Rai, Avishek Saha, Hal Daumé III, and Suresh Venkatasubramanian · 2010
Earlier work this paper cites.
Trading off mistakes and don’t-know predictions
Amin Sayedi, Morteza Zadimoghaddam, and Avrim Blum · 2010
Earlier work this paper cites.
Learning noisy linear classifiers via adaptive and selective sampling
Giovanni Cavallanti, Nicolò Cesa-Bianchi, and Claudio Gentile · 2011
Cited alongside, same era.
Rates of convergence in active learning
Steve Hanneke · 2011
Cited alongside, same era.
Knows what it knows: a framework for self-aware learning
Lihong Li, Michael L Littman, Thomas J Walsh, and Alexander L Strehl · 2011
Cited alongside, same era.
Active supervised domain adaptation
Avishek Saha, Piyush Rai, Hal Daumé, Suresh Venkatasubramanian, and Scott L DuVall · 2011
Cited alongside, same era.
Agnostic kwik learning and efficient approximate reinforcement learning
István Szita and Csaba Szepesvári · 2011
Cited alongside, same era.
Unbiased look at dataset bias
Antonio Torralba and Alexei A Efros · 2011
Cited alongside, same era.
Domain-adversarial training of neural networks
Yaroslav Ganin, Evgeniya Ustinova, Hana Ajakan, Pascal Germain, Hugo Larochelle, François Laviolette, Mario Marchand, and Victor Lempitsky · 2016
Later among the works it cites.
Introduction to online convex optimization
Elad Hazan · 2016
Later among the works it cites.
The extended littlestone’s dimension for learning with mistakes and abstentions
Chicheng Zhang and Kamalika Chaudhuri · 2016
Later among the works it cites.
Understanding deep learning requires rethinking generalization
Chiyuan Zhang, Samy Bengio, Moritz Hardt, Benjamin Recht, and Oriol Vinyals · 2016
Later among the works it cites.
Active heteroscedastic regression
Kamalika Chaudhuri, Prateek Jain, and Nagarajan Natarajan · 2017
Later among the works it cites.
Adaptivity to noise parameters in nonparametric active learning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Active learning with a drifting distribution
Liu Yang · 2011
Cited alongside, same era.
Model-oriented design of experiments , volume 125
Valerii V Fedorov and Peter Hackl · 2012
Cited alongside, same era.
Plug-in approach to active learning
Stanislav Minsker · 2012
Cited alongside, same era.
Selective sampling algorithms for cost-sensitive multiclass prediction
Alekh Agarwal · 2013
Cited alongside, same era.
Eluder dimension and the sample complexity of optimistic exploration
Daniel Russo and Benjamin Van Roy · 2013
Cited alongside, same era.
Finite-time analysis of kernelised contextual bandits
Michal Valko, Nathaniel Korda, Rémi Munos, Ilias Flaounas, and Nelo Cristianini · 2013
Cited alongside, same era.
Andrea Locatelli, Alexandra Carpentier, and Samory Kpotufe · 2017
Later among the works it cites.
Reverse iterative volume sampling for linear regression
Michał Dereziński and Manfred K Warmuth · 2018
Later among the works it cites.
Leveraged volume sampling for linear regression
Michal Derezinski, Manfred KK Warmuth, and Daniel J Hsu · 2018
Later among the works it cites.
Bert: Pre-training of deep bidirectional transformers for language understanding
Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova · 2018
Later among the works it cites.
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2018
Later among the works it cites.
Do cifar-10 classifiers generalize to cifar-10?
Benjamin Recht, Rebecca Roelofs, Ludwig Schmidt, and Vaishaal Shankar · 2018
Later among the works it cites.
Ai-human partnerships tackle "fake news": Machine learning can get you only so far-then human judgment is required - [news]
Eliza Strickland · 2018
Later among the works it cites.
Xavier Fontaine, Pierre Perrault, and Vianney Perchet · 2019
Later among the works it cites.
Do imagenet classifiers generalize to imagenet?
Benjamin Recht, Rebecca Roelofs, Ludwig Schmidt, and Vaishaal Shankar · 2019
Later among the works it cites.
Visualizing and measuring the geometry of bert
Emily Reif, Ann Yuan, Martin Wattenberg, Fernanda B Viegas, Andy Coenen, Adam Pearce, and Been Kim · 2019
Later among the works it cites.
Equipping experts/bandits with long-term memory
Kai Zheng, Haipeng Luo, Ilias Diakonikolas, and Liwei Wang · 2019
Later among the works it cites.
Identifying statistical bias in dataset replication
Logan Engstrom, Andrew Ilyas, Shibani Santurkar, Dimitris Tsipras, Jacob Steinhardt, and Aleksander Madry · 2020
Closest in time.
Understanding self-training for gradual domain adaptation
Ananya Kumar, Tengyu Ma, and Percy Liang · 2020
Closest in time.
Active adversarial domain adaptation
Jong-Chyi Su, Yi-Hsuan Tsai, Kihyuk Sohn, Buyu Liu, Subhransu Maji, and Manmohan Chandraker · 2020
Closest in time.
On the generalization ability of on-line learning algorithms
Nicolo Cesa-Bianchi, Alex Conconi, and Claudio Gentile · 2057
Closest in time.