aspireai.
PUBLIC EDITION

A pipeline turned 157 numerical linear algebra and PDE targets into Lean-checked computational skills at 0.85 to 2.29 dollars per target

AspireAI community · arXiv
Automated computational science needs numerical methods an AI system can interpret and reuse with explicit guarantees, and this paper builds that foundation by connecting formal statements to source context, algorithmic meaning and quantitative guarantees through source preparation, reusable representations and semantic review. Across 171 targets in randomised numerical linear algebra and numerical partial differential equations, 157 were accepted by the pipeline, with mean estimated costs of 0.85 to 2.29 dollars per target across four sources. Lean-checked implications from explicit source premises connect the selected statements to computational skills, illustrated by a steady heat-flow solve and compression of wave-response libraries. The limitation is the acceptance rate itself: roughly one target in eight was rejected, and the pipeline's reach is currently limited to randomised numerical linear algebra and numerical PDEs.
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.