Pith. sign in

REVIEW 2 cited by

TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.04101 v1 pith:UAIH72ST submitted 2021-09-09 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords methodtaskforecastingfuturegraphknowledgelearningmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Temporal knowledge graph (TKG) reasoning is a crucial task that has gained increasing research interest in recent years. Most existing methods focus on reasoning at past timestamps to complete the missing facts, and there are only a few works of reasoning on known TKGs to forecast future facts. Compared with the completion task, the forecasting task is more difficult that faces two main challenges: (1) how to effectively model the time information to handle future timestamps? (2) how to make inductive inference to handle previously unseen entities that emerge over time? To address these challenges, we propose the first reinforcement learning method for forecasting. Specifically, the agent travels on historical knowledge graph snapshots to search for the answer. Our method defines a relative time encoding function to capture the timespan information, and we design a novel time-shaped reward based on Dirichlet distribution to guide the model learning. Furthermore, we propose a novel representation method for unseen entities to improve the inductive inference ability of the model. We evaluate our method for this link prediction task at future timestamps. Extensive experiments on four benchmark datasets demonstrate substantial performance improvement meanwhile with higher explainability, less calculation, and fewer parameters when compared with existing state-of-the-art methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. RECIPE-TKG: From Sparse History to Structured Reasoning for LLM-based Temporal Knowledge Graph Completion

    cs.LG 2025-05 conditional novelty 6.0 of 10

    RECIPE-TKG combines rule-based multi-hop history sampling, contrastive LoRA fine-tuning, and test-time semantic filtering to improve LLM temporal knowledge graph completion, with Hits@10 gains up to 30.6% over prior L...

  2. Disentangled Multi-span Evolutionary Network against Temporal Knowledge Graph Reasoning

    cs.AI 2025-05 conditional novelty 5.0 of 10

    DiMNet combines multi-span cross-time message passing with disentangled active/stable node factors to set new state-of-the-art MRR on four TKG extrapolation benchmarks.

Pith tools