Pith. sign in

REVIEW 2 cited by

GenTKG: Generative Forecasting on Temporal Knowledge Graph with Large Language Models

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 2310.07793 v5 pith:XN3ZRKI7 submitted 2023-10-11 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords temporaldataforecastinggentkgllmschallengesgenerativegraph
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The rapid advancements in large language models (LLMs) have ignited interest in the temporal knowledge graph (tKG) domain, where conventional embedding-based and rule-based methods dominate. The question remains open of whether pre-trained LLMs can understand structured temporal relational data and replace them as the foundation model for temporal relational forecasting. Therefore, we bring temporal knowledge forecasting into the generative setting. However, challenges occur in the huge chasms between complex temporal graph data structure and sequential natural expressions LLMs can handle, and between the enormous data sizes of tKGs and heavy computation costs of finetuning LLMs. To address these challenges, we propose a novel retrieval-augmented generation framework named GenTKG combining a temporal logical rule-based retrieval strategy and few-shot parameter-efficient instruction tuning to solve the above challenges, respectively. Extensive experiments have shown that GenTKG outperforms conventional methods of temporal relational forecasting with low computation resources using extremely limited training data as few as 16 samples. GenTKG also highlights remarkable cross-domain generalizability with outperforming performance on unseen datasets without re-training, and in-domain generalizability regardless of time split in the same dataset. Our work reveals the huge potential of LLMs in the tKG domain and opens a new frontier for generative forecasting on tKGs. Code and data are released here: https://github.com/mayhugotong/GenTKG.

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. Integrate Temporal Graph Learning into LLM-based Temporal Knowledge Graph Model

    cs.IR 2025-01 conditional novelty 5.0 of 10

    TGL-LLM combines temporal graph embeddings with LLM tokenization and two-stage fine-tuning, achieving higher multiple-choice forecasting accuracy than existing TKGF baselines.

Pith tools