Rethinking Table Pruning in TableQA: From Sequential Revisions to Gold Trajectory-Supervised Parallel Search
Not on the map. Why?
Abstract (arXiv)
Table Question Answering (TableQA) benefits significantly from table pruning, which extracts compact sub-tables by eliminating redundant cells to streamline downstream reasoning. However, existing pruning methods typically rely on sequential revisions driven by unreliable critique signals, often failing to detect the loss of answer-critical data. To address this limitation, we propose TabTrim, a novel table pruning framework which transforms table pruning from sequential revisions to gold trajectory-supervised parallel search. TabTrim derives a gold pruning trajectory using the intermediate sub-tables in the execution process of gold SQL queries, and trains a pruner and a verifier to make the step-wise pruning result align with the gold pruning trajectory. During inference, TabTrim performs parallel search to explore multiple candidate pruning trajectories and identify the optimal sub-table. Extensive experiments demonstrate that TabTrim achieves state-of-the-art performance across diverse tabular reasoning tasks: TabTrim-8B reaches 73.5% average accuracy, outperforming the strongest baseline by 3.2%, including 79.4% on WikiTQ and 61.2% on TableBench.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 23 of its 46 references that are in the map. First posted on arXiv 7 Jan 2026.
Builds on
23 of 46 references.
References · 23
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 8,065
- 2023Large Language Models Cannot Self-Correct Reasoning Yetcited by 1,017
- 2017Seq2SQL: Generating Structured Queries from Natural Language using Reinforcement Learningcited by 687
- 2015Compositional Semantic Parsing on Semi-Structured Tablescited by 515
- 2020TAPAS: Weakly Supervised Table Parsing via Pre-trainingcited by 434
- 2019TabFact: A Large-scale Dataset for Table-based Fact Verificationcited by 428
- 2020TaBERT: Pretraining for Joint Understanding of Textual and Tabular Datacited by 398
- 2021TAPEX: Table Pre-training via Learning a Neural SQL Executorcited by 235
- 2022Binding Language Models in Symbolic Languagescited by 228
- 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
- 2024TableBench: A Comprehensive and Complex Benchmark for Table Question Answeringcited by 128
11 more
- 2023ReAcTable: Enhancing ReAct for Table Question Answeringcited by 76
- 2020On the Potential of Lexico-logical Alignments for Semantic Parsing to SQL Queriescited by 60
- 2022PASTA: Table-Operations Aware Fact Verification via Sentence-Table Cloze Pre-trainingcited by 41
- 2024TableRAG: Million-Token Table Understanding with Language Modelscited by 41
- 2024TabSQLify: Enhancing Reasoning Capabilities of LLMs Through Table Decompositioncited by 39
- 2025Table-R1: Region-based Reinforcement Learning for Table Understandingcited by 37
- 2025Table-Critic: A Multi-Agent Framework for Collaborative Criticism and Refinement in Table Reasoningcited by 32
- 2024Confidence v.s. Critique: A Decomposition of Self-Correction Capability for LLMscited by 29
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMscited by 25
- 2024ProTrix: Building Models for Planning and Reasoning over Tables with Sentence Contextcited by 23
- 2025When TableQA Meets Noise: A Dual Denoising Framework for Complex Questions and Large-scale Tablescited by 10
Built on by
Citing papers per year: 2026: 8.
8 papers.
- 2026ChartVerse: Scaling Chart Reasoning via Reliable Programmatic Synthesis from Scratchcited by 10
- 2026TABQAWORLD: Optimizing Multimodal Reasoning for Multi-Turn Table Question Answeringcited by 4
- 2026Enhancing Table Reasoning with Deterministic Table-State Rewardscited by 3
- 2026From Table to Cell: Attention for Better Reasoning with TABALIGNcited by 2
- 2026AWM: Answerable Working Memory for Long-Document VQA Agentscited by 2
- 2026All for 1-Bit: Towards Genuine 1-Bit Post-Training Quantization for LLMscited by 2
- 2026TabTracer: Monte Carlo Tree Search for Complex Table Reasoning with Large Language Modelscited by 1
- 2026CEDAR: Automata as Verifiable Interfaces for Language-Guided Embodied Actioncited by 0
- 2026All for 1-Bit: Towards Genuine 1-Bit Post-Training Quantization for LLMs5 Sep 2026
- 2026CEDAR: Automata as Verifiable Interfaces for Language-Guided Embodied Action28 Aug 2026
- 2026AWM: Answerable Working Memory for Long-Document VQA Agents26 Aug 2026
- 2026From Table to Cell: Attention for Better Reasoning with TABALIGN14 May 2026
- 2026TABQAWORLD: Optimizing Multimodal Reasoning for Multi-Turn Table Question Answering3 Apr 2026
- 2026TabTracer: Monte Carlo Tree Search for Complex Table Reasoning with Large Language Models15 Feb 2026
- 2026Enhancing Table Reasoning with Deterministic Table-State Rewards30 Jan 2026
- 2026ChartVerse: Scaling Chart Reasoning via Reliable Programmatic Synthesis from Scratch20 Jan 2026