- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper develops a probability-spectrum account to analyse what capability changes can be justified by finite rollout evaluations from model checkpoints before and after RLVR. The analysis connects support transport, Hausdorff moment represetation, finite-prefix partial identification, sementic coarsening, simultaneous probability-change regions with a measurd bridge gap。
Critical strengths
- This paper separates uniform finite-sample non-testability and finite-prefix partial identification.
- This paper theoretically proves that the infinite discovery sequence identifies the positive mode-mass spectrum up to mode labels.
- This paper reveals the "budget crossover" phenomenon and theoretically demonstrates that coverage is Schur-concave in mode masses.
Critical weaknesses
- The author should explain more clearly the conceptual difference between their proposed finite-prefix partial identification and Hausdorff relaxation, and the existing unseen-species estimation and partial identification literature reviewed in Section 2.
- The author should evaluate whether the Hausdorff-relaxation bounds still remain useful when the prefix moments are estimated from finite neural rollouts with sampling noise, rather than being computed from exact analytic prefixes as in Table 3.
- The author should clarify the conceptual gap between the within-prompt semantic mode coverage defined in Section 3 and the across-problem level evaluation used for the DeepScaleR budget crossover.
Questions for authors
- What does verified full-softmax sampler refer to, the assumption in Appendix C.3 or a particular executable sampler discussed in Appendix M.2?
- How does the DeepScaleR budget crossover change when the 2048-token cap is varied, and how many responses from each checkpoint are truncated?
Thank you for the positive assessment of the non-testability / partial-identification split, the spectrum identification result, and the budget crossover.
W1. Relation to unseen-species estimation and partial identification.
We will add this comparison to Sec. 2.
W2. Bounds when prefix moments come from noisy neural rollouts.
Theorem 4.4 takes moment intervals [ℓ_k, u_k], not exact values. App. F.7 builds these intervals from simultaneous bands on the observed coverage curve, so the bound stays valid at the same confidence level. We ran this on real neural rollouts (MATH-500 for both lineages, and the controlled panel). We estimated the prefix from a random quarter of the rollouts and bounded the curve at the full budget. The bound contained the held-out value in every resample. Its upper extent beyond the sample is governed by rare unseen mass, which Theorem 4.1 shows no finite budget can exclude, and the set reports this directly. Manuscript revision: the real-rollout check now appears next to the exact certificate in App. F.
W3. Within-prompt mode coverage vs. the across-problem DeepScaleR crossover.
Both use the same functional, C_K = Σ_a H_K(p_a) with H_K(p) = 1 − (1 − p)^K, on different atom spaces. Within a prompt, the atoms are successful semantic modes, and C_K counts the modes exposed by K attempts. On MATH-500, each problem has one success cell, and the average first-hit curve is the expected fraction of problems solved by budget K. The concentration argument of Theorem 4.5 applies at both levels: RL can concentrate probability among semantic modes within a prompt, or spread success probability more unevenly across problems, and either can raise one-shot success while lowering large-budget coverage. Propositions 4.6–4.7 describe how merging atoms changes flow and coverage, and the controlled panel reports the fine and coarse levels on the same rollouts (Observation 3). We will state this link in Sec. 3.
Q1. What does "verified full-softmax sampler" refer to?
Both, in two roles. App. C.3 states the condition: finite logits and no vocabulary truncation give every finite token sequence positive probability. App. M.2 explains why an executable sampler with exact zeroing (nucleus, top-k, filters) can break this. "Verified" refers to the sampling configuration that produced our data, recorded in App. P: top-p = 1, no top-k, no repetition penalty, and a shared tokenizer within each pair. This configuration applies no vocabulary truncation, so with finite logits the C.3 condition holds. An explicit witness response within the length cap, for every registered mode and for every MATH problem, then has positive probability at both checkpoints. We will state this configuration and its consequence in one sentence in the main text.
Q2. The 2048-token cap and truncation.
The cap is one coordinate of the registered sampling law, λ_math = (T = 1, top-p = 1, L_max = 2048) (App. P). Both checkpoints use the same cap and the same scoring rule: a response that reaches the cap is scored from any boxed answer it already contains, and otherwise counts as a failure.
The crossover theorem is stated for a fixed law. Changing the cap changes the mass vector, just as changing the temperature does, and the same procedure then reports the curve for that law. This is the paper's claim: capability rankings are indexed by sampler and budget, and the cap is part of the sampler. Under the registered law, the DeepScaleR reversal is certified by the curvewise band, and it is certified again when top-p changes to 0.9 (App. W, Table 20). At this cap the observed truncation rates are 62.0% (base) and 63.9% (RL). Manuscript revision: these per-checkpoint counts are now reported in App. P.