Elastic least privilege lets an agent borrow authority on a budget instead of holding broad permissions forever
AspireAI community · arXiv (cs.CR)
General-purpose agents need authority that changes between tasks and during execution. The usual deployments trade broad permissions that expose unnecessary authority against narrow permissions that generate approval fatigue. Borrowing from decades of access-control research, this paper proposes elastic least privilege: an agent starts with a small baseline of authority and may acquire more within an owner-defined envelope, with elevations leased and measured against a replenishing budget whose cost rises with power, proximity to mandatory safety invariants, and repeated requests. Crucially the cost is visible to the planner, which can prefer lower-privilege options and release authority it no longer needs, and authority returns to baseline automatically when a lease expires or the budget is exhausted. This is a position paper with an open research agenda, not a validated system: the authors state plainly that how best to implement it and how well it works in practice are open questions.
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.