Hyperspatial optimisation of structures

Abstract

Anticipating the low energy arrangements of atoms in space is an indispensable scientific task. Modern stochastic approaches to searching for these configurations depend on the optimisation of structures to nearby local minima in the energy landscape. In many cases these local minima are relatively high in energy, and inspection reveals that they are trapped, tangled, or otherwise frustrated in their descent to a lower energy configuration. Strategies have been developed which attempt to overcome these traps, such as classical and quantum annealing, basin/minima hopping, evolutionary algorithms and swarm based methods. Random structure search makes no attempt to avoid the local minima, and benefits from a broad and uncorrelated sampling of configuration space. It has been particularly successful in the first principles prediction of unexpected new phases of dense matter. Here it is demonstrated that by starting the structural optimisations in a higher dimensional space, or hyperspace, many of the traps can be avoided, and that the probability of reaching low energy configurations is much enhanced. Excursions into the extra dimensions are progressively eliminated through the application of a growing energetic penalty. This approach is tested on hard cases for random search - clusters, compounds, and covalently bonded networks. The improvements observed are most dramatic for the most difficult ones. Random structure search is shown to be typically accelerated by two orders of magnitude, and more for particularly challenging systems. This increase in performance is expected to benefit all approaches to structure prediction that rely on the local optimisation of stochastically generated structures.

10 pages, 11 figures, Accepted Manuscript

References in corpus (16)

• Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
• CALYPSO: a method for crystal structure prediction
• Ab initio Random Structure Searching
• Molecular geometry optimization with a genetic algorithm
• High-pressure phases of silane
• Theory of Quantum Annealing of an Ising Spin Glass
• Dense Packings of the Platonic and Archimedean Solids
• Packing Hyperspheres in High-Dimensional Euclidean Spaces
• The double-funnel energy landscape of the 38-atom Lennard-Jones cluster
• Materials Cartography: Representing and Mining Material Space Using Structural and Electronic Fingerprints
• Data-driven learning of total and local energies in elemental boron
• The performance of Minima Hopping and Evolutionary Algorithms for cluster structure prediction
• A universal preconditioner for simulating condensed phase materials
• Multi-Self-Overlap Ensemble for protein folding: ground state search and thermodynamics
• Predicting interface structures: From SrTiO${}_3$ to graphene
• Power-law distributions for the areas of the basins of attraction on a potential energy landscape

Cited by in corpus (11)

• A Perspective on Conventional High-Temperature Superconductors at High Pressure: Methods and Materials
• On Machine Learning Force Fields for Metallic Nanoparticles
• Deep Learning-Enhanced Variational Monte Carlo Method for Quantum Many-Body Physics
• E(n)-Equivariant Cartesian Tensor Passing Potential
• Visualising energy landscapes through manifold learning
• Why Mercury is a superconductor
• Generating candidates in global optimization algorithms using complementary energy landscapes
• Cascading symmetry constraint during machine learning-enabled structural search for sulfur induced Cu(111)-$(\sqrt{43}\times \sqrt{43})$ surface reconstruction
• Machine-learning enabled optimization of atomic structures using atoms with fractional existence
• Atomistic Global Optimization X: A Python package for optimization of atomistic structures
• Gradient-based grand canonical optimization enabled by graph neural networks with fractional atomic existence