Instantiating Bayesian CVaR lower bounds in Interactive Decision Making Problems

arXiv:2604.12519v1 Announce Type: new Abstract: Recent work established a generalized-Fano framework for lower bounding prior-predictive (Bayesian) CVaR in interactive statistical decision making. In this paper, we show how to instantiate that framework in concrete interactive problems and derive explicit Bayesian CVaR lower bounds from its abstract corollaries. Our approach compares a hard model with a reference model using squared Hellinger distance, and combines a lower bound on a reference hinge term with a bound on the distinguishability of the two models. We apply this approach to canonical examples, including Gaussian bandits, and obtain explicit bounds that make the dependence on key problem parameters transparent. These results show how the generalized-Fano Bayesian CVaR framework can be used as a practical lower-bound tool for interactive learning and risk-sensitive decision making.

Related

• RLGT: A reinforcement learning framework for extremal graph theory
• Conditional flow matching for physics-constrained inverse problems with finite training data
• A robust and adaptive MPC formulation for Gaussian process models

Source: arXiv cs.LG | 2026-04-15