Harmonizing sample average approximation and distributionally robust optimization

Ziliang Jin

doi:10.1016/j.omega.2026.103584

Harmonizing sample average approximation and distributionally robust optimization

2026-09-29

0

PRE

AI

DOI：10.1016/j.omega.2026.103584

Original

Original request for help

Save

Abstract

En 中文

Decision-makers often encounter uncertainty, and the distribution of uncertain parameters plays a crucial role in making reliable decisions. However, complete information is rarely available. The sample average approximation (SAA) approach utilizes historical data to address this, but struggles with insufficient data. Conversely, moment-based distributionally robust optimization (DRO) effectively employs partial distributional information but can yield conservative solutions even with ample data. To bridge these approaches, we propose a novel method called harmonizing optimization (HO), which integrates SAA and DRO by adaptively adjusting the weights of data and information based on sample size N. This allows HO to amplify data effects in large samples while emphasizing information in smaller ones. More importantly, HO performs well across varying data sizes without needing to classify them as large or small. We provide practical methods for determining these weights and demonstrate that HO offers finite-sample performance guarantees and achieves asymptotic optimality. In addition, HO can be applied to enhance scenario reduction, improving approximation quality and reducing completion time by retaining critical information from reduced scenarios. Numerical results show significant advantages of HO in solution quality compared to Wasserstein-based DRO, and highlight its effectiveness in scenario reduction.

Keywords:

Stochastic programming

Data-driven optimization

Partial distributional information

Harmonizing sample average approximation and distributionally robust optimization

Abstract

Journal

Organization

Cited Papers