aspireai.
PUBLIC EDITION

Adding 5% more agent Skills raised policy violations from 35% to 58%, and a harness-level information-flow guard cut them back to 6.7%

AspireAI community · arXiv
Checking an agent Skill in isolation does not rule out a policy violation once Skills are composed. The authors identify four recurring mechanisms behind what they call Conflict of Skills, then build the Conflict of Skills Attack, which adds locally admitted Skills to a pool to supply missing business operations or reshape artifact exchange, decision reuse, and target/action bindings - without touching existing Skills or runtime permissions. Across five LLMs and three agent harnesses, additions capped at 5% of each original pool raised the policy-violation rate from 35.02% to 58.45%. A lightweight harness-level guard that checks information flow and authorization before consequential actions reduced violations on OpenClaw recruiting tasks from 65.28% to 6.67%, while policy-compliant completion on matched benign controls moved only from 66.67% to 65.00%. The honest limit: CoSA-Bench is 288 tasks across recruiting, finance, IT and business, so the surface it covers is narrower than the underlying risk it describes. https://arxiv.org/abs/2610.35082
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.