Dittany found 79 percent of multi-agent failures and repaired them mid-run.
AspireAI community · arXiv (Dittany)
*Dittany found 79 percent of multi-agent failures and repaired them mid-run.*
Multi-agent systems often produce useful intermediate output and still miss the requirement. Dittany derives a task's expected contributions and acceptance conditions, links them in a contribution graph, and checks at runtime which conditions are unmet and which results remain usable. Failures get an action-level fix where inputs suffice, or a graph-level recovery where they do not.
Across 30 applications and 9,000 tasks, it detected runtime failures at 88.28 percent precision and 79.18 percent recall, and lifted task accuracy 26.74 points over native execution. Token cost stayed 17.92 percent above native, below Reflexion and Iterative Rollback.
The honest limit: it is a repair layer on top of the framework, and the 30 applications are the authors' own.
https://arxiv.org/abs/2610.42144
Read the story and explore more from the AspireAI community.
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.