Fetching the paper…
Reading the bibliography…
In lifelong learning, data are used to improve performance not only on the present task, but also on past and future (unencountered) tasks.
1904
Earlier work this paper cites.
V. Vapnik and A. Chervonenkis, “On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities,” Theory Probab. Appl. , vol. 16, no. 2, pp. 264–280, Jan. 1971
1971
Earlier work this paper cites.
L. G. Valiant, “A Theory of the Learnable,” Commun. ACM , vol. 27, no. 11, pp. 1134–1142, Nov. 1984. [Online]. Available: http://doi.acm.org/10.1145/1968.1972
1972
Earlier work this paper cites.
L. Breiman, J. Friedman, C. J. Stone, and R. A. Olshen, Classification and regression trees . CRC press, 1984
1984
Earlier work this paper cites.
M. McCloskey and N. J. Cohen, “Catastrophic interference in connectionist networks: The sequential learning problem,” in Psychology of learning and motivation . Elsevier, 1989, vol. 24, pp. 109–165
1989
Earlier work this paper cites.
J. L. McClelland, B. L. McNaughton, and R. C. O’Reilly, “Why there are complementary learning systems in the hippocampus and neocortex: insights from the successes and failures of connectionist models of learning and memory.” Psychological review , vol. 102, no. 3, p. 419, 1995
1995
Earlier work this paper cites.
A. Robins, “Catastrophic forgetting, rehearsal and pseudorehearsal,” Connection Science , vol. 7, no. 2, pp. 123–146, 1995
1995
Earlier work this paper cites.
Y. Freund, “Boosting a Weak Learning Algorithm by Majority,” Inform. and Comput. , vol. 121, no. 2, pp. 256–285, Sep. 1995
1995
Earlier work this paper cites.
S. Thrun, “Is learning the n-th thing any easier than learning the first?” in Advances in neural information processing systems , 1996, pp. 640–646
1996
Earlier work this paper cites.
L. Breiman, “Bagging predictors,” Mach. Learn. , vol. 24, no. 2, pp. 123–140, Aug. 1996
1996
Earlier work this paper cites.
R. Caruana, “Multitask learning,” Machine learning , vol. 28, no. 1, pp. 41–75, 1997
1997
Earlier work this paper cites.
Y. Amit and D. Geman, “Shape Quantization and Recognition with Randomized Trees,” Neural Comput. , vol. 9, no. 7, pp. 1545–1588, Oct. 1997
1997
Earlier work this paper cites.
T. M. Mitchell, “Machine learning and data mining,” Communications of the ACM , vol. 42, no. 11, pp. 30–36, 1999
1999
Earlier work this paper cites.
R. Polikar, L. Upda, S. S. Upda, and V. Honavar, “Learn++: An incremental learning algorithm for supervised neural networks,” IEEE transactions on systems, man, and cybernetics, part C (applications and reviews) , vol. 31, no. 4, pp. 497–508, 2001
2001
Earlier work this paper cites.
L. Breiman, “Random forests,” Machine learning , vol. 45, no. 1, pp. 5–32, 2001
2001
Earlier work this paper cites.
H. Wang, W. Fan, P. S. Yu, and J. Han, “Mining concept-drifting data streams using ensemble classifiers,” in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , 2003, pp. 226–235
2003
Earlier work this paper cites.
W. Kuo and M. J. Zuo, Optimal reliability modeling: principles and applications . John Wiley & Sons, 2003
2003
Earlier work this paper cites.
R. Caruana, A. Niculescu-Mizil, G. Crew, and A. Ksikes, “Ensemble selection from libraries of models,” in Proceedings of the twenty-first international conference on Machine learning , 2004, p. 18
2004
Earlier work this paper cites.
R. Caruana and A. Niculescu-Mizil, “An Empirical Comparison of Supervised Learning Algorithms,” in Proceedings of the 23rd International Conference on Machine Learning , ser. ICML ’06. New York, NY, USA: ACM, 2006, pp. 161–168
2006
Earlier work this paper cites.
W. Dai, Q. Yang, G.-R. Xue, and Y. Yu, “Boosting for transfer learning.(2007), 193–200,” in Proceedings of the 24th international conference on Machine learning , 2007
2007
Earlier work this paper cites.
C. Dwork, “Differential privacy: A survey of results,” in International conference on theory and applications of models of computation . Springer, 2008, pp. 1–19
2008
Earlier work this paper cites.
Y. Netzer, T. Wang, A. Coates, A. Bissacco, B. Wu, and A. Y. Ng, “Reading digits in natural images with unsupervised feature learning,” 2011
2011
Earlier work this paper cites.
Y. Bulatov, “http://yaroslavvb.blogspot.com/2011/09/notmnist-dataset.html,” 2011
2011
Earlier work this paper cites.
S. Thrun and L. Pratt, Learning to Learn . Springer Science & Business Media, Dec. 2012. [Online]. Available: https://market.android.com/details?id=book-X_jpBwAAQBAJ
2012
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory . New York: John Wiley & Sons, Nov. 2012
2012
Earlier work this paper cites.
A. Krizhevsky, “Learning multiple layers of features from tiny images,” University of Toronto , 05 2012
2012
Earlier work this paper cites.
K. Cho, B. van Merrienboer, C. Gulcehre, F. Bougares, H. Schwenk, and Y. Bengio, “Learning phrase representations using rnn encoder-decoder for statistical machine translation,” in Conference on Empirical Methods in Natural Language Processing (EMNLP 2014) , 2014
2014
Earlier work this paper cites.
M. Denil, D. Matheson, and N. D. Freitas, “Narrowing the gap: Random forests in theory and in practice,” in Proceedings of the 31st International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, E. P. Xing and T. Jebara, Eds., vol. 32, 6 2014, pp. 665–673
2014
Earlier work this paper cites.
P. J. Bickel and K. A. Doksum, Mathematical statistics: basic ideas and selected topics, volumes I-II package . Chapman and Hall/CRC, 2015
2015
Cited alongside, same era.
F. Chollet et al. , “Keras,” https://github.com/fchollet/keras
2015
Cited alongside, same era.
J. Zhao, B. Quiroz, L. Q. Dixon, and R. M. Joshi, “Comparing Bilingual to Monolingual Learners on English Spelling: A Meta-analytic Review,” Dyslexia , vol. 22, no. 3, pp. 193–213, Aug. 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
J. Kirkpatrick, R. Pascanu, N. Rabinowitz, J. Veness, G. Desjardins, A. A. Rusu, K. Milan, J. Quan, T. Ramalho, A. Grabska-Barwinska, D. Hassabis, C. Clopath, D. Kumaran, and R. Hadsell, “Overcoming catastrophic forgetting in neural networks,” Proceedings of the national academy of sciences , vol. 114, no. 13, pp. 3521–3526, 2017
S. Athey, J. Tibshirani, and S. Wager, “Generalized random forests,” Annals of Statistics , vol. 47, no. 2, pp. 1148–1178, 2019
2019
Later among the works it cites.
I. van Rooij, M. Blokpoel, J. Kwisthout, and T. Wareham, Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis . Cambridge University Press, Apr. 2019
2019
Later among the works it cites.
2020
Closest in time.
G. M. van de Ven, H. T. Siegelmann, and A. S. Tolias, “Brain-inspired replay for continual learning with artificial neural networks,” Nature communications , vol. 11, p. 4069, 2020
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
F. Zenke, B. Poole, and S. Ganguli, “Continual learning through synaptic intelligence,” in Proceedings of the 34th International Conference on Machine Learning-Volume 70 . JMLR. org, 2017, pp. 3987–3995
2017
Cited alongside, same era.
Z. Li and D. Hoiem, “Learning without forgetting,” IEEE transactions on pattern analysis and machine intelligence , vol. 40, no. 12, pp. 2935–2947, 2017
2017
Cited alongside, same era.
H. Shin, J. K. Lee, J. Kim, and J. Kim, “Continual learning with deep generative replay,” in Advances in Neural Information Processing Systems , 2017, pp. 2990–2999
2017
Cited alongside, same era.
D. Lopez-Paz and M. Ranzato, “Gradient episodic memory for continual learning,” in NIPS , 2017
2017
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. U. Kaiser, and I. Polosukhin, “Attention is All you Need,” in Advances in Neural Information Processing Systems 30 , I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, Eds. Curran Associates, Inc., 2017, pp. 5998–6008
2017
Cited alongside, same era.
V. Lomonaco and D. Maltoni, “Core50: a new dataset and benchmark for continuous object recognition,” in Conference on Robot Learning . PMLR, 2017, pp. 17–26
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2020
Closest in time.
A. Prabhu, P. H. Torr, and P. K. Dokania, “Gdumb: A simple approach that questions our progress in continual learning,” in Computer Vision–ECCV 2020: 16th European Conference, Glasgow, UK, August 23–28, 2020, Proceedings, Part II 16 . Springer, 2020, pp. 524–540
2020
Closest in time.
2020
Closest in time.
M. Caccia, P. Rodriguez, O. Ostapenko, F. Normandin, M. Lin, L. Page-Caccia, I. H. Laradji, I. Rish, A. Lacoste, D. Vázquez et al. , “Online fast adaptation and knowledge accumulation (osaka): a new approach to continual learning,” Advances in Neural Information Processing Systems , vol. 33, pp. 16 532–16 545, 2020
2020
Closest in time.
T. Doan, M. A. Bennani, B. Mazoure, G. Rabusseau, and P. Alquier, “A theoretical analysis of catastrophic forgetting through the ntk overlap matrix,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021, pp. 1072–1080
2021
Closest in time.
R. Ramesh and P. Chaudhari, “Model zoo: A growing brain that learns continually,” in International Conference on Learning Representations , 2021
2021
Closest in time.
O. Ostapenko, P. Rodriguez, M. Caccia, and L. Charlin, “Continual learning via local module composition,” Advances in Neural Information Processing Systems , vol. 34, pp. 30 298–30 312, 2021
2021
Closest in time.
N. Mehta, K. Liang, V. K. Verma, and L. Carin, “Continual learning using a bayesian nonparametric dictionary of weight factors,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021, pp. 100–108
2021
Closest in time.
S. Yan, J. Xie, and X. He, “Der: Dynamically expandable representation for class incremental learning,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2021, pp. 3014–3023
2021
Closest in time.
C. Chen, K. Ota, M. Dong, C. Yu, and H. Jin, “Human activity recognition-oriented incremental learning with knowledge distillation,” Journal of Circuits, Systems and Computers , vol. 30, no. 06, p. 2150096, 2021
2021
Closest in time.
2021
Closest in time.
M. De Lange, R. Aljundi, M. Masana, S. Parisot, X. Jia, A. Leonardis, G. Slabaugh, and T. Tuytelaars, “A continual learning survey: Defying forgetting in classification tasks,” IEEE transactions on pattern analysis and machine intelligence , vol. 44, no. 7, pp. 3366–3385, 2021
2021
Closest in time.
C. Zhang, S. Bengio, M. Hardt, B. Recht, and O. Vinyals, “Understanding deep learning (still) requires rethinking generalization,” Communications of the ACM , vol. 64, no. 3, pp. 107–115, 2021
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
G. M. van de Ven, T. Tuytelaars, and A. S. Tolias, “Three types of incremental learning,” Nature Machine Intelligence , pp. 1–13, 2022
2022
Closest in time.
H. Kang, R. J. L. Mina, S. R. H. Madjid, J. Yoon, M. Hasegawa-Johnson, S. J. Hwang, and C. D. Yoo, “Forget-free continual learning with winning subnetworks,” in International Conference on Machine Learning . PMLR, 2022, pp. 10 734–10 750
2022
Closest in time.
S. Chakraborty, B. Uzkent, K. Ayush, K. Tanmay, E. Sheehan, and S. Ermon, “Efficient conditional pre-training for transfer learning,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2022, pp. 4241–4250
2022
Closest in time.
L. Wang, X. Zhang, Q. Li, J. Zhu, and Y. Zhong, “Coscl: Cooperation of small continual learners is stronger than a big one,” in European Conference on Computer Vision . Springer, 2022, pp. 254–271
2022
Closest in time.
S. Channappayya, B. R. Tamma et al. , “Augmented memory replay-based continual learning approaches for network intrusion detection,” Advances in Neural Information Processing Systems , vol. 36, pp. 17 156–17 169, 2023
2023
Closest in time.
B. Yuan and D. Zhao, “A survey on continual semantic segmentation: Theory,” Challenge, Method and Application , 2023
2023
Closest in time.
I. E. Marouf, S. Roy, E. Tartaglione, and S. Lathuilière, “Weighted ensemble models are strong continual learners,” in European Conference on Computer Vision . Springer, 2024, pp. 306–324
2024
Closest in time.
A. Prabhu, S. Sinha, P. Kumaraguru, P. Torr, O. Sener, and P. Dokania, “Randumb: Random representations outperform online continually learned representations,” Advances in Neural Information Processing Systems , vol. 37, pp. 37 988–38 006, 2024
2024
Closest in time.