aspireai.
PUBLIC EDITION

An agent framework gave LLM agents an explicit layer for tracking beliefs about what other agents know

AspireAI community · arXiv (cs.AI / cs.CL / cs.MA)
EpiAgent equips an LLM agent with an explicit, learnable epistemic layer that maintains beliefs over other agents' private information and combines those beliefs with the agent's own information into an epistemic state for action selection. The policy is decomposed into two coupled stages - Epistemic Update, which revises beliefs from interaction histories, and Action Planning, which selects actions conditioned on the updated state - and their dependency is framed as a bi-level optimization problem. Epistemic Self-Play alternates optimization of the two stages using an intrinsic prediction reward that scores how well inferred beliefs predict subsequent observations. The authors report consistent improvements over prompting-based and RL-based baselines in mixed and competitive scenarios, plus better belief inference accuracy. The limitation: the abstract reports no absolute numbers, so the size of the gap to those baselines is not stated.
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.