- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
SCS shares outcome-based advantages among corresponding mathematical segments in independently sampled solutions. A frozen encoder identifies related segments, and rewards from their source responses are pooled to update the matched token spans. The method improves average accuracy over Dr.GRPO across three 1.7B runs and in an additional 4B comparison. A within-response shuffling control supports the usefulness of applying shared credit to its original matched locations.
Critical strengths
-
S1. Reusing completed solutions to improve local feedback is an appealing idea. The method preserves independent sampling and does not require extra continuations or process-level labels.
-
S2. Three training runs, consistent paired improvements, and the assignment-shuffling control provide credible evidence that the method helps in the tested setting.
-
S3. The paper reports costs, imperfect matches, and the limited fraction of tokens whose advantages change. This makes the contribution easier to assess and avoids presenting approximate semantic matching as exact equivalence.
Critical weaknesses
- W1. The contribution of SCS's mathematical-correspondence mechanism is not sufficiently isolated from post-rollout advantage sharing itself. The Dr.GRPO comparison shows the benefit of introducing local advantage sharing, and SCS-shuffle provides evidence that pooled credit is more effective when applied to its semantically matched locations. However, neither comparison isolates what the proposed correspondence construction—particularly the use of preceding context and normalized mathematical representations—adds over a simpler segment-matching scheme. This distinction is important because the paper explicitly builds on prior post-rollout advantage sharing, while the main methodological novelty lies in how local mathematical correspondence is established. A controlled ablation that keeps candidate selection, clustering, and the advantage-sharing rule fixed but simplifies the matching representation, for example by using only the current raw segment without preceding context or normalized mathematical fields, would more directly establish the contribution of the proposed correspondence design.
The relationship to prior cross-trajectory grouping methods could also be clarified. In particular, GiGPO (NeurIPS 2025, Sections 4.2–4.3) similarly constructs local groups from completed trajectories without requiring additional rollouts, but is not discussed in Related Work or Table 3. GiGPO groups repeated environment states and compares action returns within those states, whereas SCS groups approximately corresponding mathematical segments and shares coefficients using terminal outcomes relative to a question-level reference. These are substantive differences, so GiGPO is not necessarily a directly interchangeable baseline; nevertheless, explicitly positioning SCS relative to this line of work would make the novelty boundary clearer.
- W2. The semantic correspondence at the core of SCS lacks direct validation of whether grouped segments are sufficiently compatible to share credit. Downstream gains, the assignment-shuffling control, and outcome-prediction diagnostics provide useful evidence, but do not measure matching precision or the prevalence of mathematically incompatible pairs. Figure 4(b) makes the concern concrete: a valid rearrangement and a wrong-sign equation enter the same cluster, weakening the negative coefficient on the erroneous equation. The paper openly acknowledges such mismatches and correctly limits the interpretation of its leave-one-out diagnostic; nevertheless, the frequency and training relevance of these errors remain unknown. Because grouping changes policy-gradient coefficients, a small contextual matching-quality evaluation is needed to assess the reliability of the mechanism, rather than relying only on aggregate performance and terminal-outcome predictiveness.
Questions for authors
-
Q1. Could the authors include GiGPO in Related Work and Table 3 and explain the differences in grouping units, local reference, and advantage construction? An empirical GiGPO-style comparison would be useful only if states and actions can be defined fairly in this mathematical setting; otherwise, a clear methodological comparison would suffice to establish the boundary. Q2 asks for a directly applicable control of the correspondence design.
-
Q2. How much of the improvement remains if the frozen encoder receives only the current raw segment, without the preceding context or normalized mathematical fields, while keeping candidate selection, clustering, and the advantage-sharing rule unchanged?
-
Q3. Could the authors evaluate matching quality on a representative sample of accepted pairs, with the preceding context available to annotators? Distinguishing compatible derivations from surface similarity and incompatible equations, and reporting how often mismatches actually change advantages, would directly complement the outcome-prediction diagnostic. Exact textual identity or universal mathematical equivalence need not be the criterion.
-
Q4. How sensitive is SCS to , , and ? In particular, beyond limiting replacement to matched spans, what supports fixing rather than retaining some response-level credit? A small sensitivity study could show how these choices affect matching coverage, precision, and downstream performance, especially in the presence of the recorded mismatches.
-
Q5. Which kinds of mathematical problems or recurring derivations benefit most from sharing? Given that only a small fraction of tokens receive changed advantages, representative successful cases could help explain where those local changes produce the observed gains.