REVIEW 2 cited by
Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
read the original abstract
Distributionally robust optimization (DRO) can improve the robustness and fairness of learning methods. In this paper, we devise stochastic algorithms for a class of DRO problems including group DRO, subpopulation fairness, and empirical conditional value at risk (CVaR) optimization. Our new algorithms achieve faster convergence rates than existing algorithms for multiple DRO settings. We also provide a new information-theoretic lower bound that implies our bounds are tight for group DRO. Empirically, too, our algorithms outperform known methods.
Forward citations
Cited by 2 Pith papers
-
Integrating Feature Correlation in Differential Privacy with Applications in DP-ERM
CorrDP relaxes standard differential privacy by incorporating feature correlations, enabling distance-dependent noise in DP-ERM for better privacy-utility tradeoffs.
-
FAST-CAD: A Fairness-Aware Framework for Non-Contact Stroke Diagnosis
FAST-CAD unifies domain-adversarial training and Group-DRO to deliver fair, accurate non-contact stroke diagnosis across 12 demographic subgroups with convergence guarantees.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.