| Title: |
Higher-Order Expansion and Bartlett Correctability of Distributionally Robust Optimization. |
| Authors: |
He, Shengyi1 (AUTHOR) sh3972@columbia.edu; Lam, Henry1 (AUTHOR) khl2114@columbia.edu |
| Source: |
Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p1538-1584. 47p. |
| Subject Terms: |
Asymptotic expansions; Karush-Kuhn-Tucker conditions; Robust optimization; Statistical measurement; Likelihood ratio tests; Confidence intervals; Asymptotic analysis |
| Abstract: |
Distributionally robust optimization (DRO) is a worst-case framework for stochastic optimization under uncertainty that has drawn fast-growing studies in recent years. When the underlying probability distribution is unknown and observed from data, DRO suggests computing the worst-case distribution within a so-called uncertainty set that captures the involved statistical uncertainty. In particular, DRO with uncertainty set constructed as a statistical divergence neighborhood ball has been shown to provide a tool for constructing valid confidence intervals for nonparametric functionals and bears a duality with the empirical likelihood (EL). In this paper, we show how adjusting the ball size of such type of DRO can reduce higher-order coverage errors similar to the so-called Bartlett correction. Our correction, which applies to general von Mises differentiable functionals, is more general than the existing EL literature that only focuses on smooth function models or M-estimation. Moreover, we demonstrate a higher-order "self-normalizing" property of DRO regardless of the choice of divergence. Our approach builds on the development of a higher-order expansion of DRO, which is obtained through an asymptotic analysis on a fixed-point equation arising from the Karush-Kuhn-Tucker conditions. Funding: This work was supported by the National Science Foundation, Division of Information and Intelligent Systems [Grant IIS-1849280] and the Division of Civil, Mechanical and Manufacturing Innovation [Grant CAREER CMMI-1834710]. [ABSTRACT FROM AUTHOR] |
| : |
Copyright of Mathematics of Operations Research (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Premier |