TL;DR
This paper introduces Efficient Feature Transformations (EFTs), a simple and parameter-efficient method for continual learning that improves task learning and prediction without catastrophic forgetting, outperforming many existing methods.
Contribution
The paper proposes EFTs, a novel feature map transformation strategy that adds minimal parameters for effective continual learning, avoiding the high computational costs of existing methods.
Findings
EFTs outperform many continual learning methods across various datasets.
EFTs achieve significant performance with low parameter growth.
The feature distance maximization enhances task prediction without generative models.
Abstract
As neural networks are increasingly being applied to real-world applications, mechanisms to address distributional shift and sequential task learning without forgetting are critical. Methods incorporating network expansion have shown promise by naturally adding model capacity for learning new tasks while simultaneously avoiding catastrophic forgetting. However, the growth in the number of additional parameters of many of these types of methods can be computationally expensive at larger scales, at times prohibitively so. Instead, we propose a simple task-specific feature map transformation strategy for continual learning, which we call Efficient Feature Transformations (EFTs). These EFTs provide powerful flexibility for learning new tasks, achieved with minimal parameters added to the base architecture. We further propose a feature distance maximization strategy, which significantly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
