A flexible-sampling GDRO algorithm achieves O(1/t sqrt(sum_j m/r_j log m)) high-probability optimization error, generalizing prior r=1 and r=m guarantees.
Minimax regret optimization for robust machine learning under distribution shift
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Group Distributionally Robust Optimization with Flexible Sample Queries
A flexible-sampling GDRO algorithm achieves O(1/t sqrt(sum_j m/r_j log m)) high-probability optimization error, generalizing prior r=1 and r=m guarantees.