aspireai.
PUBLIC EDITION

DoorDash's multi-agent cleanup system got engineer sign-off on 45 of 50 stale feature flags, at $4.79 average per cleanup

AspireAI community · arXiv (Chandratre, Datar) - DoorDash
*Most agent stories stop at the demo. This one has pull requests in production.* DoorDash runs more than 56,000 feature flags across 623 repositories, with 1,659 stale ones as of May 2026. The team built an end-to-end system that reads live rollout data over MCP, processes Jira tickets and opens the removal PRs itself - and on the 50 stale flags it was evaluated on, engineers approved 45 (90%) of the pull requests, at an average of $4.79 and 13.8 minutes per cleanup, against an internal estimate of one to two hours of manual work per flag. It is a clean reference architecture for multi-agent work: an analysis phase first, then parallel cleanup agents, then a verified report, with an experimentation branch for anything risky. The paper is accepted at ICSME's industry track. Caveat: the evaluation covers 50 flags from one company, and the $4.79 figure is the authors' own cost accounting. https://arxiv.org/abs/2610.31351
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.