IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2509.23128.html

Conditional Risk Minimization with Side Information: A Tractable, Universal Optimal Transport Framework

Author

Listed:
  • Xinqiao Xie
  • Jonathan Yu-Meng Li

Abstract

Conditional risk minimization arises in high-stakes decisions where risk must be assessed in light of side information, such as stressed economic conditions, specific customer profiles, or other contextual covariates. Constructing reliable conditional distributions from limited data is notoriously difficult, motivating a series of optimal-transport-based proposals that address this uncertainty in a distributionally robust manner. Yet these approaches remain fragmented, each constrained by its own limitations: some rely on point estimates or restrictive structural assumptions, others apply only to narrow classes of risk measures, and their structural connections are unclear. We introduce a universal framework for distributionally robust conditional risk minimization, built on a novel union-ball formulation in optimal transport. This framework offers three key advantages: interpretability, by subsuming existing methods as special cases and revealing their deep structural links; tractability, by yielding convex reformulations for virtually all major risk functionals studied in the literature; and scalability, by supporting cutting-plane algorithms for large-scale conditional risk problems. Applications to portfolio optimization with rank-dependent expected utility highlight the practical effectiveness of the framework, with conditional models converging to optimal solutions where unconditional ones clearly do not.

Suggested Citation

  • Xinqiao Xie & Jonathan Yu-Meng Li, 2025. "Conditional Risk Minimization with Side Information: A Tractable, Universal Optimal Transport Framework," Papers 2509.23128, arXiv.org.
  • Handle: RePEc:arx:papers:2509.23128
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2509.23128
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yichun Hu & Nathan Kallus & Xiaojie Mao, 2022. "Fast Rates for Contextual Linear Optimization," Management Science, INFORMS, vol. 68(6), pages 4236-4245, June.
    2. Rui Gao & Anton Kleywegt, 2023. "Distributionally Robust Stochastic Optimization with Wasserstein Distance," Mathematics of Operations Research, INFORMS, vol. 48(2), pages 603-655, May.
    3. Luhao Zhang & Jincheng Yang & Rui Gao, 2024. "Optimal Robust Policy for Feature-Based Newsvendor," Management Science, INFORMS, vol. 70(4), pages 2315-2329, April.
    4. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    5. Adam N. Elmachtoub & Paul Grigas, 2022. "Smart “Predict, then Optimize”," Management Science, INFORMS, vol. 68(1), pages 9-26, January.
    6. Viet Anh Nguyen & Fan Zhang & Shanshan Wang & Jose Blanchet & Erick Delage & Yinyu Ye, 2021. "Robustifying Conditional Portfolio Decisions via Optimal Transport," Papers 2103.16451, arXiv.org, revised Apr 2024.
    7. Muñoz, M.A. & Pineda, S. & Morales, J.M., 2022. "A bilevel framework for decision-making under uncertainty with contextual information," Omega, Elsevier, vol. 108(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Li Chen & Melvyn Sim & Xun Zhang & Long Zhao & Minglong Zhou, 2026. "Robust Actionable Prescriptive Analytics," Operations Research, INFORMS, vol. 74(1), pages 550-571, January.
    2. Sadana, Utsav & Chenreddy, Abhilash & Delage, Erick & Forel, Alexandre & Frejinger, Emma & Vidal, Thibaut, 2025. "A survey of contextual optimization methods for decision-making under uncertainty," European Journal of Operational Research, Elsevier, vol. 320(2), pages 271-289.
    3. Luhao Zhang & Jincheng Yang & Rui Gao, 2024. "Optimal Robust Policy for Feature-Based Newsvendor," Management Science, INFORMS, vol. 70(4), pages 2315-2329, April.
    4. Mingyang Fu & Xiaobo Li & Lianmin Zhang, 2024. "Distributionally Robust Newsvendor Under Stochastic Dominance with a Feature-Based Application," Manufacturing & Service Operations Management, INFORMS, vol. 26(5), pages 1962-1977, September.
    5. Corredera, Alberto & Ruiz, Carlos, 2023. "Prescriptive selection of machine learning hyperparameters with applications in power markets: Retailer’s optimal trading," European Journal of Operational Research, Elsevier, vol. 306(1), pages 370-388.
    6. Jingkai Huang & Kevin Shang & Yi Yang & Weihua Zhou & Yuan Li, 2025. "Taylor Approximation of Inventory Policies for One-Warehouse, Multi-Retailer Systems with Demand Feature Information," Management Science, INFORMS, vol. 71(1), pages 879-897, January.
    7. Rohit Kannan & Güzin Bayraksan & James R. Luedtke, 2025. "Technical Note—Data-Driven Sample Average Approximation with Covariate Information," Operations Research, INFORMS, vol. 73(6), pages 3245-3259, November.
    8. Viet Anh Nguyen & Fan Zhang & Shanshan Wang & José Blanchet & Erick Delage & Yinyu Ye, 2025. "Robustifying Conditional Portfolio Decisions via Optimal Transport," Operations Research, INFORMS, vol. 73(5), pages 2801-2829, September.
    9. Tobias Sutter & Bart P. G. Van Parys & Daniel Kuhn, 2024. "A Pareto Dominance Principle for Data-Driven Optimization," Operations Research, INFORMS, vol. 72(5), pages 1976-1999, September.
    10. Alcántara Mata, Antonio & Ruiz Mora, Carlos, 2022. "Optimal day-ahead offering strategy for large producers based on market price response learning," DES - Working Papers. Statistics and Econometrics. WS 34605, Universidad Carlos III de Madrid. Departamento de Estadística.
    11. Zhang, Yuying & Deng, Shiming & Wang, Wanpeng, 2026. "Feature-based profitability evaluation for newsvendor-type products," Omega, Elsevier, vol. 141(C).
    12. Joaquim Dias Garcia & Alexandre Street & Tito Homem-de-Mello & Francisco D. Muñoz, 2025. "Application-Driven Learning: A Closed-Loop Prediction and Optimization Approach Applied to Dynamic Reserves and Demand Forecasting," Operations Research, INFORMS, vol. 73(1), pages 22-39, January.
    13. Ali Shirali & Rediet Abebe & Moritz Hardt, 2024. "Allocation Requires Prediction Only if Inequality Is Low," Papers 2406.13882, arXiv.org.
    14. Nathan Kallus & Xiaojie Mao, 2023. "Stochastic Optimization Forests," Management Science, INFORMS, vol. 69(4), pages 1975-1994, April.
    15. Bernardo K. Pagnoncelli & Domingo Ramírez & Hamed Rahimian & Arturo Cifuentes, 2023. "A Synthetic Data-Plus-Features Driven Approach for Portfolio Optimization," Computational Economics, Springer;Society for Computational Economics, vol. 62(1), pages 187-204, June.
    16. Qi Feng & J. George Shanthikumar & Jian Wu, 2025. "Contextual Data-Integrated Newsvendor Solution with Operational Data Analytics (ODA)," Management Science, INFORMS, vol. 71(11), pages 9384-9403, November.
    17. Othman El Balghiti & Adam N. Elmachtoub & Paul Grigas & Ambuj Tewari, 2023. "Generalization Bounds in the Predict-Then-Optimize Framework," Mathematics of Operations Research, INFORMS, vol. 48(4), pages 2043-2065, November.
    18. Tian, Xuecheng & Wang, Shuaian & Liu, Yan & Yang, Ying, 2025. "Data-driven optimization for container ship bunkering management under fuel price uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 198(C).
    19. Notz, Pascal M. & Pibernik, Richard, 2024. "Explainable subgradient tree boosting for prescriptive analytics in operations management," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1119-1133.
    20. Tian, Xuecheng & Yan, Ran & Liu, Yannick & Wang, Shuaian, 2023. "A smart predict-then-optimize method for targeted and cost-effective maritime transportation," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 32-52.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:2509.23128. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.