Group Distributionally Robust Optimization with Flexible Sample Queries
A GDRO algorithm via flexible sample queries and a prediction-with-limited-advice game achieves high-probability error O(√(∑ m/r_j)/t) with consistent sample complexity O(m log m/ε²).
Sydney Poster Session 5, Thu, Dec 10, 10:00 AM–1:00 PM, Hall 1-4 · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.