AdaTKG: Adaptive Memory for Temporal Knowledge Graph Reasoning

Published: 10 Jun 2026, Last Modified: 10 Jun 2026GMLLM'26 OralEveryoneRevisionsBibTeXCC BY 4.0
Keywords: Temporal Knowledge Graph, Knowledge Graph Reasoning, Memory Update, Inductive Reasoning
TL;DR: We propose AdaTKG, which turns inductive TKG reasoning from a static per-entity representation into an adaptive process refined by each arriving interaction.
Abstract: Temporal knowledge graphs (TKGs) represent time-stamped relational facts and support a wide range of reasoning tasks over evolving events. However, existing methods produce entity representations that are static at the entity level, in that each representation is a function of learned parameters only and retains no trace of the interactions in which the entity has participated. In this paper, we depart from this static view and propose that each entity be modeled as an adaptive process whose representation is refined every time the entity participates in a fact. To this end, we propose AdaTKG, which maintains a per-entity memory that is updated with every observed interaction, with the memory accumulating online and predictions improving as more interactions arrive. Specifically, we instantiate the memory update as a learnable exponential moving average governed by a single shared scalar instead of using learnable parameters for each entity, enabling AdaTKG to handle entities unseen during training. Extensive experiments confirm consistent gains over TKG baselines, demonstrating the effectiveness of adaptive memory. Code and appendix are available at: https://anonymous.4open.science/r/adatkg_anon-4637/.
Email Sharing: We authorize the sharing of all author emails with Program Chairs.
Data Release: We authorize the release of our submission and author names to the public in the event of acceptance.
Submission Number: 6
Loading