- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates capability fragmentation during the self-evolution of language model agents, where successive model updates may lose previously acquired capabilities, while different historical checkpoints retain complementary strengths. The authors analyze instance-level correctness transitions and parameter-response patterns across self-evolution iterations.
To recover these capabilities, the paper proposes CapDyn-Match, a response-level selection framework that chooses among outputs generated by frozen historical checkpoints. The method combines query–response representations, cross-iteration answer agreement, and a margin-based selection mechanism with a fallback to a training-derived prior.
Experiments are conducted on Agent0 and R-Zero self-evolution trajectories across 14 benchmarks covering mathematics, general reasoning, and code generation. The results show that CapDyn-Match generally improves accuracy over the latest checkpoint and several selection and model-merging baselines, with additional evaluations on held-out benchmarks and longer evolution trajectories.
Critical strengths
-
An interesting observation about capability dynamics during self-evolution. The paper provides empirical evidence that improvements in aggregate performance can mask substantial changes in instance-level correctness. The observation that different historical checkpoints retain complementary capabilities is useful for understanding the limitations of iterative model self-improvement.
-
Reasonably comprehensive empirical evaluation. The authors evaluate the proposed method across different self-evolution frameworks, multiple model configurations, and 14 benchmarks. The inclusion of baseline comparisons, ablation studies, and leave-one-dataset-out evaluations helps establish the practical effectiveness of historical response selection.
Critical weaknesses
-
Limited methodological novelty. My main concern is that the proposed CapDyn-Match framework is relatively straightforward from a methodological perspective. It essentially performs instance-level selection among responses from historical model checkpoints, using learned representation-based correctness prediction, answer agreement, and a confidence-based fallback mechanism. These are largely established techniques in model selection and ensemble learning. While their application to self-evolving agents is reasonable, I find the resulting algorithmic contribution rather incremental, without a sufficiently novel technical insight.
-
Limited incremental benefit from the proposed components and unclear practical significance. The ablation results in Table 3 show that the representation-only baseline already achieves 37.63% and 38.67% overall accuracy on Agent0 and R-Zero, compared with 37.98% and 38.76% for the full CapDyn-Match method. These relatively small improvements raise questions about the necessity and effectiveness of the additional agreement-based scoring and conservative selection mechanisms. Furthermore, the framework requires maintaining and generating responses from multiple historical checkpoints rather than consolidating the recovered capabilities into a single model. This limits its practical relevance as a solution to continual self-improvement.
Questions for authors
Please see Weaknesses
3 comments
Official Response to Reviewer PS76 (Part II)
C2: Component Contributions and Practical Significance
Response: We thank the reviewer for the careful reading. Note that Representation-only in Table 3 already includes gating and fallback, so its gap to the full method (+0.35/+0.09 pp) reflects only the agreement branch. Against Vanilla Linear, which has neither, the full method gains 0.85/1.06 pp in total (Agent0/R-Zero):
| Variant | Agent0 | R-Zero | Component Added |
|---|---|---|---|
| Vanilla Linear | 37.13 | 37.70 | – |
| Representation-only | 37.63 (+0.50) | 38.67 (+0.97) | Gating & fallback |
| CapDyn-Match (Full) | 37.98 (+0.35) | 38.76 (+0.09) | Agreement branch |
- (1) Both components yield statistically significant gains. With three iterations, query–response representations provide most of the gains, while agreement and gating add further improvements. Their paired bootstrap 95% CIs are [+0.18, +0.52]/[+0.02, +0.26] (agreement) and [+0.24, +0.76]/[+0.71, +1.23] (gating and fallback), all excluding zero.
- (2) Agreement gains grow with more candidates. Three candidates yield few agreement patterns, yet these already help: when Iter1 and Iter2 agree but Iter3 disagrees, subset accuracy rises from 18.06% to 26.19% (Agent0) and from 19.59% to 26.14% (R-Zero) (
Table 7). With six candidates (Qwen3-1.7B), agreement improves over Representation-only by +0.72 pp (nested CV) and +0.99 pp (LODO), with gains on all 14 held-out benchmarks (§4.4;Appendix F.7,Tables 15–16). - (3) Practical significance. Please see our response to C3 for a detailed discussion of inference cost and single-model consolidation.
In summary, agreement and gating each add significant gains on top of a strong representation-based scorer, and agreement becomes more useful as more candidates are available.
C3: Practical Significance and Single-Model Consolidation
Response: We thank the reviewer for this suggestion and agree that single-model consolidation is a valuable direction. Our work focuses on inference-time recovery: CapDyn-Match reuses existing historical checkpoints via a lightweight selection module, without modifying the base model. Parameter-level consolidation can follow as a subsequent stage; the two are complementary rather than contradictory.
- (1) Practical value. CapDyn-Match requires no additional training beyond lightweight probes, yet outperforms the best single iteration by 2.90/2.34 pp (Agent0/R-Zero;
Table 3). The cost is extra inference resources: 4 GPUs instead of 1, with median latency rising from 4.36 s to 5.52 s (Table 5). It thus suits settings where checkpoints are available and parallel inference is affordable. - (2) Comparison with parameter merging. CapDyn-Match outperforms Model Soup by 2.28/2.79 pp and TIES by 3.48/2.73 pp (
Table 3). This matches our finding that Gain and Damage instances are hard to separate in parameter space (Appendix D.1,Figure 7), so direct merging cannot reliably keep beneficial updates while discarding harmful ones. - (3) Toward single-model consolidation. Response-level selection can also supply targeted training data for consolidation. Since CapDyn-Match needs no ground-truth labels at inference, it can select responses on unlabeled data, which can then serve for SFT or distillation into a single model.
We acknowledge that CapDyn-Match does not yet achieve single-model consolidation and relies on parallel inference resources. Nevertheless, it delivers immediate gains and lays a data foundation for future consolidation.
Kind Reminder: Discussion Period Ends Today
Dear Reviewer PS76,
We apologize for writing again. The discussion period ends today, so we wanted to send one final reminder in case our earlier message was missed.
In short, our responses address both of your main concerns:
- Methodological novelty: Our core contribution is not a new ensemble algorithm. It is the finding of historical capability fragmentation: 9.65%–12.58% of instances change correctness between adjacent iterations. We also show that this loss cannot be localized in parameter space (Gain/Damage overlap 0.78–0.80, the same as random groupings, 0.78–0.79). This is what motivates recovering capabilities at the response level. The components are also not interchangeable: query-only routing yields only +0.25 pp versus +2.55 pp for response-level representations, and majority voting trails CapDyn-Match by 2.62 pp.
- Component contributions: Representation-only in Table 3 already includes gating and fallback. Against Vanilla Linear, the full method gains +0.85/+1.06 pp, and the bootstrap 95% CIs for both the agreement and the gating components exclude zero. With six candidates, agreement adds +0.72 pp (nested CV) and +0.99 pp (LODO), with gains on all 14 held-out benchmarks.
- Practical significance: CapDyn-Match outperforms the best single iteration by 2.90/2.34 pp and beats Model Soup and TIES by 2.28–3.48 pp. Median latency rises only from 4.36 s to 5.52 s. The selected responses can also serve as training data for future single-model consolidation.
If our responses have resolved your concerns, we would be sincerely grateful if you could consider updating your score. If any questions remain, we are happy to clarify right away before the deadline.
Thank you very much for your time. Best regards, The Authors
Official Response to Reviewer PS76(Part I)
We sincerely thank you for your thorough and insightful feedback. We have carefully considered every comment and revised the manuscript accordingly. Due to space limits, the new and revised content (marked in blue) has been integrated not only into the relevant sections of the main text but also extensively into the appendix. We provide detailed point-by-point responses below.
C1: Positioning of Core Contributions
Response: We would like to clarify that the core contribution of this work does not lie in proposing a new ensemble algorithm. Rather, it lies in revealing an overlooked phenomenon in self-evolution, namely historical capability fragmentation, and in showing why such capabilities must be recovered at the response level rather than the parameter level. CapDyn-Match is a minimal sufficient instantiation for validating this finding, and its simplicity is a deliberate design choice. Specifically:
(1) A new problem finding: capabilities do not accumulate across iterations. Existing self-evolution methods adopt the latest checkpoint by default, implicitly assuming that capabilities accumulate across iterations. We find that similar aggregate accuracy conceals substantial capability turnover: 9.65%–12.58% of instances change correctness between adjacent iterations (
Appendix, Table 6), and the historical union exceeds every individual checkpoint across all 14 benchmarks (Table 1). This phenomenon has not been systematically characterized before. It shows that the bottleneck of self-evolution lies not only in acquiring new capabilities but also in retaining the ones already acquired.(2) A key technical insight: capability loss cannot be localized in parameter space. A natural approach is to identify and preserve beneficial updates at the parameter level. However, the overlap of highly responsive parameter rows between Gain and Damage instances (top-1%: 0.78–0.80) is comparable to that of random groupings (0.78–0.79), and the two groups also overlap in PCA projections (
Appendix D.1,Figure 7). Beneficial and harmful updates are thus hard to distinguish at the parameter level, which directly motivates shifting recovery to the response level. This conclusion is not presupposed by existing model selection or ensemble methods; it emerges from our analysis.(3) The design choices are not interchangeable: each component is empirically supported. If CapDyn-Match were merely a simple combination of existing techniques, replacing any component should make little difference. The experimental results show otherwise:
Table 3).These comparisons indicate that the effectiveness stems from the insight of exploiting historical complementarity at the response level, rather than from any generic component.
Moreover, CapDyn-Match freezes all historical models and trains only lightweight probes. With parallel checkpoint inference, median latency increases only from 4.36 s to 5.52 s (
Table 5), without retraining the base model or invoking a large judge model. We believe that validating a previously overlooked phenomenon with a simple mechanism, and achieving consistent gains across 14 benchmarks, itself demonstrates the value of the problem characterization.