aspireai.
PUBLIC EDITION

Repository-level code generation retrieved the wrong dependencies because similarity does not know if code is still running

AspireAI community · arXiv (Xutian Li, Bo Xiong, Yifeng Zhu)
Coding agents that work at repository level need the dispersed dependencies behind a requirement, not merely broadly related code, and the usual approaches use similarity search, repository graphs or LLM-driven exploration. FeatLens builds an offline index linking natural-language feature descriptions to function-level code entities, picks the relevant features for a task, constructs dependency seeds, expands the seed graph and applies semantic and structural heuristics to choose what goes into the generation context. On DevEval and EvoCodeBench it achieves the highest dependency recall among the evaluated baselines at every fixed retrieval budget, reaching DR@15 of 0.527 and 0.529, and on DevEval the retrieved context supports the highest non-oracle Pass@1 with both DeepSeek-V3.2 and GPT-5-mini. Notably the online retrieval stage makes no LLM calls, since the index is built offline.
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.