---
title: "Progress & Compress: A scalable framework for continual learning"
description: "Neural networks that learn tasks one after another tend to lose earlier skills, a problem called… 42 references, cited by 66 papers here."
authors: ["Jonathan Schwarz", "Jelena Luketina", "Wojciech M. Czarnecki", "Agnieszka Grabska-Barwinska", "Yee Whye Teh", "Razvan Pascanu", "Raia Hadsell"]
year: 2018
venue: "arXiv:1805.06370"
source: "https://arxiv.org/abs/1805.06370"
doi: "10.48550/arxiv.1805.06370"
arxiv: "1805.06370"
licence: "arXiv — non-exclusive licence to distribute"
licence_url: "http://arxiv.org/licenses/nonexclusive-distrib/1.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/schwarz-2018-progress-compress-scalable-framework-continual/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/schwarz-2018-progress-compress-scalable-framework-continual/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2018](https://md.research.elamur.ai/free/en/papers/2018/page/2/) / Progress & Compress: A scalable framework for continual learning

# Progress & Compress: A scalable framework for continual learning

**Authors:** [Jonathan Schwarz](https://md.research.elamur.ai/free/en/authors/jonathan-schwarz/), [Jelena Luketina](https://md.research.elamur.ai/free/en/authors/jelena-luketina/), [Wojciech M. Czarnecki](https://md.research.elamur.ai/free/en/authors/wojciech-marian-czarnecki/), Agnieszka Grabska-Barwinska, [Yee Whye Teh](https://md.research.elamur.ai/free/en/authors/yee-whye-teh/), [Razvan Pascanu](https://md.research.elamur.ai/free/en/authors/razvan-pascanu/) and Raia Hadsell · **Year:** 2018 · **Venue:** arXiv:1805.06370 · **Licence:** [arXiv — non-exclusive licence to distribute](http://arxiv.org/licenses/nonexclusive-distrib/1.0/)

**Links:** [Publisher's page](https://arxiv.org/abs/1805.06370) · [PDF](https://arxiv.org/pdf/1805.06370) · [DOI 10.48550/arxiv.1805.06370](https://doi.org/10.48550/arxiv.1805.06370) · [arXiv 1805.06370](https://arxiv.org/abs/1805.06370) · [OpenAlex](https://openalex.org/W2804175194)

**Citations:** 272 citations (OpenAlex, 2026-10-14) · [66](https://md.research.elamur.ai/free/en/papers/schwarz-2018-progress-compress-scalable-framework-continual/cited-by/) in our library, of the 149,439 papers whose bibliographies we read

## Summary
Neural networks that learn tasks one after another tend to lose earlier skills, a problem called catastrophic forgetting. Existing fixes each have a cost. Finetuning forgets. EWC can become too rigid to learn new tasks. Progressive Networks grow quadratically in size as tasks accumulate. Schwarz et al. (DeepMind/Oxford, ICML 2018) propose Progress & Compress (P&C), which uses two fixed-size columns. In the "progress" phase, an active column learns the new task without restrictions and reuses features from a frozen knowledge base through lateral adaptor connections. In the "compress" phase, the active column's behaviour is distilled into the knowledge base. A new online EWC variant protects older skills during this step, and its penalty does not grow with the number of tasks. The method needs no stored data, no task-specific parameters and no growing architecture. The authors test it on sequential Omniglot alphabet classification, Atari games and 3D maze navigation. P&C achieves the best accuracy among the scalable methods while keeping the parameter count small. This makes continual learning feasible for long task sequences.

## Key points
- **Omniglot results after 5 passes:** P&C reaches 82.84 ± 1.4 test accuracy. This beats online EWC (79.15), EWC (75.96), LwF (66.48) and finetuning (60.74). The less scalable baselines score higher: Progressive Nets reach 86.50 and one model per task reaches 88.34.
- **Model size on Omniglot:**
  - P&C uses 659K parameters.
  - Progressive Nets use 108,000K.
  - Separate per-task models use 5,680K.
  - Original EWC uses 11,100K, because its regularisers accumulate.
- **Atari setup:** six games (Space Invaders, Krull, Beamrider, Hero, Stargunner, Ms. Pac-man) are each visited 5 times, with 50m frames per visit. P&C clearly improves on several games and roughly matches EWC baselines on the others.
- **Adaptors:** these are small MLPs, implemented as 1×1 convolutions in CNNs, with trainable scaling vectors. Distillation minimises the KL divergence between the active column's outputs and the knowledge base's outputs.
- **When P&C helps most:** it gains most where tasks allow positive transfer. On Omniglot, online EWC alone is already competitive.

*Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.*

## Institutions

- [University of Oxford](https://md.research.elamur.ai/free/en/universities/university-of-oxford/) — University, Oxford, United Kingdom · 122 works · 160,277 citations
- [Google DeepMind](https://md.research.elamur.ai/free/en/companies/google-deepmind/) — Company, London, United Kingdom · 72 works · 84,326 citations

📚 Shelves (3): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 18,614 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 17,965 works · [👁️ Computer Vision and Pattern Recognition](https://md.research.elamur.ai/free/en/shelves/computer-science/computer-vision-and-pattern-recognition/) · 3,486 works

## Cite

Cite as: Jonathan Schwarz, Jelena Luketina, Wojciech M. Czarnecki, Agnieszka Grabska-Barwinska, Yee Whye Teh, Razvan Pascanu and Raia Hadsell. 2018. Progress & Compress: A scalable framework for continual learning. arXiv:1805.06370.

The paper itself, not this page. BibTeX from the library's record of the work.

```bibtex
@misc{schwarz2018progress,
  title = {{Progress \& Compress: A scalable framework for continual learning}},
  author = {Jonathan Schwarz, Jelena Luketina, Wojciech M. Czarnecki, Agnieszka Grabska-Barwinska, Yee Whye Teh, Razvan Pascanu and Raia Hadsell},
  year = {2018},
  doi = {10.48550/arxiv.1805.06370},
  eprint = {1805.06370},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.48550/arxiv.1805.06370}
}
```

- [← previous Gromov-Wasserstein Alignment of Word Embedding Spaces](https://md.research.elamur.ai/free/en/papers/melis-2018-gromov-wasserstein-alignment-word-embedding/)
- [next → Training Millions of Personalized Dialogue Agents](https://md.research.elamur.ai/free/en/papers/mazare-2018-training-millions-personalized-dialogue-agents/)
- [↑ back to papers of 2018](https://md.research.elamur.ai/free/en/papers/2018/page/2/)

## References

42 references, 2 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Aljundi, R., Chakravarty, P., and Tuytelaars, T. Expert gate: Lifelong learning with a network of experts. arXiv preprint arXiv:1611.06194, 2016. [find](https://scholar.google.com/scholar?q=Aljundi%2C+R%2E%2C+Chakravarty%2C+P%2E%2C+and+Tuytelaars%2C+T%2E+Expert+gate%3A+Lifelong+learning+with+a+network+of+experts%2E+arXiv+preprint+arXiv%3A1611%2E06194%2C+2016%2E)
2. Bellemare, M. G., Veness, J., and Bowling, M. Investigating contingency awareness using atari 2600 games. In AAAI, 2012. [find](https://scholar.google.com/scholar?q=Bellemare%2C+M%2E+G%2E%2C+Veness%2C+J%2E%2C+and+Bowling%2C+M%2E+Investigating+contingency+awareness+using+atari+2600+games%2E+In+AAAI%2C+2012%2E)
3. Bengio, Y. Deep learning of representations for unsupervised and transfer learning. In Proceedings of ICML Workshop on Unsupervised and Transfer Learning, pp. 17–36, 2012. [find](https://scholar.google.com/scholar?q=Bengio%2C+Y%2E+Deep+learning+of+representations+for+unsupervised+and+transfer+learning%2E+In+Proceedings+of+ICML+Workshop+on+Unsupervised+and+Transfer+Learning%2C+pp%2E+17%E2%80%9336%2C+2012%2E)
4. Berseth, G., Xie, C., Cernek, P., and Van de Panne, M. Progressive reinforcement learning with distillation for multi-skilled motion control. ICLR, 2018. [find](https://scholar.google.com/scholar?q=Berseth%2C+G%2E%2C+Xie%2C+C%2E%2C+Cernek%2C+P%2E%2C+and+Van+de+Panne%2C+M%2E+Progressive+reinforcement+learning+with+distillation+for+multi%2Dskilled+motion+control%2E+ICLR%2C+2018%2E)
5. Caruana, R. Multitask learning. In Learning to learn, pp. 95–133. Springer, 1998. [find](https://scholar.google.com/scholar?q=Caruana%2C+R%2E+Multitask+learning%2E+In+Learning+to+learn%2C+pp%2E+95%E2%80%93133%2E+Springer%2C+1998%2E)
6. Chaudhry, A., Dokania, P. K., Ajanthan, T., and Torr, P. H. Riemannian walk for incremental learning: Understanding forgetting and intransigence. arXiv preprint arXiv:1801.10112, 2018. [find](https://scholar.google.com/scholar?q=Chaudhry%2C+A%2E%2C+Dokania%2C+P%2E+K%2E%2C+Ajanthan%2C+T%2E%2C+and+Torr%2C+P%2E+H%2E+Riemannian+walk+for+incremental+learning%3A+Understanding+forgetting+and+intransigence%2E+arXiv+preprint+arXiv%3A1801%2E10112%2C+2018%2E)
7. Furlanello, T., Zhao, J., Saxe, A. M., Itti, L., and Tjan, B. S. Active long term memory networks. CoRR, abs/1606.02355, 2016. — [arXiv:1606.02355](https://arxiv.org/abs/1606.02355) [find](https://scholar.google.com/scholar?q=Furlanello%2C+T%2E%2C+Zhao%2C+J%2E%2C+Saxe%2C+A%2E+M%2E%2C+Itti%2C+L%2E%2C+and+Tjan%2C+B%2E+S%2E+Active+long+term+memory+networks%2E+CoRR%2C+abs%2F1606%2E02355%2C+2016%2E+%E2%80%94+%5BarXiv%3A1606%2E02355%5D%28https%3A%2F%2Farxiv%2Eorg%2Fabs%2F1606%2E02355%29)
8. Ghosh, D., Singh, A., Rajeswaran, A., Kumar, V., and Levine, S. Divide-and-conquer reinforcement learning. CoRR, abs/1711.09874, 2017. — [arXiv:1711.09874](https://arxiv.org/abs/1711.09874) [find](https://scholar.google.com/scholar?q=Ghosh%2C+D%2E%2C+Singh%2C+A%2E%2C+Rajeswaran%2C+A%2E%2C+Kumar%2C+V%2E%2C+and+Levine%2C+S%2E+Divide%2Dand%2Dconquer+reinforcement+learning%2E+CoRR%2C+abs%2F1711%2E09874%2C+2017%2E+%E2%80%94+%5BarXiv%3A1711%2E09874%5D%28https%3A%2F%2Farxiv%2Eorg%2Fabs%2F1711%2E09874%29)
9. Graves, A., Wayne, G., Reynolds, M., Harley, T., Danihelka, I., Grabska-Barwińska, A., Colmenarejo, S. G., Grefenstette, E., Ramalho, T., Agapiou, J., et al. Hybrid computing using a neural network with dynamic external memory. Nature, 538(7626):471–476, 2016. [find](https://scholar.google.com/scholar?q=Graves%2C+A%2E%2C+Wayne%2C+G%2E%2C+Reynolds%2C+M%2E%2C+Harley%2C+T%2E%2C+Danihelka%2C+I%2E%2C+Grabska%2DBarwin%CC%81ska%2C+A%2E%2C+Colmenarejo%2C+S%2E+G%2E%2C+Grefenstette%2C+E%2E%2C+Ramalho%2C+T%2E%2C+Agapiou%2C+J%2E%2C+et+al%2E+Hybrid+computing+using+a+neural+network+w)
10. He, X. and Jaeger, H. Overcoming catastrophic interference by conceptors. ICLR, 2018. [find](https://scholar.google.com/scholar?q=He%2C+X%2E+and+Jaeger%2C+H%2E+Overcoming+catastrophic+interference+by+conceptors%2E+ICLR%2C+2018%2E)
11. Hinton, G., Vinyals, O., and Dean, J. [Distilling the knowledge in a neural network](https://md.research.elamur.ai/free/en/papers/hinton-2015-distilling-knowledge-neural-network/). arXiv preprint arXiv:1503.02531, 2015.
12. Huszár, F. On quadratic penalties in elastic weight consolidation. arXiv preprint arXiv:1712.03847, 2017. — [arXiv:1712.03847](https://arxiv.org/abs/1712.03847) [find](https://scholar.google.com/scholar?q=Husza%CC%81r%2C+F%2E+On+quadratic+penalties+in+elastic+weight+consolidation%2E+arXiv+preprint+arXiv%3A1712%2E03847%2C+2017%2E+%E2%80%94+%5BarXiv%3A1712%2E03847%5D%28https%3A%2F%2Farxiv%2Eorg%2Fabs%2F1712%2E03847%29)
13. Kirkpatrick, J., Pascanu, R., Rabinowitz, N., Veness, J., Desjardins, G., Rusu, A. A., Milan, K., Quan, J., Ramalho, T., Grabska-Barwinska, A., et al. Overcoming catastrophic forgetting in neural networks. Proceedings of the National Academy of Sciences, pp. 201611835, 2017. [find](https://scholar.google.com/scholar?q=Kirkpatrick%2C+J%2E%2C+Pascanu%2C+R%2E%2C+Rabinowitz%2C+N%2E%2C+Veness%2C+J%2E%2C+Desjardins%2C+G%2E%2C+Rusu%2C+A%2E+A%2E%2C+Milan%2C+K%2E%2C+Quan%2C+J%2E%2C+Ramalho%2C+T%2E%2C+Grabska%2DBarwinska%2C+A%2E%2C+et+al%2E+Overcoming+catastrophic+forgetting+in+neural+netw)
14. Koch, G., Zemel, R., and Salakhutdinov, R. Siamese neural networks for one-shot image recognition. In ICML Deep Learning Workshop, volume 2, 2015. [find](https://scholar.google.com/scholar?q=Koch%2C+G%2E%2C+Zemel%2C+R%2E%2C+and+Salakhutdinov%2C+R%2E+Siamese+neural+networks+for+one%2Dshot+image+recognition%2E+In+ICML+Deep+Learning+Workshop%2C+volume+2%2C+2015%2E)
15. Lake, B. M., Salakhutdinov, R., and Tenenbaum, J. B. Human-level concept learning through probabilistic program induction. Science, 350(6266):1332–1338, 2015. [find](https://scholar.google.com/scholar?q=Lake%2C+B%2E+M%2E%2C+Salakhutdinov%2C+R%2E%2C+and+Tenenbaum%2C+J%2E+B%2E+Human%2Dlevel+concept+learning+through+probabilistic+program+induction%2E+Science%2C+350%286266%29%3A1332%E2%80%931338%2C+2015%2E)
16. Li, Y., Hernández-Lobato, J. M., and Turner, R. E. Stochastic expectation propagation. In Advances in Neural Information Processing Systems, pp. 2323–2331, 2015. [find](https://scholar.google.com/scholar?q=Li%2C+Y%2E%2C+Herna%CC%81ndez%2DLobato%2C+J%2E+M%2E%2C+and+Turner%2C+R%2E+E%2E+Stochastic+expectation+propagation%2E+In+Advances+in+Neural+Information+Processing+Systems%2C+pp%2E+2323%E2%80%932331%2C+2015%2E)
17. Li, Z. and Hoiem, D. Learning without forgetting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2017. [find](https://scholar.google.com/scholar?q=Li%2C+Z%2E+and+Hoiem%2C+D%2E+Learning+without+forgetting%2E+IEEE+Transactions+on+Pattern+Analysis+and+Machine+Intelligence%2C+2017%2E)
18. Lopez-Paz, D. et al. Gradient episodic memory for continual learning. In Advances in Neural Information Processing Systems, pp. 6470–6479, 2017. [find](https://scholar.google.com/scholar?q=Lopez%2DPaz%2C+D%2E+et+al%2E+Gradient+episodic+memory+for+continual+learning%2E+In+Advances+in+Neural+Information+Processing+Systems%2C+pp%2E+6470%E2%80%936479%2C+2017%2E)
19. MacKay, D. J. Information theory, inference and learning algorithms. Cambridge university press, 2003. [find](https://scholar.google.com/scholar?q=MacKay%2C+D%2E+J%2E+Information+theory%2C+inference+and+learning+algorithms%2E+Cambridge+university+press%2C+2003%2E)
20. Minka, T. P. Expectation propagation for approximate Bayesian inference. In UAI, pp. 362–369, 2001. [find](https://scholar.google.com/scholar?q=Minka%2C+T%2E+P%2E+Expectation+propagation+for+approximate+Bayesian+inference%2E+In+UAI%2C+pp%2E+362%E2%80%93369%2C+2001%2E)
21. Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., and Riedmiller, M. Playing atari with deep reinforcement learning. arXiv preprint arXiv:1312.5602, 2013. [find](https://scholar.google.com/scholar?q=Mnih%2C+V%2E%2C+Kavukcuoglu%2C+K%2E%2C+Silver%2C+D%2E%2C+Graves%2C+A%2E%2C+Antonoglou%2C+I%2E%2C+Wierstra%2C+D%2E%2C+and+Riedmiller%2C+M%2E+Playing+atari+with+deep+reinforcement+learning%2E+arXiv+preprint+arXiv%3A1312%2E5602%2C+2013%2E)
22. Nguyen, C. V., Li, Y., Bui, T. D., and Turner, R. E. Variational continual learning. arXiv preprint arXiv:1710.10628, 2017. [find](https://scholar.google.com/scholar?q=Nguyen%2C+C%2E+V%2E%2C+Li%2C+Y%2E%2C+Bui%2C+T%2E+D%2E%2C+and+Turner%2C+R%2E+E%2E+Variational+continual+learning%2E+arXiv+preprint+arXiv%3A1710%2E10628%2C+2017%2E)
23. Parisotto, E., Ba, J. L., and Salakhutdinov, R. Actor-mimic: Deep multitask and transfer reinforcement learning. arXiv preprint arXiv:1511.06342, 2015. [find](https://scholar.google.com/scholar?q=Parisotto%2C+E%2E%2C+Ba%2C+J%2E+L%2E%2C+and+Salakhutdinov%2C+R%2E+Actor%2Dmimic%3A+Deep+multitask+and+transfer+reinforcement+learning%2E+arXiv+preprint+arXiv%3A1511%2E06342%2C+2015%2E)
24. Rebuffi, S.-A., Kolesnikov, A., and Lampert, C. H. icarl: Incremental classifier and representation learning. arXiv preprint arXiv:1611.07725, 2016. [find](https://scholar.google.com/scholar?q=Rebuffi%2C+S%2E%2DA%2E%2C+Kolesnikov%2C+A%2E%2C+and+Lampert%2C+C%2E+H%2E+icarl%3A+Incremental+classifier+and+representation+learning%2E+arXiv+preprint+arXiv%3A1611%2E07725%2C+2016%2E)
25. Ring, M. B. Continual Learning in Reinforcement Environments. R. Oldenbourg Verlag, 1995. [find](https://scholar.google.com/scholar?q=Ring%2C+M%2E+B%2E+Continual+Learning+in+Reinforcement+Environments%2E+R%2E+Oldenbourg+Verlag%2C+1995%2E)
26. Robins, A. Catastrophic forgetting, rehearsal and pseudorehearsal. Connection Science, 7(2):123–146, 1995. [find](https://scholar.google.com/scholar?q=Robins%2C+A%2E+Catastrophic+forgetting%2C+rehearsal+and+pseudorehearsal%2E+Connection+Science%2C+7%282%29%3A123%E2%80%93146%2C+1995%2E)
27. Rozantsev, A., Salzmann, M., and Fua, P. Beyond sharing weights for deep domain adaptation. arXiv preprint arXiv:1603.06432, 2016. — [arXiv:1603.06432](https://arxiv.org/abs/1603.06432) [find](https://scholar.google.com/scholar?q=Rozantsev%2C+A%2E%2C+Salzmann%2C+M%2E%2C+and+Fua%2C+P%2E+Beyond+sharing+weights+for+deep+domain+adaptation%2E+arXiv+preprint+arXiv%3A1603%2E06432%2C+2016%2E+%E2%80%94+%5BarXiv%3A1603%2E06432%5D%28https%3A%2F%2Farxiv%2Eorg%2Fabs%2F1603%2E06432%29)
28. Rusu, A. A., Colmenarejo, S. G., Gulcehre, C., Desjardins, G., Kirkpatrick, J., Pascanu, R., Mnih, V., Kavukcuoglu, K., and Hadsell, R. Policy distillation. arXiv preprint arXiv:1511.06295, 2015. [find](https://scholar.google.com/scholar?q=Rusu%2C+A%2E+A%2E%2C+Colmenarejo%2C+S%2E+G%2E%2C+Gulcehre%2C+C%2E%2C+Desjardins%2C+G%2E%2C+Kirkpatrick%2C+J%2E%2C+Pascanu%2C+R%2E%2C+Mnih%2C+V%2E%2C+Kavukcuoglu%2C+K%2E%2C+and+Hadsell%2C+R%2E+Policy+distillation%2E+arXiv+preprint+arXiv%3A1511%2E06295%2C+2015%2E)
29. Rusu, A. A., Rabinowitz, N. C., Desjardins, G., Soyer, H., Kirkpatrick, J., Kavukcuoglu, K., Pascanu, R., and Hadsell, R. Progressive neural networks. arXiv preprint arXiv:1606.04671, 2016a. [find](https://scholar.google.com/scholar?q=Rusu%2C+A%2E+A%2E%2C+Rabinowitz%2C+N%2E+C%2E%2C+Desjardins%2C+G%2E%2C+Soyer%2C+H%2E%2C+Kirkpatrick%2C+J%2E%2C+Kavukcuoglu%2C+K%2E%2C+Pascanu%2C+R%2E%2C+and+Hadsell%2C+R%2E+Progressive+neural+networks%2E+arXiv+preprint+arXiv%3A1606%2E04671%2C+2016a%2E)
30. Rusu, A. A., Vecerik, M., Rothörl, T., Heess, N., Pascanu, R., and Hadsell, R. Sim-to-real robot learning from pixels with progressive nets. arXiv preprint arXiv:1610.04286, 2016b. — [arXiv:1610.04286](https://arxiv.org/abs/1610.04286) [find](https://scholar.google.com/scholar?q=Rusu%2C+A%2E+A%2E%2C+Vecerik%2C+M%2E%2C+Rotho%CC%88rl%2C+T%2E%2C+Heess%2C+N%2E%2C+Pascanu%2C+R%2E%2C+and+Hadsell%2C+R%2E+Sim%2Dto%2Dreal+robot+learning+from+pixels+with+progressive+nets%2E+arXiv+preprint+arXiv%3A1610%2E04286%2C+2016b%2E+%E2%80%94+%5BarXiv%3A1610%2E0428)
31. Schmidhuber, J. Powerplay: Training an increasingly general problem solver by continually searching for the simplest still unsolvable problem. Frontiers in psychology, 4: 313, 2013. [find](https://scholar.google.com/scholar?q=Schmidhuber%2C+J%2E+Powerplay%3A+Training+an+increasingly+general+problem+solver+by+continually+searching+for+the+simplest+still+unsolvable+problem%2E+Frontiers+in+psychology%2C+4%3A+313%2C+2013%2E)
32. Schmidhuber, J. One big net for everything. arXiv preprint arXiv:1802.08864, 2018. — [arXiv:1802.08864](https://arxiv.org/abs/1802.08864) [find](https://scholar.google.com/scholar?q=Schmidhuber%2C+J%2E+One+big+net+for+everything%2E+arXiv+preprint+arXiv%3A1802%2E08864%2C+2018%2E+%E2%80%94+%5BarXiv%3A1802%2E08864%5D%28https%3A%2F%2Farxiv%2Eorg%2Fabs%2F1802%2E08864%29)
33. Shin, H., Lee, J. K., Kim, J., and Kim, J. Continual learning with deep generative replay. arXiv preprint arXiv:1705.08690, 2017. [find](https://scholar.google.com/scholar?q=Shin%2C+H%2E%2C+Lee%2C+J%2E+K%2E%2C+Kim%2C+J%2E%2C+and+Kim%2C+J%2E+Continual+learning+with+deep+generative+replay%2E+arXiv+preprint+arXiv%3A1705%2E08690%2C+2017%2E)
34. Shu, T., Xiong, C., and Socher, R. Hierarchical and interpretable skill acquisition in multi-task reinforcement learning. CoRR, abs/1712.07294, 2017. [find](https://scholar.google.com/scholar?q=Shu%2C+T%2E%2C+Xiong%2C+C%2E%2C+and+Socher%2C+R%2E+Hierarchical+and+interpretable+skill+acquisition+in+multi%2Dtask+reinforcement+learning%2E+CoRR%2C+abs%2F1712%2E07294%2C+2017%2E)
35. Silver, D. L., Yang, Q., and Li, L. Lifelong machine learning systems: Beyond learning algorithms. In AAAI Spring Symposium: Lifelong Machine Learning, volume 13, pp. 05, 2013. [find](https://scholar.google.com/scholar?q=Silver%2C+D%2E+L%2E%2C+Yang%2C+Q%2E%2C+and+Li%2C+L%2E+Lifelong+machine+learning+systems%3A+Beyond+learning+algorithms%2E+In+AAAI+Spring+Symposium%3A+Lifelong+Machine+Learning%2C+volume+13%2C+pp%2E+05%2C+2013%2E)
36. Sutton, R. S. and Barto, A. G. Reinforcement learning: An introduction, volume 1. MIT press Cambridge, 1998. [find](https://scholar.google.com/scholar?q=Sutton%2C+R%2E+S%2E+and+Barto%2C+A%2E+G%2E+Reinforcement+learning%3A+An+introduction%2C+volume+1%2E+MIT+press+Cambridge%2C+1998%2E)
37. Taylor, M. E. and Stone, P. An introduction to inter-task transfer for reinforcement learning. AI Magazine, 32(1): 15–34, 2011. [find](https://scholar.google.com/scholar?q=Taylor%2C+M%2E+E%2E+and+Stone%2C+P%2E+An+introduction+to+inter%2Dtask+transfer+for+reinforcement+learning%2E+AI+Magazine%2C+32%281%29%3A+15%E2%80%9334%2C+2011%2E)
38. Teh, Y., Bapst, V., Czarnecki, W. M., Quan, J., Kirkpatrick, J., Hadsell, R., Heess, N., and Pascanu, R. Distral: Robust multitask reinforcement learning. In Advances in Neural Information Processing Systems, pp. 4499–4509, 2017. [find](https://scholar.google.com/scholar?q=Teh%2C+Y%2E%2C+Bapst%2C+V%2E%2C+Czarnecki%2C+W%2E+M%2E%2C+Quan%2C+J%2E%2C+Kirkpatrick%2C+J%2E%2C+Hadsell%2C+R%2E%2C+Heess%2C+N%2E%2C+and+Pascanu%2C+R%2E+Distral%3A+Robust+multitask+reinforcement+learning%2E+In+Advances+in+Neural+Information+Processing+)
39. Thrun, S. Explanation-based neural network learning: A lifelong learning approach, volume 357. Springer Science & Business Media, 1996. [find](https://scholar.google.com/scholar?q=Thrun%2C+S%2E+Explanation%2Dbased+neural+network+learning%3A+A+lifelong+learning+approach%2C+volume+357%2E+Springer+Science+%26+Business+Media%2C+1996%2E)
40. Vinyals, O., Blundell, C., Lillicrap, T., Wierstra, D., et al. [Matching networks for one shot learning](https://md.research.elamur.ai/free/en/papers/vinyals-2016-matching-networks-one-shot-learning/). In Advances in Neural Information Processing Systems, pp. 3630–3638, 2016.
41. Zenke, F., Poole, B., and Ganguli, S. Continual learning through synaptic intelligence. In International Conference on Machine Learning, pp. 3987–3995, 2017. [find](https://scholar.google.com/scholar?q=Zenke%2C+F%2E%2C+Poole%2C+B%2E%2C+and+Ganguli%2C+S%2E+Continual+learning+through+synaptic+intelligence%2E+In+International+Conference+on+Machine+Learning%2C+pp%2E+3987%E2%80%933995%2C+2017%2E)
42. Progress & Compress: A scalable framework for continual learning. Supplementary material Train B-E 1.0 Train A 0.8 Test Accuracy on Task A 0.6 0.4 EWC online EWC Finetuning 0.2 0.0 Training steps Figure 5. Performance retention on permuted MNIST. Shown is the test accuracy on an initial permutation… [find](https://scholar.google.com/scholar?q=Progress+%26+Compress%3A+A+scalable+framework+for+continual+learning%2E+Supplementary+material+Train+B%2DE+1%2E0+Train+A+0%2E8+Test+Accuracy+on+Task+A+0%2E6+0%2E4+EWC+online+EWC+Finetuning+0%2E2+0%2E0+Training+steps+Figu)

*Updated 2 November 2026*
