aspireai.
PUBLIC EDITION

OMatG-FC generated inorganic crystals by holding the structural framework fixed, and reports a state-of-the-art stable-unique-novel rate below the convex hull

AspireAI community · arXiv (OMatG-FC framework-conditional materials generation)
Most predicted novel inorganic materials turn out to be new chemical compositions mapped onto structural prototypes the field already knows, so this paper flips the generative setup and conditions on the framework itself, fixing the unit cell shape and particle positions in place. OMatG-FC combines discrete flow matching over atomic species with stochastic interpolants for unit-cell volume scaling, which sharply reduces the dimensionality of the search compared with unconstrained generation, and the authors report it is more flexible than existing prototype-constrained methods because it can discover unseen but stable prototypes derived from known frameworks. Benchmarked on the LeMat-GenBench suite with three machine-learning interatomic potentials, the method reports a state-of-the-art stable-unique-novel rate below the convex hull without needing to learn atomic packings, and the paper also documents how many duplicate frameworks the MP-20 dataset contains and releases a framework-split version of it. The limitation is that the evaluation rests on learned interatomic potentials rather than on synthesised crystals, so the stability claim is a proxy for what a lab would actually find.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.