mlsanityData to 14 Oct 2026

Quantifying Risk Under Evolving Uncertainty: Belief-Dependent Robustness for Safe Sequential Decision Making

arXiv 2608.17574 ↗First posted 18 Aug 2026cs.AI cs.SY eess.SYcited by 0

Not on the map. Why?

Abstract (arXiv)

How cautious should an agent be while it is still learning its environment? We propose RATTL (Risk-Adversarial Total-Reward Learning), which ties caution to epistemic uncertainty: the agent holds a Bayesian posterior over unknown dynamics and plans against a Wasserstein ambiguity set whose radius is a monotone function of that posterior. The radius contracts with evidence, so behaviour interpolates continuously between worst-case robustness and risk-neutral total-reward maximization. The design follows the duality underlying the Entropic Value-at-Risk, which converts the choice of a risk level into the choice of an ambiguity radius. We show the resulting planning problem is well posed under transience and compactness conditions, and prove a Safety Sandwich: the RATTL value lies between the uninformed robust value and the full- knowledge optimum, with a gap that vanishes as the posterior concentrates. In a canonical binary-hazard instance, the induced criterion reduces to Conditional Value-at-Risk at a level set by the posterior entropy. A worked example shows the agent deferring the efficient action until a sharp identification threshold. RATTL targets runtime safety for agents, including LLM-based systems, acting under uncertainty.

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

Builds on

6 of 17 references.

References · 6

  1. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
  2. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
  3. 2019Beyond Confidence Regions: Tight Bayesian Ambiguity Sets for Robust MDPscited by 40
  4. 2020Distributional Robustness and Regularization in Reinforcement Learningcited by 40
  5. 2023Solving Long-run Average Reward Robust MDPs via Stochastic Gamescited by 10
  6. 2025Bayesian Ambiguity Contraction-based Adaptive Robust Markov Decision Processes for Adversarial Surveillance Missionscited by 1

Built on by

Not cited yet.