Concentration Bounds for Optimized Certainty Equivalent Risk Estimation

Ayon Ghosh, L. A. Prashanth, Krishna Jagannathan
5/31/2024
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

We consider the problem of estimating the Optimized Certainty Equivalent (OCE) risk from independent and identically distributed (i.i.d.) samples. For the classic sample average approximation (SAA) of OCE, we derive mean-squared error as well as concentration bounds (assuming sub-Gaussianity). Further, we analyze an efficient stochastic approximation-based OCE estimator, and derive finite sample bounds for the same. To show the applicability of our bounds, we consider a risk-aware bandit problem, with OCE as the risk. For this problem, we derive bound on the probability of mis-identification. Finally, we conduct numerical experiments to validate the theoretical findings.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ghosh2024concentration,
  title  = {Concentration Bounds for Optimized Certainty Equivalent Risk Estimation},
  author = {Ayon Ghosh and L. A. Prashanth and Krishna Jagannathan},
  year   = {2024},
  eprint = {2405.20933},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.20933v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.20933.svg)](https://codeofpaper.com/paper/2405.20933)

Discussion