TY - CHAP
T1 - LEAP
T2 - 21st International Conference on Advanced Data Mining and Applications, ADMA 2025
AU - Zhang, Hanwen
AU - Si, Qingyi
AU - Fu, Peng
AU - Lin, Zheng
AU - Lu, Zhigang
AU - Wang, Weiping
PY - 2026
Y1 - 2026
N2 - The reasoning ability on Table-based Fact Verification (TFV) has been explored extensively on Large Language Models (LLMs). Existing TFV approaches can be broadly categorized into two main paradigms: prompting and fine-tuning. However, most prompting methods highly depend on powerful closed-sourced LLMs, which causes data breach problems, while fine-tuning methods mainly focus on generating end-to-end answers but often lack explainability. In this paper, we introduce a three-stage pipeline framework LEAP for TFV. It provides a step-by-step solution through instruction tuning by decomposing the statement into sub-questions. It consists of three sub-modules: a sentence decomposer, a table-based question answerer, and a table-based evidence-augmented verifier. To specialize the sub-modules in their respective tasks, we construct the reasoning evidence by data distillation and pseudo-labeling. Through diverse experiments on four TFV benchmarks, we demonstrate that our LEAP achieves state-of-the-art performance. In particular, it even outperforms human performance with an accuracy of 2.02% on Infotabs. As an effective method suitable for scenarios that require data privacy, our LEAP framework exhibits strong generalization and versatility on different types of backbone models and datasets. Furthermore, our experiments validate the effectiveness of each sub-module, proving its suitability as a standalone model for its respective task.
AB - The reasoning ability on Table-based Fact Verification (TFV) has been explored extensively on Large Language Models (LLMs). Existing TFV approaches can be broadly categorized into two main paradigms: prompting and fine-tuning. However, most prompting methods highly depend on powerful closed-sourced LLMs, which causes data breach problems, while fine-tuning methods mainly focus on generating end-to-end answers but often lack explainability. In this paper, we introduce a three-stage pipeline framework LEAP for TFV. It provides a step-by-step solution through instruction tuning by decomposing the statement into sub-questions. It consists of three sub-modules: a sentence decomposer, a table-based question answerer, and a table-based evidence-augmented verifier. To specialize the sub-modules in their respective tasks, we construct the reasoning evidence by data distillation and pseudo-labeling. Through diverse experiments on four TFV benchmarks, we demonstrate that our LEAP achieves state-of-the-art performance. In particular, it even outperforms human performance with an accuracy of 2.02% on Infotabs. As an effective method suitable for scenarios that require data privacy, our LEAP framework exhibits strong generalization and versatility on different types of backbone models and datasets. Furthermore, our experiments validate the effectiveness of each sub-module, proving its suitability as a standalone model for its respective task.
KW - Decomposing
KW - Instruction Tuning
KW - Large Language Models
KW - Table-based Fact Verification
UR - https://www.scopus.com/pages/publications/105020673842
UR - https://go.openathens.net/redirector/westernsydney.edu.au?url=https://doi.org/10.1007/978-981-95-3453-1_14
U2 - 10.1007/978-981-95-3453-1_14
DO - 10.1007/978-981-95-3453-1_14
M3 - Chapter
AN - SCOPUS:105020673842
SN - 9789819534524
T3 - Lecture Notes in Computer Science
SP - 206
EP - 221
BT - Advanced Data Mining and Applications: 21st International Conference, ADMA 2025, Kyoto, Japan, October 22-24, 2025, Proceedings, Part I
A2 - Yoshikawa, Masatoshi
A2 - Meng, Xiaofeng
A2 - Cao, Yang
A2 - Xiao, Chuan
A2 - Chen, Weitong
A2 - Wang, Yanda
PB - Springer
CY - Singapore
Y2 - 22 October 2025 through 24 October 2025
ER -