Sign inGet started
Paper · arXiv

Beyond the Mean: Multi-Moment Policy Optimization for LLM Reasoning

Reinforcement learning has become a central paradigm for improving the reasoning capabilities of large language models. Existing methods generally aim to reduce the failure probabilities induced across problems. In this paper, we introduce a moment-based perspective on policy optimization for LLM reasoning by treating the failure probability of a randomly sampled problem as a random variable and characterizing optimization objectives through its moments. Under this perspective, many existing methods optimize only a single moment of the failure-probability distribution, leaving its broader distributional structure largely uncharacterized. We propose \textbf{M}ulti-\textbf{M}oment \textbf{P...

AuthorsYijun Zhang, Yule Xie, Jiaxin Ding et al.
Primary categorycs.AI
Published3 August 2026
Last updated at source3 August 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/83b4f81f-3de1-44fd-a060-008a2e2c9a32" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.