IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v302y2021i1d10.1007_s10479-021-03991-8.html
   My bibliography  Save this article

Minimization of a class of rare event probabilities and buffered probabilities of exceedance

Author

Listed:
  • Amarjit Budhiraja

    (The University of North Carolina at Chapel Hill (UNC))

  • Shu Lu

    (The University of North Carolina at Chapel Hill (UNC))

  • Yang Yu

    (The University of North Carolina at Chapel Hill (UNC))

  • Quoc Tran-Dinh

    (The University of North Carolina at Chapel Hill (UNC))

Abstract

We consider the problem of choosing design parameters to minimize the probability of an undesired rare event that is described through the average of n i.i.d. random variables. Since the probability of interest for near optimal design parameters is very small, one needs to develop suitable accelerated Monte-Carlo methods for estimating its value. One of the challenges in the study is that simulating from exponential twists of the laws of the summands may be computationally demanding since these transformed laws may be non-standard and intractable. We consider a setting where the summands are given as a nonlinear functional of random variables, the exponential twists of whose distributions take a simpler form than those for the original summands. We use techniques from Dupuis and Wang (Stochastics 76(6):481–508, 2004, Math Oper Res 32(3):723–757, 2007) to identify the appropriate Issacs equations whose subsolutions are used to construct tractable importance sampling (IS) schemes. We also study the closely related problem of estimating buffered probability of exceedance and provide the first rigorous results that relate the asymptotics of buffered probability and that of the ordinary probability under a large deviation scaling. The analogous minimization problem for buffered probability, under conditions, can be formulated as a convex optimization problem. We show that, under conditions, changes of measures that are asymptotically efficient (under the large deviation scaling) for estimating ordinary probability are also asymptotically efficient for estimating the buffered probability of exceedance. We embed the constructed IS scheme in gradient descent algorithms to solve the optimization problems, and illustrate these schemes through computational experiments.

Suggested Citation

  • Amarjit Budhiraja & Shu Lu & Yang Yu & Quoc Tran-Dinh, 2021. "Minimization of a class of rare event probabilities and buffered probabilities of exceedance," Annals of Operations Research, Springer, vol. 302(1), pages 49-83, July.
  • Handle: RePEc:spr:annopr:v:302:y:2021:i:1:d:10.1007_s10479-021-03991-8
    DOI: 10.1007/s10479-021-03991-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-021-03991-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-021-03991-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Paul Dupuis & Hui Wang, 2007. "Subsolutions of an Isaacs Equation and Efficient Schemes for Importance Sampling," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 723-757, August.
    2. I. Bremer & R. Henrion & A. Möller, 2015. "Probabilistic constraints via SQP solver: application to a renewable energy management problem," Computational Management Science, Springer, vol. 12(3), pages 435-459, July.
    3. Pierre L’Ecuyer & Bruno Tuffin, 2011. "Approximating zero-variance importance sampling in a reliability setting," Annals of Operations Research, Springer, vol. 189(1), pages 277-297, September.
    4. Evans, Michael & Swartz, Timothy, 2000. "Approximating Integrals via Monte Carlo and Deterministic Methods," OUP Catalogue, Oxford University Press, number 9780198502784.
    5. B. K. Pagnoncelli & S. Ahmed & A. Shapiro, 2009. "Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 399-416, August.
    6. Rockafellar, R.T. & Royset, J.O., 2010. "On buffered failure probability in design and optimization of structures," Reliability Engineering and System Safety, Elsevier, vol. 95(5), pages 499-510.
    7. Ad Ridder, 2005. "Importance Sampling Simulations of Markovian Reliability Systems Using Cross-Entropy," Annals of Operations Research, Springer, vol. 134(1), pages 119-136, February.
    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. L. Jeff Hong & Zhaolin Hu & Liwei Zhang, 2014. "Conditional Value-at-Risk Approximation to Value-at-Risk Constrained Programs: A Remedy via Monte Carlo," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 385-400, May.
    2. Lirong Cui & Shijia Du & Aofu Zhang, 2014. "Reliability measures for two-part partition of states for aggregated Markov repairable systems," Annals of Operations Research, Springer, vol. 212(1), pages 93-114, January.
    3. repec:jss:jstsof:33:i11 is not listed on IDEAS
    4. Matthew Norton & Valentyn Khokhlov & Stan Uryasev, 2021. "Calculating CVaR and bPOE for common probability distributions with application to portfolio optimization and density estimation," Annals of Operations Research, Springer, vol. 299(1), pages 1281-1315, April.
    5. Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo & Newman, Alexandra, 2024. "A target-time-windows technique for project scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 314(2), pages 792-806.
    6. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    7. G. Pantuso & L. M. Hvattum, 2021. "Maximizing performance with an eye on the finances: a chance-constrained model for football transfer market decisions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 583-611, July.
    8. Xiaojiao Tong & Hailin Sun & Xiao Luo & Quanguo Zheng, 2018. "Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems," Journal of Global Optimization, Springer, vol. 70(1), pages 131-158, January.
    9. Hadi Karimi & Sandra D. Ekşioğlu & Michael Carbajales-Dale, 2021. "A biobjective chance constrained optimization model to evaluate the economic and environmental impacts of biopower supply chains," Annals of Operations Research, Springer, vol. 296(1), pages 95-130, January.
    10. Thilini V. Mahanama & Abootaleb Shirvani & Svetlozar Rachev, 2023. "The Financial Market of Indices of Socioeconomic Wellbeing," Papers 2303.05654, arXiv.org.
    11. Jiang, Jie & Peng, Shen, 2024. "Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 616-627.
    12. Chen, Zhen & Archibald, Thomas W., 2024. "Maximizing the survival probability in a cash flow inventory problem with a joint service level constraint," International Journal of Production Economics, Elsevier, vol. 270(C).
    13. Massimiliano Amarante, 2016. "A representation of risk measures," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 39(1), pages 95-103, April.
    14. Hu, Shaolong & Dong, Zhijie Sasha & Dai, Rui, 2024. "A machine learning based sample average approximation for supplier selection with option contract in humanitarian relief," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    15. Episcopos, Athanasios, 2004. "The implied reserves of the Bank Insurance Fund," Journal of Banking & Finance, Elsevier, vol. 28(7), pages 1617-1635, July.
    16. Nott, David J. & Fielding, Mark & Leonte, Daniela, 2009. "On a generalization of the Laplace approximation," Statistics & Probability Letters, Elsevier, vol. 79(11), pages 1397-1403, June.
    17. Kleijnen, Jack P.C. & Ridder, A.A.N. & Rubinstein, R.Y., 2010. "Variance Reduction Techniques in Monte Carlo Methods," Other publications TiSEM 87680d1a-53c1-4107-ada4-7, Tilburg University, School of Economics and Management.
    18. Mafusalov, Alexander & Uryasev, Stan, 2016. "CVaR (superquantile) norm: Stochastic case," European Journal of Operational Research, Elsevier, vol. 249(1), pages 200-208.
    19. Ming Liu & Yueyu Ding & Lihua Sun & Runchun Zhang & Yue Dong & Zihan Zhao & Yiting Wang & Chaoran Liu, 2023. "Green Airline-Fleet Assignment with Uncertain Passenger Demand and Fuel Price," Sustainability, MDPI, vol. 15(2), pages 1-22, January.
    20. Yi Zhao & Qingwan Xue & Xi Zhang, 2018. "Stochastic Empty Container Repositioning Problem with CO 2 Emission Considerations for an Intermodal Transportation System," Sustainability, MDPI, vol. 10(11), pages 1-24, November.
    21. Berridge, S.J. & Schumacher, J.M., 2002. "An Irregular Grid Approach for Pricing High Dimensional American Options," Other publications TiSEM 416a6d43-3466-47e0-b656-d, Tilburg University, School of Economics and Management.

    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:spr:annopr:v:302:y:2021:i:1:d:10.1007_s10479-021-03991-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.