Exploring potential energy surfaces to reach saddle points above convex regions
Bibliographic record
Abstract
Saddle points on high-dimensional potential energy surfaces (PES) play a determining role in the activated dynamics of molecules and materials. Building on approaches dating back more than 50 years, many open-ended transition-state search methods have been developed to follow the direction of negative curvature from a local minimum to an adjacent first-order saddle point. Despite the mathematical justification, these methods can display a high failure rate: using small deformation steps, up to 80% of the explorations can end up in a convex region of the PES, where all directions of negative curvature vanish, while if the deformation is aggressive, a similar fraction of attempts lead to saddle points that are not directly connected to the initial minimum. In high-dimension PES, these reproducible failures were thought to only increase the overall computational cost, without having any effect on the methods' capacity to find all saddle points surrounding a minimum. Using activation-relaxation technique nouveau (ARTn), we characterize the nature of the PES around minima, considerably expanding on previous knowledge. We show that convex regions can lie on activation pathways and that not exploring beyond them can introduce significant bias in the saddle-point search. We introduce an efficient approach for traversing the convex regions, almost eliminating exploration failures, while multiplying by almost 10 the number of identified unique and connected saddle points as compared to the standard ARTn, thus underlining the importance of correctly handling convex regions for completeness of saddle point explorations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".