Papers › Segment Policy Optimization: Effective Segment-Level Credit Assignment in RL for Large...

Segment Policy Optimization: Effective Segment-Level Credit Assignment in RL for Large Language Models

29 May 2025arXiv:2505.23564archive 2025-07-28

Yiran Guo, Lijie Xu, Jie Liu, Dan Ye, Shuang Qiu

Enhancing the reasoning capabilities of large language models effectively using reinforcement learning (RL) remains a crucial challenge. Existing approaches primarily adopt two contrasting advantage estimation granularities: Token-level methods (e.g., PPO) aim to provide the fine-grained advantage signals but suffer from inaccurate estimation due to difficulties in training an accurate critic model. On the other extreme, trajectory-level methods (e.g., GRPO) solely rely on a coarse-grained advantage signal from the final reward, leading to imprecise credit assignment. To address these limitations, we propose Segment Policy Optimization (SPO), a novel RL framework that leverages segment-level advantage estimation at an intermediate granularity, achieving a better balance by offering more precise credit assignment than trajectory-level methods and requiring fewer estimation points than token-level methods, enabling accurate advantage estimation based on Monte Carlo (MC) without a critic model. SPO features three components with novel strategies: (1) flexible segment partition; (2) accurate segment advantage estimation; and (3) policy optimization using segment advantages, including a novel probability-mask strategy. We further instantiate SPO for two specific scenarios: (1) SPO-chain for short chain-of-thought (CoT), featuring novel cutpoint-based partition and chain-based advantage estimation, achieving $6$-$12$ percentage point improvements in accuracy over PPO and GRPO on GSM8K. (2) SPO-tree for long CoT, featuring novel tree-based advantage estimation, which significantly reduces the cost of MC estimation, achieving $7$-$11$ percentage point improvements over GRPO on MATH500 under 2K and 4K context evaluation. We make our code publicly available at https://github.com/AIFrameResearch/SPO.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2505.23564")

Code

Syntology Ran 7 of 9 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 7 ran with no contract checked.

By repository: official repository: 9 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

aiframeresearch/spo officialmentioned in papermentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 7 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7ran
2unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from AIFrameResearch/SPO. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

SavedText AIFrameResearch/SPO/src/guidance/_grammar.py official repository ran MIT (permissive) · 358e91bb94af0ba2 · report
add_spaces AIFrameResearch/SPO/src/guidance/_program.py official repository ran fingerprinted MIT (permissive) · 0751f6d65e347f7d · report
assistant AIFrameResearch/SPO/src/guidance/library/_assistant.py official repository ran MIT (permissive) · f0a41b57b2a4951a · report
await_ AIFrameResearch/SPO/src/guidance/library/_await.py official repository ran MIT (permissive) · 5e6a8e3edae86812 · report
callable AIFrameResearch/SPO/src/guidance/library/_callable.py official repository ran MIT (permissive) · 94e304b04bca6113 · report
find_func_name AIFrameResearch/SPO/src/guidance/_utils.py official repository ran MIT (permissive) · 12a84ce5d8467107 · report
load AIFrameResearch/SPO/src/guidance/_utils.py official repository ran MIT (permissive) · 41a6139f3b69cb44 · report
chain AIFrameResearch/SPO/src/guidance/_utils.py official repository unverified MIT (permissive) · 07024abd2b391cdf · report
get_logger AIFrameResearch/SPO/src/treetune/logging_utils.py official repository unverified MIT (permissive) · e635b6a7bc9b6a4f · report

Tasks

2k4kGSM8KReinforcement Learning (RL)

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

ADOPTEntropy RegularizationPPO

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections