Likelihood Robust Optimization for Data-driven Problems
Not on the map. Why?
Abstract (arXiv)
We consider optimal decision-making problems in an uncertain environment. In particular, we consider the case in which the distribution of the input is unknown, yet there is abundant historical data drawn from the distribution. In this paper, we propose a new type of distributionally robust optimization model called the likelihood robust optimization (LRO) model for this class of problems. In contrast to previous work on distributionally robust optimization that focuses on certain parameters (e.g., mean, variance, etc.) of the input distribution, we exploit the historical data and define the accessible distribution set to contain only those distributions that make the observed data achieve a certain level of likelihood. Then we formulate the targeting problem as one of optimizing the expected value of the objective function under the worst-case distribution in that set. Our model avoids the over-conservativeness of some prior robust approaches by ruling out unrealistic distributions while maintaining robustness of the solution for any statistically likely outcomes. We present statistical analyses of our model using Bayesian statistics and empirical likelihood theory. Specifically, we prove the asymptotic behavior of our distribution set and establish the relationship between our model and other distributionally robust models. To test the performance of our model, we apply it to the newsvendor problem and the portfolio selection problem. The test results show that the solutions of our model indeed have desirable performance.
Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Jul 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 3; 2023: 1; 2024: 2; 2025: 2.
13 papers.
Sort:
- 2021Distributionally Robust Learningcited by 44
- 2021Sinkhorn Distributionally Robust Optimizationcited by 38
- 2022Holistic Robust Data-Driven Decisionscited by 18
- 2021Poisoning Attack against Estimating from Pairwise Comparisonscited by 14
- 2023Unifying Distributionally Robust Optimization via Optimal Transport Theorycited by 13
- 2024Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spacescited by 8
- 2025Worst-case generation via minimax optimization in Wasserstein spacecited by 7
- 2024Evaluating Model Performance Under Worst-case Subpopulationscited by 5
- 2021Adversarially Robust Kernel Smoothingcited by 4
- 2021A data-driven approach to beating SAA out-of-samplecited by 3
- 2022Bilevel Optimization for Feature Selection in the Data-Driven Newsvendor Problemcited by 3
- 2022Optimal Methods for Convex Risk Averse Distributed Optimizationcited by 2
1 more
- 2025Worst-case generation via minimax optimization in Wasserstein space9 Dec 2025
- 2025PASTA: A Unified Framework for Offline Assortment Learning2 Oct 2025
- 2024Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces29 Dec 2024
- 2024Evaluating Model Performance Under Worst-case Subpopulations1 Jul 2024
- 2023Unifying Distributionally Robust Optimization via Optimal Transport Theory10 Aug 2023
- 2022Bilevel Optimization for Feature Selection in the Data-Driven Newsvendor Problem12 Sep 2022
- 2022Holistic Robust Data-Driven Decisions19 Jul 2022
- 2022Optimal Methods for Convex Risk Averse Distributed Optimization10 Mar 2022
- 2021Sinkhorn Distributionally Robust Optimization24 Sep 2021
- 2021Distributionally Robust Learning20 Aug 2021
- 2021Poisoning Attack against Estimating from Pairwise Comparisons5 Jul 2021
- 2021A data-driven approach to beating SAA out-of-sample26 May 2021
1 more
- 2021Adversarially Robust Kernel Smoothing16 Feb 2021
- 2021Distributionally Robust Learningcited by 44
- 2021Sinkhorn Distributionally Robust Optimizationcited by 38
- 2022Holistic Robust Data-Driven Decisionscited by 18
- 2021Poisoning Attack against Estimating from Pairwise Comparisonscited by 14
- 2023Unifying Distributionally Robust Optimization via Optimal Transport Theorycited by 13
- 2024Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spacescited by 8
- 2025Worst-case generation via minimax optimization in Wasserstein spacecited by 7
- 2024Evaluating Model Performance Under Worst-case Subpopulationscited by 5
- 2021Adversarially Robust Kernel Smoothingcited by 4
- 2021A data-driven approach to beating SAA out-of-samplecited by 3
- 2022Bilevel Optimization for Feature Selection in the Data-Driven Newsvendor Problemcited by 3
- 2022Optimal Methods for Convex Risk Averse Distributed Optimizationcited by 2
12 most cited of 13 All 13 (JSON)
- 2025Worst-case generation via minimax optimization in Wasserstein space9 Dec 2025
- 2025PASTA: A Unified Framework for Offline Assortment Learning2 Oct 2025
- 2024Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces29 Dec 2024
- 2024Evaluating Model Performance Under Worst-case Subpopulations1 Jul 2024
- 2023Unifying Distributionally Robust Optimization via Optimal Transport Theory10 Aug 2023
- 2022Bilevel Optimization for Feature Selection in the Data-Driven Newsvendor Problem12 Sep 2022
- 2022Holistic Robust Data-Driven Decisions19 Jul 2022
- 2022Optimal Methods for Convex Risk Averse Distributed Optimization10 Mar 2022
- 2021Sinkhorn Distributionally Robust Optimization24 Sep 2021
- 2021Distributionally Robust Learning20 Aug 2021
- 2021Poisoning Attack against Estimating from Pairwise Comparisons5 Jul 2021
- 2021A data-driven approach to beating SAA out-of-sample26 May 2021
12 newest of 13 All 13 (JSON)