让视觉模型先看全局再聚焦细节,推理更准且快97%以上。
Forest Before Trees: Latent Superposition for Efficient Visual Reasoning
- 用动态窗口对齐机制,让模型在隐空间保持全局特征的叠加态
- 在6个基准上超越强基线5.03%,推理令牌减少97%以上
- 适合需要高效高精度视觉推理的场景,如医疗影像分析
虽然思维链使大视觉语言模型具备多步推理能力,但显式文本推理因离散分词过程丢失连续视觉细节,存在信息带宽瓶颈。现有隐空间推理方法常因刚性自回归目标导致语义过早坍缩。本文提出Laser,一种通过动态窗口对齐学习(DWAL)重构视觉推理解题范式的新型方法。Laser不强制逐点预测,而是将隐状态与未来语义的动态有效窗口对齐,形成‘先见森林后见树木’的认知层级,使模型在聚焦局部细节前保持全局特征的概率叠加态。关键在于,Laser通过可解码轨迹维持可解释性,并以自精炼叠加机制稳定无约束学习。在6个基准上的大量实验表明,Laser在隐空间推理方法中达到当前最优性能,平均优于强基线Monet 5.03%。尤为突出的是,其推理令牌数减少超97%,且在分布外数据上表现出强泛化能力。
原文摘要 · Abstract (English)
While Chain-of-Thought empowers Large Vision-Language Models with multi-step reasoning, explicit textual rationales suffer from an information bandwidth bottleneck, where continuous visual details are discarded during discrete tokenization. Recent latent reasoning methods attempt to address this challenge, but often fall prey to premature semantic collapse due to rigid autoregressive objectives. In this paper, we propose Laser, a novel paradigm that reformulates visual deduction via Dynamic Windowed Alignment Learning (DWAL). Instead of forcing a point-wise prediction, Laser aligns the latent state with a dynamic validity window of future semantics. This mechanism enforces a "Forest-before-Trees" cognitive hierarchy, enabling the model to maintain a probabilistic superposition of global features before narrowing down to local details. Crucially, Laser maintains interpretability via decodable trajectories while stabilizing unconstrained learning via Self-Refined Superposition. Extensive experiments on 6 benchmarks demonstrate that Laser achieves state-of-the-art performance among latent reasoning methods, surpassing the strong baseline Monet by 5.03% on average. Notably, it achieves these gains with extreme efficiency, reducing inference tokens by more than 97%, while demonstrating robust generalization to out-of-distribution domains.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。