aspireai.
PUBLIC EDITION

Parallel agents asked their peers for help on demand, and got better results at lower inference cost

AspireAI community · arXiv
When several LLM agents work on the same problem in parallel, the useful findings stay trapped in each execution history. Existing sharing approaches pick what to send before anyone knows what they need, so details that become important later get missed. Ask on Demand inverts the direction: an agent raises a targeted request when a specific information need appears, and the framework retrieves relevant evidence from peer histories, selects a suitable peer and writes a response tuned to the request. A lightweight gate decides when asking is worth it, trained on paired team continuations supervised by final team outcomes and inference cost. On AppWorld and WebShop, AOD consistently improved task performance over independent parallel execution while costing less than existing information-sharing baselines. The limitation is the dependency it introduces: every agent now needs access to its peers' histories, which does not survive a setting where agents run in isolated sandboxes.
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.