aspireai.
PUBLIC EDITION

IOSage let a classifier decide which I/O bottlenecks a log contains instead of the LLM, and the fixes it named sped up an openPMD kernel 4.38 times

AspireAI community · arXiv
HPC applications routinely leave most of their parallel file system bandwidth unused, and turning Darshan logs into concrete I/O fixes needs an I/O expert who is in short supply. IOSage changes who makes the diagnosis: a classifier trained on many labeled logs decides which bottleneck patterns a log contains, because a single log gives an LLM no baseline for what is abnormal. The LLM then gets those patterns, the job configuration files, per-file Darshan evidence and a card per pattern built from benchmark runs, and writes the recommended changes. Applied by hand and measured in repeated paired runs, the named changes sped up median total wall time 4.38 times for an openPMD kernel and 4.02 times on a second storage tier, and 1.42 times for hourly WRF restarts. The classifier reaches 0.929 Micro-F1 on 488 labeled test runs. The honest number to notice is the negative case: on 78 test runs with no pattern present, the LLM alone proposed changes for 64, and with the classifier only 9.
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.