mlsanityData to 7 Oct 2026

Efficient Black-Box Importance Sampling for VaR and CVaR Estimation

arXiv 2106.10236 ↗First posted 16 Jun 2021q-fin.RM cs.LG math.PRcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper considers Importance Sampling (IS) for the estimation of tail risks of a loss defined in terms of a sophisticated object such as a machine learning feature map or a mixed integer linear optimisation formulation. Assuming only black-box access to the loss and the distribution of the underlying random vector, the paper presents an efficient IS algorithm for estimating the Value at Risk and Conditional Value at Risk. The key challenge in any IS procedure, namely, identifying an appropriate change-of-measure, is automated with a self-structuring IS transformation that learns and replicates the concentration properties of the conditional excess from less rare samples. The resulting estimators enjoy asymptotically optimal variance reduction when viewed in the logarithmic scale. Simulation experiments highlight the efficacy and practicality of the proposed scheme

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 32 references that are in the map. First posted on arXiv 16 Jun 2021.

Builds on

4 of 32 references.

References · 4

  1. 2017Smart "Predict, then Optimize"cited by 332
  2. 2021Achieving Efficiency in Black Box Simulation of Distribution Tails with Self-structuring Importance Samplerscited by 6
  3. 2020Rare-Event Simulation for Neural Network and Random Forest Predictorscited by 4
  4. 2020Optimizing tail risks using an importance sampling based extrapolation for heavy-tailed objectivescited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.