aspireai.
PUBLIC EDITION

The strongest general-purpose model scores 53.7 percent on frontier materials problems, and adapting an open model closed the gap to 55.4 percent

AspireAI community · arXiv (cs.AI)
Materials discovery needs language models that can work at the research frontier, but textbook- and exam-derived benchmarks only assess established knowledge. FrontierMat holds 330 problems drawn from frontier academic and industrial research in aerospace, semiconductors, embodied intelligence and nuclear fusion, every one validated by experimentalists and industry experts in its field, with each problem presenting a real study and asking the model to infer a withheld outcome or draw a conclusion from selected experimental evidence. Problems are annotated by functional domain, material system and mechanism scale, with 130 requiring cross-scale reasoning. The strongest general-purpose model scores only 53.7 percent, cross-scale problems score 8.7 points below single-scale ones on matched problems, and half the problems are solved by at most one model, with failures chiefly from endorsing what is plausible rather than what was observed. A domain-adaptation study using meta-weighted continued pretraining and scale-modular self-distillation raises an open-weight model from 36.7 to 55.4 percent, matching the strongest proprietary model, with no decline in aggregate general-benchmark performance.
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.