- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a network architecture that takes an initial atomic conformation as input and outputs an adjusted atomic conformation, passing it through a filter to obtain a more reasonable initial search solution. This is then further fed into a subsequent Dimer search algorithm to obtain the final balanced conformation. The authors claim that their method achieves higher coverage and reduces the computational cost of the Dimer search.
Critical strengths
- This paper proposes an accelerated Dimer search scheme that preprocesses the initial condition by adjusting the positions of atoms to the corresponding saddle point configurations. This idea is correct.
Critical weaknesses
-
This method lacks any novelty; many previous papers have already explored this idea, and the network architecture is also unoriginal. This paper simply uses a different dataset. For example, the following papers have already proposed similar ideas: Peterson, Acceleration of saddle-point searches with machine learning (2016) Xu & Delin, A general optimization framework for mapping local transition-state networks (2026)
-
The experimental design is unfair; the number of input conformations is 96 vs. 80, and the number of steps is also different. How can you prove that your 77.20% and 75.73% and the 2.7x speedup are correct?
-
Lack of multi-random seed experiments
Questions for authors
- The issue of inconsistent input conformation numbers needs a more detailed explanation, or additional experiments should be conducted. Furthermore, the analysis of convergence steps could be more detailed. The multi-random seed experiment needs to be supplemented.
3 comments
We understand the motivation for comparing the methods at the level of their overall search workflows. A description such as “preparing inputs for a subsequent numerical search” captures a method’s position in that workflow, but leaves its prediction target, supervision, and learning mechanism unspecified. At this level of abstraction, substantively different methods can share the same description; treating that common description as sufficient evidence that the contribution has already been made would risk overlooking methodological innovations within an established computational workflow.
We describe the novelty of our work at the following levels. We fully recognize the foundations provided by prior saddle-search research and existing ML architectures. We do not claim to have introduced set prediction, equivariant learning, or matching as basic ideas. Our contribution is to establish the ASPIRE proposal-and-refinement framework for the computationally expensive discovery of multiple unknown transition events from a single initial state in highly symmetric crystalline environments. This framework translates an open-ended physical search problem into a clearly defined multi-saddle configuration set prediction task. Building on this formulation, we identify a structural connection to established set prediction ideas and adapt them to the distinctive requirements of three-dimensional atomic geometry.
The cited saddle-search studies do not propose our saddle-configuration set prediction method, while the original studies introducing the relevant ML components do not establish a solution framework for this open-ended multi-saddle discovery problem, develop the corresponding task-specific adaptations, or provide the knowledge and experience gained from adapting and applying those components in this setting. Their existence demonstrates the scientific computing and ML foundations on which our work builds; it does not establish that the cross-domain connection, specific problem formulation, and task-specific adaptations developed here have already been explored.
Q1/W2. Number of evaluated input configurations
Response. We respond by describing the two evaluation settings. We evaluate both event coverage and force-evaluation cost on the full test set of 200 initial configurations. Force calls quantify the computational cost of physical refinement after candidate prediction, allowing us to focus on how the method works: how predictions close to saddle points reduce the cost of the subsequent physical search. It is also an experiment that can help distinguish the difference between how our method and the work that the reviewer mentioned above works. We conduct a larger-scale empirical evaluation of this specific mechanism across the full test set.
The 50-configuration wall-clock study serves a complementary purpose. Since these methods are not mutually exclusive and can be used together, this comparison primarily aims to identify their respective advantages and trade-offs, providing a basis for choosing or combining them. Such measurements require fixed hardware allocations, and evaluating multiple methods involves substantial runtime. We therefore supplement the full-set event-recovery and force-cost evaluation with wall-clock comparisons of multiple methods on a shared set of 50 configurations. This keeps both the input configurations and hardware resources consistent while providing evidence on practical runtime and complementary event discovery. The full-set recovery and force-cost results are reported in Section 5.3, and the 50-configuration wall-time and complementarity results are reported in Section 5.5 of the revised manuscript.
Q1/W3. Evaluation across random seeds
Response. We have completed three additional independent Random Dimer runs, varying the seeds that control random initialization of the search starts on the same 200 evaluation configurations, while keeping the search budget, Dimer cap, and reference catalogue unchanged. Full run-level results and seed-to-seed uncertainty estimates are reported in Section 5 of our common response, “Random Dimer Initialization Seeds and Uncertainty Intervals”. The summary statistics include the original run and the three additional runs. These statistics characterize the variability of the Random Dimer baseline under different search initializations. We retain the original run in the main comparisons.
Reviewer 4 — q1my
W1. Related work, method positioning, and novelty
Response. We thank the reviewer for suggesting these two related studies. We have cited and discussed Peterson (2016) and MOTO (Xu and Delin, 2026) in the “Rare-event simulation, saddle search, and reuse” paragraph of Related Work in the revised manuscript. Below, we respond by examining the specific content of these studies.
The similarities between these studies and ASPIRE are largely confined to the highly abstract goal of improving saddle-search efficiency. Their specific problem settings, the tasks assigned to machine learning, and their optimization mechanisms differ substantially from ours. This limited commonality at an abstract level is therefore insufficient to establish that prior work has already proposed our saddle-configuration set prediction problem and the corresponding method.
First, Peterson (2016) primarily studies accelerating NEB-based saddle-point searches through a learned potential energy surface, which differs from the problem considered here. NEB requires predefined initial and final states. Our task is to discover multiple potential saddle points from a single metastable atomic configuration, without knowing the final states or the number of possible transition events. The ML model in Peterson’s work approximates the potential energy surface to reduce the cost of energy evaluations during subsequent numerical optimization; it does not learn to predict target saddle-point configurations. This also differs from the preprocessing of search starting points described in the review. Thus, although both approaches use ML to assist saddle-point searches, this work does not establish a precedent for the open-ended, ML-based saddle-configuration set prediction formulation adopted in ASPIRE.
Second, MOTO, proposed by Xu and Delin (2026), is closer to our work in addressing open-ended multi-saddle discovery, but its optimization strategy is also distinct. MOTO uses NSGA-II-based, multi-objective, non-learning online numerical optimization to optimize local perturbations applied to a reference stable configuration, so that the perturbed configurations have more favorable properties for subsequent searches. Its objectives primarily concern diversity, physical feasibility, and minimum-curvature-mode separability, aiming to improve the efficiency and coverage of subsequent minimum-mode-following searches. This is a non-learning optimization strategy, rather than an ML method trained with reference saddle configurations to directly predict target saddle geometries. MOTO improves open-ended saddle searches by optimizing perturbations; our model learns target configurations under reference-saddle supervision. The two approaches therefore use different optimization mechanisms.
Describing ASPIRE primarily as preprocessing or optimizing the initial configurations for Dimer searches does not fully capture the task performed by the ML model. In the computational workflow, the predicted configurations indeed serve as inputs to subsequent Dimer refinement. However, defining the method solely by this interface overlooks its direct prediction target. ASPIRE does not train a model to find perturbations that merely provide more favorable starting points for Dimer. It uses the complete atomic displacement fields of reference saddle points as supervision, directly learning a mapping from a single initial atomic configuration to multiple potential saddle-point configurations, with set matching supporting joint prediction of multiple events.
In other words, our objective is for the ML model to perform a substantial part of candidate saddle-configuration discovery, followed by Dimer refinement and validation on the original physical potential energy surface, rather than relying primarily on Dimer to discover the target saddles from optimized perturbations. This decomposition also underlies ASPIRE’s theoretical motivation: the local convergence properties of refinement connect ML-based candidate geometry prediction with the accuracy requirements of physical saddle-point calculations. Therefore, although these approaches may ultimately invoke numerical saddle-search algorithms, similar downstream interfaces do not imply identical problem definitions, learning objectives, or optimization mechanisms.