A general optimization framework for mapping local transition-state networks
Qichen Xu, Anna Delin
TL;DR
The paper introduces MOTO, a general three-layer optimization framework to map local transition-state networks around a minimum by jointly exploring diverse initial guesses, locating index-1 saddles via a bilayer minimum-mode approach, and certifying connectivity with a deterministic bidirectional descent. The method leverages Hessian-vector products to estimate the lowest-curvature subspace with Krylov solvers, dramatically reducing memory and compute relative to explicit-Hessian approaches while maintaining accuracy, and combines this with a multi-objective NSGA-II explorer to maximize diversity and separability of the minimum-mode directions. Applied to a DFT-parameterized Pd/Fe/Ir(111) spin model and a Cartesian Ni(111) heptamer benchmark, MOTO reconstructs rich local networks including meron/antimeron–mediated mechanisms, boundary-defect–driven charge changes, and canonical rearrangements, demonstrating up to 32 pathways between topological states and successful transfer across domains. The framework’s generality, robustness, and compatibility with existing TS-search paradigms offer a scalable path to mechanism-aware landscape maps for complex materials and can support downstream kinetic modeling, catalyst design, and spintronics applications with reduced resource requirements.
Abstract
Understanding how complex systems transition between states requires mapping the energy landscape that governs these changes. Local transition-state networks reveal the barrier architecture that explains observed behaviour and enables mechanism-based prediction across computational chemistry, biology, and physics, yet current practice either prescribes endpoints or randomly samples only a few saddles around an initial guess. We present a general optimization framework that systematically expands local coverage by coupling a multi-objective explorer with a bilayer minimum-mode kernel. The inner layer uses Hessian-vector products to recover the lowest-curvature subspace (smallest k eigenpairs), the outer layer optimizes on a reflected force to reach index-1 saddles, then a two-sided descent certifies connectivity. The GPU-based pipeline is portable across autodiff backends and eigensolvers and, on large atomistic-spin tests, matches explicit-Hessian accuracy while cutting peak memory and wall time by orders of magnitude. Applied to a DFT-parameterized Néel-type skyrmionic model, it recovers known routes and reveals previously unreported mechanisms, including meron-antimeron-mediated Néel-type skyrmionic duplication, annihilation, and chiral-droplet formation, enabling up to 32 pathways between biskyrmion (Q=2) and biantiskyrmion (Q=-2). The same core transfers to Cartesian atoms, automatically mapping canonical rearrangements of a Ni(111) heptamer, underscoring the framework's generality.
