Instantiating Bayesian CVaR lower bounds in Interactive Decision Making Problems

• URL: http://arxiv.org/abs/2604.12519v1
• Date: Tue, 14 Apr 2026 09:54:32 GMT
• Title: Instantiating Bayesian CVaR lower bounds in Interactive Decision Making Problems
• Abstract summary: We show how to instantiate the generalized-Fano framework for lower bounding prior-predictive CVaR in interactive problems.<n>We obtain explicit bounds that make the dependence on key problem parameters transparent.<n>Results show how the framework can be used as a practical lower-bound tool for interactive learning and risk-sensitive decision making.
• Score: 37.191697980212346
• License: http://creativecommons.org/licenses/by/4.0/
• 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 papers

• ScoreMatchingRiesz: Auto-DML with Infinitesimal Classification [6.44705221140412]
  The Riesz representer is a key component in machine learning for constructing $sqrtn$-consistent and efficient estimators.<n>We extend score-matching-based DRE methods to Riesz representer estimation.
  arXiv  Detail & Related papers  (2025-12-23T17:14:14Z)
• A Survey of Low-shot Vision-Language Model Adaptation via Representer Theorem [38.84662767814454]
  Key challenge to address under the condition of limited training data is how to fine-tune pre-trained vision-language models in a parameter-efficient manner. This paper proposes a unified computational framework to integrate existing methods together, identify their nature and support in-depth comparison. As a demonstration, we extend existing methods by modeling inter-class correlation between representers in reproducing kernel Hilbert space (RKHS)
  arXiv  Detail & Related papers  (2024-10-15T15:22:30Z)
• Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability [71.82666334363174]
  We develop a unifying framework for information-theoretic lower bound in statistical estimation and interactive decision making.<n>We propose a new lower bound approach called emphinteractive Fano methodinteractive.
  arXiv  Detail & Related papers  (2024-10-07T15:14:58Z)
• Less is More: Mitigate Spurious Correlations for Open-Domain Dialogue Response Generation Models by Causal Discovery [52.95935278819512]
  We conduct the first study on spurious correlations for open-domain response generation models based on a corpus CGDIALOG curated in our work. Inspired by causal discovery algorithms, we propose a novel model-agnostic method for training and inference of response generation model.
  arXiv  Detail & Related papers  (2023-03-02T06:33:48Z)
• Learning to Bound: A Generative Cram\'er-Rao Bound [25.739449801033846]
  We introduce a novel approach to approximate the Cram'er-Rao bound (CRB) using data-driven methods. We model the distribution of the measurements and obtain an approximation of the CRB, which we call Generative Cram'er-Rao Bound (GCRB)
  arXiv  Detail & Related papers  (2022-03-07T20:31:53Z)
• Optimal variance-reduced stochastic approximation in Banach spaces [114.8734960258221]
  We study the problem of estimating the fixed point of a contractive operator defined on a separable Banach space. We establish non-asymptotic bounds for both the operator defect and the estimation error.
  arXiv  Detail & Related papers  (2022-01-21T02:46:57Z)
• BSN++: Complementary Boundary Regressor with Scale-Balanced Relation Modeling for Temporal Action Proposal Generation [85.13713217986738]
  We present BSN++, a new framework which exploits complementary boundary regressor and relation modeling for temporal proposal generation. Not surprisingly, the proposed BSN++ ranked 1st place in the CVPR19 - ActivityNet challenge leaderboard on temporal action localization task.
  arXiv  Detail & Related papers  (2020-09-15T07:08:59Z)
• Lower bounds in multiple testing: A framework based on derandomized proxies [107.69746750639584]
  This paper introduces an analysis strategy based on derandomization, illustrated by applications to various concrete models. We provide numerical simulations of some of these lower bounds, and show a close relation to the actual performance of the Benjamini-Hochberg (BH) algorithm.
  arXiv  Detail & Related papers  (2020-05-07T19:59:51Z)
• Causal Modeling with Stochastic Confounders [11.881081802491183]
  This work extends causal inference with confounders. We propose a new approach to variational estimation for causal inference based on a representer theorem with a random input space.
  arXiv  Detail & Related papers  (2020-04-24T00:34:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.