Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.19692 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912447210717184 |
|---|---|
| author | Lamers, Christiaan Belbachir, Ahmed Nabil Bäck, Thomas van Stein, Niki |
| author_facet | Lamers, Christiaan Belbachir, Ahmed Nabil Bäck, Thomas van Stein, Niki |
| contents | Catastrophic forgetting can be trivially alleviated by keeping all data from previous tasks in memory. Therefore, minimizing the memory footprint while maximizing the amount of relevant information is crucial to the challenge of continual learning. This paper aims to decrease required memory for memory-based continuous learning algorithms. We explore the options of extracting a minimal amount of information, while maximally alleviating forgetting. We propose the usage of lightweight generators based on Singular Value Decomposition to enhance existing continual learning methods, such as A-GEM and Experience Replay. These generators need a minimal amount of memory while being maximally effective. They require no training time, just a single linear-time fitting step, and can capture a distribution effectively from a small number of data samples. Depending on the dataset and network architecture, our results show a significant increase in average accuracy compared to the original methods. Our method shows great potential in minimizing the memory footprint of memory-based continual learning algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_19692 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Leveraging Lightweight Generators for Memory Efficient Continual Learning Lamers, Christiaan Belbachir, Ahmed Nabil Bäck, Thomas van Stein, Niki Machine Learning Catastrophic forgetting can be trivially alleviated by keeping all data from previous tasks in memory. Therefore, minimizing the memory footprint while maximizing the amount of relevant information is crucial to the challenge of continual learning. This paper aims to decrease required memory for memory-based continuous learning algorithms. We explore the options of extracting a minimal amount of information, while maximally alleviating forgetting. We propose the usage of lightweight generators based on Singular Value Decomposition to enhance existing continual learning methods, such as A-GEM and Experience Replay. These generators need a minimal amount of memory while being maximally effective. They require no training time, just a single linear-time fitting step, and can capture a distribution effectively from a small number of data samples. Depending on the dataset and network architecture, our results show a significant increase in average accuracy compared to the original methods. Our method shows great potential in minimizing the memory footprint of memory-based continual learning algorithms. |
| title | Leveraging Lightweight Generators for Memory Efficient Continual Learning |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2506.19692 |