The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
An informational approach to the global optimization of expensive-to-evaluate functions
Open accessAbstract
In many global optimization problems motivated by engineering applications, the number of function evaluations is severely limited by time or cost. To ensure that each evaluation contributes to the localization of good candidates for the role of global minimizer, a sequential choice of evaluation points is usually carried out. In particular, when Kriging is used to interpolate past evaluations, the uncertainty associated with the lack of information on the function can be expressed and used to compute a number of criteria accounting for the interest of an additional evaluation at any given point. This paper introduces minimizers entropy as a new Kriging-based criterion for the sequential choice of points at which the function should be evaluated. Based on stepwise uncertainty reduction, it accounts for the informational gain on the minimizer expected from a new evaluation. The criterion is approximated using conditional simulations of the Gaussian process model behind Kriging, and then inserted into an algorithm similar in spirit to the Efficient Global Optimization (EGO) algorithm. An empirical comparison is carried out between our criterion and expected improvement, one of the reference criteria in the literature. Experimental results indicate major evaluation savings over EGO. Finally, the method, which we call IAGO (for Informational Approach to Global Optimization), is extended to robust optimization problems, where both the factors to be tuned and the function evaluations are corrupted by noise.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070 · cited 2×
“This criterion, directly inspired f romstepwise uncertainty reduction [9], is then inserted in an algorithm similar to theEfficient Global Optimization(EGO) algorithm [14].”
MethodAdvances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
Matheron, G. (1963) · Economic Geology · doi:10.2113/gsecongeo.58.8.1246 · Cited by 4,845
Understanding the Metropolis-Hastings Algorithm
Chib, S., & Greenberg, E. (1995) · The American Statistician · doi:10.1080/00031305.1995.10476177 · Cited by 4,145
Geostatistics: Modeling Spatial Uncertainty
Stein, M. L., Chiles, J.-P., & Delfiner, P. (2000) · Journal of the American Statistical Association · doi:10.2307/2669569 · Cited by 2,880
Stein, M. L. (1999) · Springer Series in Statistics · doi:10.1007/978-1-4612-1494-6 · Cited by 2,348
A Taxonomy of Global Optimization Methods Based on Response Surfaces
Jones, D. R. (2001) · Journal of Global Optimization · doi:10.1023/a:1012771025575 · Cited by 2,159
Interpolation of Spatial Data: Some Theory for Kriging
Rathbun, S. L., & Stein, M. L. (2000) · Journal of the American Statistical Association · doi:10.2307/2669494 · Cited by 1,916
Geostatistics: Modeling Spatial Uncertainty
Chilès, J., & Delfiner, P. (1999) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316993 · Cited by 1,834
Gaussian Processes for Regression
Williams, C. K. I., & Rasmussen, C. E. (1995) · Aston Publications Explorer (Aston University) · Cited by 1,246
A Radial Basis Function Method for Global Optimization
Gutmann, H.-M. (2001) · Journal of Global Optimization · doi:10.1023/a:1011255519438 · Cited by 910
Correlation theory of stationary and related random functions
Iaglom, A. M. (1987) · Springer eBooks · Cited by 769
Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models
Huang, D., Allen, T. T., Notz, W. I., & Zeng, N. (2006) · Journal of Global Optimization · doi:10.1007/s10898-005-2454-3 · Cited by 625
Estimation and Model Identification for Continuous Spatial Processes
Vecchia, A. V. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01729.x · Cited by 535
An active testing model for tracking roads in satellite images
Geman, D., & Jedynak, B. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.476006 · Cited by 498
Exploration of Metamodeling Sampling Criteria for Constrained Global Optimization
Sasena, M. J., Papalambros, P. Y., & Goovaerts, P. (2002) · Engineering Optimization · doi:10.1080/03052150211751 · Cited by 428
Computer experiments and global optimization
Welch, W. J., & Schonlau, M. (1997) · Library and Archives Canada (Government of Canada) · Cited by 382
Support Vector Machines, Reproducing Kernel Hilbert Spaces, and Randomized GACV
Wahba, G. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0009 · Cited by 318
A statistical method for global optimization
Cox, D. D., & John, S. (2003) · [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.1992.271617 · Cited by 302
On excursion sets, tube formulas and maxima of random fields
Adler, R. J. (2000) · The Annals of Applied Probability · doi:10.1214/aoap/1019737664 · Cited by 213
Sequential design of computer experiments to minimize integrated response functions
Notz, W. I., Santner, T. J., & Williams, B. J. (2000) · Cited by 135
Cited by
Taking the Human Out of the Loop: A Review of Bayesian Optimization
Shahriari, B., Swersky, K., Wang, Z., Adams, R. P., & de Freitas, N. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494218 · Cited by 6,049
(2011) · Cited by 3,939
Liu, H., Ong, Y.-S., & Cai, J. (2018) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-017-1739-8 · Cited by 444
Entropy search for information-efficient global optimization
Hennig, P., & Schuler, C. J. (2012) · Journal of Machine Learning Research · doi:10.5555/2188385.2343701 · Cited by 443
Predictive Entropy Search for Efficient Global Optimization of Black-box Functions
Hernández-Lobato, J. M., Hoffman, M. W., & Ghahramani, Z. (2014) · arXiv · doi:10.48550/arxiv.1406.2541 · Cited by 407
Metadata
- Authors
- Villemonteix, J., Vazquez, E., & Walter, E.
- Venue
- Journal of Global Optimization
- Published
- 2008-09-26
- Volume
- 44
- Issue
- 4
- Pages
- 509-534
- ISSN
- 0925-5001 (ISSN-L)
- 1573-2916
- OpenAlex
- W2020732830
- Cited by
- 308
- References
- 22
- FWCI
- 14.81
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.