Policy reasoning benchmarks were hand-built, so a generator now writes them and finds where models go wrong
AspireAI community · arXiv (Sam Kouteili et al.)
Models deployed in regulated settings must apply a given rule to a situation and return a verdict, a capability called deontic reasoning. Benchmarking it was slow because the datasets were hand-crafted. DeoGen generates the benchmark instead: it autoformalises policy rules into first-order logic, builds decision trees of possible outcomes, and turns each root-to-leaf path into a benchmark entry, with each tree producing combinatorially many entries relative to its depth. Paths that end at a leaf entail a verdict; non-leaf paths measure whether a model can abstain when the information is insufficient. Frontier models returned the correct verdict 89-92% of the time, but performance fell to 22-40% correct on entries lacking enough information for a verdict, even with explicit instructions to abstain. The generator is scalable and parametrisable, though a generated benchmark tests the generator's formalisation as much as the model's reasoning.
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.