Difference between revisions of "Functional regularisation for continual learning with gaussian processes"
|Line 41:||Line 41:|
== References ==
== References ==
Revision as of 17:45, 22 November 2020
- 1 Presented by
- 2 Introduction
- 3 Previous Work
- 4 Comparison between the Proposed Method and Previous Methods
- 5 Gaussian Process
- 6 Conclusion
- 7 Critiques
- 8 References
Continual Learning (CL) refers to the problem where different tasks are fed to model sequentially, such as training a natural language processing model on different languages over time. A major challenge in CL is model forgets how to solve earlier tasks. This paper proposed a new framework to regularize Continual Learning (CL) so that it doesn't forget previously learned tasks. This method, referred to as functional regularization for Continual Learning, leverages the Gaussian process to construct an approximate posterior belief over the underlying task-specific function. Then the posterior belief is utilized in optimization as a regularizer to prevent the model from completely deviating from the earlier tasks. The estimation of posterior functions is carried out under the framework of approximate Bayesian inference.
There are two types of methods that have been widely used in Continual Learning.
This type of methods stores the data or its compressed form from earlier tasks. The stored data is replayed when learning a new task to mitigate forgetting. It can be used for constraining the optimization of new tasks or joint training of both previous and current tasks. However, it has two disadvantages: 1. Deciding which data to store often remains heuristic; 2. Requires a large quantity of stored data to achieve good performance.
These methods leverage sequential Bayesian inference by putting a prior distribution over the model parameters in a hope to regularize the learning of new tasks. Two important methods are Elastic Weight Consolidation (EWC) and Variational Continual Learning (VCL), both of which make model parameters adaptive to new tasks while regularizing weights by prior knowledge from the earlier tasks. Nonetheless, with long sequences of tasks this might still result in an increased forgetting of earlier tasks.
Comparison between the Proposed Method and Previous Methods
Comparison to regularization-based methods
Similarity: It is also based on approximate Bayesian inference by using a prior distribution that regularizes the model updates.
Difference: It constrains the neural network on the space of functions rather than weights by making use of Gaussian processes (GP).
Comparison to replay/rehearsal methods
Similarity: It also stores data from earlier tasks.
Difference: Instead of storing a subset of data, it stores a set of inducing points, which can be optimized using criteria from GP literature.
Definition: A Gaussian process is a collection of random variables, any finite number of which have a joint Gaussian distribution .
 Rasmussen, Carl Edward and Williams, Christopher K. I., Gaussian Processes for Machine Learning, The MIT Press, 2006.