Author
Listed:
- Shuoguang Yang
(Department of Industrial Engineering & Decision Analytics, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong SAR, China)
- Ethan X. Fang
(Department of Biostatistics & Bioinformatics, Duke University, Durham, North Carolina 27705)
- Uday V. Shanbhag
(Department of Industrial & Manufacturing Engineering, Pennsylvania State University, University Park, Pennsylvania 16803)
Abstract
As systems grow in size, scale, and intricacy, the challenges of misspecification become even more pronounced. In this paper, we focus on parametric misspecification in regimes complicated by risk and nonconvexity. When this misspecification may be resolved via a parallel learning process, we develop data-driven schemes for resolving a broad class of misspecified stochastic compositional optimization problems. Notably, this rather broad class of compositional problems can contend with challenges posed by diverse forms of risk, dynamics, and nonconvexity, significantly extending the reach of such avenues. Specifically, we consider the minimization of a stochastic compositional function over a closed and convex set X in a regime, where certain parameters are unknown or misspecified. Existing algorithms can accommodate settings where the parameters are correctly specified, but efficient first-order schemes are hitherto unavailable for the imperfect information compositional counterparts. Via a data-driven compositional optimization approach, we develop asymptotic and rate guarantees for unaccelerated and accelerated schemes for convex, strongly convex, and nonconvex problems in a two-level regime. Additionally, we extend the accelerated schemes to the general T -level setting. Notably, the nonasymptotic rate guarantees in all instances show no degradation from the rate statements obtained in a correctly specified regime. Further, under mild assumptions, our schemes achieve optimal (or near-optimal) sample complexities for general T -level strongly convex and nonconvex compositional problems, providing a marked improvement over prior work. Our numerical experiments support the theoretical findings based on the resolution of a misspecified three-level compositional risk-averse optimization problem.
Suggested Citation
Shuoguang Yang & Ethan X. Fang & Uday V. Shanbhag, 2025.
"Data-Driven Compositional Optimization in Misspecified Regimes,"
Operations Research, INFORMS, vol. 73(3), pages 1395-1411, May.
Handle:
RePEc:inm:oropre:v:73:y:2025:i:3:p:1395-1411
DOI: 10.1287/opre.2021.0295
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:73:y:2025:i:3:p:1395-1411. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.