Date of Submission
6-11-2026
Date of Award
6-16-2026
Institute Name (Publisher)
Indian Statistical Institute
Document Type
Master's Dissertation
Degree Name
Master of Technology
Subject Name
Computer Science
Department
Electronics and Communication Sciences Unit (ECSU-Kolkata)
Supervisor
Das, Swagatam
Abstract (Summary of the Work)
Graph Neural Networks struggle to learn new tasks without forgetting old ones a problem known as catastrophic forgetting. In graph domains, this is compounded by structural shift, where newly added edges corrupt the learned representations of historical nodes even when model weights remain unchanged. We present CAM-Titans, a continual graph learning framework built around a two-buffer associative memory to address both parametric and structural forgetting. Our architecture operates across three timescales of adaptation: a slow base memory updated via ordinary gradient descent, an intermediate task buffer re-encoded after every task using the delta-rule, and a transient in-context state for rapid within-pass adaptation. To ensure historical class prototypes remain retrievable as the network backbone evolves, memory retrieval is anchored in a dynamically maintained prototype coordinate system. Furthermore, a cosine classifier mitigates magnitude imbalance, preventing older classes from dominating predictions. Empirical evaluations across diverse continual learning benchmarks demonstrate that CAM-Titans effectively mitigates catastrophic forgetting, achieving superior stability and accuracy in both Task-Incremental and Class-Incremental settings.
Control Number
CS2429
DOI
https://dspace.isical.ac.in/items/f69a6844-3db5-48e7-ba49-3f2ae65e009b
DSpace Identifier
http://hdl.handle.net/10263/7728
Recommended Citation
Kundu, Shuvam, "Multi-Frequency Associative Memory for Continual Graph Learning through Nested Optimization" (2026). Master’s Dissertations. 459.
https://digitalcommons.isical.ac.in/masters-dissertations/459