IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i16p3572-d1219611.html
   My bibliography  Save this article

Nested Maximum Entropy Designs for Computer Experiments

Author

Listed:
  • Weiyan Mu

    (School of Science, Beijing University of Civil Engineering and Architecture, Beijing 100044, China)

  • Chengxin Liu

    (School of Science, Beijing University of Civil Engineering and Architecture, Beijing 100044, China)

  • Shifeng Xiong

    (NCMIS, KLSC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China)

Abstract

Presently, computer experiments with multiple levels of accuracy are widely applied in science and engineering. This paper introduces a class of nested maximum entropy designs for such computer experiments. A multi-layer DETMAX algorithm is proposed to construct nested maximum entropy designs. Based on nested maximum entropy designs, we also propose an integer-programming procedure to specify the sample sizes in multi-fidelity computer experiments. Simulated annealing techniques are used to tackle complex optimization problems in the proposed methods. Illustrative examples show that the proposed nested entropy designs can yield better prediction results than nested Latin hypercube designs in the literature and that the proposed sample-size determination method is effective.

Suggested Citation

  • Weiyan Mu & Chengxin Liu & Shifeng Xiong, 2023. "Nested Maximum Entropy Designs for Computer Experiments," Mathematics, MDPI, vol. 11(16), pages 1-12, August.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:16:p:3572-:d:1219611
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/16/3572/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/16/3572/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yunfei Wei & Shifeng Xiong, 2019. "Bayesian integrative analysis for multi-fidelity computer experiments," Journal of Applied Statistics, Taylor & Francis Journals, vol. 46(11), pages 1973-1987, August.
    2. Sukanta Dash & Baidya Nath Mandal & Rajender Parsad, 2020. "On the construction of nested orthogonal Latin hypercube designs," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 83(3), pages 347-353, April.
    3. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Discussion Paper 2009-06, Tilburg University, Center for Economic Research.
    4. Bing Guo & Xue-Ping Chen & Min-Qian Liu, 2020. "Construction of Latin hypercube designs with nested and sliced structures," Statistical Papers, Springer, vol. 61(2), pages 727-740, April.
    5. Mu, Weiyan & Xiong, Shifeng, 2018. "A class of space-filling designs and their projection properties," Statistics & Probability Letters, Elsevier, vol. 141(C), pages 129-134.
    6. Cox, Dennis D. & Park, Jeong-Soo & Singer, Clifford E., 2001. "A statistical method for tuning a computer code to a data base," Computational Statistics & Data Analysis, Elsevier, vol. 37(1), pages 77-92, July.
    7. Yaping Wang & Fasheng Sun & Hongquan Xu, 2022. "On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 117(537), pages 375-385, January.
    8. Xu, Jin & Duan, Xiaojun & Wang, Zhengming & Yan, Liang, 2018. "A general construction for nested Latin hypercube designs," Statistics & Probability Letters, Elsevier, vol. 134(C), pages 134-140.
    9. Weiyan Mu & Qiuyue Wei & Dongli Cui & Shifeng Xiong, 2018. "Best Linear Unbiased Prediction for Multifidelity Computer Experiments," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-7, June.
    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. Bing Guo & Xiao-Rong Li & Min-Qian Liu & Xue Yang, 2023. "Construction of orthogonal general sliced Latin hypercube designs," Statistical Papers, Springer, vol. 64(3), pages 987-1014, June.
    2. Hao Chen & Yan Zhang & Xue Yang, 2021. "Uniform projection nested Latin hypercube designs," Statistical Papers, Springer, vol. 62(4), pages 2031-2045, August.
    3. Merlin Keller & Guillaume Damblin & Alberto Pasanisi & Mathieu Schumann & Pierre Barbillon & Fabrizio Ruggeri, 2022. "Validation of a Computer Code for the Energy Consumption of a Building, with Application to Optimal Electric Bill Pricing," Post-Print hal-04071903, HAL.
    4. Peyman Bahrami & Farzan Sahari Moghaddam & Lesley A. James, 2022. "A Review of Proxy Modeling Highlighting Applications for Reservoir Engineering," Energies, MDPI, vol. 15(14), pages 1-32, July.
    5. Edwin Dam & Bart Husslage & Dick Hertog, 2010. "One-dimensional nested maximin designs," Journal of Global Optimization, Springer, vol. 46(2), pages 287-306, February.
    6. Merlin Keller & Guillaume Damblin & Alberto Pasanisi & Mathieu Schumann & Pierre Barbillon & Fabrizio Ruggeri & Eric Parent, 2022. "Validation of a Computer Code for the Energy Consumption of a Building, with Application to Optimal Electric Bill Pricing," Econometrics, MDPI, vol. 10(4), pages 1-24, November.
    7. Jin Xu & Jiajie Chen & Peter Z. G. Qian, 2015. "Sequentially Refined Latin Hypercube Designs: Reusing Every Point," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 110(512), pages 1696-1706, December.
    8. Shields, Michael D. & Teferra, Kirubel & Hapij, Adam & Daddazio, Raymond P., 2015. "Refined Stratified Sampling for efficient Monte Carlo based uncertainty quantification," Reliability Engineering and System Safety, Elsevier, vol. 142(C), pages 310-325.
    9. Wang, Chunyan & Lin, Dennis K.J., 2024. "Strong orthogonal Latin hypercubes for computer experiments," Computational Statistics & Data Analysis, Elsevier, vol. 198(C).
    10. Trucano, T.G. & Swiler, L.P. & Igusa, T. & Oberkampf, W.L. & Pilch, M., 2006. "Calibration, validation, and sensitivity analysis: What's what," Reliability Engineering and System Safety, Elsevier, vol. 91(10), pages 1331-1357.
    11. Razmi, Afshin & Rahbar, Morteza & Bemanian, Mohammadreza, 2022. "PCA-ANN integrated NSGA-III framework for dormitory building design optimization: Energy efficiency, daylight, and thermal comfort," Applied Energy, Elsevier, vol. 305(C).
    12. Husslage, B.G.M. & Rennen, G. & van Dam, E.R. & den Hertog, D., 2011. "Space-filling Latin hypercube designs for computer experiments," Other publications TiSEM 694f73df-a373-46a7-aa4d-1, Tilburg University, School of Economics and Management.
    13. Xiaodi Wang & Hengzhen Huang, 2024. "Nested symmetrical Latin hypercube designs," Statistical Papers, Springer, vol. 65(7), pages 4299-4330, September.
    14. van Dam, E.R., 2008. "Two-dimensional maximin Latin hypercube designs," Other publications TiSEM 61788dd1-b1b5-4c81-9151-8, Tilburg University, School of Economics and Management.
    15. Chen, Ray-Bing & Hsu, Yen-Wen & Hung, Ying & Wang, Weichung, 2014. "Discrete particle swarm optimization for constructing uniform design on irregular regions," Computational Statistics & Data Analysis, Elsevier, vol. 72(C), pages 282-297.
    16. Wang, Sumin & Wang, Dongying & Sun, Fasheng, 2019. "A central limit theorem for marginally coupled designs," Statistics & Probability Letters, Elsevier, vol. 146(C), pages 168-174.
    17. Ray-Bing Chen & Ying-Chao Hung & Weichung Wang & Sung-Wei Yen, 2013. "Contour estimation via two fidelity computer simulators under limited resources," Computational Statistics, Springer, vol. 28(4), pages 1813-1834, August.
    18. Huaimin Diao & Yan Wang & Dianpeng Wang, 2022. "A D-Optimal Sequential Calibration Design for Computer Models," Mathematics, MDPI, vol. 10(9), pages 1-15, April.
    19. Wang, Xiaodi & Huang, Hengzhen, 2023. "Group symmetric Latin hypercube designs for symmetrical global sensitivity analysis," Computational Statistics & Data Analysis, Elsevier, vol. 179(C).

    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:gam:jmathe:v:11:y:2023:i:16:p:3572-:d:1219611. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.