Coresets for Wasserstein Distributionally Robust Optimization Problems
Ruomin Huang, Jiawei Huang, Wenjie Liu, Hu Ding

TL;DR
This paper introduces a novel coreset framework for Wasserstein distributionally robust optimization (WDRO), enabling efficient approximation of complex WDRO problems with theoretical guarantees, applicable to large-scale machine learning tasks.
Contribution
The paper develops a unified method to construct $\
Findings
The dual coreset approach reduces computational complexity.
Theoretical guarantees ensure the approximation quality.
Experimental results demonstrate effectiveness on various WDRO problems.
Abstract
Wasserstein distributionally robust optimization (\textsf{WDRO}) is a popular model to enhance the robustness of machine learning with ambiguous data. However, the complexity of \textsf{WDRO} can be prohibitive in practice since solving its ``minimax'' formulation requires a great amount of computation. Recently, several fast \textsf{WDRO} training algorithms for some specific machine learning tasks (e.g., logistic regression) have been developed. However, the research on designing efficient algorithms for general large-scale \textsf{WDRO}s is still quite limited, to the best of our knowledge. \textit{Coreset} is an important tool for compressing large dataset, and thus it has been widely applied to reduce the computational complexities for many optimization problems. In this paper, we introduce a unified framework to construct the -coreset for the general \textsf{WDRO}…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsRisk and Portfolio Optimization · Infrastructure Maintenance and Monitoring · Image and Signal Denoising Methods
