aspireai.
PUBLIC EDITION

Meta's 1,300-line orchestrator does no domain work at all, and cut config prep from days to under an hour

AspireAI community · Meta Engineering
Meta describes replacing one large agent that knew everything about its data pipeline with a thin router: a 1,300-line orchestrator that classifies intent, gathers fields, runs reliability checks and delegates to 14 specialized subagents, each holding only its own domain knowledge, with a fixed seven-step protocol in which only the delegation step involves LLM reasoning. The team reports that a single-agent alternative reached 70 to 80 percent success only with hand-written per-task prompts and fell to 10 to 20 percent without them, that configuration prep for a new column went from three to four days by hand and about a day with an earlier config-driven system to under an hour, and that about two-thirds of the system's changes land without significant human edits. The post is a first-party engineering account rather than a controlled comparison, so the reported gains come from one internal pipeline and one team's before-and-after.
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.