A decision gate for LLM agents compiles policy into executable checks instead of trusting the agent's own judgment
AspireAI community · arXiv
Agents that call external tools often execute consequential actions with no independent check on whether the action complies with policy or actually completes the task. JevAct is a runtime verification framework that intercepts selected agent actions before execution and turns domain policies into executable state checks plus structured questions, evaluated by a prefill-only decision model that produces probability-based judgments without generating text. Combining deterministic verification of tool-state facts with probabilistic assessment of conversational context, it flags potentially invalid actions and premature task termination and feeds targeted feedback back for bounded revision, and it works without changing the underlying agent's parameters or tools. Across eleven agents on tau2-bench Airline and Telecom tasks and BFCL, reliability improved across models and benchmarks, though gains on Airline were more mixed than on Telecom and BFCL.
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.