Fetching the paper…
Reading the bibliography…
Coresets are small data summaries that are sufficient for model training.
An algorithm for quadratic programming
M. Frank and P. Wolfe · 1956
Earlier work this paper cites.
Theory of optimal experiments
V. V. Fedorov · 1972
Earlier work this paper cites.
Characterizations of an empirical influence function for detecting influential cases in regression
R. D. Cook and S. Weisberg · 1980
Earlier work this paper cites.
Residuals and influence in regression
R. D. Cook and S. Weisberg · 1982
Earlier work this paper cites.
Random sampling with a reservoir
J. S. Vitter · 1985
Earlier work this paper cites.
On the limited memory bfgs method for large scale optimization
D. C. Liu and J. Nocedal · 1989
Earlier work this paper cites.
Catastrophic interference in connectionist networks: The sequential learning problem
M. McCloskey and N. J. Cohen · 1989
Earlier work this paper cites.
Bilevel and multilevel programming: A bibliography review
L. N. Vicente and P. H. Calamai · 1994
Earlier work this paper cites.
Bayesian experimental design: A review
K. Chaloner and I. Verdinelli · 1995
Earlier work this paper cites.
On linear-time deterministic algorithms for optimization problems in fixed dimension
B. Chazelle and J. Matoušek · 1996
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Practical Bilevel Optimization: Algorithms and Applications
J. F. Bard · 1998
Earlier work this paper cites.
Catastrophic forgetting in connectionist networks
R. M. French · 1999
Earlier work this paper cites.
k-means++: The advantages of careful seeding
D. ARTHUR · 2007
Earlier work this paper cites.
Learning multiple layers of features from tiny images, 2009
A. Krizhevsky et al · 2009
Earlier work this paper cites.
Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection
A. Das and D. Kempe · 2011
Earlier work this paper cites.
A unified framework for approximating and clustering data
D. Feldman and M. Langberg · 2011
Earlier work this paper cites.
icub world: Friendly robots help building good vision data-sets
S. Fanello, C. Ciliberto, M. Santoro, L. Natale, G. Metta, L. Rosasco, and F. Odone · 2013
Earlier work this paper cites.
An empirical investigation of catastrophic forgetting in gradient-based neural networks, 2014
I. J. Goodfellow, M. Mirza, D. Xiao, A. Courville, and Y. Bengio · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
D. P. Kingma and J. Ba · 2015
Cited alongside, same era.
Submodularity in data subset selection and active learning
K. Wei, R. Iyer, and J. Bilmes · 2015
Cited alongside, same era.
Deep residual learning for image recognition
K. He, X. Zhang, S. Ren, and J. Sun · 2016
Cited alongside, same era.
Coresets for scalable bayesian logistic regression
J. Huggins, T. Campbell, and T. Broderick · 2016
Cited alongside, same era.
Hyperparameter optimization with approximate gradient
F. Pedregosa · 2016
Cited alongside, same era.
A. A. Rusu, N. C. Rabinowitz, G. Desjardins, H. Soyer, J. Kirkpatrick, K. Kavukcuoglu, R. Pascanu, and R. Hadsell · 2016
Cited alongside, same era.
Neural tangent kernel: Convergence and generalization in neural networks
A. Jacot, F. Gabriel, and C. Hongler · 2018
Later among the works it cites.
Variational continual learning
C. V. Nguyen, Y. Li, T. D. Bui, and R. E. Turner · 2018
Later among the works it cites.
Learning to reweight examples for robust deep learning
M. Ren, W. Zeng, B. Yang, and R. Urtasun · 2018
Later among the works it cites.
Active learning for convolutional neural networks: A core-set approach
O. Sener and S. Savarese · 2018
Later among the works it cites.
Task-free continual learning
R. Aljundi, K. Kelchtermans, and T. Tuytelaars · 2019
Later among the works it cites.
Gradient based sample selection for online continual learning
R. Aljundi, M. Lin, B. Goujaud, and Y. Bengio · 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…
Guarantees for greedy maximization of non-submodular functions with applications
A. A. Bian, J. M. Buhmann, A. Krause, and S. Tschiatschek · 2017
Cited alongside, same era.
Model-agnostic meta-learning for fast adaptation of deep networks
C. Finn, P. Abbeel, and S. Levine · 2017
Cited alongside, same era.
Overcoming catastrophic forgetting in neural networks
J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, G. Desjardins, A. A. Rusu, K. Milan, J. Quan, T. Ramalho, A. Grabska-Barwinska, et al · 2017
Cited alongside, same era.
Understanding black-box predictions via influence functions
P. W. Koh and P. Liang · 2017
Cited alongside, same era.
Greedy algorithms for cone constrained optimization with convergence guarantees
F. Locatello, M. Tschannen, G. Rätsch, and M. Jaggi · 2017
Cited alongside, same era.
Gradient episodic memory for continual learning
D. Lopez-Paz and M. Ranzato · 2017
Cited alongside, same era.
On exact computation with an infinitely wide neural net
S. Arora, S. S. Du, W. Hu, Z. Li, R. R. Salakhutdinov, and R. Wang · 2019
Later among the works it cites.
Automated scalable bayesian inference via hilbert coresets
T. Campbell and T. Broderick · 2019
Later among the works it cites.
Continual learning with tiny episodic memories
A. Chaudhry, M. Rohrbach, M. Elhoseiny, T. Ajanthan, P. K. Dokania, P. H. Torr, and M. Ranzato · 2019
Later among the works it cites.
Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications
C. Harshaw, M. Feldman, J. Ward, and A. Karbasi · 2019
Later among the works it cites.
Memory efficient experience replay for streaming learning
T. L. Hayes, N. D. Cahill, and C. Kanan · 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.
DARTS: Differentiable architecture search
H. Liu, K. Simonyan, and Y. Yang · 2019
Later among the works it cites.
Online continual learning from imbalanced data
A. Chrysakis and M.-F. Moens · 2020
Closest in time.
Selection via proxy: Efficient data selection for deep learning
C. Coleman, C. Yeh, S. Mussmann, B. Mirzasoleiman, P. Bailis, P. Liang, J. Leskovec, and M. Zaharia · 2020
Closest in time.
Optimizing millions of hyperparameters by implicit differentiation
J. Lorraine, P. Vicol, and D. Duvenaud · 2020
Closest in time.
Neural tangents: Fast and easy infinite neural networks in python
R. Novak, L. Xiao, J. Hron, J. Lee, A. A. Alemi, J. Sohl-Dickstein, and S. S. Schoenholz · 2020
Closest in time.
Makesense: Automated sensor design for proprioceptive soft robots
J. Tapia, E. Knoop, M. Mutnỳ, M. A. Otaduy, and M. Bächer · 2020
Closest in time.
Functional regularisation for continual learning with gaussian processes
M. K. Titsias, J. Schwarz, A. G. de G. Matthews, R. Pascanu, and Y. W. Teh · 2020
Closest in time.