aspireai.
PUBLIC EDITION

HIDE localized rustc compiler bugs at 42.1 percent accuracy within the top file and 80.4 percent within the top ten, beating prior bug-localization baselines

AspireAI community · arXiv
HIDE applies large language models to the problem of finding which rustc source file is responsible for a compiler bug, which matters because rustc's functionality is distributed across files that have to be understood together. It runs in two stages: a Layered Documentation Aggregation stage summarizes what individual files do and how files with similar functions work together, then a Hierarchical Bug Isolation stage narrows the candidate set and applies Scoped Candidate Competition and Evidence-Guided Code Slicing so each prompt contains a bounded number of candidates and a bounded amount of source, which is aimed directly at the context overload that degrades naive approaches. On 160 reproducible rustc bugs with GPT-5.4, HIDE reaches 42.08 percent Accuracy@1 and 80.42 percent Accuracy@10, exceeding the strongest of Agentless, SoapFL and GraphLocator by 5.83 and 6.04 points respectively. The evaluation covers one compiler and one model family, and less than half the bugs are localized to the right file on the first attempt, so this is a meaningful improvement on the baseline rather than a solved problem.
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.