REVIEW 3 cited by
A parametric approach to the estimation of convex risk functionals based on Wasserstein distance
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, we explore a static setting for the assessment of risk in the context of mathematical finance and actuarial science that takes into account model uncertainty in the distribution of a possibly infinite-dimensional risk factor. We allow for perturbations around a baseline model, measured via Wasserstein distance, and we investigate to which extent this form of probabilistic imprecision can be parametrized. The aim is to come up with a convex risk functional that incorporates a sefety margin with respect to nonparametric uncertainty and still can be approximated through parametrized models. The particular form of the parametrization allows us to develop a numerical method, based on neural networks, which gives both the value of the risk functional and the optimal perturbation of the reference measure. Moreover, we study the problem under additional constraints on the perturbations, namely, a mean and a martingale constraint. We show that, in both cases, under suitable conditions on the loss function, it is still possible to estimate the risk functional by passing to a parametric family of perturbed models, which again allows for a numerical approximation via neural networks.
Forward citations
Cited by 3 Pith papers
-
Scaling limits of multi-period distributionally robust optimization problems
The continuous-time scaling limit of multi-period Wasserstein DRO is a monotone semigroup whose generator is the nominal Bellman operator plus m‖∇f‖.
-
Numerical method for nonlinear Kolmogorov PDEs via sensitivity analysis
A sensitivity analysis reduces nonlinear Kolmogorov PDEs (nonlinearity from ε-neighborhood max over drifts/diffusions) to a linear PDE plus ε times a second linear PDE, enabling efficient high-dimensional Monte Carlo ...
-
Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems
Develops robust SGLD with non-asymptotic convergence bounds for non-convex DRO and applies it to neural network regression under adversarial corruption.
Discussion (0). Sign in to comment.