REVIEW 5 cited by
Sensitivity of robust optimization problems under drift and volatility uncertainty
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
abstract
We examine optimization problems in which an investor has the opportunity to trade in $d$ stocks with the goal of maximizing her worst-case cost of cumulative gains and losses. Here, worst-case refers to taking into account all possible drift and volatility processes for the stocks that fall within a $\varepsilon$-neighborhood of predefined fixed baseline processes. Although solving the worst-case problem for a fixed $\varepsilon>0$ is known to be very challenging in general, we show that it can be approximated as $\varepsilon\to 0$ by the baseline problem (computed using the baseline processes) in the following sense: Firstly, the value of the worst-case problem is equal to the value of the baseline problem plus $\varepsilon$ times a correction term. This correction term can be computed explicitly and quantifies how sensitive a given optimization problem is to model uncertainty. Moreover, approximately optimal trading strategies for the worst-case problem can be obtained using optimal strategies from the corresponding baseline problem.
Forward citations
Cited by 5 Pith papers
-
An optimal transport foundation for a class of dynamically consistent risk measures
Dynamically consistent risk measures are constructed via optimal transport penalizations of transition laws, yielding generators that are first-order convex Hamiltonians on gradients under linear scaling or second-ord...
-
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‖.
-
Sensitivity Analysis of Distributionally Robust BSDEs and RBSDEs
First-order sensitivities of non-Markovian distributionally robust control/stopping problems under L∞ and L2 drift perturbations equal the L1/L2 norms of the Z component of the corresponding (R)BSDE.
-
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.