Spin-informed universal graph neural networks for simulating magnetic ordering

The screening and discovery of magnetic materials are hindered by the computational cost of first-principles density-functional theory (DFT) calculations required to find the ground state magnetic ordering. Although universal machine-learning interatomic potentials (uMLIPs), also known as atomistic foundation models, offer high-fidelity models of many atomistic systems with significant speedup, they currently lack the inputs required for predicting magnetic ordering. In this work, we present a data-efficient, spin-informed graph neural network framework that incorporates spin degrees of freedom as inputs and preserves physical symmetries, extending the functionality of uMLIPs to simulate magnetic orderings. This framework speeds up DFT calculations through better initial guesses for magnetic moments, determines the ground-state ordering of bulk materials and even generalizes to magnetic ordering in surfaces. Furthermore, we implement a closed-loop anomaly detection approach that effectively addresses the classic "chicken-and-egg" problem of creating a high-quality dataset while developing a uMLIP, unearthing anomalies in large benchmark datasets and boosting model accuracy.

Authors

Institutions

Publication Details

Journal
Proceedings of the National Academy of Sciences
Published
2025-07-01
DOI
https://doi.org/10.1073/pnas.2422973122
Citations
4
Primary Topic
Machine Learning in Materials Science
Type
article
Field-Weighted Citation Impact
2.07

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Spin-informed universal graph neural networks for simulating magnetic ordering

John R. Kitchin, Adeesh Kolluru, Karsten Reuter, Rohan Yuri Sanspeur et al.
4 citations
Proceedings of the National Academy of Sciences
Machine Learning in Materials Science
2.07
article

Spin-informed universal graph neural networks for simulating magnetic ordering

John R. Kitchin, Adeesh Kolluru, Karsten Reuter, Rohan Yuri Sanspeur, Wenbin Xu, Peter Harrington, Bowen Deng, Steven Farrell
article en
4 citations

Abstract

The screening and discovery of magnetic materials are hindered by the computational cost of first-principles density-functional theory (DFT) calculations required to find the ground state magnetic ordering. Although universal machine-learning interatomic potentials (uMLIPs), also known as atomistic foundation models, offer high-fidelity models of many atomistic systems with significant speedup, they currently lack the inputs required for predicting magnetic ordering. In this work, we present a data-efficient, spin-informed graph neural network framework that incorporates spin degrees of freedom as inputs and preserves physical symmetries, extending the functionality of uMLIPs to simulate magnetic orderings. This framework speeds up DFT calculations through better initial guesses for magnetic moments, determines the ground-state ordering of bulk materials and even generalizes to magnetic ordering in surfaces. Furthermore, we implement a closed-loop anomaly detection approach that effectively addresses the classic "chicken-and-egg" problem of creating a high-quality dataset while developing a uMLIP, unearthing anomalies in large benchmark datasets and boosting model accuracy.

Proceedings of the National Academy of SciencesVol. 122(27)
Lawrence Berkeley National Laboratory (US), Fritz Haber Institute of the Max Planck Society (DE), National Energy Research Scientific Computing Center (US), Carnegie Mellon University (US)
National Energy Research Scientific Computing Center, Army Research Office
Openalex Percentile: Top 13%
Machine Learning in Materials Science
2.07
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.