- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper investigates why implicit chain-of-thought (CoT) reasoning is hard to learn on complex logical tasks and proposes ALiCoT to address the problem. The authors start with parity problems, studying how interaction order affects learning. They find that, under uniform attention initialization, the gradient signal for identifying relevant inputs gets exponentially weaker as interaction order increases. Meanwhile, the sufficient sample-size bound for distinguishing this signal from sampling noise grows. This finding suggests that intermediate computational states should be preserved when compressing explicit reasoning. The authors also introduce NatBool-DAG, a benchmark that describes Boolean computational graphs in natural language and aims to reduce reliance on semantic shortcuts. For natural-language reasoning, ALiCoT supplements the task loss with a step-wise alignment objective between latent hidden states and pooled representations of corresponding explicit reasoning steps from the same model. Experiments examine the predicted gradient scaling and report fewer training iterations with intermediate-state supervision. The GSM8K results also show improved mathematical reasoning accuracy within the training budgets.
Critical strengths
- NatBool-DAG provides a useful setting for studying compressed logical reasoning. Its symbolic construction supplies verifiable answers and explicit derivations.
- The empirical benefits extend across multiple model families and scales.
Critical weaknesses
- The novelty is limited or insufficiently clarified. ALiCoT is closely related to existing representation distillation and step-level latent supervision methods. Similarly, the theoretical analysis builds on existing parity-learning and scratchpad frameworks [1][2]. While the theory motivates preserving intermediate computational states (meanwhile, the benefit of representation alignment and step-level latent supervision has already been demonstrated by CODI and SimCOT), it does not directly justify the specific alignment mechanism. The choices of max pooling and cosine similarity remain largely heuristic, and the paper lacks comparisons with alternative aggregation and alignment objectives to establish the benefits of these particular choices.
- The experimental evaluation is incomplete. The main NatBool-DAG results primarily compare ALiCoT with Imp.Base-1, leaving its effectiveness relative to the closest baselines (CODI and SIM-CoT) insufficiently evaluated. Although these baselines are included in the GSM8K experiments, their low accuracies and the reported non-convergence of Coconut make the comparison difficult to interpret.
[1] Kim, Juno, and Taiji Suzuki. "Transformers provably solve parity efficiently with chain of thought." ICML 2025.
[2] Abbe, Emmanuel, et al. "How far can transformers reason? the globality barrier and inductive scratchpad." Neurips 2024.
Questions for authors
/