Learning to Continually Learn

Shawn Beaulieu, Lapo Frati, Thomas Miconi, Joel Lehman, Kenneth O. Stanley +2 more
2/21/2020
cs.LGcs.CVcs.NE

Official code: uvm-neurobotics-lab/ANML (118 stars, last commit 2020-05-02).

Abstract

Continual lifelong learning requires an agent or model to learn many sequentially ordered tasks, building on previous knowledge without catastrophically forgetting it. Much work has gone towards preventing the default tendency of machine learning models to catastrophically forget, yet virtually all such work involves manually-designed solutions to the problem. We instead advocate meta-learning a solution to catastrophic forgetting, allowing AI to learn to continually learn. Inspired by neuromodulatory processes in the brain, we propose A Neuromodulated Meta-Learning Algorithm (ANML). It differentiates through a sequential learning process to meta-learn an activation-gating function that enables context-dependent selective activation within a deep neural network. Specifically, a neuromodulatory (NM) neural network gates the forward pass of another (otherwise normal) neural network called the prediction learning network (PLN). The NM network also thus indirectly controls selective plasticity (i.e. the backward pass of) the PLN. ANML enables continual learning without catastrophic forgetting at scale: it produces state-of-the-art continual learning performance, sequentially learning as many as 600 classes (over 9,000 SGD updates).

View on arXivView PDF

Code Implementations(1)

A Neuromodulated Meta-Learning algorithm

11821PythonFeb 19, 20206 years ago

Similar Papers

Cite this paper

@article{beaulieu2020learning,
  title  = {Learning to Continually Learn},
  author = {Shawn Beaulieu and Lapo Frati and Thomas Miconi and Joel Lehman and Kenneth O. Stanley and Jeff Clune and Nick Cheney},
  year   = {2020},
  eprint = {2002.09571},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2002.09571}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2002.09571.svg)](https://codeofpaper.com/paper/2002.09571)

Discussion