Wasserstein Distributionally Robust Risk-Sensitive Estimation via Conditional Value-at-Risk

• URL: http://arxiv.org/abs/2604.18546v1
• Date: Mon, 20 Apr 2026 17:39:18 GMT
• Title: Wasserstein Distributionally Robust Risk-Sensitive Estimation via Conditional Value-at-Risk
• Abstract summary: We propose a distributionally robust approach to risk-sensitive estimation of an unknown signal x from an observed signal y.<n>We show that, when the nominal distribution at the center of the Wasserstein ball is finitely supported, such estimators can be exactly computed by solving a tractable semidefinite program.<n>We evaluate the proposed estimators on a wholesale electricity price forecasting task using real market data and show that they deliver lower out-of-sample CVaR of squared error compared to existing methods.
• Score: 0.3867363075280543
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a distributionally robust approach to risk-sensitive estimation of an unknown signal x from an observed signal y. The unknown signal and observation are modeled as random vectors whose joint probability distribution is unknown, but assumed to belong to a given type-2 Wasserstein ball of distributions, termed the ambiguity set. The performance of an estimator is measured according to the conditional value-at-risk (CVaR) of the squared estimation error. Within this framework, we study the problem of computing affine estimators that minimize the worst-case CVaR over all distributions in the given ambiguity set. As our main result, we show that, when the nominal distribution at the center of the Wasserstein ball is finitely supported, such estimators can be exactly computed by solving a tractable semidefinite program. We evaluate the proposed estimators on a wholesale electricity price forecasting task using real market data and show that they deliver lower out-of-sample CVaR of squared error compared to existing methods.

Related papers

• Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation [55.47411235954028]
  We recast imputation under missing completely at random as density estimation from masked observations.<n>We obtain a convex empirical risk problem with closed form marginals, solvable by a Newton interior point method.<n>The resulting PSD Impute model yields both single and multiple imputations from the same fitted density.
  arXiv  Detail & Related papers  (2026-07-08T15:51:05Z)
• Estimation of discrete distributions in relative entropy, and the deviations of the missing mass [3.4265828682659705]
  We study the problem of estimating a distribution over a finite alphabet from an i.i.d. sample.<n>We establish a high-probability risk bound depending on two effective sparsity parameters.<n>As part of the analysis, we also derive a sharp high-probability upper bound on the missing mass.
  arXiv  Detail & Related papers  (2025-04-30T16:47:10Z)
• Distributionally Robust Instrumental Variables Estimation [10.765695227417865]
  We show that Wasserstein DRIVE is a distributionally robust IV estimation method.<n>We derive the distribution of Wasserstein DRIVE and propose data-driven procedures to select the regularization parameter.
  arXiv  Detail & Related papers  (2024-10-21T04:33:38Z)
• Distributional Matrix Completion via Nearest Neighbors in the Wasserstein Space [8.971989179518216]
  Given a sparsely observed matrix of empirical distributions, we seek to impute the true distributions associated with both observed and unobserved matrix entries.<n>We utilize tools from optimal transport to generalize the nearest neighbors method to the distributional setting.
  arXiv  Detail & Related papers  (2024-10-17T00:50:17Z)
• Rejection via Learning Density Ratios [50.91522897152437]
  Classification with rejection emerges as a learning paradigm which allows models to abstain from making predictions.<n>We propose a different distributional perspective, where we seek to find an idealized data distribution which maximizes a pretrained model's performance.<n>Our framework is tested empirically over clean and noisy datasets.
  arXiv  Detail & Related papers  (2024-05-29T01:32:17Z)
• Symmetric Q-learning: Reducing Skewness of Bellman Error in Online Reinforcement Learning [55.75959755058356]
  In deep reinforcement learning, estimating the value function is essential to evaluate the quality of states and actions. A recent study suggested that the error distribution for training the value function is often skewed because of the properties of the Bellman operator. We proposed a method called Symmetric Q-learning, in which the synthetic noise generated from a zero-mean distribution is added to the target values to generate a Gaussian error distribution.
  arXiv  Detail & Related papers  (2024-03-12T14:49:19Z)
• Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning [2.4578723416255754]
  Distributionally robust optimization (DRO) has become a powerful framework for estimation under uncertainty.<n>We propose a DRO-based method for linear regression and address a central question: how to optimally choose the robustness radius.<n>We show that our method achieves the same effect as cross-validation, but at a fraction of the computational cost.
  arXiv  Detail & Related papers  (2022-06-27T13:02:59Z)
• Robust Estimation for Nonparametric Families via Generative Adversarial Networks [92.64483100338724]
  We provide a framework for designing Generative Adversarial Networks (GANs) to solve high dimensional robust statistics problems. Our work extend these to robust mean estimation, second moment estimation, and robust linear regression. In terms of techniques, our proposed GAN losses can be viewed as a smoothed and generalized Kolmogorov-Smirnov distance.
  arXiv  Detail & Related papers  (2022-02-02T20:11:33Z)
• 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)
• Wasserstein Generative Learning of Conditional Distribution [6.051520664893158]
  We propose a Wasserstein generative approach to learning a conditional distribution. We establish non-asymptotic error bound of the conditional sampling distribution generated by the proposed method.
  arXiv  Detail & Related papers  (2021-12-19T01:55:01Z)
• Robust W-GAN-Based Estimation Under Wasserstein Contamination [8.87135311567798]
  We study several estimation problems under a Wasserstein contamination model and present computationally tractable estimators motivated by generative networks (GANs) Specifically, we analyze properties of Wasserstein GAN-based estimators for adversarial location estimation, covariance matrix estimation, and linear regression. Our proposed estimators are minimax optimal in many scenarios.
  arXiv  Detail & Related papers  (2021-01-20T05:15:16Z)
• Nonparametric Estimation of the Fisher Information and Its Applications [82.00720226775964]
  This paper considers the problem of estimation of the Fisher information for location from a random sample of size $n$. An estimator proposed by Bhattacharya is revisited and improved convergence rates are derived. A new estimator, termed a clipped estimator, is proposed.
  arXiv  Detail & Related papers  (2020-05-07T17:21:56Z)

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.