Computational Materials Science

Overview

Computational materials science studies how composition, structure, and processing determine material properties, using quantum calculations, atomistic simulations, and continuum models. Common approaches include density functional theory (DFT), machine-learned interatomic potentials, equivariant graph neural networks, and surrogate or generative models for crystals, defects, alloys, and microstructures. These methods support property prediction, materials screening, and inverse design, with benchmarks such as Materials Project and OC20 testing bulk properties and surface energies and forces. A central challenge is balancing speed and scale with physical consistency, transfer to unfamiliar materials and conditions, and validation against experiments rather than computational reference data alone.

Latest papers

154 papers11 papers in the last four weeks, down 42% on the four weeks before. 0.1% of all new papers.

Sep 25, 2025

Shoot from the HIP: Hessian Interatomic Potentials without derivatives

Fundamental tasks in computational chemistry, from transition state search to vibrational analysis, rely on molecular Hessians, which are the second derivatives of the potential energy. Yet, Hessians are computationally expensive to calculate and scale poorly with system size, with both quantum mechanical methods and neural networks. In this work, we demonstrate that Hessians can be predicted directly from a deep learning model, without relying on automatic differentiation or finite differences. We observe that one can construct SE(3)-equivariant, symmetric Hessians from irreducible representations (irrep) features up to degree ll=2 computed during message passing in graph neural networks. This makes HIP Hessians one to two orders of magnitude faster, more accurate, more memory efficient, easier to train, and enables more favorable scaling with system size. We validate our predictions across a wide range of downstream tasks, demonstrating consistently superior performance for transition state search, accelerated geometry optimization, zero-point energy corrections, and vibrational analysis benchmarks. We open-source the HIP codebase and model weights to enable further development of the direct prediction of Hessians at https://github.com/BurgerAndreas/hip
Sep 7, 2025

Learning Magnetic Order Classification from Large-Scale Materials Databases

The reliable identification of magnetic ground states remains a major challenge in high-throughput materials databases, where density functional theory (DFT) workflows often converge to ferromagnetic (FM) solutions. Here, we partially address this challenge by developing machine-learning classifiers trained on experimentally validated MAGNDATA magnetic materials, leveraging a limited number of simple compositional, structural, and electronic descriptors sourced from the Materials Project Database. Our propagation-vector classifiers achieve accuracies above 92%, outperforming a recent equivariant-neural-network study on a differently constructed dataset in reliably distinguishing between zero and nonzero propagation-vector structures, and exposing a systematic ferromagnetic bias inherent to the Materials Project database for more than 6840 candidate materials. In parallel, LightGBM and XGBoost models trained directly on the Materials Project labels achieve accuracies of 82% and 85%, respectively (with macro-F1 average scores of 66% and 63%), proving useful for large-scale screening for magnetic classes, when refined by MAGNDATA-trained classifiers. These results underscore the role of machine-learning techniques as corrective and exploratory tools, enabling more trustworthy databases and accelerating progress toward the identification of materials with various properties.
Jul 11, 2025

Surprisingly High Redundancy in Electronic Structure Data Across Materials Explained by Low Intrinsic Dimensionality

Machine learning (ML) models for electronic structure typically rely on large datasets generated by computationally expensive Kohn-Sham density functional theory calculations, as it is not known a priori which portions of the data are essential for accurate learning. Here, we reveal significant redundancies in electronic structure datasets across diverse material systems and attribute them to the low intrinsic dimensionality of the underlying data. We show that even random pruning can substantially reduce dataset size with minimal degradation in predictive accuracy. Moreover, a state-of-the-art coverage-based pruning strategy that samples data across all learning difficulties almost always preserves chemical accuracy and maintains model generalizability while using up to two orders of magnitude less data and reducing training time by a factor of three or more. We further demonstrate that the essential electronic structure information lies on a low-dimensional, non-linear manifold, providing a potential geometric explanation for the observed prunability. These observations are consistent with the predominance of local atomic environments in determining electronic properties, as suggested by nearsightedness arguments, and indicate that large-scale datasets may contain highly overlapping information. Our findings challenge the prevailing assumption that such extensive datasets are necessary for accurate ML-based electronic structure predictions and open a path toward identifying minimal, representative datasets for each material class.
Oct 2, 2022

Tensor-reduced atomic density representations

Density based representations of atomic environments that are invariant under Euclidean symmetries have become a widely used tool in the machine learning of interatomic potentials, broader data-driven atomistic modelling and the visualisation and analysis of materials datasets.The standard mechanism used to incorporate chemical element information is to create separate densities for each element and form tensor products between them. This leads to a steep scaling in the size of the representation as the number of elements increases. Graph neural networks, which do not explicitly use density representations, escape this scaling by mapping the chemical element information into a fixed dimensional space in a learnable way. We recast this approach as tensor factorisation by exploiting the tensor structure of standard neighbour density based descriptors. In doing so, we form compact tensor-reduced representations whose size does not depend on the number of chemical elements, but remain systematically convergeable and are therefore applicable to a wide range of data analysis and regression tasks.