Pith. sign in

REVIEW 2 cited by

Towards Robust Temporal Reasoning of Large Language Models via a Multi-Hop QA Dataset and Pseudo-Instruction Tuning

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 2311.09821 v2 pith:HKIADQGS submitted 2023-11-16 cs.CL

classification cs.CL
keywords temporalllmsreasoningmulti-hopcomplexcomplex-trdatadataset
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Knowledge in the real world is being updated constantly. However, it is costly to frequently update large language models (LLMs). Therefore, it is crucial for LLMs to understand the concept of temporal knowledge. However, prior works on temporal question answering (TQA) did not emphasize multi-answer and multi-hop types of temporal reasoning. In this paper, we propose a complex temporal question-answering dataset Complex-TR that focuses on multi-answer and multi-hop temporal reasoning. Besides, we also propose a novel data augmentation strategy to improve the complex temporal reasoning capability and robustness of LLMs. We conducted experiments on multiple temporal QA datasets. Experimental results show that our method is able to improve LLMs' performance on temporal QA benchmarks by significant margins. Our code and data are released at: https://github.com/nusnlp/complex-tr.

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. DyG-RAG: Dynamic Graph Retrieval-Augmented Generation with Event-Centric Reasoning

    cs.IR 2025-07 conditional novelty 5.0 of 10

    DyG-RAG builds a dynamic event graph from time-anchored event units and uses timeline retrieval with Time-CoT prompting to answer temporal questions.

  2. DateLogicQA: Benchmarking Temporal Biases in Large Language Models

    cs.CL 2024-12 reject novelty 4.0 of 10

    DateLogicQA evaluates 12 LLMs on 190 date-reasoning questions and claims separate representation-level and logical-level temporal biases, but the Semantic Integrity Metric is undefined.

Pith tools