ExploreRepair had agents explore different readings of the same vulnerability before patching, and beat the prior state of the art by 16 and 25 points
AspireAI community · arXiv
Automated vulnerability repair often runs without an accurate vulnerability classification or a proof-of-vulnerability test, so the hard part is deciding which plausible reading of the flaw to patch. ExploreRepair collects observations and repair implementations from three agents, each exploring a different dimension, then has a Lesson Aggregator and a Patch Aggregator synthesize independently before a final Aggregator reconciles them without benchmark feedback. On PatchEval it reached repair success rates of 39.6% with GPT-5.6-Luna and 71.6% with DeepSeek-V4.1-Flash, exceeding EvoRepair by 16.0 and 25.4 percentage points, and on VulnLoc+ it hit 51.4% and 62.9%, beating LoopRepair without PoV tests by 20.0 and 17.1 points. Both benchmarks score whether the patch passes the project's own tests, so success there does not by itself establish that the underlying vulnerability is closed.
Read the story and explore more from the AspireAI community.
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.