mlsanityData to 14 Oct 2026

Risk Estimation in a Markov Cost Process: Lower and Upper Bounds

arXiv 2310.11389 ↗First posted 17 Oct 2023cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

We tackle the problem of estimating risk measures of the infinite-horizon discounted cost within a Markov cost process. The risk measures we study include variance, Value-at-Risk (VaR), and Conditional Value-at-Risk (CVaR). First, we show that estimating any of these risk measures with ε-accuracy, either in expected or high-probability sense, requires at least Omega(1/ε2) samples. Then, using a truncation scheme, we derive an upper bound for the CVaR and variance estimation. This bound matches our lower bound up to logarithmic factors. Finally, we discuss an extension of our estimation scheme that covers more general risk measures satisfying a certain continuity criterion, e.g., spectral risk measures, utility-based shortfall risk. To the best of our knowledge, our work is the first to provide lower and upper bounds for estimating any risk measure beyond the mean within a Markovian setting. Our lower bounds also extend to the infinite-horizon discounted costs' mean. Even in that case, our lower bound of Omega(1/ε2) improves upon the existing Omega(1/ε) bound [13].

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 3 of its 20 references that are in the map. First posted on arXiv 17 Oct 2023.

Builds on

3 of 20 references.

References · 3

  1. 2019A Wasserstein distance approach for concentration of empirical risk estimatescited by 18
  2. 2018Concentration bounds for empirical conditional value-at-risk: The unbounded casecited by 13
  3. 2023A Tale of Sampling and Estimation in Discounted Reinforcement Learningcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.