.png){kind=icon}
.png){kind=icon}
Return
SketchOGD: Memory-Efficient Continual Learning
.png){kind=icon}
PRE
AI
DOI：10.1109/tsp.2026.3695343.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
When machine learning models are trained continually on a sequence of tasks, they are often liable to forget what they learned on previous tasks—a phenomenon known as catastrophic forgetting. Proposed solutions to catastrophic forgetting tend to involve storing information about past tasks, meaning that memory usage is a chief consideration in determining their practicality. This paper develops a memory-efficient solution to catastrophic forgetting using the idea of matrix sketching, in the context of a simple continual learning algorithm known as orthogonal gradient descent (OGD). OGD finds weight updates that aim to preserve performance on prior datapoints, using gradients of the model on those datapoints. However, since the memory cost of storing prior model gradients grows with the runtime of the algorithm, OGD is ill-suited to continual learning over long time horizons. To address this problem, we propose SketchOGD. SketchOGD employs an online sketching algorithm to compress model gradients as they are encountered into a matrix of a fixed, user-determined size. In contrast to existing memory-efficient variants of OGD, SketchOGD runs online without the need for advance knowledge of the total number of tasks, is simple to implement, and is more amenable to analysis. We provide theoretical guarantees on the approximation error of the relevant sketches under a novel metric suited to the downstream task of OGD. Experimentally, we find that SketchOGD tends to outperform current state-of-the-art variants of OGD given a fixed memory budget.11
We provide code for SketchOGD and for reproducing our results at https://github.com/azizanlab/sketchogd.
Keywords:
Matrices
Modeling
Training
Distance measurement
Memory
Continuing education
Principal component analysis
Algorithms
Ranking (statistics)
Learning (artificial intelligence)
Journal
I
IF:
5.8
Papers:
278
Citations:
0