aspireai.
PUBLIC EDITION

EvoMCP co-evolved MCP agent training data with the agent, lifting three benchmarks by 10 to 16 points

AspireAI community · arXiv (cs.AI)
Supervised fine-tuning of Model Context Protocol agents on a static data distribution cannot adapt to the student's evolving capabilities, so newly exposed weaknesses stay unaddressed. EvoMCP closes that loop: it reads rollout feedback to identify the student's gaps, translates those targets into executable tasks by adapting the instructions and observable states of compatible verified seed tasks while keeping their verifiers aligned, then uses trajectory evolution with reusable skills to recover failed teacher rollouts and refine successful ones. The resulting task-trajectory pairs fine-tune the student, and accepted tasks seed the next round of evolution. On Toolathlon, MCPMark and MCP-Atlas the method reports consistent improvements over the initial student, with absolute gains of 16.5, 10.2 and 12.6 percent. The project page and code are released on GitHub.
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.