🤖 AI Summary
Discrete chain-of-thought (CoT) reasoning suffers from limited expressivity and serial inefficiency due to token-level discrete sampling. Method: We propose continuous chain-of-thought (CoT2), modeling reasoning trajectories as continuous latent-variable optimization—bypassing discrete token generation. CoT2 integrates a single-layer Transformer with theoretical guarantees for exact solving of NP problems (e.g., Subset Sum); introduces continuous exploration over the probability simplex, K-token parallel combinatorial decoding, softmax-distribution matching supervision, and policy-optimization-driven self-improving training. Contribution/Results: Experiments demonstrate that CoT2 significantly outperforms standard CoT on logical reasoning benchmarks, achieving superior expressivity, inherent parallelism, and differentiable search efficiency. Our results validate the effectiveness and scalability of continuous reasoning as a novel paradigm for neuro-symbolic inference.
📝 Abstract
Current language models generate chain-of-thought traces by autoregressively sampling tokens from a finite vocabulary. While this discrete sampling has achieved remarkable success, conducting chain-of-thought with continuously-valued tokens (CoT2) offers a richer and more expressive alternative. Our work examines the benefits of CoT2 through logical reasoning tasks that inherently require search capabilities and provide optimization and exploration methods for CoT2. Theoretically, we show that CoT2 allows the model to track multiple traces in parallel and quantify its benefits for inference efficiency. Notably, one layer transformer equipped with CoT2 can provably solve the combinatorial"subset sum problem"given sufficient embedding dimension. These insights lead to a novel and effective supervision strategy where we match the softmax outputs to the empirical token distributions of a set of target traces. Complementing this, we introduce sampling strategies that unlock policy optimization and self-improvement for CoT2. Our first strategy samples and composes $K$ discrete tokens at each decoding step to control the level of parallelism, and reduces to standard CoT when $K=1$. Our second strategy relies on continuous exploration over the probability simplex. Experiments confirm that policy optimization with CoT2 indeed improves the performance of the model beyond its initial discrete or continuous supervision.