TKGB: A Comprehensive Benchmark for Temporal Knowledge Graph Forecasting
Jiasheng ZhangZhengpin LiHao LiJie ShaoHui LiJiangtao Cui
Oct 2026
Artificial Intelligence
Abstract
Temporal knowledge graph (TKG) forecasting has advanced remarkably in recent years. Yet we found existing benchmarks inadvertently introduce a shortcut: For a subset of test queries, models can achieve optimal evaluation metrics without using any time information. We trace this to two pieces of evidence: inherent dataset biases and an overly simplistic task formulation that allows models to exploit biases, revealing fundamental flaws in current evaluation protocols for differentiating true forecasting ability. Moreover, existing datasets rely on fixed history that poorly reflects real-world dynamics, lack semantic context, and fail to explicitly mitigate shortcut, preventing thorough assessment of forecasting abilities. To address these, we propose TKGB, a comprehensive benchmark for evaluating the capability of TKG forecasting models. By integrating four complementary tasks with an automatic pipeline for constructing up-to-date and context-enriched TKG datasets with controllable shortcuts, TKGB reveals capability differences and failure modes hidden under conventional evaluation.
This paper investigates developing real-world perception for active agents, proposes Gibson Environment for this purpose, and showcases a set of perceptual tasks learned therein.
F. Xia, Amir Zamir, Zhi-Yang He et al.· 2018 IEEE/CVF Conference on...· 1,069 citations· ⚡112
GAOKAO-Bench is introduced, an intuitive benchmark that employs questions from the Chinese GAOKAO examination as test samples, including both subjective and objective questions that contribute a robust evaluation benchmark for future large language models and offers valuable insights into the advantages and limitations...
Xiaotian Zhang, Chun-yan Li, Yi Zong et al.· arXiv.org· 216 citations· ⚡17
An algorithm is proposed which leverages disentangled semantic factors to generate adversarial perturbation by altering controlled semantic attributes to fool the learner towards various "adversarial" targets.
Haonan Qiu, Chaowei Xiao, Lei Yang et al.· arXiv.org· 208 citations· ⚡17
This work proposes a HALO that directly maximizes the utility of generations instead of maximizing the log-likelihood of preferences, and suggests that the best loss depends on the inductive biases most appropriate for a given setting, an oft-overlooked consideration.
This work investigates the possibilities of using LLMs in a resume screening setting via a document retrieval framework that simulates job candidate selection and finds that the MTEs are biased, significantly favoring White-associated names in 85% of cases and female-associated names in only 11.1% of cases.
This work shows that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration and introduces high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical...
Masoud Mohseni, Artur Scherer, K. Johnson et al.· arXiv.org· 121 citations· ⚡9
