Skip to content
AI News HubLIVE
Original source3 min read

Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning

Summary

This paper introduces Adaptive Power-Mean Policy Optimization (APMPO), which addresses the misalignment between static policy optimization and evolving LLM reasoning capabilities through Power-Mean Policy Optimization (PMPO) and Feedback-Adaptive Clipping (FAC). Experiments on nine datasets across three reasoning tasks show APMPO outperforms state-of-the-art RLVR baselines, e.g., achieving a 3.0-point improvement in average Pass@1 on math reasoning over GRPO with Qwen2.5-3B-Instruct.

SourcearXiv Computational LinguisticsAuthor: Yiming Huang, Zhenbo Shi, Shuzheng Gao, Cuiyun Gao, Peiyi Han, Chuanyi Liu
Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2605.04066] Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning

Skip to main content

Learn about arXiv becoming an independent nonprofit.

We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate

> cs > arXiv:2605.04066

Help | Advanced Search

All fields Title Author Abstract Comments Journal reference ACM classification MSC classification Report number arXiv identifier DOI ORCID arXiv author ID Help pages Full text

Search

GO

quick links

Login

Help Pages

About

-->

Computer Science > Computation and Language

arXiv:2605.04066 (cs)

[Submitted on 11 Apr 2026]

Title:Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning

Authors:Yiming Huang, Zhenbo Shi, Shuzheng Gao, Cuiyun Gao, Peiyi Han, Chuanyi Liu

View a PDF of the paper titled Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning, by Yiming Huang and 5 other authors

View PDF HTML (experimental)

Abstract:Reinforcement Learning with Verifiable Rewards (RLVR) is an essential paradigm that enhances the reasoning capabilities of Large Language Models (LLMs). However, existing methods typically rely on static policy optimization schemes that misalign with the model's evolving reasoning capabilities. To address this issue, we propose Adaptive Power-Mean Policy Optimization (APMPO), which comprises two main innovations: Power-Mean Policy Optimization (PMPO) and Feedback-Adaptive Clipping (FAC). Specifically, PMPO introduces a generalized power-mean objective. This enables the model to adaptively transition from the signal-amplifying behavior of the arithmetic mean to the consistency-enforcing behavior of the geometric mean. FAC adaptively adjusts clipping bounds based on real-time reward statistics to overcome the limitations of static mechanisms. Capitalizing on these innovations, APMPO improves learning dynamics and reasoning performance. Extensive experiments on nine datasets across three reasoning tasks showcase the superiority of APMPO over state-of-the-art RLVR-based baselines. For instance, APMPO boosts the average Pass@1 score on mathematical reasoning benchmarks by 3.0 points compared to GRPO when using Qwen2.5-3B-Instruct.

Comments: Accepted to ACL 2026 (Findings)

Subjects:

Computation and Language (cs.CL); Emerging Technologies (cs.ET); Machine Learning (cs.LG)

Cite as: arXiv:2605.04066 [cs.CL]

(or arXiv:2605.04066v1 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2605.04066

Focus to learn more

arXiv-issued DOI via DataCite

Submission history

From: Yiming Huang [view email] [v1] Sat, 11 Apr 2026 07:34:59 UTC (868 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning, by Yiming Huang and 5 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.CL

new | recent | 2026-05

Change to browse by:

cs cs.ET cs.LG

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

export BibTeX citation Loading...

BibTeX formatted citation

×

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

About

Help

contact arXivClick here to contact arXiv Contact

subscribe to arXiv mailingsClick here to subscribe Subscribe

Copyright

Privacy Policy

Web Accessibility Assistance

arXiv Operational Status

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • APMPO comprises PMPO, which uses a generalized power-mean objective to adapt optimization behavior, and FAC, which adjusts clipping bounds based on real-time reward statistics.
  • It surpasses existing methods on nine datasets spanning math, symbolic, and commonsense reasoning.
  • The work has been accepted to ACL 2026 Findings.

Highlights and analysis are generated automatically and may contain errors. Check the original source.