- Rating
- 2
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes BRAID, a training-free framework that evolves the Evaluator alongside the Task Agent in self-evolving systems. The authors argue that existing approaches mainly focus on improving the Task Agent while keeping the Evaluator fixed, even though the quality of evaluation feedback can directly affect subsequent improvements. BRAID introduces an independent evolution process for the Evaluator. New Evaluator candidates are generated from previous task trajectories, feedback, and evolution histories, then selected through two mechanisms: the Interventional Reliability Gate, which checks whether evaluation judgments remain reliable under misleading labels, and Challenger Branch Realization, which tests whether an Evaluator's feedback actually leads to better Task Agent modifications. Experiments are conducted across several self-evolving frameworks, including DGM, HGM, SICA, and their variants, using Polyglot, SWE-bench Verified, and IMO-GradingBench. The results show consistent improvements in held-out task performance, with additional ablations and computational cost analyses supporting the proposed approach.
Critical strengths
-
An interesting direction for self-evolving agents. Most existing approaches focus on improving the Task Agent, while BRAID explores how the Evaluator itself can evolve to provide better feedback.
-
A reasonable approach to selecting Evaluators. Using both evaluation reliability and realized downstream utility makes sense, since accurate judgments alone do not guarantee useful feedback.
-
Consistent improvements across different settings. The experiments cover several self-evolution frameworks and three benchmarks, with BRAID improving held-out performance across all reported configurations.
-
Useful ablation studies. The comparisons with Frozen Evaluator, Reliability-only, and Utility-only variants help explain the contributions of different components. The additional experiment using the final evolved Evaluator also provides insight into how much of the improvement comes from the Evaluator itself.
-
Attention to computational cost. Evaluator evolution introduces additional computation, so it is useful that the authors report token consumption alongside search-action budgets.
Critical weaknesses
-
Limited novelty compared with existing co-evolving agent frameworks. Prior work such as RQGM and ARCO has already explored adapting evaluators alongside agents. Although BRAID introduces a different selection procedure, the distinction from these approaches could be established more clearly, particularly regarding the benefits of maintaining an independent Evaluator lineage.
-
Lack of direct comparisons with closely related approaches. The experiments mainly compare BRAID against the native self-evolving frameworks and internal ablations. Since RQGM and ARCO also study adaptive evaluation, comparisons with these methods or adaptations of their core mechanisms would help clarify BRAID's contribution.
-
The reliability criterion may not fully capture Evaluator quality. The Interventional Reliability Gate tests whether an Evaluator can resist incorrect labels, but this does not necessarily mean it can correctly diagnose task failures or provide useful feedback. Interestingly, Table 5 shows that normal-subset accuracy decreases after Evaluator evolution for both HGM and HGM-H, raising questions about the trade-off introduced by the selection criterion.
-
Computational efficiency gains depend on the evaluation setting. BRAID reduces the number of search actions required to reach shared performance targets, but its total computation can be substantially higher because of Evaluator evolution.
Questions for authors
RQGM and ARCO have already explored evolving evaluators alongside agents. Could the authors clarify what makes BRAID fundamentally different from these approaches? It would also be helpful to explain why direct comparisons with these methods were not included.
If the authors can address the weaknesses, I can consider update my score.
3 comments
Evaluator Reliability and Feedback Utility
W3: We agree that robustness to misleading labels does not fully characterize Evaluator quality. We explicitly separate Normal Score Agreement, Intervened-label Score Agreement, and Realized Downstream Utility instead of treating them as interchangeable indicators of Evaluator quality. The Interventional Reliability Gate measures how closely Evaluator scores agree with the unchanged environment outcomes when exposed labels are correct or deliberately altered. It does not directly measure whether the feedback identifies the most important failure or provides an effective modification strategy. This distinction motivates Challenger Branch Realization, which measures the actual downstream effect of the challenger's feedback.
We also clarify that the reliability metric is Normalized Score Agreement rather than exact-match accuracy, since Evaluators can assign intermediate scores even when the environment outcome is binary. Regarding the decrease in Normal Score Agreement, we evaluated independent held-out Polyglot audit records that were not used for Evaluator selection (seed 42). Normal denotes the subset whose exposed labels remain unchanged (not flipped on Polyglot) and match the true environment outcomes; Intervened-label denotes the subset whose exposed labels are deliberately altered. Unseen refers to the records' exclusion from Evaluator selection, not to whether their labels were altered. Agreement is computed against the unchanged true outcomes over all records in the respective subsets:
| Host | Normal Agreement (%) | Intervened-label Agreement (%) | Balanced Reliability (%) |
|---|---|---|---|
| HGM | 77.53 → 62.73 | 54.51 → 96.21 | 66.02 → 79.47 |
| HGM-H | 63.34 → 60.25 | 72.22 → 78.88 | 67.78 → 69.57 |
The HGM-H comparison refers to the first and last reported seed-42 Evaluator stages, ev-0015 and ev-0017. This analysis confirms that improved intervention robustness can be accompanied by lower normal-label agreement. To understand this decline, we manually examined records in the non-intervened subset where the final environment outcome was correct () but the Evaluator assigned a score below 1. We found that some evolved Evaluators penalized execution-process defects even when the submitted solution passed the environment tests.
The three-seed audit of these non-intervened subsets shows more manually verified process-induced score reductions in the later Evaluators across all six host–seed comparisons. After correcting only these verified scores to the true final-outcome labels and leaving all other scores unchanged, Normal Score Agreement is recomputed over the entire non-intervened subset, including both successful and failed task outcomes. The corrected agreement is higher for the later Evaluators than for the earlier Evaluators in all six comparisons. For example, the HGM seed-42 comparison changes from 77.53% → 62.73% before correction to 77.53% → 79.73% after correction (Table 4(b); Appendix C.4). This diagnostic correction was not used during evolution or promotion. It provides a partial explanation based on process-sensitive scoring, but the small manual audit does not rule out other judgment errors or establish that normal-condition evaluation improves overall.
We also tested the need for label intervention by removing it while retaining the rest of the selection procedure under HGM-H on Polyglot (seed 42).
| Setting | Gate Passed | CBR Success | Success Rate | WorkSet (%) | TestSet (%) |
|---|---|---|---|---|---|
| Full BRAID | 6 | 2 | 33% | 68.33 | 65.19 |
| No Intervention | 10 | 1 | 10% | 61.67 | 60.00 |
Without intervention, more challengers pass the Gate, but fewer produce successful realized branches. The lower success rate and TestSet accuracy suggest that intervention improves selection quality by reducing reliance on externally supplied labels.
To examine the Gate more directly, we also realized Task Agent branches for challengers that had originally been rejected and assessed downstream utility. The table below aggregates results across seeds 0, 42, and 2026, with 21 Gate-passed and 21 Gate-rejected challengers in total. These retrospective branches did not alter the original evolution trajectories.
| Challenger Group | Number | Mean Realized Utility | Non-positive Utility (%) |
|---|---|---|---|
| Gate Passed | 21 | 0.00962 | 57.14 |
| Gate Rejected | 21 | −0.08265 | 90.48 |
Gate-rejected challengers show substantially lower average utility and more frequent non-positive outcomes. We do not claim that label intervention by itself guarantees diagnosis quality. Its reliability constraint is complemented by the downstream utility test.
Computational Cost and Matched-Token Comparison
W4: We agree that requiring fewer search actions does not imply lower end-to-end computation cost. BRAID introduces additional Evaluator-side operations, including challenger generation, reliability evaluation, and candidate selection. Therefore, we distinguish the cost of reaching a shared performance target from the total cost of a complete evolution run. On Polyglot, we compare the search actions and cumulative tokens required for Native and BRAID to reach the same accuracy targets.
| Host | Search-Action Saving (%) | Token Saving (%) |
|---|---|---|
| HGM | 85.02 | 40.49 |
| HGM-H | 57.94 | 1.28 |
The smaller HGM-H token saving shows that the cost benefit is host dependent. BRAID reaches shared performance targets using fewer search actions, but much of this advantage is offset by Evaluator-side token consumption. Indeed, full-run HGM-H token consumption increases from 111.73M for the native host to 152.68M with BRAID.
Therefore, we added a further control to determine whether BRAID's performance gain can be explained simply by a larger total token budget. The BRAID reference run completed 800 search actions, including the budget-completion stage, and consumed 152.680M tokens. We extend Native HGM-H beyond its original 800 search actions until its total token consumption approximately matches this total.
| Setting | Search Actions | Total Tokens (M) | WorkSet (%) | TestSet (%) |
|---|---|---|---|---|
| Native HGM-H | 1,107 | 152.674 | 61.67 | 58.52 |
| HGM-H + BRAID | 800 | 152.680 | 68.33 | 65.19 |
Despite receiving 307 additional search actions, Native HGM-H remains 6.66 percentage points below BRAID on the WorkSet and 6.67 points below it on the TestSet. This comparison shows that BRAID's performance improvement in this setting cannot be explained only by greater total token consumption.
Accordingly, we do not claim that BRAID always minimizes total computational cost. Our more precise claim is that, in the reported setting, it uses a given compute budget more effectively to improve final Task Agent performance, while the amount of search- and token-efficiency benefit depends on the host and the measurement protocol.
Novelty and Baseline Comparisons
We thank the reviewer for recognizing the potential value of evaluating Evaluators through their downstream effects. We have made corresponding revisions and address the issues below.
W1: We agree that co-evolving agents and evaluation mechanisms is not unique to BRAID. RQGM and ARCO have already explored this direction, and our original contribution statement was too broad. The main differences concern how the Evaluator evolves, how it interacts with Task Agent search, and how replacement decisions are made.
ARCO jointly trains a rubric model and task policy using on-policy trajectories. BRAID instead operates without updating the underlying model parameters. It evolves an executable semantic Evaluator by modifying its instructions, tools, evaluation criteria, and diagnostic feedback strategy. RQGM is more closely related to BRAID because it also supports training-free evolution of evaluation criteria. However, RQGM couples Evaluator updates with its own epoch-based search procedure and uses ground-truth anchors and Selective Erasure to manage evaluation changes and search history. BRAID maintains an independent Evaluator evolutionary lineage alongside the host's existing Task Agent search procedure. The Evaluator can be generated, evaluated, and replaced without changing the host's parent-selection policy, search topology, or native candidate-processing rules. The benefit of this separation is architectural rather than a claim that independent Evaluator evolution is inherently superior to joint search. It allows the same evaluation-side procedure to operate with different underlying self-evolution algorithms.
BRAID also differs in the criterion used for Evaluator promotion. Grounded evaluation alone is insufficient. A challenger must first satisfy the Interventional Reliability Gate and then produce a Task Agent branch whose realized utility exceeds the incumbent's historical utility baseline. We have revised the Related Work section and contributions to reflect these distinctions. The first contribution now emphasizes the independent, training-free Evaluator lineage and compatibility with different host search procedures. The second emphasizes Evaluator promotion based jointly on reliability and realized downstream utility.
W2: We added comparisons with task-compatible adaptations of RQGM, AutoLibra, and Zhen et al. on Polyglot under approximately matched total-token budgets (seed 42). The RQGM-inspired baseline retains evaluator/task co-evolution, epoch-wise fixed Evaluators, ground-truth-anchor-based promotion, and Selective Erasure, while retaining its own search procedure. The AutoLibra-inspired baseline retains feedback grounding, behavior clustering, metric induction, and coverage/redundancy optimization, with a fixed LLM Feedback Agent replacing open-ended human feedback. The adapted Zhen baseline retains active sampling, error reflection, and iterative prompt optimization, but uses environment outcomes instead of additional human labels. We do not present an ARCO reproduction, as it requires parameter training and is not directly equivalent to these training-free adaptations.
BRAID achieves the highest WorkSet and TestSet accuracy in this comparison. Relative to RQGM-inspired evolution, it improves the final TestSet endpoint by 1.49 percentage points under nearly identical total-token consumption. This comparison provides evidence for BRAID's selection mechanism in a shared experimental setting, while the cross-host results show its compatibility with different search procedures.
[1] Zhu, Hao, et al. "AutoLibra: Agent metric induction from open-ended human feedback." International Conference on Learning Representations. 2026.
[2] Zhen, Cheng, et al. "Enhancing llm-as-a-judge through active-sampling-based prompt optimization." Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 6: Industry Track). 2025.