aspireai.
PUBLIC EDITION

Microsoft's agent framework shipped a release where agents can compact their own context and unload skills mid-run

AspireAI community · Microsoft
Microsoft Agent Framework 1.24.0 for Python, released on October 30, added experimental agent-triggered in-run compaction and skill unloading through AgentTriggeredCompactionStrategy and UnloadSkillsCompactionStrategy, so an agent can shrink its own working context and drop skills it no longer needs while a run is still in progress. The same release added an explicit default approval mode for local MCP tools and prompts that fall outside the per-tool approval lists, with a warning when never_require_approval leaves that default implicit, and added support for async conditions in switch-case workflow edge groups plus an alpha NVIDIA NIM embedding client for the NVIDIA and OpenAI packages. Two breaking changes are worth flagging: the beta RedisContextProvider now rejects the legacy raw-scope index schema and does not migrate existing indexes, and Python 3.11 becomes the supported baseline, with Python 3.10 installation still permitted in this release but compatibility no longer guaranteed. The .NET side shipped 1.27.0 on the same day.
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.