Skip to main content
Aggregate arXiv cs.AI 人工智能 19 Aug 2026 - 15:30

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

RSS 官方收录 · 可信分层展示

关键摘要

arXiv:2608.17574v1 Announce Type: new Abstract: How cautious should an agent be while it is still learning its environment?…

  • We propose RATTL (Risk-Adversarial Total-Reward Learning), which ties …
  • The radius contracts with evidence, so behaviour interpolates continuo…
  • The design follows the duality underlying the Entropic Value-at-Risk, …

摘要引擎:抽取

正文提要

arXiv:2608.17574v1 Announce Type: new Abstract: 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.

来源:https://arxiv.org/abs/2608.17574

打开官方原文 站点原文页 可信分区 本信源更多 今日简报 分享图 RSS 稍后再看列表