arXiv Machine Learning

Policy-Verified Self-Training: Learning Agent Compliance from Verifiable Policy Rewards

arXiv AI
Aug 20

Task-Conditioned Least-Privilege Learning for Executable Terminal and MCP Agents

The paper introduces a post‑training framework that teaches a 4B‑parameter language model to exercise task‑conditioned authority in executable terminal and Model Context Protocol (MCP) environments. By auditing each action across six risk dimensions with deterministic verifiers and optimizing for task‑specific excess‑privilege values, the authors achieve 98.48% safe success and reduce excess‑authority errors from 4.56% to 0.79% on held‑out tasks. The study also demonstrates capability retention, prompt‑directed improvement, and generalization over a 400‑task continuation test.

By Alexander Tu, Michael Tu
arXiv AI
Sep 3

LLM-as-a-Judge Is Not an Oracle: Why Self-Improving Agents Need Deterministic Guardrails

The paper argues that using a large language model (LLM) as the sole judge in self‑improving agent pipelines is problematic, as the judge can be biased or manipulated, leading to false confidence in system performance. The authors propose a new framework, PROCTOR, which replaces the oracle judge with a deterministic, teacher‑student loop that enforces guardrails such as sandboxing, role separation, and acceptance checks to prevent cheating and ensure reliable evaluation. Experiments across contract analysis, compliance review, and code quality demonstrate that PROCTOR mitigates eleven identified failure modes that previously allowed agents to achieve perfect scores while hiding significant capability gaps.

By Vansh Wahi
arXiv AI
Oct 2

Chaining Skills to Hijack LLM Agents

The paper "Chaining Skills to Hijack LLM Agents" introduces APEX, a method that constructs adversarial skill chains to manipulate large language model agents into performing attacker-selected actions. By exploiting the sequential invocation of open-source skills, APEX creates a record of genuine task progress that falsely signals user approval, enabling downstream skills to carry out malicious actions. Experiments on SkillsBench and GPT‑5.4 show high success rates, and a prompting defense reduces but does not eliminate the threat.

By Tian Dong, Zixuan Ma, Haodong Zhao, Huaien Zhang, Shaofeng Li, Hao Chen
arXiv Machine Learning
Oct 2

VERA: Verifiable Feasibility Representations with Counterfactual Credit for Constrained Multi-Agent Control

VERA is a centralized‑training, decentralized‑execution framework for constrained multi‑agent control that separates feasibility estimation from credit assignment. Each actor predicts a five‑dimensional verifiable feasibility representation (VFR), which is supervised by exact action‑conditioned margins during training and ranked by a counterfactual group‑relative advantage (CGRA). In a dynamic space‑air‑ground integrated network, VERA achieves over 55% success with minimal coverage violation, outperforming baselines by up to 8.74 percentage points and reducing violations by more than 50%.

By Bo Yin, Dongbo Li, Hongkai Chen, Jie Liu, Guoliang Xing
arXiv Machine Learning
Sep 24

From Reasoning Strings to Partial Orders: Verifier-Certified Rule Transport through Quotient Policy Optimization

The paper introduces Verifier-Certified Rule Transport (VCRT), a method that uses native verifiers to replay adjacent operation pairs and identify commutation certificates or anti-diamonds, thereby distinguishing true logical dependencies from mere serialization choices in reinforcement learning with verifiable rewards. VCRT assigns policy credit based on the total probability mass of each certified orbit and imposes constraints on post-swap consistency, source retention, and policy drift. In leave-one-environment-out transfer experiments across ProofWriter, CLRS, and Lean, VCRT achieves a 77.60% macro pass rate, outperforming the strongest baseline by 13.06 points, with the largest gains observed in Lean.

By Bang Xie, Hao Liu, Zhiyuan Peng, Xin Yin, Chenhao Ying, Yuan Luo, Senjian Zhang, Wei Chen