arXiv Computer Vision

Calibrate What You SHIP: Post-Selection Risk Control for Verifier-Guided Text-to-Image Generation

arXiv AI
Oct 28

CASEL: Consequence-Aware Selective Execution for Reliable Long-Horizon Tool-Using Agents

CASEL (Consequence-Aware Selective Execution Layer) is a runtime allocation policy for tool‑using language agents that chooses among direct execution, verification, sandboxing, clarification, approval, and abstention for each proposed tool call. It combines calibrated failure probability, state‑dependent consequence, reversibility, ambiguity, and evidence freshness to minimize a per‑mode cost. In controlled simulations, CASEL cuts harmful‑side‑effect trajectories from 14.75 % to 7.02 % and reduces mean normalized harm from 0.184 to 0.123 compared to an uncertainty‑ranked gate.

By Yanyan Zhang, Fei Shen, Ting Yan, Hao Zhang
arXiv Machine Learning
Sep 10

Conditional Validity for Adaptive Modality Acquisition: When the Policy Chooses Its Own Calibration Group

The paper introduces RouteCert, a method for ensuring risk control in multimodal systems that acquire inputs adaptively. It shows that conditional calibration can remain valid even when the acquisition policy determines the calibration group, and provides two finite‑sample constructions: threshold‑free routing with terminal‑pattern calibration and simultaneous validation of policy‑pattern pairs. Experiments on a clinical ECG task and masked multimodal benchmarks demonstrate that RouteCert achieves low disagreement rates and competitive answered fractions while validating each acquisition stage separately.

By Melika Baghi
arXiv Machine Learning
Oct 8

CARE: Certifying Acceleration for Vision-Language-Action Inference

The paper introduces CARE, a method for certifying accelerated inference in vision‑language‑action models. CARE uses paired rollouts on a calibration set to guarantee that the risk of acceleration‑induced failure stays below a user‑specified budget, selecting the fastest certified accelerator or falling back to the reference policy. Experiments on LIBERO suites show that CARE achieves 9.0–10.8× speedups while preserving at least 85.8% of reference‑solved episodes with 95% confidence, and it outperforms non‑guaranteed selectors in both budget adherence and rollout efficiency.

By Rui Liu, Tong Zheng, Jindong Gu, Zhipeng Wang
arXiv AI
Oct 19

Audit-First VAPO: Risk-Certified Selective Updates under Imperfect Verification

The paper introduces Audit-First VAPO, a method that separates directional admission from magnitude control for selective updates under imperfect verification. It employs an observation-only accept‑appeal‑abstain policy with a finite secondary‑verification budget, freezing the action trace before clean labels are added, and uses finite‑sample bounds to certify harmful risk, coverage, and verifier‑call rate. Experiments on Qwen3.5‑0.8B and GSM8K show that RC‑VAPO achieves high accuracy while maintaining low selected harmful risk and modest verifier cost compared to baseline methods.

By Miaobo Hu, Shuhao Hu, Xiaobo Guo, Xin Wang, Bokun Wang, Rui Chen, Daren Zha
arXiv AI
Sep 15

When Should a World Model Move? Loss-Conditioned State Execution

The paper introduces loss‑conditioned state execution, a model‑agnostic technique that decides whether to apply a world model’s proposed state change or keep the current state based on whether the change reduces downstream loss. It formalizes state movability as the existence of a loss‑reducing feasible correction and constructs loss‑specific proposals from predictive distributions, executing them only when a groupwise lower confidence bound on loss improvement is positive. Experiments on forecasting and dynamics benchmarks show that the method accepts updates for a subset of cases, achieving lower bounded loss than persistence or always executing the proposal, and highlights that event predictability and loss‑based decisions must be evaluated separately.

By Jintao Xu, Zhengyu Chen, Ben Zhang, Yongzhi Qi, Jianshen Zhang