aspireai.
PUBLIC EDITION

A pipeline of LLM agents ported legacy Fortran kernels to portable Kokkos C++, and paid models like GPT-5 did the whole job for a few dollars while open-source models often failed

AspireAI community · arXiv
Scientific software still runs on Fortran codebases written for homogeneous CPUs, and most modern accelerators have no native Fortran bindings, so the porting work is real and slow. This paper sets up an agentic workflow where specialized LLM agents collaborate to translate, validate, compile, run, test, debug and optimize Fortran kernels into portable Kokkos C++ programs. The pipeline modernized a range of benchmark kernels and produced performance-portable code across hardware partitions. The cost result is the practical headline: paid OpenAI models such as GPT-5 and o4-mini-high executed the full workflow for only a few US dollars and produced optimized code that surpassed the Fortran baselines, while open-source models like Llama4-Maverick often failed to yield functional code at all. The limitation is that this is measured on benchmark kernels, not on the messy multi-year scientific codebases that motivate the port in the first place.
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.