Document-Level Tabular Numerical Cross-Checking: A Coarse-to-Fine Approach
Not on the map. Why?
Abstract (arXiv)
Numerical consistency across tables in disclosure documents is critical for ensuring accuracy, maintaining credibility, and avoiding reputational and economic risks. Automated tabular numerical cross-checking presents two significant challenges: (C1) managing the combinatorial explosion of candidate instances at the document level and (C2) comprehending multi-faceted numerical semantics. Previous research typically depends on heuristic-based filtering or simplified context extraction, often struggling to balance performance and efficiency. Recently, large language models (LLMs) have demonstrated remarkable contextual understanding capabilities that helps address C2 at the instance level, yet they remain hampered by computational inefficiency (C1) and limited domain expertise. This paper introduces CoFiTCheck, a novel LLM-based coarse-to-fine framework that addresses these challenges through two sequential stages: embedding-based filtering and discriminative classification. The embedding-based filtering stage introduces an instructional parallel encoding method to efficiently represent all numerical mentions in a table with LLMs, as well as a decoupled InfoNCE objective to mitigate the isolated mention problem. The discriminative classification stage employs a specialized LLM for fine-grained analysis of the remaining candidate pairs. This stage is further enhanced by our crosstable numerical alignment pretraining paradigm, which leverages weak supervision from cross-table numerical equality relationships to enrich task-specific priors without requiring manual annotation. Comprehensive evaluation across three types of real-world disclosure documents demonstrates that CoFiTCheck significantly outperforms previous methods while maintaining practical efficiency.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 37 of its 58 references that are in the map. First posted on arXiv 16 Jun 2025.
Builds on
37 of 58 references.
References · 37
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2023GPT-4 Technical Reportcited by 18,396
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,301
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,216
25 more
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2021Large Dual Encoders Are Generalizable Retrieverscited by 456
- 2019TabFact: A Large-scale Dataset for Table-based Fact Verificationcited by 428
- 2024LLM2Vec: Large Language Models Are Secretly Powerful Text Encoderscited by 404
- 2021A Survey on Automated Fact-Checkingcited by 378
- 2024The Faiss librarycited by 376
- 2023StructGPT: A General Framework for Large Language Model to Reason over Structured Datacited by 343
- 2017Fake News Detection on Social Media: A Data Mining Perspectivecited by 336
- 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 272
- 2024Generative Representational Instruction Tuningcited by 233
- 2024Chain-of-Table: Evolving Tables in the Reasoning Chain for Table Understandingcited by 188
- 2023Large Language Models are Versatile Decomposers: Decompose Evidence and Questions for Table-based Reasoningcited by 178
- 2021FEVEROUS: Fact Extraction and VERification Over Unstructured and Structured informationcited by 167
- 2023TableLlama: Towards Open Large Generalist Models for Tablescited by 137
- 2023Table Meets LLM: Can Large Language Models Understand Structured Table Data? A Benchmark and Empirical Studycited by 116
- 2023In-context Pretraining: Language Modeling Beyond Document Boundariescited by 79
- 2023Exploring the Numerical Reasoning Capabilities of Language Models: A Comprehensive Analysis on Tabular Datacited by 33
- 2024PromptReps: Prompting Large Language Models to Generate Dense and Sparse Representations for Zero-Shot Document Retrievalcited by 30
- 2023Guideline Learning for In-context Information Extractioncited by 24
- 2024Large Language Models as Foundations for Next-Gen Dense Retrieval: A Comprehensive Empirical Assessmentcited by 19
- 2023Breaking the Bank with ChatGPT: Few-Shot Text Classification for Financecited by 12
- 2024Uncovering Limitations of Large Language Models in Information Seeking from Tablescited by 9
- 2021SciClops: Detecting and Contextualizing Scientific Claims for Assisting Manual Fact-Checkingcited by 8
- 2024An Integrated Data Processing Framework for Pretraining Foundation Modelscited by 6
- 2025Towards Automated Fact-Checking of Real-World Claims: Exploring Task Formulation and Assessment with LLMscited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.