Distributionally robust stochastic programs with side information based on trimmings
This is a research paper whose authors are Adrián Esteban-Pérez and Juan M. Morales.
Abstract:
- We look at stochastic programmes that are conditional on some covariate information, where the only knowledge of the possible relationship between the unknown parameters and the covariates is a limited data sample of their joint distribution. We build a data-driven Distributionally Robust Optimization (DRO) framework to hedge the decision against the inherent error in the process of inferring conditional information from limited joint data by leveraging the close relationship between the notion of trimmings of a probability measure and the partial mass transportation problem.
- We demonstrate that our technique is computationally as tractable as the usual (no side information) Wasserstein-metric-based DRO and provides performance guarantees. Furthermore, our DRO framework may be easily applied to data-driven decision-making issues involving tainted samples. Finally, using a single-item newsvendor problem and a portfolio allocation problem with side information, the theoretical findings are presented.
Conclusions:
- We used the relationship between probability reductions and partial mass transit in this study to give a straightforward, yet powerful and creative technique to expand the usual Wasserstein-metric-based DRO to the situation of conditional stochastic programming. In the process of inferring the conditional probability measure of the random parameters from a limited sample drawn from the genuine joint data-generating distribution, our technique generates judgments that are distributionally resilient to uncertainty. In a series of numerical tests based on the single-item newsvendor issue and a portfolio allocation problem, we proved that our strategy achieves much higher out-of-sample performance than several current options. We backed up these actual findings with theoretical analysis, demonstrating that our strategy had appealing performance guarantees.
To learn more about probability, visit :
brainly.com/question/11234923
#SPJ4
B because the distance between p to b is 1/4 of the line and the distance between p to a is 3/4 of the line
Hi!
Factors of 12: 1, 2, 3, 4, 6, 12
Factors of 30: 1, 2, 3, 5, 6, 10, 30
Explanation: <u><em>This question is super super easy. This question should be the least common multiples. First find the prime factorization of 12. It gave us 2*2*3=12. Then the prime factorization of 30. It gave us 2*3*5=30. You can also multiply each factors the greater number of times and it occurs to in steps 1 or step 2 and it gave us LCM=2*2*3*5=60. The least common multiple factors is 60 is the right answer. Hope this helps! And thank you for posting your question at here on Brainly. And have a great day. -Charlie</em></u>
