atlas

Research map / Graph learning / Graph self-supervised learning

Conformal Crystal Graph Transformer with Robust Encoding of Periodic Invariance

AAAI 2024 · Graph learning › Graph self-supervised learning · approach: Molecular graph pretraining · 5 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes CrystalFormer, an E(3)- and periodic-invariant crystal graph transformer with a robust hierarchical-weight graph construction and a Dirichlet-energy-based angle-preserving attention, evaluated on five JARVIS property prediction tasks.

Problem

Predicting crystal material properties with graph neural networks requires representations that preserve E(3) and periodic invariance robustly under structural perturbations, and capturing angular information efficiently.

Approach

A hierarchical weighting graph construction (reciprocal distance, distance-penalizing, electronegativity weights with AUROC-based neighbor selection) that reduces neighbor-selection stochasticity, plus an angle-preserving graph transformer whose harmonic mapping is trained by minimizing a graph Dirichlet energy to approximate conformal mapping.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use CrystalFormer instead of PotNetCrystalFormer · JARVIS Bandgap (OPT)MAE: 0.127 -> 0.101Helped
use CrystalFormer instead of PotNetCrystalFormer · JARVIS Bandgap (MBJ)MAE: 0.27 -> 0.13Helped
use CrystalFormer instead of PotNetCrystalFormer · JARVIS Total EnergyMAE: 0.032 -> 0.017Helped
use CrystalFormer instead of PotNetCrystalFormer · JARVIS Formation EnergyMAE: 0.029 -> 0.033Hurt
use CrystalFormer instead of PotNetCrystalFormer · JARVIS EhullMAE: 0.055 -> 0.040Helped
add the proposed robust graph construction instead of multi-edge graph construction (ablation)CrystalFormer · JARVIS Bandgap (MBJ)MAE: 0.28 -> 0.13Helped
add the proposed robust graph construction instead of k-connected graph construction (ablation)CrystalFormer · JARVIS Bandgap (MBJ)MAE: 0.30 -> 0.13Helped
add the proposed robust graph construction instead of modified k-connected graph construction (ablation)CrystalFormer · JARVIS Bandgap (MBJ)MAE: 0.29 -> 0.13Helped
add the angle-preserving graph transformer blocks (ablation)CrystalFormer · JARVIS Bandgap (MBJ)MAE: 0.28 -> 0.13Helped

Surprising findings

Limitations

Experimental setup

Datasets: JARVIS-DFT 3D (DFT-2021.8.18)

Benchmarks: JARVIS bandgap (OPT) JARVIS bandgap (MBJ) JARVIS total energy JARVIS formation energy JARVIS Ehull

Metrics: MAE training time per epoch inference throughput

Baselines: CGCNN SchNet MEGNET GATGNN ALIGNN Matformer PotNet

Builds on: CGCNN Matformer PotNet ALIGNN Pan et al. 2021 weight-based neighbor selection

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy