arXiv AI

PolicyMem: Geometric Policy Memory for LLM Governance

arXiv AI
Oct 23

AdaGuard: An Adaptive Guard Model with User-defined Policies

AdaGuard is an adaptive guard model that evaluates language‑model agent trajectories against user‑defined policies. The authors created the AdaptiveSafety dataset, containing 10,939 training and 1,000 test examples with policy rules, counterfactuals, explanations, and violated rules. Using supervised pre‑training followed by the SafePO reinforcement‑learning algorithm, they built 0.6B, 4B, and 8B guard models, with the 4B version achieving 89.30% accuracy on AdaptiveSafety and 71.82% on DynaBench.

By Yunhao Feng, Yifan Ding, Yuxiang Xie, Zheng Li, Mingrui Lao, Zeyuan Wang, Yanming Guo
arXiv AI
Aug 26

RePolicy: Reinforcement Learning for Safety-Policy Invocation in Agent Safeguards

RePolicy is a reinforcement learning approach designed to invoke safety policies for language model agents by evaluating entire execution trajectories within context-dependent policy libraries. It generates policy-grounded rationales and safety judgments, and is initialized with the PolicyTraj-20K dataset before fine-tuning via GRPO with verifiable rewards and policy-context perturbation. Experiments on six safety benchmarks demonstrate strong safety-detection performance and robust policy invocation across varying contexts.

By Houcheng Jiang, Boxuan Zhang, Qiyong Zhong, Junfeng Fang, Xiang Wang, Xiangnan He
arXiv Computation and Language
Oct 23

SCOPE: Compiling Natural-Language Policies into Neurosymbolic Predicate Programs

SCOPE compiles natural‑language policies into neurosymbolic predicate programs that combine small neural models, deterministic extractors, and logical composition. The system is jointly optimized with adversarially generated counterexamples, achieving higher accuracy than prompt‑optimization, task‑decomposition, and workflow‑generation baselines on real‑world policy benchmarks. Programs trained with the weakest executor transfer to other models, enabling deployment on inexpensive models with stable, interpretable predictions.

By Arnon Mazza, Elad Levi
arXiv AI
Oct 12

VEPA: Verified Evolving Formal Policy for Lifelong LLM Agent Guardrails

VEPA is a framework that enables the verified evolution of formal guardrails for lifelong large language model agents. It represents guardrails as formal policies of symbolic rules over typed agent events, and during deployment uses LLM‑guided feedback to propose policy patches that fix new failures while preserving correct behavior. A deterministic verifier accepts only structurally valid, conflict‑free policies, and an evidence‑aware authority layer activates verified rules only when sufficient supporting evidence exists, ensuring that uncertain updates do not directly affect guardrail decisions.

By Duy Nguyen, Lesly Miculicich, Bhavana Dalvi Mishra, Shuo Li, Krishnamurthy Dj Dvijotham, Mohit Bansal, Tomas Pfister, Long T. Le
arXiv AI
2d ago

RePolicy: Learning to Select and Apply Safety Policies for Agent Safeguards

RePolicy is a safeguard that learns to both select the appropriate safety policy from a library and assess agent behavior against it. It processes an agent trajectory and a set of candidate policies, chooses the best-matching policy, applies its requirements, and predicts safety. The authors created PolicyTraj-20K, a dataset of over 20,000 annotated trajectories, and trained RePolicy with supervised and reinforcement learning, achieving top performance on six benchmarks and 19 baselines.

By Houcheng Jiang, Boxuan Zhang, Qiyong Zhong, Junfeng Fang, Xiang Wang, Xiangnan He
arXiv Machine Learning
Sep 2

Training-Free Policy Violation Detection via Activation-Space Whitening in LLMs

The paper introduces a training‑free approach to detect policy violations in large language models by treating the task as an out‑of‑distribution problem in the model’s activation space. It uses whitening‑inspired techniques to compute policy‑violation scores directly from normalized hidden activations, requiring only the policy text and a few illustrative examples. Experiments on several LLMs and policy benchmarks show the method achieves up to 86.0% F1, outperforming fine‑tuned and LLM‑as‑a‑judge baselines while being computationally lightweight.

By Oren Rachmil, Avishag Shapira, Roy Betser, Omer Hofman, Itay Gershon, Asaf Shabtai, Yuval Elovici, Roman Vainshtein