paper-with-me

Papers

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

2025-08-05 · Wenkai Wang, Hongcan Guo, Zheqi Lv, Shengyu Zhang arxiv

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. We will release our code to contribute to the community.

📄 PDF Abstract BibTeX arXiv:2508.09155

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

MOSS: End-to-End Dialog System Framework with Modular Supervision

2019-09-12 · Weixin Liang, Youzhi Tian, Chengcai Chen, Zhou Yu

A major bottleneck in training end-to-end task-oriented dialog system is the lack of data. To utilize limited training data more efficiently, we propose Modular Supervision Network (MOSS), an encoder-decoder training fra…

Decoderdialog state trackingNatural Language UnderstandingText Generation

Minimax Policy for Heavy-tailed Bandits

2020-07-20 · Lai Wei, Vaibhav Srivastava

We study the stochastic Multi-Armed Bandit (MAB) problem under worst-case regret and heavy-tailed reward distribution. We modify the minimax policy MOSS for the sub-Gaussian reward distribution by using saturated empiric…

Multi-Armed Bandits

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits

2025-08-08 · Zichun Ye, Runqi Wang, Xutong Liu, Shuai Li arxiv

The combinatorial multi-armed bandit (CMAB) is a cornerstone of sequential decision-making framework, dominated by two algorithmic families: UCB-based and adversarial methods such as follow the regularized leader (FTRL) …

Meta-Reinforcement Learning Based on Self-Supervised Task Representation Learning

2023-04-29 · Mingyang Wang, Zhenshan Bing, Xiangtong Yao, Shuai Wang 외

Meta-reinforcement learning enables artificial agents to learn from related training tasks and adapt to new tasks efficiently with minimal interaction data. However, most existing research is still limited to narrow task…

Meta Reinforcement LearningMuJoCoreinforcement-learningReinforcement Learning+1

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms

2025-11-24 · Samya Praharaj, Koulik Khamaru arxiv

Statistical inference from data generated by multi-armed bandit (MAB) algorithms is challenging due to their adaptive, non-i.i.d. nature. A classical manifestation is that sample averages of arm rewards under bandit samp…