Arrow Research search

Author name cluster

Meiqi Chen

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

EAAI Journal 2026 Journal Article

Exploring semantic dependency for reasoning over temporal knowledge graph

  • Hong Yu
  • Meiqi Chen
  • Ronghua Tian
  • Yongfang Xie

Temporal knowledge graph reasoning aims to predict future facts based on given historical ones. When two entities that have had no historical interaction interact with each other, we call a new event occurs. Most existing methods suffer from limitations in predicting new events, as they only focus on direct historical interaction. To this end, we propose a temporal knowledge graph reasoning method by exploring semantic dependencies, abbreviated as SdTKG. It enriches the characterization of entities by capturing and representing potential semantic dependencies between entities with limited historical interactions. First, a potential semantic dependency graph and its encoder are constructed based on temporal path analysis to capture potential dependencies beyond direct historical interactions. Second, the entities with the similar stance to the target entity, which are mined by the potential semantic dependency graph, are used as positive samples; and then, self-supervised negative-free contrastive learning is employed on the positive samples to enhance the representation of potential semantic dependencies. Extensive experiments fully demonstrate that SdTKG is more competitive than ten state-of-the-art models. The mean reciprocal rank (MRR) values of SdTKG for relation prediction and new event prediction exceed those of the best baseline method 6. 47% and 5. 46% on average, respectively. The code is available at: https: //github. com/yuhongcqupt/SdTKG.

NeurIPS Conference 2024 Conference Paper

MMLONGBENCH-DOC: Benchmarking Long-context Document Understanding with Visualizations

  • Yubo Ma
  • Yuhang Zang
  • Liangyu Chen
  • Meiqi Chen
  • Yizhu Jiao
  • Xinze Li
  • Xinyuan Lu
  • Ziyu Liu

Understanding documents with rich layouts and multi-modal components is a long-standing and practical task. Recent Large Vision-Language Models (LVLMs) have made remarkable strides in various tasks, particularly in single-page document understanding (DU). However, their abilities on long-context DU remain an open problem. This work presents MMLONGBENCH-DOC, a long-context, multi- modal benchmark comprising 1, 082 expert-annotated questions. Distinct from previous datasets, it is constructed upon 135 lengthy PDF-formatted documents with an average of 47. 5 pages and 21, 214 textual tokens. Towards comprehensive evaluation, answers to these questions rely on pieces of evidence from (1) different sources (text, image, chart, table, and layout structure) and (2) various locations (i. e. , page number). Moreover, 33. 7\% of the questions are cross-page questions requiring evidence across multiple pages. 20. 6\% of the questions are designed to be unanswerable for detecting potential hallucinations. Experiments on 14 LVLMs demonstrate that long-context DU greatly challenges current models. Notably, the best-performing model, GPT-4o, achieves an F1 score of only 44. 9\%, while the second-best, GPT-4V, scores 30. 5\%. Furthermore, 12 LVLMs (all except GPT-4o and GPT-4V) even present worse performance than their LLM counterparts which are fed with lossy-parsed OCR documents. These results validate the necessity of future research toward more capable long-context LVLMs.

v2026.09.13