arXiv AI

Beyond Dense States: Sparse Transcoders as Causally Testable Operators for LLM Latent Reasoning

arXiv AI
Jul 29

Penelope: Localized Latent Recurrence for Efficient Structured Reasoning

arXiv:2607. 25915v1 Announce Type: new Abstract: Complex structured reasoning tasks often require additional computation, yet current language models obtain it mainly by increasing parameter scale or by serializing intermediate steps as chain-of-thought (CoT) tokens.

By Yutong Chen, Shouqian Shi, Xinran Liu, Haochen Wang, Jiaying Wang, Tianxing Xu, Yuanxi Wang, Zirui Ding
arXiv AI
Oct 9

Efficient Reasoning via Constrained Optimization in Latent Space

Large Reasoning Models often overthink, producing redundant reasoning steps that consume many tokens. The authors observe that efficient reasoning steps cluster in a concentrated region of latent space, while verbose steps lie outside this region. By projecting deviating hidden states back into the region via a quadratic program, they propose a training‑free framework that cuts token generation by up to 52.8% while improving accuracy by up to 12.1% across several benchmarks.

By Zhinan Hou, Xingchen Li, Keyou You
arXiv Machine Learning
4d ago

INTACT: Inducing Latent Reasoning on a Frozen Backbone

INTACT introduces a small external encoder that induces latent reasoning in a frozen backbone model by mapping hidden states to compact continuous representations, called soft-token blocks. The encoder is trained via distillation to mimic written reasoning steps while preserving the backbone’s behavior, and then fine‑tuned for answer correctness. Experiments on four frozen backbones (1B–8B) show that INTACT improves accuracy on GSM8K and other out‑of‑domain benchmarks, reduces latency by up to 19%, and outperforms existing latent‑reasoning baselines at 3B and 8B scales.

By Kutay Tire, Atula Tejaswi, Haris Vikalo, Sujay Sanghavi