Crystal Structure Prediction via Oblivious Local Search

03/27/2020
by   Dmytro Antypov, et al.
0

We study Crystal Structure Prediction, one of the major problems in computational chemistry. This is essentially a continuous optimization problem, where many different, simple and sophisticated, methods have been proposed and applied. The simple searching techniques are easy to understand, usually easy to implement, but they can be slow in practice. On the other hand, the more sophisticated approaches perform well in general, however almost all of them have a large number of parameters that require fine tuning and, in the majority of the cases, chemical expertise is needed in order to properly set them up. In addition, due to the chemical expertise involved in the parameter-tuning, these approaches can be biased towards previously-known crystal structures. Our contribution is twofold. Firstly, we formalize the Crystal Structure Prediction problem, alongside several other intermediate problems, from a theoretical computer science perspective. Secondly, we propose an oblivious algorithm for Crystal Structure Prediction that is based on local search. Oblivious means that our algorithm requires minimal knowledge about the composition we are trying to compute a crystal structure for. In addition, our algorithm can be used as an intermediate step by any method. Our experiments show that our algorithms outperform the standard basin hopping, a well studied algorithm for the problem.

READ FULL TEXT

page 7

page 16

research
03/11/2015

Benchmarking NLopt and state-of-art algorithms for Continuous Global Optimization via Hybrid IACO_R

This paper presents a comparative analysis of the performance of the Inc...
research
05/06/2020

Local Search is State of the Art for NAS Benchmarks

Local search is one of the simplest families of algorithms in combinator...
research
03/12/2016

Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm

We consider a multi-neighborhood local search algorithm with a large num...
research
03/29/2016

Local Search Yields a PTAS for k-Means in Doubling Metrics

The most well known and ubiquitous clustering problem encountered in nea...
research
05/05/2018

A New Perspective on Stochastic Local Search and the Lovasz Local Lemma

We present a new perspective on the analysis of stochastic local search ...
research
06/15/2022

Sparse Structure Search for Parameter-Efficient Tuning

Adapting large pre-trained models (PTMs) through fine-tuning imposes pro...
research
05/30/2011

Ethane: A Heterogeneous Parallel Search Algorithm for Heterogeneous Platforms

In this paper we present Ethane, a parallel search algorithm specificall...

Please sign up or login with your details

Forgot password? Click here to reset