Pith. sign in

REVIEW 4 cited by

Tab-CoT: Zero-shot Tabular Chain of Thought

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.17812 v1 pith:7RNERAUE submitted 2023-05-28 cs.CL

classification cs.CL
keywords reasoningstructuredapproachcomplexexplicitlymethodsprocessesprompting
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The chain-of-though (CoT) prompting methods were successful in various natural language processing (NLP) tasks thanks to their ability to unveil the underlying complex reasoning processes. Such reasoning processes typically exhibit implicitly structured steps. Recent efforts also started investigating methods to encourage more explicitly structured reasoning procedures to be captured. In this work, we propose Tab-CoT, a novel tabular-format CoT prompting method, which allows the complex reasoning process to be explicitly modelled in a highly structured manner. Despite its simplicity, we show that our approach is capable of performing reasoning across multiple dimensions (i.e., both rows and columns). We demonstrate our approach's strong zero-shot and few-shot capabilities through extensive experiments on a range of reasoning tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TableMind: An Autonomous Programmatic Agent for Tool-Augmented Table Reasoning

    cs.AI 2025-09 conditional novelty 5.0 of 10

    TableMind, a two-stage SFT-plus-RL agent trained on an 8B model, reports state-of-the-art results on three table reasoning benchmarks.

  2. Can Structured Templates Facilitate LLMs in Tackling Harder Tasks? : An Exploration of Scaling Laws by Difficulty

    cs.AI 2025-08 reject novelty 5.0 of 10

    Training on easy synthetic math data lowers accuracy on hard benchmarks, and the proposed SST framework, which teaches explicit procedural chains, aims to reverse that drop.

  3. S$^2$-MAD: Breaking the Token Barrier to Enhance Multi-Agent Debate Efficiency

    cs.CL 2025-02 conditional novelty 5.0 of 10

    S2-MAD's decision mechanism filters redundant viewpoints and conditionally skips participation, cutting token costs by up to 94.5% versus standard multi-agent debate while keeping accuracy within about 2 points in the...

  4. Tree-of-Table: Unleashing the Power of LLMs for Enhanced Large-Scale Table Understanding

    cs.CL 2024-11 conditional novelty 4.0 of 10

    A tree-structured prompting method for LLM table reasoning reports modest gains on four benchmarks, with reproducibility and evaluation concerns.

Pith tools