Massively parallel fitting of Gaussian approximation potentials

نویسندگان

چکیده

Abstract We present a data-parallel software package for fitting Gaussian approximation potentials (GAPs) on multiple nodes using the ScaLAPACK library with MPI and OpenMP. Until now maximum training set size GAP models has been limited by available memory single compute node. In our new implementation, descriptor evaluation is carried out in parallel no communication requirement. The subsequent linear solve required to determine model coefficients parallelised ScaLAPACK. Our approach scales thousands of cores, lifting limitation also delivering substantial speedups. This development expands applicability more complex systems as well opening up opportunities efficiently embedding within higher-level workflows such committee or hyperparameter optimisation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Massively parallel approximate Gaussian process regression

We explore how the big-three computing paradigms—symmetric multi-processor (SMP), graphical processing units (GPUs), and cluster computing—can together be brought to bear on large-data Gaussian processes (GP) regression problems via a careful implementation of a newly developed local approximation scheme. Our methodological contribution focuses primarily on GPU computation, as this requires the...

متن کامل

A Parallel Quasi-Newton Method for Gaussian Data Fitting

We describe a parallel method for unconstrained optimization based on the quasi-Newton descent method of Broyden, Fletcher, Goldfarb, and Shanno. Our algorithm is suitable for both single-instruction and multiple-instruction parallel architectures and has only linear memory requirements in the number of parameters used to ®t the data. We also present the results of numerical testing on both sin...

متن کامل

Massively Parallel Approximation Algorithms for the Traveling Salesman Problem

The traveling salesman problem (TSP) describes a salesman who needs to travel through a list of given cities exactly once by taking the shortest possible tour. The problem is NP-Complete since there are no known polynomial time algorithms to solve it. The main motivation to solve this problem is that the applications of Traveling Salesman are immense. It can be used by banks to find an optimal ...

متن کامل

A parallel hybrid optimization algorithm for fitting interatomic potentials

In this work we present the parallel implementation of a hybrid global optimization algorithm assembled specifically to tackle a class of time consuming interatomic potential fitting problems. The resulting objective function is characterized by large and varying execution times, discontinuity and lack of derivative information. The presented global optimization algorithm corresponds to an irre...

متن کامل

Massively Parallel Execution Model and Massively Parallel Architecture

The purposes for the research and development of the RWC massively parallel computer project are (1) to e ciently support exible and integrated computation which are research targets in RWC Project, and (2) to pursue a general purpose massively parallel system e ciently supporting multiple programming paradigms, and (3) to realize a stand{alone system which has a mature operating system. For th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine learning: science and technology

سال: 2023

ISSN: ['2632-2153']

DOI: https://doi.org/10.1088/2632-2153/aca743