让视觉推理长链条更有效,突破了传统方法越长越差的瓶颈。
Self-Consistent Latent Reasoning: Long Latent Sequence Reasoning for Vision-Language Model

- 用单次生成独立视觉标记,避免逐步依赖导致信息衰减
- 推理链长度扩展30倍以上,在多个基准上领先基线14.12%
- 适合需要长序列推理和强泛化能力的视觉语言任务
在语言推理中,更长的思维链通常表现更好,这暗示视觉隐空间推理也可能受益于更长的隐序列。然而我们发现反直觉现象:现有视觉隐推理方法随着隐序列变长,性能反而系统性下降。根源在于‘信息增益坍塌’——自回归生成使每一步高度依赖前序输出,后续标记几乎无法引入新信息。我们进一步发现,作为监督目标的强池化图像嵌入(≥128×)提供的信号与无意义占位符无异。基于此,我们提出SCOLAR(Self-COnsistent LAtent Reasoning),引入轻量级解变换器,利用大语言模型全序列隐藏状态单次生成辅助视觉标记,每个标记独立锚定原始视觉空间。结合三阶段SFT与ALPO强化学习,SCOLAR将可接受的隐思维链长度扩展超30倍,在真实世界推理基准上达到开源模型最佳表现(较基线提升14.12%),并展现强大分布外泛化能力。
原文摘要 · Abstract (English)
In language reasoning, longer chains of thought consistently yield better performance, which naturally suggests that visual latent reasoning may likewise benefit from longer latent sequences. However, we discover a counterintuitive phenomenon: the performance of existing latent visual reasoning methods systematically degrades as the latent sequence grows longer. We reveal the root cause: Information Gain Collapse -- autoregressive generation makes each step highly dependent on prior outputs, so subsequent tokens can barely introduce new information. We further identify that heavily pooled ($\geq 128\times$) image embeddings used as supervision targets provide no more signal than meaningless placeholders. Motivated by these insights, we propose SCOLAR (Self-COnsistent LAtent Reasoning), which introduces a lightweight detransformer that leverages the LLM's full-sequence hidden states to generate auxiliary visual tokens in a single shot, with each token independently anchored to the original visual space. Combined with three-stage SFT and ALPO reinforcement learning, SCOLAR extends acceptable latent CoT length by over $30\times$, achieves state-of-the-art among open-source models on real-world reasoning benchmarks (+14.12% over backbone), and demonstrates strong out-of-distribution generalization.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。