arXiv Machine Learning By Wei Liu, Muhammad Khan, Gabriel Mancino-Ball, Yangyang Xu

A stochastic smoothing framework for nonconvex-nonconcave minEmax problems with applications to Wasserstein distributionally robust optimization

Read the original on arXiv Machine Learning →

arXiv:2502. 17602v2 Announce Type: replace-cross Abstract: We study a class of stochastic nonsmooth optimization problems in which an outer variable minimizes the expectation of a pointwise maximum.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 30

Wasserstein Distributionally Robust Regret Optimization

arXiv:2504. 10796v4 Announce Type: replace-cross Abstract: Distributionally robust optimization (DRO) is widely used for decision-making under uncertainty, but its adversarial focus on worst-case loss can lead to overly conservative policies.

By Lukas-Benedikt Fiechtner, Jose Blanchet
arXiv Machine Learning
Aug 12

Risk-Averse Wasserstein Distributionally Robust Online Learning

arXiv:2602. 20403v2 Announce Type: replace Abstract: We study distributionally robust online learning, where a risk-averse learner updates decisions sequentially to guard against worst-case distributions drawn from a Wasserstein ambiguity set centered at past observations.

By Guixian Chen, Salar Fattahi, Soroosh Shafiee