Distributionally Robust Optimisation

DRO optimises performance under the worst distribution in an ambiguity set, not just under a point estimate.

advancedrobustambiguityportfoliowasserstein

Mental model

Robust optimisation chooses decisions that remain defensible across a set of plausible distributions.

Classical optimisation uses a single estimated distribution; DRO works against a set of plausible distributions.

Ambiguity sets can be defined via moments, Wasserstein balls, or divergence constraints.

INTERACTIVE INTUITION

Explore the mechanism

How does the decision change when the data-generating distribution is allowed to vary within a defensible ambiguity set?

Distributionally robust optimisation replaces the single “best guess” distribution with a family of nearby distributions. As robustness ϵ grows, probability weight is shifted towards bad scenarios, and the preferred decision can switch to a more conservative one.

Losses for decision B across scenarios; circles show nominal vs robust probabilitiesS1mild up / small lossS2S3S4S5S6crashloss L_inominal p_irobust p_i(ϵ)
Expected loss under nominal vs robust distribution (lower is better)Decision A2.904.36Decision B2.373.48Decision C1.602.18
Decision focus:
Numbers
Nominal best decision: C
Robust best decision at ϵ=0.20: C
E_nom(A,B,C) ≈ (2.90, 2.37, 1.60)
E_rob(A,B,C) ≈ (4.36, 3.48, 2.18)
Interpretation

With ϵ = 0, all scenarios are equally weighted: nominal expected loss selects the decision with the lowest average cost. As ϵ increases, more probability mass moves into the crash scenario: the purple markers shift up on S6.

Decisions with heavy tails (large loss in S6) are penalised more strongly under the robust distribution. The robust optimum can therefore switch from an aggressive portfolio to a more conservative one, even if its nominal average loss is slightly higher. This is the core DRO effect in portfolio and risk system design.

UNDERSTAND

What to notice

In portfolio problems, DRO tilts allocations away from fragile bets that only work under a narrow distribution.

FORMALIZE

The quantitative structure

Notation

x
decision variable
P
candidate probability distribution
A
ambiguity set
l(x,xi)
loss under decision x and outcome xi

Distributionally robust objective

min_x sup_(P in A) E_P[l(x,xi)]

The decision minimizes loss under the worst distribution admitted by the ambiguity set.

This model assumes

  • The ambiguity set contains distributions considered plausible for the decision.
  • The chosen distance, moments, or constraints make the optimization computationally tractable.
TRANSFER

Where it appears

  • portfolio construction with estimation uncertainty
  • robust operational planning
  • stress-aware allocation under limited data
CHALLENGE

Where the intuition breaks

What this view leaves out

  • Results can be excessively conservative or falsely reassuring when the ambiguity set or radius is poorly chosen.

Common mistakes

“Distributional robustness protects against every possible distribution.”

Not quite.

Protection is limited to the explicitly defined ambiguity set and loss function.

CONNECT

Where this concept sits

Follow the strongest prerequisites, applications, extensions, and contrasts.

Connections for Distributionally Robust Optimisation

Supported by · Covariance Estimation and Correlation

Robust portfolio optimisation often starts from uncertain estimates of means, covariances or distributions.

Explore concept
SOURCES

References

  1. Esfahani, P. M. and Kuhn, D. (2018), Data-driven Distributionally Robust Optimization Using the Wasserstein Metric (opens in a new tab)
← Explore all concepts