Fast Epigraphical Projection-based Incremental Algorithms for Wasserstein Distributionally Robust Support Vector Machine
Jiajin Li, Caihua Chen, Anthony Man-Cho So

TL;DR
This paper introduces fast, scalable incremental algorithms based on epigraphical projection for solving Wasserstein distributionally robust SVM problems, significantly improving computational efficiency for large-scale applications.
Contribution
The paper develops novel epigraphical projection-based incremental algorithms for Wasserstein DRO SVMs, with proven convergence rates and superior speed over existing methods.
Findings
Algorithms are orders of magnitude faster than state-of-the-art.
Proposed methods scale efficiently with problem size.
Convergence rates are established under a H"olderian growth condition.
Abstract
Wasserstein \textbf{D}istributionally \textbf{R}obust \textbf{O}ptimization (DRO) is concerned with finding decisions that perform well on data that are drawn from the worst-case probability distribution within a Wasserstein ball centered at a certain nominal distribution. In recent years, it has been shown that various DRO formulations of learning models admit tractable convex reformulations. However, most existing works propose to solve these convex reformulations by general-purpose solvers, which are not well-suited for tackling large-scale problems. In this paper, we focus on a family of Wasserstein distributionally robust support vector machine (DRSVM) problems and propose two novel epigraphical projection-based incremental algorithms to solve them. The updates in each iteration of these algorithms can be computed in a highly efficient manner. Moreover, we show that the DRSVM…
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
TopicsSparse and Compressive Sensing Techniques · Medical Image Segmentation Techniques · Point processes and geometric inequalities
