mlsanityData to 14 Oct 2026

Diagnose, Recover, Certify: Task Readiness under Hidden Dynamics Changes

arXiv 2609.20304 ↗First posted 30 Jul 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

A deployed control policy can conceal consequential dynamics changes: an actuator may lose effectiveness without affecting the current task when the policy rarely excites it, despite being critical for a future task that has not yet been specified. We introduce task readiness under dormant dynamics drift, a decision problem that unifies active change diagnosis and post-change control recovery under a limited, task-agnostic interaction budget. An agent must identify whether and where local dynamics have changed, use a small number of informative interactions to characterize the change before downstream task identity is revealed, and subsequently provide each candidate task with either a recovered policy and a calibrated lower bound on its achievable return or an abstention decision to a safe fallback. We propose Evidence-Gated Matched-Pulse Transport, an intervention-based Bayesian procedure that couples fault localization with estimation of actuator effectiveness through a shared matched-response representation, thereby preserving diagnostic reliability while converting localized evidence into recovery-relevant uncertainty. This uncertainty is propagated to task-conditioned policy selection and readiness certification, enabling deployment decisions that explicitly trade off expected performance, confidence, and fallback use. We evaluate the resulting framework on a diverse suite of dormant-actuator benchmarks spanning multiple simulators, under a protocol that separates diagnosis from capability recovery, scores deployment by readiness coverage, selective risk, and interaction cost as well as return, and identifies the fault regimes in which transported evidence is decisive.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 18 references that are in the map. First posted on arXiv 30 Jul 2026.

Builds on

11 of 18 references.

References · 11

  1. 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 389
  2. 2017Safe Model-based Reinforcement Learning with Stability Guaranteescited by 366
  3. 2019SelectiveNet: A Deep Neural Network with an Integrated Reject Optioncited by 350
  4. 2017Safe Policy Improvement with Baseline Bootstrappingcited by 144
  5. 2023Optimistic Active Exploration of Dynamical Systemscited by 32
  6. 2022Factored Adaptation for Non-Stationary Reinforcement Learningcited by 30
  7. 2024ASID: Active Exploration for System Identification in Robotic Manipulationcited by 28
  8. 2024Distributionally Robust Off-Dynamics Reinforcement Learning: Provable Efficiency with Linear Function Approximationcited by 25
  9. 2024ODRL: A Benchmark for Off-Dynamics Reinforcement Learningcited by 25
  10. 2021Bandit Quickest Changepoint Detectioncited by 7
  11. 2024A Behavior-Aware Approach for Deep Reinforcement Learning in Non-stationary Environments without Known Change Pointscited by 5

Built on by

Not cited yet.