Saliency-Guided Hidden Associative Replay for Continual Learning
Guangji Bai, Qilong Zhao, Xiaoyang Jiang, Yifei Zhang, Liang Zhao

TL;DR
This paper introduces SHARC, a novel continual learning framework that uses saliency-guided sparse memory encoding and associative memory for efficient, human-like memory retention and retrieval, reducing catastrophic forgetting.
Contribution
It proposes a new replay method combining saliency detection with associative memory, enabling selective, efficient memory storage and retrieval in continual learning.
Findings
Effective in reducing catastrophic forgetting
Achieves near-perfect recall of salient data
Outperforms existing replay methods
Abstract
Continual Learning is a burgeoning domain in next-generation AI, focusing on training neural networks over a sequence of tasks akin to human learning. While CL provides an edge over traditional supervised learning, its central challenge remains to counteract catastrophic forgetting and ensure the retention of prior tasks during subsequent learning. Amongst various strategies to tackle this, replay based methods have emerged as preeminent, echoing biological memory mechanisms. However, these methods are memory intensive, often preserving entire data samples, an approach inconsistent with humans selective memory retention of salient experiences. While some recent works have explored the storage of only significant portions of data in episodic memory, the inherent nature of partial data necessitates innovative retrieval mechanisms. Current solutions, like inpainting, approximate full data…
Peer Reviews
Decision·Submitted to ICLR 2024
The paper introduces the novel Saliency-Guided Hidden Associative Replay (SHARC) framework, which combines associative memory with replay-based strategies to address catastrophic forgetting in Continual Learning. The proposed SHARC framework demonstrates its effectiveness through extensive experimental results on various continual learning tasks, showcasing its superiority in mitigating forgetting and achieving better recall. The structure of SHARC is sparsity, which is hardware-friendly and c
The paper does not provide a comprehensive comparison with existing replay-based methods for Continual Learning, making it difficult to assess the superiority of the proposed framework. While the paper introduces a content-focused memory retrieval mechanism, it lacks detailed explanation and analysis of how this mechanism works and its impact on recall performance.
This paper presents bio-inspired perspectives to store hidden sparse representations and associate memory based recall. This resembles how humans and animals learn by compressing information. Innovative approach of storing and retrieving rehearsal data for memory efficient replay and mitigating catastrophic forgetting. Saliency based approach to store sparse information which leads to increased memory efficiency. Associate memory based retrieval offers fast and efficient recall and higher noi
Lack of experiments on high dimensional and large scale datasets e.g., ImageNet-1K. Many algorithms do not scale for large numbers of classes and high-dimensional inputs. It is 2023 and people have been using ImageNet for continual learning for at least 7 years. I'm assuming this is because they are starting with an ImageNet pre-trained backbone, but that is also a problem given the datasets studied. Mini-imageNet is not an appropriate test set using an ImageNet pre-trained backbone. MNIST and C
The proposed method can be seamlessly adapted to any replay-based approach, improving their performance in various continual learning scenarios. The experimental results provide evidence of the effectiveness of SHARC in improving the performance of replay-based methods.
Lack of detailed network and hyper-parameter configuration, especially, for associative memory networks. The lack of recent baselines in the experiment, most of the baselines used were proposed two or three years ago. The associative memory A(x,ω) is implemented as a recurrent or feed-forward neural network. The associative memory creates an additional memory footprint, and consumes a lot of computing resources for updating it. The experiments in this paper do not seem to be reasonable. The m
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFire Detection and Safety Systems · Domain Adaptation and Few-Shot Learning · Advanced Image and Video Retrieval Techniques
