A Rolling Stone Gathers No Moss: Adaptive Policy Optimization for Stable Self-Evaluation in Large Multimodal Models

Authors

  • Wenkai Wang Zhejiang University
  • Hongcan Guo Beijing University of Posts and Telecommunications
  • Zheqi Lv Zhejiang University
  • Shengyu Zhang Zhejiang University

DOI:

https://doi.org/10.1609/aaai.v40i40.40656

Abstract

Self-evaluation, a model's ability to assess the correctness of its own output, is crucial for Large Multimodal Models (LMMs) to achieve self-improvement in multi-turn conversations, yet largely absent in foundation models. Recent work has employed reinforcement learning (RL) to enhance self-evaluation; however, its fixed reward mechanism suffers from reward hacking when optimizing multiple training objectives, leading to model collapse. In this paper we propose AdaPO, an online reinforcement learning framework capable of adaptively adjusting training objective in real time according to the current training state for each task. Specifically, to mitigate reward hacking , AdaPO introduces an Adaptive Reward Model (ARM) and a Reward Aware Dynamic KL Regularization mechanism. ARM assesses the task's training state from the distribution of model generated multi-turn trajectories' performance. Reward Aware Dynamic KL replaces a fixed penalty with dynamic coefficients which is modulated by the reward gap between different multi-turn situations. Notably, our method automatically and smoothly adjusts its learning focus based on sub-tasks' training progress without manual intervention. Extensive experiments over 8 benchmarks and various models show that our method significantly enhances both direct reasoning and self-evaluation capability.

Published

2026-03-14

How to Cite

Wang, W., Guo, H., Lv, Z., & Zhang, S. (2026). A Rolling Stone Gathers No Moss: Adaptive Policy Optimization for Stable Self-Evaluation in Large Multimodal Models. Proceedings of the AAAI Conference on Artificial Intelligence, 40(40), 33666–33674. https://doi.org/10.1609/aaai.v40i40.40656

Issue

Section

AAAI Technical Track on Natural Language Processing V