--- title: 'STaR: Slow-Thinking for Table Reasoning' url: https://www.emergentmind.com/topics/star-slow-thinking-for-table-reasoning type: topic --- # STaR: Slow-Thinking for Table Reasoning STaR (Slow-Thinking for Table Reasoning) is a framework designed to endow large language models (LLMs) with cognitive, step-by-step reasoning abilities over tabular data, addressing key limitations of shallow pattern matching and unstable outputs that characterize standard LLM approaches to table reasoning. By incorporating a curriculum-based, difficulty-aware reinforcement learning (RL) paradigm and a principled uncertainty quantification mechanism, STaR attains superior accuracy, stability, and generalization on both standard and out-of-domain table reasoning benchmarks [2511.11233]. ## 1. Motivation and Problem Setting Table reasoning challenges conventional LLMs with demands for precise cell retrieval, logical inference across rows and columns, and exact numerical computation. Existing LLM methods tend to generate answers without modeling intermediate steps, yielding outputs that are difficult to interpret and susceptible to instability under minor input perturbations. STaR seeks to emulate human “slow-thinking,” wherein analytic processes are explicitly decomposed into verifiable chains of reasoning. This approach promotes interpretability and iterative self-correction, thus supporting reliable downstream analysis. The framework targets cognitive table reasoning through three principal stages: construction of self-verified chain-of-thought (CoT) datasets, two-stage reinforcement learning with curriculum, and trajectory-level uncertainty quantification. ## 2. Architectural Components and Training Methodology ### Slow-Thinking Dataset Construction STaR generates “chain-of-thought” demonstrations by prompting a strong model with (table, question, ground-truth answer), then filtering out any reasoning trajectories whose computed final answer diverges from ground truth. A valid demonstration adopts the template $\langle\!\mathtt{think}\rangle$\{detailed steps\}$\langle\!\mathtt{answer}\rangle$\{JSON-formatted answer\}, thereby ensuring only self-consistent rationales are retained. ### Two-Stage Difficulty-Aware Reinforcement Learning The training set is partitioned according to observed pass@k rates under a supervised fine-tuning (SFT) base model: - $S_{\text{easy}} = \{\text{queries} \mid \text{pass@k}_1(\text{model}_{\text{SFT}}, \text{query}) \geq 0.6\}$ - $S_{\text{hard}} = \{\text{queries} \mid \text{pass@k}_1(\text{model}_{\text{SFT}}, \text{query}) < 0.6\}$ Each contains approximately 10,000 queries. A curriculum is imposed during RL: foundational training occurs on “easy” queries (stage 1), followed by progressive training on “hard” queries with dynamic sample filtering based on real-time pass@k tracking (stage 2). Policy optimization employs an enhanced Group-Relative Proximal Policy Optimization (GRPO) objective, omitting KL penalty and using asymmetric clipping: \[ \mathcal{J}_{\text{GRPO}}(\theta) = \mathbb{E}_{q \sim \mathcal{D}; o_1, \dots, o_G \sim \pi_{\theta_\text{old}}} \Biggl[ \frac{1}{\sum_i|o_i|} \sum_{i=1}^G\sum_{t=1}^{|o_i|} \min \left( r_{i,t}(\theta)\hat A_{i,t},\, \mathrm{clip}(r_{i,t}(\theta),1-\epsilon_{\text{low}},1+\epsilon_{\text{high}})\hat A_{i,t} \right) \Biggr] \] Reward for each trajectory $y$ combines format correctness, partial correctness, and exact match: \[ R(y)\;=\;0.2\,R_{\rm format}(y)\;+\;0.3\,R_{\rm partial}(y)\;+\;0.5\,R_{\rm complete}(y) \] ## 3. Inference: Trajectory-Level Uncertainty Quantification At inference, STaR samples multiple reasoning trajectories and computes the following metrics: - **Token-level confidence**: mean log-probability and entropy across tokens: \[ \mathrm{logprob}(y)=\frac1n\sum_{i=1}^n\log p(t_i\mid t_{