CoChat
Sign Up
Cited by 10Advanced Bandit Algorithms ResearchAdvanced Multi-Objective Optimization AlgorithmsGaussian Processes and Bayesian Inference

The DOI matches its Crossref record.

Generalized hierarchical expected improvement method based on black-box functions of adaptive search strategy

Open access
Zhang, Lulu, Jin, Guang, Liu, Tianyu, Zhang, Ran·2022·Applied Mathematical Modelling
DOI 10.1016/j.apm.2021.12.041
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1016/j.apm.2021.12.041

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 24

  1. Muller, 2019, Surrogate optimization of computationally expensive black-box problems with hidden constraints, Informs J. Comput., 31, 689, 10.1287/ijoc.2018.0864 · DOI
  2. Tenne, 2017, Machine-learning in optimization of expensive black-box function, Int. J. Appl. Math. Comput. Sci., 27, 105, 10.1515/amcs-2017-0008 · DOI
  3. Bjrkman, 2000, Global optimization of costly nonconvex functions using radial basis functions, Optim. Eng., 1, 373, 10.1023/A:1011584207202 · DOI
  4. Muratore, 2021, Data-efficient domain randomization with bayesian optimization, IEEE Robotic. Automat. Lett., 6, 911, 10.1109/LRA.2021.3052391 · DOI · Paper page
  5. Mak, 2018, An efficient surrogate model for emulation and physics extraction of large eddy simulations, J. Am. Stat. Assoc., 113, 1443, 10.1080/01621459.2017.1409123 · DOI
  6. Bull, 2011, Convergence rates of efficient global optimization algorithms, J. Mach. Learn. Res., 12, 2879
  7. Jones, 1998, Efficient global optimization of expensive black-box functions, J Glob Optim, 13, 455, 10.1023/A:1008306431147 · DOI · Paper page
  8. Qin, 2017, Improving the expected improvement algorithm, Adv. Neural Inf. Process. Syst., 5381
  9. Zhang, 2018, Variable-fidelity expected improvement method for efficient global optimization of expensive functions, Struct. Multidiscip. Optim., 58, 1431, 10.1007/s00158-018-1971-x · DOI
  10. Mockus, 1978, The application of bayesian methods for seeking the extremum, Towards Global Optim., 2, 117
  11. Zhang, 2017, Estimation of the pareto front in stochastic simulation through stochastic kriging, Simul. Modell. Pract. Theory, 79, 69, 10.1016/j.simpat.2017.09.006 · DOI
  12. Bergstra, 2012, Random search for hyperparameter optimization, J. Mach. Learn. Res., 13, 281
  13. Mak, 2019, Analysis-of-marginal-tail-means(ATM): a robust method for discrete black-box optimization, Technometrics, 61, 545, 10.1080/00401706.2019.1593246 · DOI
  14. Ryzhov, 2016, On the convergence rates of expected improvement methods, Oper. Res., 1
  15. Vazquez, 2010, Convergence properties of the expected improvement algorithm with fixed mean and covariance function, J. Stat. Plan. Inference, 140, 3088, 10.1016/j.jspi.2010.04.018 · DOI
  16. Snoek, 2012, Practical Bayesian optimization of machine learning algorithms, Adv. Neural Inf. Process. Syst., 2951
  17. Chen, 2019, A hierarchical expected improvement method for bayesian optimization, eprint arXiv:1911.07285 · arXiv
  18. Shu, 2020, A multi-fidelity bayesian optimization approach based on the expected further improvement, Struct. Multidiscip.
  19. Qian, 2008, Bayesian hierarchical modeling for integrating low-accuracy and high-accuracy experiments, Technometrics, 50, 192, 10.1198/004017008000000082 · DOI
  20. Tuo, 2016, A theoretical framework for calibration in computer models: parametrization, estimation and convergence properties, Siam/asa J. Uncertain. Quantificat., 4, 767, 10.1137/151005841 · DOI
  21. Schwarz, 1978, Estimating the dimension of a model, Annal. Stat., 6, 461, 10.1214/aos/1176344136 · DOI · Paper page
  22. He, 2016, A central limit theorem for nested or sliced latin hypercube designs, Statistica Sinica, 26, 1117
  23. Adell, 2014, Dose and dose rate effect in microelectronics: pushing the limits to extreme conditions, Proc. IEEE Nucl. Space Radiat. Effects Conf. Paris, France
  24. Zhang, 2018, Modeling of Dybanic behavior of carbon fiber-reinforced polymer (CFRP) composite under X-ray radiation, Materials, 11, 143, 10.3390/ma11010143 · DOI

Cited by

Sorted by citations

Metadata

Authors
Zhang, L., Jin, G., Liu, T., & Zhang, R.
Affiliations
National University of Defense Technology (CN)
Corresponding author
Jin, Guang
ORCID
Venue
Applied Mathematical Modelling
Publisher
Elsevier BV
Published
2022-06
Volume
106
Pages
30-44
ISSN
0307-904X (ISSN-L)
DOI
10.1016/j.apm.2021.12.041
OpenAlex
W4206983367
Cited by
10
References
0
Citations by year
2026: 1 · 2025: 3 · 2024: 4 · 2023: 1 · 2022: 1
FWCI
1.38
Type
journal article
Language
en
Open access
Licence
Locations
Applied Mathematical Modelling (publishedVersion)
Topics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Gaussian Processes and Bayesian Inference
Keywords
Bayesian optimization, black-box functions, adaptive search strategy, acquisition functions, hierarchical Gaussian process, hyperparameter estimation, basis function selection, surrogate-based optimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review