Главная
Study mode:
on
1
Intro
2
Decision-Making under Uncertainty
3
Data-Driven Decision-Making
4
Nominal Distribution
5
Estimation Errors
6
Wasserstein Distance
7
Stability Theory
8
Distributionally Robust Optimization (DRO)
9
Wasserstein DRO
10
Gelbrich Bound (p = 2)
11
Strong Duality
12
Piecewise Concave Loss
13
Main Takeaways
14
Warst-Case Risk for p = 1
15
Computing the Gelbrich Bound
16
Piecewise Quadratic Lass
17
Classification
18
Regression
19
Maximum Likelihood Estimation
20
Minimum Mean Square Error Estimation
Description:
Explore the theory and applications of Wasserstein Distributionally Robust Optimization in machine learning through this comprehensive lecture. Delve into data-driven decision-making challenges, learn about the Wasserstein distance approach, and discover its benefits in solving complex problems. Examine the connections between statistical learning and Wasserstein DRO, and understand its applications in classification, regression, maximum likelihood estimation, and minimum mean square error estimation. Gain insights into tractable convex optimization problems, out-of-sample guarantees, and asymptotic consistency in decision-making under uncertainty.

Wasserstein Distributionally Robust Optimization - Theory and Applications in Machine Learning

Institute for Pure & Applied Mathematics (IPAM)
Add to list