The paper introduces a framework for diagnosing and recovering from hidden dynamics changes in deployed control policies, focusing on the problem of task readiness under dormant dynamics drift. It proposes an intervention-based Bayesian method called Evidence‑Gated Matched‑Pulse Transport that localizes faults and estimates actuator effectiveness, enabling agents to certify readiness for future tasks with limited, task‑agnostic interactions. The approach is evaluated on diverse benchmarks, measuring readiness coverage, selective risk, interaction cost, and return, and identifies regimes where transported evidence is decisive.
By Nguyen Viet Tuan Kiet, Huynh Thi Thanh Binh
arXiv:2609. 29140v1 Announce Type: new Abstract: Repeated evaluation can estimate a benchmark score accurately while still requiring replication to certify narrow uncertainty.
By Yezhou Cheng, Runjia Du, Zeming Liu, Qibai Chen, Hang Lyu, Yilan Wei, Yankai Zeng, Bojun Lin
Repeated evaluation can estimate a benchmark score accurately while still requiring replication to certify narrow uncertainty. We characterize that requirement on a fixed grid of $M$ tasks with $L$ binary paths per task under the hard budget $(M+t)K$, where each path costs at most $K$ responses or episodes.
arXiv:2610.33842v1 Announce Type: cross
Abstract: Bayesian mixtures, and Solomonoff induction in particular, provide an idealized model of prediction learned by minimizing population log loss, and th...
By Richard Cornelius Suwandi
arXiv:2610.18948v1 Announce Type: cross
Abstract: Finite safety assessments cannot exclude an adversary that preserves unattacked behavior until certification and activates afterward. We characterize...
By Inderjeet Singh
The paper introduces a denoised counterfactual protocol to accurately measure the selectable headroom of world action models (WAMs) and uses these measurements to build a fail‑gated selector. Across four WAMs and two benchmarks, the study shows that the standard estimate overstates selectable headroom, that structured action perturbations can add up to 16 points of headroom, and that imagined futures retain candidate‑outcome information without loss. The selector improves closed‑loop task success from 76.9 % to 81.6 % on held‑out training episodes and from 62.6 % to 69.8 % on unseen tasks.
By Haojia Gao, Yue Cao, Yumin Liu, Haohua Que, Mingkai Liu, Guanqiu Guo, Zhuo Zou, Bokui Chen, Xueqian Wang
arXiv:2509. 11208v3 Announce Type: replace-cross Abstract: Transformers used for evidence-grounded binary adjudication (e.
By Leon Chlon, Ahmed Karim, Maggie Chlon, MarcAntonio Awada
arXiv:2609.06036v1 Announce Type: new
Abstract: Proposal-based controllers---learned policies, language-model planners, and other black-box \emph{generators}---are increasingly deployed behind runtim...
By Guangxi Wan, Yongbo Xie, Yuqi Liu, Qingwei Dong, Qingxin Li, Hongfei Bai, Peng Zeng
The paper introduces Acquisition‑State Telemetry (AST), a model‑free framework that monitors ongoing information gathering in autonomous systems. AST maps raw observations to task‑resolution coordinates and uses a fixed causal monitor to emit two real‑time signals: one indicating prospective progress on unresolved requirements, and another quantifying informational friction when new evidence yields little gain. Experiments across eight varied domains—ranging from search and rescue dialogue to robotic manipulation—show that the friction signal can distinguish unproductive stagnation from purposeful exploration and that penalizing friction in reinforcement learning leads to higher mission success under early‑termination constraints.
By Dimitris Panagopoulos, Adolfo Perrusqu\'ia, Yang Xing, Weisi Guo
The paper introduces the Distinguish-or-Homogenize principle, where an agent can either spend resources to differentiate between latent fault models or alter the system state so that the remaining models share a common acceptable policy, eliminating further diagnosis. This leads to the Last-Chance Policy Identification (LCPI) framework, which evaluates correctness at the reached state rather than the initial one, and defines the Last Identifiable Margin (LIM) as the boundary between distinguishing and homogenizing. For deterministic diagnostic graphs, an Exact-LIM recursion is provided, while for noisy finite-horizon recovery the authors propose Risk-Budgeted Compatibility Planning (RBCP), which searches a compatibility-aware frontier under a hard worst-case failure constraint, demonstrating improved risk-feasible recovery in microservice and MiniGrid scenarios.
By Yibo Guo, Xiaodan Wang
arXiv:2609.37841v1 Announce Type: new
Abstract: Masked generative models offer parallel token prediction, but accurate parallel sampling must account for dependencies among tokens. When dependencies...
By Ryotaro Kawata, Satoshi Hayakawa, Taiji Suzuki
Certified Anchor-Based Adaptation (CABA) is a post‑update gate for continual adaptation that reserves historical observations, compares old and candidate policies on frozen representations, and selects the largest interpolation coefficient whose worst‑anchor forward KL divergence stays within a declared budget. The method does not require action labels or complete trajectories and is supported by a theory‑led certification framework that provides uniform behavioral‑divergence bounds under representation‑coverage and Lipschitz assumptions. In a UCI Human Activity Recognition study, CABA reduced mean forgetting from 1.01 % to 0.00 % at a budget ε = 0.05, while slightly lowering final average accuracy.
By Ahanaf Hasan Ariq, Abrar Shahid