- Rating
- 2
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SCOPE, a generative optimization framework that enables generative models to continuously learn from newly discovered solutions during the search process. By incorporating these discoveries into the generative policy, SCOPE aims to progressively expand the coverage of high-quality solution regions and facilitate further exploration of promising designs.
Critical strengths
-
The paper presents an interesting perspective on the relationship between discovery and learning in generative optimization. A newly discovered solution does not necessarily imply that the generative model has adequately learned its surrounding region. By explicitly distinguishing discovery from learning, the proposed framework provides a reasonable motivation for expanding generative coverage through continued training.
-
The paper develops a comprehensive framework that integrates exploration and continual learning. It introduces a reward mechanism to encourage exploration of previously unexplored regions, together with replay-based learning and policy refinement to progressively expand the regions accessible to the generative model.
Critical weaknesses
-
The overall paradigm of generating candidate solutions, evaluating newly discovered solutions, incorporating them into model parameters through training, and iteratively improving exploration has been widely explored in LLM-based iterative optimization. Although SCOPE applies this paradigm to continuous generative models, it remains unclear what fundamentally new methodological contributions distinguish it from existing iterative optimization frameworks.
-
Although the experiments demonstrate that SCOPE can discover more qualified designs under a fixed physical evaluation budget, the framework generates a large number of candidate solutions and still requires expensive physical evaluations for the selected candidates. Moreover, the experiments primarily compare SCOPE with other generative approaches, without including conventional non-generative optimization methods, particularly quality-diversity search algorithms. Consequently, it remains unclear whether SCOPE provides a meaningful advantage in search efficiency over existing optimization methods when computational costs are taken into account.
-
Table 3 shows that SCOPE generates more distinct qualified designs than SCOPE-Uniform, but its joint success rate decreases from 59.38% to 50.00%. This suggests a potential trade-off between generation quality and diversity. It remains unclear whether SCOPE achieves broader generative coverage at the expense of generation quality, and whether this trade-off can be better balanced. A sensitivity analysis of the replay priority weight would help clarify how the proposed mechanism affects both objectives.
Questions for authors
Please see the weaknesses above.
2 comments
3.[W3] Quality–coverage trade-off and replay sensitivity
SCOPE separates feedback for learning from qualification for reporting. New discoveries receive replay priority once they satisfy equilibrium recovery and request conditions (). This retains valid intermediate discoveries as learning signals: requiring every discovery to immediately satisfy all joint-quality criteria would further sparsify exploration feedback. Quality anchors continue to support qualified generation, while persistent discovery credit keeps new regions represented in training after archive admission.
Increasing gives these discoveries more replay weight. The resulting change is visible in the number of qualified outputs () and the distinct qualified novel designs they contain ().
| Replay weight | Qualified outputs G (%) | Qualified coverage K |
|---|---|---|
| 0 (Uniform) | 147 (57.42%) | 40 |
| 2 | 131 (51.17%) | 44 |
| 4 | 126 (49.22%) | 46 |
| 16 | 131 (51.17%) | 53 |
Uniform produces more passing outputs; discovery priority produces more new qualified alternatives. At , the generator produces 131 qualified outputs containing 53 distinct novel designs, compared with 147 qualified outputs containing 40 under Uniform. Thus, the same 256 evaluations yield 13 additional distinct qualified designs (+32.5%).
This is the purpose of persistent discovery credit: to turn exploration feedback into a broader reusable repertoire. The replay weight controls how strongly learning emphasizes these discoveries, while every design counted in K satisfies the same full qualification criteria.
Thank you for the insightful comments. Below we clarify SCOPE's methodological distinction, compare search efficiency against non-generative QD, and provide the requested replay-priority sensitivity analysis.
1.[W1] Methodological distinction from LLM-based iterative optimization and archive distillation
While LLM-based iterative frameworks (e.g., FunSearch, ELM, and recent agentic stellarator optimization in Agentic Stage-One) share the high-level loop of proposal and evaluation, stellarator boundary design poses a distinct continuous-manifold challenge. In Agentic Stage-One, an LLM schedules discrete optimization stages, Fourier-mode truncations, and multi-objective proxy loss weights on top of a numerical solver—requiring repeated inner-loop MHD equilibrium solves per trajectory.
SCOPE addresses the mismatch between discovery and learning: archival novelty changes immediately, whereas incorporating a discovery into the generator requires continued training. It therefore separates current exploration rewards from persistent acquisition-time replay priority and combines them with signed feedback updates.
To isolate the benefit of this coupled online loop from post-hoc archive fitting, we compared SCOPE against two archive-distillation baselines that fine-tune the same pretrained FM for 2,048 updates on fixed valid archives (retaining quality anchors and reference regularization). Evaluated on 8 feedback requests × 32 ordinary outputs = 256 evaluations (averaging two paired seeds):
SCOPE achieves 2.18× the qualified coverage of QD-elite distillation and 31.5% more coverage than distilling its own collected feedback archive at comparable qualification, confirming the value of coupling persistent discovery weighting with online signed policy updates.
2.[W2] Comparison with non-generative QD search and computational efficiency
In stellarator design, sampling candidate boundaries from a flow model on a GPU takes seconds, whereas numerical MHD equilibrium verification (DESC; Panici et al., 2023) dominates runtime (>98% of total wall-clock cost, including candidate generation, geometric screening, physical evaluation, and policy updates). Conventional solver-based optimization must iteratively balance MHD force-balance equations against multiple competing proxy losses (quasisymmetry, magnetic well, aspect ratio, and rotational transform), making each trajectory far costlier than a single equilibrium solve. Conversely, non-generative black-box search via direct geometric perturbation avoids inner-loop solver gradients but frequently violates MHD equilibrium or request tolerances, wasting expensive evaluations.
By learning from validated feedback to refine the proposal distribution, SCOPE makes single-point physical evaluations highly productive. We compared SCOPE against domain-adapted MAP-Elites with Iso+LineDD under the exact same physical-quality gates, geometric discovery rules, and 2,048-evaluation ceiling over eight rounds (two paired runs):
With only 8.4% additional total time, SCOPE delivers 4.9× higher search candidate qualification (Fraction of all evaluated candidates that qualify) and 20.8× as many qualified discoveries—reducing the computational cost per qualified discovery by 19.2× (104 s vs. 1,993 s) while simultaneously producing a fast, reusable conditional generator.