mlsanityData to 7 Oct 2026

Distinguish or Homogenize: Last-Chance Policy Identification and Risk-Budgeted Recovery under Irreversible Resource Depletion

arXiv 2609.36741 ↗First posted 29 Sep 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Under irreversible resource depletion, an agent can spend resources to distinguish among latent fault models, or to change the system state so that the remaining models admit a common acceptable continuation--at which point further diagnosis becomes unnecessary. This distinguish-or-homogenize principle identifies a path that existing frameworks for identification, planning, and diagnosis do not make explicit: prior formulations treat the mapping from fault models to acceptable policies as a given, whereas LCPI makes it a function of the agent's own actions. We formalize this principle through Last-Chance Policy Identification (LCPI), where correctness is evaluated at the state the agent reaches rather than at the initial state. The Last Identifiable Margin (LIM) marks the feasibility boundary between distinguishing and homogenizing. For deterministic diagnostic graphs we provide the Exact-LIM recursion; for noisy finite-horizon recovery we propose Risk-Budgeted Compatibility Planning (RBCP), which searches a compatibility-aware frontier under a hard worst-case failure constraint. Across incident recovery on abstract microservice topologies and latent-damage navigation in MiniGrid, RBCP improves risk-feasible recovery while satisfying the failure budget. A sham control--cost-matched actions that preserve model incompatibility--eliminates the gain entirely, confirming that the benefit comes from changing which policies are acceptable for which models, not from extra search or additional budget.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 23 references that are in the map. First posted on arXiv 29 Sep 2026.

Builds on

14 of 23 references.

References · 14

  1. 2016Optimal Best Arm Identification with Fixed Confidencecited by 233
  2. 2021Beyond No Regret: Instance-Dependent PAC Reinforcement Learningcited by 41
  3. 2021Navigating to the Best Policy in Markov Decision Processescited by 28
  4. 2021Best Arm Identification with Safety Constraintscited by 25
  5. 2024Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Formcited by 10
  6. 2014Near Optimal Bayesian Active Learning for Decision Makingcited by 9
  7. 2024ConstrainedZero: Chance-Constrained POMDP Planning using Learned Probabilistic Failure Surrogates and Adaptive Safety Constraintscited by 7
  8. 2024Pessimistic Iterative Planning with RNNs for Robust POMDPscited by 7
  9. 2025Efficient Policy Optimization in Robust Constrained MDPs with Iteration Complexity Guaranteescited by 6
  10. 2025Robust Finite-Memory Policy Gradients for Hidden-Model POMDPscited by 5
  11. 2022Shielding in Resource-Constrained Goal POMDPscited by 4
  12. 2013Decision-Theoretic Troubleshooting: A Framework for Repair and Experimentcited by 2
2 more
  1. 2023Recursively-Constrained Partially Observable Markov Decision Processescited by 2
  2. 2025Multi-Environment POMDPs: Discrete Model Uncertainty Under Partial Observabilitycited by 2

Built on by

Not cited yet.