Pith

open record

sign in
Browse

arxiv: 2407.03525 · v4 · pith:4PTSJ2JG · submitted 2024-07-03 · cs.CL

UnSeenTimeQA: Time-Sensitive Question-Answering Beyond LLMs' Memorization

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:4PTSJ2JGrecord.jsonopen to challenge →

classification cs.CL
keywords llmstime-sensitivetsqadataeventreasoningfact-basedgeneration
0
0 comments X
read the original abstract

This paper introduces UnSeenTimeQA, a novel data contamination-free time-sensitive question-answering (TSQA) benchmark. It differs from existing TSQA benchmarks by avoiding web-searchable queries grounded in the real world. We present a series of time-sensitive event scenarios based on synthetically generated facts. It requires large language models (LLMs) to engage in genuine temporal reasoning without depending on the factual knowledge acquired during the pre-training phase. Our data generation framework enables on-demand generation of new samples, mitigating the risk of data leakage. We designed three types of time-sensitive questions to test LLMs' temporal reasoning abilities over sequential and parallel event occurrences. Our evaluation of five LLMs on synthetic fact-based TSQA reveals mixed results: while they perform well on simpler subsets, their overall performance remains inferior as compared to real world fact-based TSQA. Error analysis indicates that LLMs face difficulties in reasoning over long-range event dependencies and parallel events.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.