LGMLJun 11, 2021

DORO: Distributional and Outlier Robust Optimization

arXiv:2106.06142v174 citations
Originality Incremental advance
AI Analysis

This addresses the issue of robust optimization for real-world tasks with subpopulation shift, though it is incremental as it builds on existing DRO methods.

The paper tackles the problem of subpopulation shift in machine learning by identifying that Distributionally Robust Optimization (DRO) performs poorly and is unstable due to sensitivity to outliers, and proposes DORO, a refined framework that improves performance and stability, with empirical validation on large datasets.

Many machine learning tasks involve subpopulation shift where the testing data distribution is a subpopulation of the training distribution. For such settings, a line of recent work has proposed the use of a variant of empirical risk minimization(ERM) known as distributionally robust optimization (DRO). In this work, we apply DRO to real, large-scale tasks with subpopulation shift, and observe that DRO performs relatively poorly, and moreover has severe instability. We identify one direct cause of this phenomenon: sensitivity of DRO to outliers in the datasets. To resolve this issue, we propose the framework of DORO, for Distributional and Outlier Robust Optimization. At the core of this approach is a refined risk function which prevents DRO from overfitting to potential outliers. We instantiate DORO for the Cressie-Read family of Rényi divergence, and delve into two specific instances of this family: CVaR and $χ^2$-DRO. We theoretically prove the effectiveness of the proposed method, and empirically show that DORO improves the performance and stability of DRO with experiments on large modern datasets, thereby positively addressing the open question raised by Hashimoto et al., 2018.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes