ASPO: Asymmetric Importance Sampling Policy Optimization

Jiakang Wang, Runze Liu, Lei Lin, Wenping Hu, Xiu Li +3 more
10/7/2025
cs.CL

Official code: wizard-III/Archer2.0 (31 stars, MIT, last commit 2025-10-10).

Abstract

Recent Large Language Model (LLM) post-training methods rely on token-level clipping mechanisms during Reinforcement Learning (RL). However, we identify a fundamental flaw in this Outcome-Supervised RL (OSRL) paradigm: the Importance Sampling (IS) ratios of positive-advantage tokens are mismatched, leading to unbalanced token weighting for positive and negative tokens. This mismatch suppresses the update of low-probability tokens while over-amplifying already high-probability ones. To address this, we propose Asymmetric Importance Sampling Policy Optimization (ASPO), which uses a simple yet effective strategy that flips the IS ratios of positive-advantage tokens, aligning their update direction with the learning dynamics of negative ones. AIS further incorporates a soft dual-clipping mechanism to stabilize extreme updates while maintaining gradient flow. Comprehensive experiments on coding and mathematical reasoning benchmarks demonstrate that ASPO significantly mitigates premature convergence, improves training stability, and enhances final performance over strong GRPO-based baselines. Our analysis provides new insights into the role of token-level weighting in OSRL and highlights the critical importance of correcting IS in LLM RL. The code and models of ASPO are available at https://github.com/wizard-III/Archer2.0.

View on arXivView PDF

Code Implementations(1)

MIT

Archer2.0 evolves from its predecessor by introducing ASPO, which overcomes fundamental PPO-Clip limitations to prevent premature convergence and unlock greater RL potential.

312Shell, PythonSep 4, 20251 years agoMIT

Cite this paper

@article{wang2025aspo,
  title  = {ASPO: Asymmetric Importance Sampling Policy Optimization},
  author = {Jiakang Wang and Runze Liu and Lei Lin and Wenping Hu and Xiu Li and Fuzheng Zhang and Guorui Zhou and Kun Gai},
  year   = {2025},
  eprint = {2510.06062},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.06062v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.06062.svg)](https://codeofpaper.com/paper/2510.06062)

Discussion