arXiv AI

Generative Recursive Reasoning

Generative Recursive Reasoning (GRAM) extends Recursive Reasoning Models by introducing probabilistic multi‑trajectory computation, allowing neural reasoning systems to explore multiple latent trajectories instead of a single deterministic path. GRAM treats reasoning as a stochastic latent trajectory, enabling multiple hypotheses, alternative solution strategies, and scalable inference through recursive depth and parallel sampling. Trained via amortized variational inference, GRAM outperforms deterministic recurrent and recursive baselines on structured reasoning and multi‑solution constraint satisfaction tasks, and also supports unconditional generation.

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 Machine Learning
Aug 26

Steering Recurrent Reasoners at Inference Time with Readout Feedback

arXiv:2608.24136v1 Announce Type: new Abstract: Recurrent models, which repeatedly update latent states with shared computation blocks, have emerged as powerful architectures for solving complex reas...

By Shunsuke Kamiya, Masanori Koyama, Seongcheol Jeong, Fumiya Uchiyama, Kenji Kubo, Kohei Hayashi, Masahiro Suzuki, Yutaka Matsuo
arXiv Machine Learning
Sep 14

Sampling via Decision-Flow: Training-Free Extraction of Improved Latent Reasoning Paths in Large Language Models

The paper introduces Decision-Flow Sampling (DF‑Sample), a training‑free, data‑free inference framework that builds a hierarchical reasoning tree, evaluates entire trajectories, and back‑propagates utilities to guide branching decisions. Unlike local step‑wise sampling, DF‑Sample explicitly assesses global paths, enabling it to recover high‑quality, low‑probability reasoning chains that standard decoding misses. On the GPQA benchmark, DF‑Sample attains 45.6% accuracy, outperforming power sampling (38.9%) and GRPO (39.9%) and consistently surpassing baselines across multiple models and benchmarks, demonstrating significant latent reasoning potential in pretrained LLMs.

By Zhendong Mi, Shaoyi Huang
arXiv AI
Jul 3

ThreadWeaver: Adaptive Threading for Efficient Parallel Reasoning in Language Models

arXiv:2512. 07843v2 Announce Type: replace-cross Abstract: Scaling inference-time computation has enabled Large Language Models (LLMs) to achieve strong reasoning performance, but their inherently sequential decoding incurs substantial latency, motivating parallelization of the generation process.

By Long Lian, Sida Wang, Felix Juefei-Xu, Tsu-Jui Fu, Xiuyu Li, Adam Yala, Trevor Darrell, Alane Suhr, Yuandong Tian, Xi Victoria Lin
arXiv Machine Learning
Oct 9

Generative Spatiotemporal Intent Sequence Recommendation via Implicit Reasoning in Amap

The paper introduces GPlan, a generative framework for Generative Spatiotemporal Intent Sequence Recommendation (GSISR) that integrates large language model reasoning into lightweight models. It employs Progressive Implicit CoT Distillation to compress reasoning into latent tokens for low-latency inference, and Spatiotemporal Counterfactual DPO to align plans with real-world constraints, improving sequence coherence and context responsiveness. Experiments and online A/B tests confirm the effectiveness of these techniques, and the authors provide an implementation and dataset on GitHub.

By Sicong Wang, Ruiting Dong, Yue Liu, Bowen Zheng, Jun Meng, Jie Li, Shuaijun Guo, Yu Gu, Fanyi Di, Xin Li
arXiv AI
Oct 9

From Chain-of-Thought to Loops: Non-Autoregressive Latent Reasoning via Looped Transformers

The paper introduces LLoCoT, a looped latent‑reasoning framework that replaces the traditional left‑to‑right generation of chain‑of‑thought tokens with iterative refinement of a compact latent workspace using a shared transformer. By jointly updating latent slots over a few iterations and sampling latent tokens in parallel, LLoCoT feeds these into an autoregressive decoder for answer generation. Experiments on HumanEval and MBPP show that LLoCoT matches or surpasses explicit‑CoT baselines while dramatically reducing reasoning latency and increasing throughput.

By Gerard Grau Garc\'ia, Arnau Padr\'es Masdemont, Niccol\`o Grillo, Jordi Ros-Giralt, Arash Behboodi, Victor Conchello Vendrell
arXiv AI
Sep 15

TimeThink: Eliciting Compositional Reasoning in Timeseries Large Language Models

arXiv:2609.13457v1 Announce Type: new Abstract: Timeseries multimodal large language models (TS-MLLMs) have recently begun leveraging the reasoning capabilities of large language models (LLMs) for qu...

By Sudarshan Regmi, Arvind Pillai, Yu Yvonne Wu, Yuliang Chen, Bibek Panthi, Tess Z. Griffin, Michael V. Heinz, Lisa Marsch, Nicholas C. Jacobson, Andrew Campbell
arXiv Computer Vision
Oct 5

ProAR: Learning Prospective Reasoning with Autoregressive Video Models

ProAR introduces a goal‑oriented reasoning framework for autoregressive video models, adding goal‑frame prediction via an asymmetric attention mask and future representation self‑alignment to guide intermediate states. These mechanisms combine sparse target supervision with dense step‑wise guidance, enabling coherent, goal‑directed generation while keeping computational costs modest. Experiments demonstrate consistent performance gains across visual reasoning benchmarks and training efficiency, achieving comparable results to fully trained baselines with only 25% of the training steps.

By Linghui Shen, Tinghui Zhu, Sheng Zhang, Muhao Chen