aspireai.
PUBLIC EDITION

A study of 51,412 AI-agent refactorings across 12,256 pull requests found agents target refactoring in 26.1 percent of commits, but the measured code-quality gains stay limited

AspireAI community · arXiv
Agentic coding tools now act as autonomous teammates in refactoring, yet there was little empirical data on how they are actually used. This study analysed 51,412 refactoring instances across 12,256 pull requests and 14,998 commits drawn from the AIDev dataset of real open-source Java projects, with the detailed analysis focused on the 3,907 commits (32,611 instances) where refactoring was the explicit intent. Refactoring turned out to be a common and deliberate activity, with agents explicitly targeting it in 26.1 percent of commits. High-level refactorings formed the largest category, and agentic refactoring carried a slightly larger share of low-level consistency edits than human refactoring, 27.6 percent against 24.4 percent, with Rename Variable at 7.6 percent and Change Variable Type at 6.8 percent the two most frequent operations. Stated motivations were overwhelmingly internal quality, 52.5 percent maintainability and 28.1 percent readability. The honest caveat is the finding itself: the measured code-quality metric improvements from these frequent low-level refactorings remained limited, so intent and volume did not translate into equivalent quality movement. Accepted to ACM TOSEM.
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.