Fetching the paper…
Reading the bibliography…
Continual learning, or lifelong learning, is a formidable current challenge to machine learning.
On the density of families of sets
Norbert Sauer · 1972
Earlier work this paper cites.
A combinatorial problem; stability and order for models and theories in infinitary languages
Saharon Shelah · 1972
Earlier work this paper cites.
Communication complexity
Christos H Papadimitriou and Michael Sipser · 1982
Earlier work this paper cites.
A theory of the learnable
Leslie G Valiant · 1984
Earlier work this paper cites.
Catastrophic interference in connectionist networks: The sequential learning problem
Michael McCloskey and Neal J Cohen · 1989
Earlier work this paper cites.
The strength of weak learnability
Robert E Schapire · 1990
Earlier work this paper cites.
Rounds in communication complexity revisited
Noam Nisan and Avi Widgerson · 1991
Earlier work this paper cites.
Sphere packing numbers for subsets of the boolean n-cube with bounded vapnik-chervonenkis dimension
David Haussler · 1995
Earlier work this paper cites.
Why there are complementary learning systems in the hippocampus and neocortex: insights from the successes and failures of connectionist models of learning and memory
James L McClelland, Bruce L McNaughton, and Randall C O’Reilly · 1995
Earlier work this paper cites.
Lifelong robot learning
Sebastian Thrun and Tom M Mitchell · 1995
Earlier work this paper cites.
On quantum and probabilistic communication: Las vegas and one-way protocols
Hartmut Klauck · 2000
Earlier work this paper cites.
Limitations of quantum advice and one-way communication
Scott Aaronson · 2004
Earlier work this paper cites.
Information equals amortized communication
Mark Braverman and Anup Rao · 2011
Earlier work this paper cites.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Earlier work this paper cites.
Distributed learning, communication complexity and privacy
Maria Florina Balcan, Avrim Blum, Shai Fine, and Yishay Mansour · 2012
Earlier work this paper cites.
A direct product theorem for the two-party bounded-round public-coin communication complexity
Rahul Jain, Attila Pereszlényi, and Penghui Yao · 2012
Earlier work this paper cites.
How to compress interactive communication
Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao · 2013
Earlier work this paper cites.
An empirical investigation of catastrophic forgetting in gradient-based neural networks
Ian J Goodfellow, Mehdi Mirza, Da Xiao, Aaron Courville, and Yoshua Bengio · 2013
Earlier work this paper cites.
Ella: An efficient lifelong learning algorithm
Paul Ruvolo and Eric Eaton · 2013
Cited alongside, same era.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
Efficient representations for lifelong learning and autoencoding
Maria-Florina Balcan, Avrim Blum, and Santosh Vempala · 2015
Cited alongside, same era.
Interactive information complexity
Mark Braverman · 2015
Cited alongside, same era.
Sample complexity bounds on differentially private learning via communication complexity
Vitaly Feldman and David Xiao · 2015
Cited alongside, same era.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir N Vapnik and A Ya Chervonenkis · 2015
Cited alongside, same era.
Space lower bounds for linear prediction in the streaming model
Yuval Dagan, Gil Kur, and Ohad Shamir · 2019
Later among the works it cites.
On communication complexity of classification problems
Daniel Kane, Roi Livni, Shay Moran, and Amir Yehudayoff · 2019
Later among the works it cites.
Continual lifelong learning with neural networks: A review
German I Parisi, Ronald Kemker, Jose L Part, Christopher Kanan, and Stefan Wermter · 2019
Later among the works it cites.
Experience replay for continual learning
David Rolnick, Arun Ahuja, Jonathan Schwarz, Timothy Lillicrap, and Gregory Wayne · 2019
Later among the works it cites.
Memory-sample tradeoffs for linear regression with small error
Vatsal Sharan, Aaron Sidford, and Gregory Valiant · 2019
Later among the works it cites.
Continual learning in low-rank orthogonal subspaces
Arslan Chaudhry, Naeemullah Khan, Puneet Dokania, and Philip Torr · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Lifelong learning with weighted majority votes
Anastasia Pentina and Ruth Urner · 2016
Cited alongside, same era.
Andrei A Rusu, Neil C Rabinowitz, Guillaume Desjardins, Hubert Soyer, James Kirkpatrick, Koray Kavukcuoglu, Razvan Pascanu, and Raia Hadsell · 2016
Cited alongside, same era.
Collaborative pac learning
Avrim Blum, Nika Haghtalab, Ariel D Procaccia, and Mingda Qiao · 2017
Cited alongside, same era.
Overcoming catastrophic forgetting in neural networks
James Kirkpatrick, Razvan Pascanu, Neil Rabinowitz, Joel Veness, Guillaume Desjardins, Andrei A Rusu, Kieran Milan, John Quan, Tiago Ramalho, Agnieszka Grabska-Barwinska, et al · 2017
Cited alongside, same era.
Gradient episodic memory for continual learning
David Lopez-Paz and Marc’Aurelio Ranzato · 2017
Cited alongside, same era.
Continual learning with deep generative replay
Hanul Shin, Jung Kwon Lee, Jaehong Kim, and Jiwon Kim · 2017
Cited alongside, same era.
Later among the works it cites.
Orthogonal gradient descent for continual learning
Mehrdad Farajtabar, Navid Azizan, Alex Mott, and Ang Li · 2020
Later among the works it cites.
Does learning require memorization? a short tale about a long tail
Vitaly Feldman · 2020
Later among the works it cites.
Optimal continual learning has perfect memory and is np-hard
Jeremias Knoblauch, Hisham Husain, and Tom Diethe · 2020
Later among the works it cites.
Brain-inspired replay for continual learning with artificial neural networks
Gido M van de Ven, Hava T Siegelmann, and Andreas S Tolias · 2020
Later among the works it cites.
The communication complexity of optimization
Santosh S Vempala, Ruosong Wang, and David P Woodruff · 2020
Later among the works it cites.
Pointer chasing via triangular discrimination
Amir Yehudayoff · 2020
Later among the works it cites.
When is memorization of irrelevant training data necessary for high-accuracy learning?
Gavin Brown, Mark Bun, Vitaly Feldman, Adam Smith, and Kunal Talwar · 2021
Later among the works it cites.
Near optimal distributed learning of halfspaces with two parties
Mark Braverman, Gillat Kol, Shay Moran, and Raghuvansh R Saxena · 2021
Later among the works it cites.
Provable lifelong learning of representations
Xinyuan Cao, Weiyang Liu, and Santosh S Vempala · 2021
Later among the works it cites.
Icml workshop on theory and foundation of continual learning
Amal Rannen-Triki, Arslan Chaudhry, Bogdan Mazoure, Xu He, Thang Doan, Rahaf Aljundi, and Vincenzo Lomonaco · 2021
Later among the works it cites.
Binghui Peng and Andrej Risteski · 2022
Closest in time.