Distributed Distributionally Robust Optimization with Non-Convex Objectives
Yang Jiao, Kai Yang, Dongjin Song

TL;DR
This paper introduces ASPIRE, an asynchronous distributed algorithm for distributionally robust optimization that effectively leverages prior distributions, adapts robustness levels, and guarantees convergence, demonstrated through empirical studies.
Contribution
The paper proposes a novel asynchronous distributed algorithm with a new uncertainty set for improved robustness and convergence in distributionally robust optimization.
Findings
Achieves fast convergence in empirical tests
Remains robust against data heterogeneity and attacks
Balances robustness and performance effectively
Abstract
Distributionally Robust Optimization (DRO), which aims to find an optimal decision that minimizes the worst case cost over the ambiguity set of probability distribution, has been widely applied in diverse applications, e.g., network behavior analysis, risk management, etc. However, existing DRO techniques face three key challenges: 1) how to deal with the asynchronous updating in a distributed environment; 2) how to leverage the prior distribution effectively; 3) how to properly adjust the degree of robustness according to different scenarios. To this end, we propose an asynchronous distributed algorithm, named Asynchronous Single-looP alternatIve gRadient projEction (ASPIRE) algorithm with the itErative Active SEt method (EASE) to tackle the distributed distributionally robust optimization (DDRO) problem. Furthermore, a new uncertainty set, i.e., constrained D-norm uncertainty set, is…
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.
Videos
Taxonomy
TopicsRisk and Portfolio Optimization · Stochastic Gradient Optimization Techniques · Metaheuristic Optimization Algorithms Research
