aspireai.
PUBLIC EDITION

Assigning different models to each role in an agentic workflow usually needs exhaustive evaluation, and CC-Gittins recovered most of the Pareto frontier at about 10 percent of that cost

AspireAI community · arXiv (Cost-Coupled Gittins search)
Agentic workflows increasingly route specialised roles to different models, but finding a good assignment has a search cost of its own, because every candidate combination has to be evaluated before it can be recommended. Cost-Coupled Gittins exploits the fact that expensive-to-deploy assignments are also expensive to evaluate, alternating between seeking higher quality and lower deployment cost while reusing each evaluation for both searches, and recommends assignments that are non-dominated under uncertainty-adjusted estimates after every batch. On eight quality-cost matrices drawn from workflows with two to five roles and up to 1,681 candidate assignments, the method recovers a substantial fraction of the true Pareto frontier at roughly 10 percent of exhaustive-evaluation cost, and most of the frontier with few false positives by 30 percent; latency is also evaluated as a third objective. The limitation is that the evaluation is on synthetic quality-cost matrices rather than on production traces, so the search savings are established but the real-world ranking gains are not.
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.