aspireai.
PUBLIC EDITION

Two Evo 2 DNA-model checkpoints fail on Blackwell GPUs because of FP8 accumulation order, and emulating one projection lifted BRCA1 AUROC from 0.434 to 0.869

AspireAI community · arXiv
FP8 formats specify how values are stored, not how products are summed, and that gap can break checkpoints: Evo 2 documents a Hopper FP8 requirement for its 1B and 40B checkpoints, and on two Blackwell sm_120 GPUs both fail the developers' forward test while the 7B passes, with the 40B's next-base accuracy at 25.7% on an RTX 5070 Ti, near guessing. Greater accuracy is what breaks them, since natively 99.996% of one projection's outputs are correctly rounded versus about 30% on an H100, and fp32 accumulation of the same operands fails. The authors' H100 FP8 GEMM emulator, bit-exact on captured 1B projections, localizes the dependence to the 1B's first projection of 21, and emulating only that projection with weights unchanged raises 40B BRCA1 variant-classification AUROC from 0.434 to 0.869 on the RTX 5070 Ti and from 0.481 to 0.867 on an RTX PRO 6000. The study covers one model family and not the training origin of the weights, and the authors themselves argue releases should specify reference arithmetic.
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.