arXiv:2601.06993cs.CV2026-01被引 9

发现推理越长准确率越低,提出新方法提升细粒度视觉分类性能。

Can Textual Reasoning Improve the Performance of MLLMs on Fine-grained Visual Classification?

  • 通过控制推理长度缓解模型过拟合,提升判别力。
  • 在多个数据集上达到当前最佳效果,最高提升4.2%准确率。
  • 适合需要高精度视觉识别的研究者和工业应用开发者。

多模态大语言模型(MLLMs)虽具备强大通用能力,但在细粒度视觉分类(FGVC)任务上仍表现不佳,该任务需精细视觉区分且对真实场景应用至关重要。尽管链式思维(CoT)在数学和编程等任务中有效,但已有研究发现其会损害视觉感知性能。本文系统评估了CoT在零样本与多种训练范式下的表现,揭示核心矛盾:推理长度越长,分类准确率越低,此现象称为「思考代价」(Cost of Thinking)。基于此,提出两项贡献:(1) MRN,一种用于多奖励优化的即插即用归一化方法,平衡异构奖励信号;(2) ReFine-RFT,结合集成奖励与MRN,在约束推理长度的同时提供密集准确率反馈。大量实验证明该方法在主流FGVC基准上实现最佳性能,最高提升4.2%准确率。

原文摘要 · Abstract (English)

Multi-modal large language models (MLLMs) exhibit strong general-purpose capabilities, yet still struggle on Fine-Grained Visual Classification (FGVC), a core perception task that requires subtle visual discrimination and is crucial for many real-world applications. A widely adopted strategy for boosting performance on challenging tasks such as math and coding is Chain-of-Thought (CoT) reasoning. However, several prior works have reported that CoT can actually harm performance on visual perception tasks. These studies, though, examine the issue from relatively narrow angles and leave open why CoT degrades perception-heavy performance. We systematically re-examine the role of CoT in FGVC through the lenses of zero-shot evaluation and multiple training paradigms. Across these settings, we uncover a central paradox: the degradation induced by CoT is largely driven by the reasoning length, in which longer textual reasoning consistently lowers classification accuracy. We term this phenomenon the ``Cost of Thinking''. Building on this finding, we make two key contributions: (1) MRN, a simple and general plug-and-play normalization method for multi-reward optimization that balances heterogeneous reward signals, and (2) ReFine-RFT, a framework that combines ensemble rewards with MRN to constrain reasoning length while providing dense accuracy-oriented feedback. Extensive experiments demonstrate the effectiveness of our findings and the proposed ReFine-RFT, achieving state-of-the-art performance across FGVC benchmarks. Project page: \href{https://refine-rft.github.io/}{ReFine-RFT}.

细粒度分类多模态模型链式思维推理优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。