Pith. sign in

REVIEW 2 cited by

Learning from History: Modeling Temporal Knowledge Graphs with Sequential Copy-Generation Networks

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 2012.08492 v2 pith:ORQPCS6G submitted 2020-12-15 cs.AI cs.CLcs.LG

classification cs.AIcs.CLcs.LG
keywords factstemporalknowledgegraphscygnetfuturelearningmodel
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Large knowledge graphs often grow to store temporal facts that model the dynamic relations or interactions of entities along the timeline. Since such temporal knowledge graphs often suffer from incompleteness, it is important to develop time-aware representation learning models that help to infer the missing temporal facts. While the temporal facts are typically evolving, it is observed that many facts often show a repeated pattern along the timeline, such as economic crises and diplomatic activities. This observation indicates that a model could potentially learn much from the known facts appeared in history. To this end, we propose a new representation learning model for temporal knowledge graphs, namely CyGNet, based on a novel timeaware copy-generation mechanism. CyGNet is not only able to predict future facts from the whole entity vocabulary, but also capable of identifying facts with repetition and accordingly predicting such future facts with reference to the known facts in the past. We evaluate the proposed method on the knowledge graph completion task using five benchmark datasets. Extensive experiments demonstrate the effectiveness of CyGNet for predicting future facts with repetition as well as de novo fact prediction.

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. Mixture Policy based Multi-Hop Reasoning over N-tuple Temporal Knowledge Graphs

    cs.AI 2025-05 conditional novelty 6.0 of 10

    MT-Path predicts missing entities in N-tuple temporal knowledge graphs by training a mixture of three reinforcement-learning path-finding policies (predicate, core-element, whole-fact) with an auxiliary-aware GCN, and...

  2. Towards Improving Long-Tail Entity Predictions in Temporal Knowledge Graphs through Global Similarity and Weighted Sampling

    cs.AI 2025-07 reject novelty 4.0 of 10

    A global relation-similarity enhancement layer plus frequency-weighted sampling improves long-tail entity link prediction in incrementally trained temporal knowledge graphs on the ICEWS14 and ICEWS18 benchmarks.

Pith tools