UP: Unbounded Positive Asymmetric Optimization for Breaking the Exploration-Stability Dilemma
Published:
IS-based RL for LLM reasoning faces an exploration-stability dilemma: pure importance sampling explodes, and the clipping used to tame it ties a token’s update budget to the old policy. By formalizing the Probability Capacity and anchoring the policy to itself with a stop-gradient, Unbounded Positive Asymmetric Optimization (UP) unleashes stable, unclipped gradients for correct rollouts while keeping clipping as a safeguard for wrong ones. UP is a plug-and-play objective that improves DAPO, GRPO, and GSPO across dense, MoE, and vision-language models.