activity
20102026
most citedOvercoming catastrophic forgetting in neural networks

7.8k citations · 21.1k across the 144 of their papers we have counts for

collaborators
Showing stat.MLShow all

14 papers · 1 filter

stat.ML2026

To Retain or to Adapt? Generalizing Continual Learning

Giulia Lanzillotta, Mandana Samiei, Doina Precup +2

The Continual Learning (CL) literature has long been driven by the goal of mitigating catastrophic forgetting. This objective rests on an often unstated assumption: that a lifelong…

stat.ML2021★ 7 cited

Powerpropagation: A sparsity inducing weight reparameterisation

Jonathan Schwarz, Siddhant M. Jayakumar, Razvan Pascanu +2

The training of sparse neural networks is becoming an increasingly important tool for reducing the computational footprint of models at training and evaluation, as well enabling th…

stat.ML2020★ 20 cited

BYOL works even without batch statistics

Pierre H. Richemond, Jean-Bastien Grill, Florent Altché +8

Bootstrap Your Own Latent (BYOL) is a self-supervised learning approach for image representation. From an augmented view of an image, BYOL trains an online network to predict a tar…

stat.ML2020★ 18 cited

Pointer Graph Networks

Petar Veličković, Lars Buesing, Matthew C. Overlan +3

Graph neural networks (GNNs) are typically applied to static graphs that are assumed to be known upfront. This static input structure is often informed purely by insight of the mac…

stat.ML2019★ 57 cited

Task Agnostic Continual Learning via Meta Learning

Xu He, Jakub Sygnowski, Alexandre Galashov +3

While neural networks are powerful function approximators, they suffer from catastrophic forgetting when the data distribution is not stationary. One particular formalism that stud…

stat.ML2019★ 86 cited

Functional Regularisation for Continual Learning with Gaussian Processes

Michalis K. Titsias, Jonathan Schwarz, Alexander G. de G. Matthews +2

We introduce a framework for Continual Learning (CL) based on Bayesian inference over the function space rather than the parameters of a deep neural network. This method, referred…

stat.ML2018★ 91 cited

Adapting Auxiliary Losses Using Gradient Similarity

Yunshu Du, Wojciech M. Czarnecki, Siddhant M. Jayakumar +3

One approach to deal with the statistical inefficiency of neural networks is to rely on auxiliary losses that help to build useful representations. However, it is not always trivia…

stat.ML2018★ 281 cited

Progress & Compress: A scalable framework for continual learning

Jonathan Schwarz, Jelena Luketina, Wojciech M. Czarnecki +4

We introduce a conceptually simple and scalable framework for continual learning domains where tasks are learned sequentially. Our method is constant in the number of parameters an…

stat.ML2018★ 32 cited

Been There, Done That: Meta-Learning with Episodic Recall

Samuel Ritter, Jane X. Wang, Zeb Kurth-Nelson +4

Meta-learning agents excel at rapidly learning new tasks from open-ended task distributions; yet, they forget what they learn about each task as soon as the next begins. When tasks…

stat.ML2018★ 26 cited

Memory-based Parameter Adaptation

Pablo Sprechmann, Siddhant M. Jayakumar, Jack W. Rae +7

Deep neural networks have excelled on a wide range of problems, from vision to language and game playing. Neural networks very gradually incorporate information into weights as the…

stat.ML2016★ 38 cited

Local minima in training of neural networks

Grzegorz Swirszcz, Wojciech Marian Czarnecki, Razvan Pascanu

There has been a lot of recent interest in trying to characterize the error surface of deep models. This stems from a long standing question. Given that deep networks are highly no…

stat.ML2015★ 59 cited

Natural Neural Networks

Guillaume Desjardins, Karen Simonyan, Razvan Pascanu +1

We introduce Natural Neural Networks, a novel family of algorithms that speed up convergence by adapting their internal representation during training to improve conditioning of th…

stat.ML2014★ 832 cited

On the Number of Linear Regions of Deep Neural Networks

Guido Montúfar, Razvan Pascanu, Kyunghyun Cho +1

We study the complexity of functions computable by deep feedforward neural networks with piecewise linear activations in terms of the symmetries and the number of linear regions th…

stat.ML2013★ 188 cited

Pylearn2: a machine learning research library

Ian J. Goodfellow, David Warde-Farley, Pascal Lamblin +6

Pylearn2 is a machine learning research library. This does not just mean that it is a collection of machine learning algorithms that share a common API; it means that it has been d…