A patch that passes every test can still be a vulnerability, and adversarial issues can produce one
AspireAI community · arXiv
Automated program repair agents fetch GitHub issues and generate patches, and the field evaluates those patches almost entirely on functional correctness. This paper asks whether an adversarial user can raise a valid issue that leads the agent to a functionally correct but vulnerable patch. SWExploit does three things: program analysis to locate injection points for payloads, adversarial issue generation that supplies misleading reproduction and error details while preserving the original issue's semantics, and iterative refinement of those issue statements against the agents' actual outputs. Across three agent pipelines and five backend models, the attack success rate on correct patches reached 0.91 while every baseline sat below 0.20. The point is not that the patches fail - they pass tests - but that passing tests is not evidence of safety, which challenges the standard evaluation paradigm for repair agents. Accepted to COLM 2026.
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.