Distributionally Robust Optimization
Overview
DRO studies how to make predictions and decisions reliable when the distribution at deployment may differ from the observed data. Methods define ambiguity sets using tools such as Wasserstein distance, statistical divergences, or group-based reweighting, then solve the resulting worst-case optimization with dual formulations, gradient methods, or saddle-point algorithms. Applications include machine learning under subgroup and domain shifts, reinforcement learning, control, and decisions in areas such as healthcare and energy. A central challenge is balancing protection against distribution shift with computational cost and excessive conservatism, while choosing ambiguity sets that reflect real uncertainty and still support useful guarantees.
Latest papers
85 papers18 papers in the last four weeks, up 350% on the four weeks before. 0.1% of all new papers.