Fetching the paper…
Reading the bibliography…
In this paper we propose an approach to avoiding catastrophic forgetting in sequential task learning scenarios.
M. McCloskey and N. J. Cohen, “Catastrophic interference in connectionist networks: The sequential learning problem,” Psychology of learning and motivation , vol. 24, pp. 109–165, 1989
1989
Earlier work this paper cites.
S.-I. Amari, “Natural gradient works efficiently in learning,” Neural computation , vol. 10, no. 2, pp. 251–276, 1998
1998
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
D. Silver and R. Mercer, “The task rehearsal method of life-long learning: Overcoming impoverished data,” Advances in Artificial Intelligence , pp. 90–101, 2002
2002
Earlier work this paper cites.
T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,” SIAM review , vol. 51, no. 3, pp. 455–500, 2009
2009
Earlier work this paper cites.
A. Krizhevsky and G. Hinton, “Learning multiple layers of features from tiny images,” Tech. Rep., 2009
2009
Earlier work this paper cites.
C. Wah, S. Branson, P. Welinder, P. Perona, and S. Belongie, “The Caltech-UCSD Birds-200-2011 Dataset,” no. CNS-TR-2011-001, 2011
2011
Earlier work this paper cites.
B. Yao, X. Jiang, A. Khosla, A. L. Lin, L. Guibas, and L. Fei-Fei, “Human action recognition by learning bases of action attributes and parts,” in ICCV , 2011, pp. 1331–1338
2011
Earlier work this paper cites.
2013
Earlier work this paper cites.
R. K. Srivastava, J. Masci, S. Kazerounian, F. Gomez, and J. Schmidhuber, “Compete to compute,” in NIPS , 2013, pp. 2310–2318
2013
Earlier work this paper cites.
J. Li, “Restructuring of deep neural network acoustic models with singular value decomposition,” in Interspeech , January 2013
2013
Cited alongside, same era.
2014
Cited alongside, same era.
Z. Li and D. Hoiem, “Learning without forgetting,” in ECCV , 2016, pp. 614–629
2016
Cited alongside, same era.
R. Grosse and J. Martens, “A kronecker-factored approximate fisher matrix for convolution layers,” in ICML , 2016, pp. 573–582
2016
Cited alongside, same era.
S.-A. Rebuffi, A. Kolesnikov, and C. H. Lampert, “iCaRL: Incremental classifier and representation learning,” in CVPR , 2017
2017
Cited alongside, same era.
R. Aljundi, P. Chakravarty, and T. Tuytelaars, “Expert gate: Lifelong learning with a network of experts,” in CVPR , 2017
2017
Later among the works it cites.
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. 2994–3003
2017
Later among the works it cites.
A. Rannen, R. Aljundi, and M. B. B. T. Tuytelaars, “Encoder based lifelong learning,” in CVPR , 2017, pp. 1320–1328
2017
Later among the works it cites.
2017
Later among the works it cites.
M. Masana, J. van de Weijer, L. Herranz, A. D. Bagdanov, and J. M. Alvarez, “Domain-adaptive deep network compression,” in International conference on Computer Vision (ICCV) , 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Lopez-Paz and M. A. Ranzato, “Gradient episodic memory for continual learning,” in NIPS , 2017, pp. 6470–6479
2017
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 et al. , “Overcoming catastrophic forgetting in neural networks,” Proceedings of the National Academy of Sciences , pp. 3521–3526, 2017
2017
Cited alongside, same era.
S.-W. Lee, J.-H. Kim, J. Jun, J.-W. Ha, and B.-T. Zhang, “Overcoming catastrophic forgetting by incremental moment matching,” in NIPS , 2017, pp. 4655–4665
2017
Cited alongside, same era.
F. Zenke, B. Poole, and S. Ganguli, “Continual learning through synaptic intelligence,” in ICML , 2017, pp. 3987–3995
2017
Cited alongside, same era.
2017
Later among the works it cites.
2018
Closest in time.
F. Huszár, “Note on the quadratic penalties in elastic weight consolidation,” Proceedings of the National Academy of Sciences , vol. 115, no. 11, pp. E2496–E2497, 2018
2018
Closest in time.
2018
Closest in time.
G. Desjardins, K. Simonyan, R. Pascanu et al. , “Natural neural networks,” in NIPS , 2015, pp. 2071–2079
2079
Closest in time.