arXiv AI By Deep Kumar Ganguly, Jan K\v{r}et\'insk\'y

Robust Risk Under Evolving Uncertainty: A Wasserstein Counterpart of the Entropic Value-at-Risk

Read the original on arXiv AI →

The paper introduces the Wasserstein entropic value-at-risk, a coherent risk measure that replaces the relative-entropy ball of the traditional entropic value-at-risk with an optimal-transport ball. This new measure captures reachable catastrophes that the original entropic measure ignores, and its variational dual mirrors the entropic formula with a transport price replacing inverse temperature. By driving the transport radius with belief entropy, the authors derive a closed‑form robust dynamic‑programming operator whose cautiousness decreases as belief sharpens, providing a certified safety sandwich and a sharp safety switch.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Aug 19

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

The paper introduces RATTL (Risk-Adversarial Total-Reward Learning), a framework that adjusts an agent’s caution based on epistemic uncertainty by using a Bayesian posterior over dynamics and a Wasserstein ambiguity set whose radius depends on that posterior. As evidence accumulates, the radius shrinks, smoothly transitioning the agent’s behavior from worst-case robustness to risk-neutral reward maximization. The authors prove a Safety Sandwich theorem showing RATTL’s value lies between the uninformed robust value and the full-knowledge optimum, and demonstrate the method on a binary-hazard example where the criterion reduces to Conditional Value-at-Risk.

By Deep Kumar Ganguly, Jan Kretinsky
arXiv Machine Learning
Jun 30

Wasserstein Distributionally Robust Regret Optimization

arXiv:2504. 10796v4 Announce Type: replace-cross Abstract: Distributionally robust optimization (DRO) is widely used for decision-making under uncertainty, but its adversarial focus on worst-case loss can lead to overly conservative policies.

By Lukas-Benedikt Fiechtner, Jose Blanchet
arXiv Machine Learning
Aug 12

Risk-Averse Wasserstein Distributionally Robust Online Learning

arXiv:2602. 20403v2 Announce Type: replace Abstract: We study distributionally robust online learning, where a risk-averse learner updates decisions sequentially to guard against worst-case distributions drawn from a Wasserstein ambiguity set centered at past observations.

By Guixian Chen, Salar Fattahi, Soroosh Shafiee
arXiv AI
Jul 7

Safe RLHF Beyond Expectation: Stochastic Dominance for Universal Spectral Risk Control

arXiv:2603. 10938v2 Announce Type: replace-cross Abstract: Safe Reinforcement Learning from Human Feedback (RLHF) typically enforces safety through expected cost constraints, but the expectation captures only a single statistic of the cost distribution and fails to account for distributional uncertainty, particularly under heavy tails or rare catastrophic events.

By Yaswanth Chittepu, Ativ Joshi, Rajarshi Bhattacharjee, Scott Niekum