用离散符号化潜变量提升推理效率与可解释性
Why Struggle with Continuous Latents? Interpretable Discrete Latent Reasoning via Rendered Compression

- 将连续潜变量转为可解释的离散符号,通过图像渲染实现压缩映射
- 在多个基准上实现最高20倍的推理序列压缩,性能超越现有基线
- 适合追求高效且透明推理过程的研究者和部署场景
大型语言模型通过显式思维链和强化学习实现高推理性能,但需长输出序列和较长推理时间。潜变量推理通过将计算移入潜空间降低开销,但连续潜变量方法训练困难,推理轨迹不稳定且不可解释。我们指出问题根源在于连续空间推理与离散符号监督之间的不匹配——连续状态缺乏逐步对齐的显式锚点。为此,我们提出首个将连续潜变量转化为显式离散符号的方法:离散潜变量推理(DLR)。受渲染压缩启发,我们将思维链文本转为图像,提取视觉特征,并通过聚类微调构建离散潜变量词表。扩展词表与输出头后,支持自然语言与潜变量符号的统一自回归建模,兼容预训练对齐、监督微调与强化学习。在五个推理基准及两个模型系列(Qwen3-VL 和 LLaMA-3)上的实验表明,DLR 在推理序列压缩上最高达20倍,且保留了可解释的语义结构。总体而言,离散潜变量为高效、可控、可解释的潜变量推理提供了坚实基础。
原文摘要 · Abstract (English)
Large language models achieve high reasoning performance via explicit chain-of-thought and reinforcement learning, but require long output sequences and extended inference time. Latent reasoning reduces this cost by shifting computation into a latent space; however, continuous latent methods are hard to train, suffering from unstable and uninterpretable reasoning trajectories. We argue these issues stem from a misalignment between continuous-space reasoning and discrete symbolic supervision, as continuous states lack explicit anchors for step-by-step alignment. To resolve this, we propose \textbf{Discrete Latent Reasoning~(DLR)}, the first method that converts continuous latent states into explicit discrete tokens. Inspired by render-based compression, we render textual chains of thought into images, extract visual features, and construct a discrete latent vocabulary via clustering-based fine-tuning. Expanding the vocabulary and output head enables standard autoregressive modeling over both natural language and latent tokens, supporting pretraining alignment, SFT, and RL. Experiments on five reasoning benchmarks and two model series~(Qwen3-VL and LLaMA-3) confirm that \textbf{DLR} outperforms prior latent reasoning baselines with up to \textbf{20$\times$ compression}. Furthermore, the learned latent trajectories retain an interpretable semantic structure. Overall, discrete latent tokens provide a controllable and interpretable basis for efficient latent reasoning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。