TabTracer: Monte Carlo Tree Search for Complex Table Reasoning with Large Language Models
Zhizhao Luo, Zhaojing Luo, Meihui Zhang, Rui Mao

TL;DR
TabTracer introduces a novel Monte Carlo Tree Search framework for complex table reasoning with large language models, enabling step verification, efficient search, and reduced token costs, leading to improved accuracy.
Contribution
It presents a new agent-based framework combining step-level verification, Monte Carlo Tree Search, and cost-reduction techniques for enhanced table reasoning with LLMs.
Findings
Outperforms state-of-the-art baselines by up to 6.7% in accuracy.
Reduces token consumption by 59-84%.
Effective verification and search strategies improve reasoning reliability.
Abstract
Large language models (LLMs) have emerged as powerful tools for natural language table reasoning, where there are two main categories of methods. Prompt-based approaches rely on language-only inference or one-pass program generation without step-level verification. Agent-based approaches use tools in a closed loop, but verification is often local and backtracking is limited, allowing errors to propagate and increasing cost. Moreover, they rely on chain- or beam-style trajectories that are typically combinatorially redundant, leading to high token costs. In this paper, we propose TabTracer, an agentic framework that coordinates multi-step tool calls over intermediate table states, with explicit state tracking for verification and rollback. First, it enforces step-level verification with typed operations and lightweight numeric and format checks to provide reliable rewards and suppress…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Machine Learning in Healthcare · Machine Learning in Materials Science
