Crystal structure prediction using neural network potential and age-fitness Pareto genetic algorithm

• URL: http://arxiv.org/abs/2309.06710v1
• Date: Wed, 13 Sep 2023 04:17:28 GMT
• Title: Crystal structure prediction using neural network potential and age-fitness Pareto genetic algorithm
• Authors: Sadman Sadeed Omee, Lai Wei, Jianjun Hu
• Abstract summary: We introduce a novel algorithm for crystal structure prediction (CSP) It combines a multi-objective genetic algorithm (MOGA) with a neural network inter-atomic potential (IAP) model to find energetically optimal crystal structures. Compared to GN-OA, it demonstrated significantly better predictive capabilities, outperforming by a factor of $2.562$ across $55$ diverse benchmark structures.
• Score: 3.660182910533372
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: While crystal structure prediction (CSP) remains a longstanding challenge, we introduce ParetoCSP, a novel algorithm for CSP, which combines a multi-objective genetic algorithm (MOGA) with a neural network inter-atomic potential (IAP) model to find energetically optimal crystal structures given chemical compositions. We enhance the NSGA-III algorithm by incorporating the genotypic age as an independent optimization criterion and employ the M3GNet universal IAP to guide the GA search. Compared to GN-OA, a state-of-the-art neural potential based CSP algorithm, ParetoCSP demonstrated significantly better predictive capabilities, outperforming by a factor of $2.562$ across $55$ diverse benchmark structures, as evaluated by seven performance metrics. Trajectory analysis of the traversed structures of all algorithms shows that ParetoCSP generated more valid structures than other algorithms, which helped guide the GA to search more effectively for the optimal structures

Related papers

• Polymorphism Crystal Structure Prediction with Adaptive Space Group Diversity Control [2.981139602986498]
  Crystalline materials can form different structural arrangements (i.e. polymorphs) with the same chemical composition.<n>We propose a multi-objective genetic algorithm for polymorphism CSP that incorporates an adaptive space group diversity control technique.<n>ParetoCSP2 achieves excellent performance in polymorphism prediction, including a nearly perfect space group.
  arXiv  Detail & Related papers  (2025-06-12T22:08:35Z)
• Understanding Inverse Reinforcement Learning under Overparameterization: Non-Asymptotic Analysis and Global Optimality [52.906438147288256]
  We show that our algorithm can identify the globally optimal reward and policy under certain neural network structures. This is the first IRL algorithm with a non-asymptotic convergence guarantee that provably achieves global optimality.
  arXiv  Detail & Related papers  (2025-03-22T21:16:08Z)
• Automatic Structural Search of Tensor Network States including Entanglement Renormalization [0.0]
  Network states, including entanglement renormalization, can encompass a wider variety of entangled states. A proposal has yet to show a structural search of ER due to its high computational cost and the lack of flexibility in its algorithm. In this study, we conducted an optimal structural search of TN, including ER, based on the reconstruction of their local structures with respect to variational energy.
  arXiv  Detail & Related papers  (2024-05-10T15:24:10Z)
• Continuous Cartesian Genetic Programming based representation for Multi-Objective Neural Architecture Search [12.545742558041583]
  We propose a novel approach for designing less complex yet highly effective convolutional neural networks (CNNs) Our approach combines real-based and block-chained CNNs representations based on cartesian genetic programming (CGP) for neural architecture search (NAS) Two variants are introduced that differ in the granularity of the search space they consider.
  arXiv  Detail & Related papers  (2023-06-05T07:32:47Z)
• HKNAS: Classification of Hyperspectral Imagery Based on Hyper Kernel Neural Architecture Search [104.45426861115972]
  We propose to directly generate structural parameters by utilizing the specifically designed hyper kernels. We obtain three kinds of networks to separately conduct pixel-level or image-level classifications with 1-D or 3-D convolutions. A series of experiments on six public datasets demonstrate that the proposed methods achieve state-of-the-art results.
  arXiv  Detail & Related papers  (2023-04-23T17:27:40Z)
• An algorithmic framework for the optimization of deep neural networks architectures and hyperparameters [0.23301643766310373]
  We propose an algorithmic framework to automatically generate efficient deep neural networks. The framework is based on evolving directed acyclic graphs (DAGs) It allows mixtures of different classical operations: convolutions, recurrences and dense layers, but also more newfangled operations such as self-attention.
  arXiv  Detail & Related papers  (2023-02-27T08:00:33Z)
• Reinforced Genetic Algorithm for Structure-based Drug Design [38.134929249388406]
  Structure-based drug design (SBDD) aims to discover drug candidates by finding molecules that bind to a disease-related protein (targets) We propose Reinforced Genetic Algorithm (RGA) that uses neural models to prioritize the profitable design steps and suppress random-walk behavior.
  arXiv  Detail & Related papers  (2022-11-28T22:59:46Z)
• Improving RNA Secondary Structure Design using Deep Reinforcement Learning [69.63971634605797]
  We propose a new benchmark of applying reinforcement learning to RNA sequence design, in which the objective function is defined to be the free energy in the sequence's secondary structure. We show results of the ablation analysis that we do for these algorithms, as well as graphs indicating the algorithm's performance across batches.
  arXiv  Detail & Related papers  (2021-11-05T02:54:06Z)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• EBM-Fold: Fully-Differentiable Protein Folding Powered by Energy-based Models [53.17320541056843]
  We propose a fully-differentiable approach for protein structure optimization, guided by a data-driven generative network. Our EBM-Fold approach can efficiently produce high-quality decoys, compared against traditional Rosetta-based structure optimization routines.
  arXiv  Detail & Related papers  (2021-05-11T03:40:29Z)
• Trilevel Neural Architecture Search for Efficient Single Image Super-Resolution [127.92235484598811]
  This paper proposes a trilevel neural architecture search (NAS) method for efficient single image super-resolution (SR) For modeling the discrete search space, we apply a new continuous relaxation on the discrete search spaces to build a hierarchical mixture of network-path, cell-operations, and kernel-width. An efficient search algorithm is proposed to perform optimization in a hierarchical supernet manner.
  arXiv  Detail & Related papers  (2021-01-17T12:19:49Z)
• AM-GCN: Adaptive Multi-channel Graph Convolutional Networks [85.0332394224503]
  We study whether Graph Convolutional Networks (GCNs) can optimally integrate node features and topological structures in a complex graph with rich information. We propose an adaptive multi-channel graph convolutional networks for semi-supervised classification (AM-GCN) Our experiments show that AM-GCN extracts the most correlated information from both node features and topological structures substantially.
  arXiv  Detail & Related papers  (2020-07-05T08:16:03Z)
• A Tailored NSGA-III Instantiation for Flexible Job Shop Scheduling [18.401817124823832]
  A customized evolutionary algorithm is proposed to solve the flexible job scheduling problem. Different local search strategies are employed to explore the neighborhood parameters for better solutions. The experimental results show excellent performance with less computing budget.
  arXiv  Detail & Related papers  (2020-04-14T14:49:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.