Liangyu Zha
Author directory2026
Can LLMs Spot Data Anomalies That Make Table QA Impossible?
Yucheng Wei | Shenzhi Yang | Ning Wang | Jinchang Zhang | Yuhang Yang | Haobo Wang | Liangyu Zha | Wentao Ye | Liyao Li | Cheng Peng | Gang Chen
Findings of the Association for Computational Linguistics: EMNLP 2026
Yucheng Wei | Shenzhi Yang | Ning Wang | Jinchang Zhang | Yuhang Yang | Haobo Wang | Liangyu Zha | Wentao Ye | Liyao Li | Cheng Peng | Gang Chen
Findings of the Association for Computational Linguistics: EMNLP 2026
Existing tabular reasoning benchmarks typically assume that input tables are clean and error-free, which contrasts sharply with real-world data pipelines where noise and anomalies are pervasive. While humans routinely validate tables and reject conclusions when anomalies render a question unanswerable, it remains unclear whether large language models (LLMs) exhibit similar anomaly awareness. In this work, we introduce AnTBench, a benchmark designed to systematically evaluate LLM behavior under anomalous tabular data. AnTBench consists of 1,571 curated instances covering five common and verifiable anomaly types. Experiments on 14 representative LLMs reveal a pronounced capability–behavior gap: even the strongest model achieves 76.07% on explicit anomaly detection, yet only 19.03% on spontaneous anomaly perception during standard table QA. As an inference-time mitigation, we introduce the Multi-Path Thinker, a multi-path reasoning framework. While this approach improves explicit anomaly detection, enforcing proactive verification for every query is practically prohibitive. We urge the community to move beyond inference-time patches and instill spontaneous anomaly awareness directly into the training and alignment phases. Our code and data are available at https://github.com/Wei12097/AnTBench.
2025
RealHiTBench: A Comprehensive Realistic Hierarchical Table Benchmark for Evaluating LLM-Based Table Analysis
Pengzuo Wu | Yuhang Yang | Guangcheng Zhu | Chao Ye | Hong Gu | Xu Lu | Ruixuan Xiao | Bowen Bao | Yijing He | Liangyu Zha | Wentao Ye | Junbo Zhao | Haobo Wang
Findings of the Association for Computational Linguistics: ACL 2025
Pengzuo Wu | Yuhang Yang | Guangcheng Zhu | Chao Ye | Hong Gu | Xu Lu | Ruixuan Xiao | Bowen Bao | Yijing He | Liangyu Zha | Wentao Ye | Junbo Zhao | Haobo Wang
Findings of the Association for Computational Linguistics: ACL 2025
With the rapid advancement of Large Language Models (LLMs), there is an increasing need for challenging benchmarks to evaluate their capabilities in handling complex tabular data. However, existing benchmarks are either based on outdated data setups or focus solely on simple, flat table structures. In this paper, we introduce RealHiTBench, a comprehensive benchmark designed to evaluate the performance of both LLMs and Multimodal LLMs (MLLMs) across a variety of input formats for complex tabular data, including LaTeX, HTML, and PNG. RealHiTBench also includes a diverse collection of tables with intricate structures, spanning a wide range of task types. Our experimental results, using 25 state-of-the-art LLMs, demonstrate that RealHiTBench is indeed a challenging benchmark. Moreover, we also develop TreeThinker, a tree-based agent that organizes hierarchical headers into a tree structure for enhanced tabular reasoning, validating the importance of improving LLMs’ perception of table hierarchies. We hope that our work will inspire further research on tabular data reasoning and the development of more robust models. The code and data are available at https://github.com/cspzyy/RealHiTBench.