AdaTKG: Adaptive Memory for Temporal Knowledge Graph Reasoning
Summary
AdaTKG is a novel method for Temporal Knowledge Graph (TKG) reasoning that introduces adaptive, per-entity representations, departing from the static entity representations common in existing TKG methods. It maintains a per-entity memory, updated with each observed interaction, which accumulates online and refines predictions as more interactions occur. This memory update is instantiated as a learnable exponential moving average (EMA) governed by a single shared scalar parameter, enabling AdaTKG to handle entities unseen during training (emerging entities). The method fuses this adaptive memory with a static entity embedding via a learnable, d-dimensional adaptive gate. Extensive experiments on four TKG benchmarks (ICEWS14, ICEWS18, ICEWS05-15, GDELT) demonstrate that AdaTKG consistently outperforms strong TKG baselines, including the state-of-the-art TransFIR, particularly on emerging and unknown entities, with only marginal computational overhead.
Key takeaway
For research scientists developing TKG reasoning systems, AdaTKG offers a robust approach to improve performance on emerging and unknown entities. You should consider integrating adaptive, per-entity memory mechanisms, such as a learnable EMA, into your models. This strategy enhances predictive accuracy and training efficiency, especially when dealing with dynamic real-world data where entities frequently appear without prior history, making your systems more inclusive for applications like financial monitoring or public-health surveillance.
Key insights
Adaptive, per-entity memory significantly enhances temporal knowledge graph reasoning for emerging entities.
Principles
- Entity representations should adapt with interactions.
- Memory updates can be entity-agnostic for inductivity.
- Adaptive gates fuse static and dynamic information.
Method
AdaTKG refines entity representations using a per-entity memory updated via a learnable exponential moving average (EMA) and fuses it with static embeddings using an adaptive gate, ensuring inductivity for unseen entities.
In practice
- Implement per-entity memory for dynamic entity modeling.
- Use a shared scalar for EMA decay for efficiency.
- Employ an adaptive gate for graceful cold-start behavior.
Topics
- Temporal Knowledge Graphs
- Adaptive Memory
- Entity Representation
- Inductive Reasoning
- Exponential Moving Average
Code references
Best for: Research Scientist, AI Scientist, Machine Learning Engineer, Data Scientist
Related on AIssential
Editorial summary, takeaway, and curation by AIssential. Original article published by cs.AI updates on arXiv.org.