The DOI matches its Crossref record.
A New Method of Locating the Maximum Point of an Arbitrary Multipeak Curve in the Presence of Noise
Abstract
A versatile and practical method of searching a parameter space is presented. Theoretical and experimental results illustrate the usefulness of the method for such problems as the experimental optimization of the performance of a system with a very general multipeak performance function when the only available information is noise-distributed samples of the function. At present, its usefulness is restricted to optimization with respect to one system parameter. The observations are taken sequentially; but, as opposed to the gradient method, the observation may be located anywhere on the parameter interval. A sequence of estimates of the location of the curve maximum is generated. The location of the next observation may be interpreted as the location of the most likely competitor (with the current best estimate) for the location of the curve maximum. A Brownian motion stochastic process is selected as a model for the unknown function, and the observations are interpreted with respect to the model. The model gives the results a simple intuitive interpretation and allows the use of simple but efficient sampling procedures. The resulting process possesses some powerful convergence properties in the presence of noise; it is nonparametric and, despite its generality, is efficient in the use of observations. The approach seems quite promising as a solution to many of the problems of experimental system optimization.
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
Cited by
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
Practical Bayesian Optimization of Machine Learning Algorithms
Snoek, J., Larochelle, H., & Adams, R. P. (2012) · arXiv · doi:10.48550/arxiv.1206.2944 · Cited by 6,691
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
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
Probabilistic machine learning and artificial intelligence
Ghahramani, Z. (2015) · Nature · doi:10.1038/nature14541 · Cited by 1,995
A Radial Basis Function Method for Global Optimization
Gutmann, H.-M. (2001) · Journal of Global Optimization · doi:10.1023/a:1011255519438 · Cited by 910
Lookman, T., Balachandran, P. V., Xue, D., & Yuan, R. (2019) · npj Computational Materials · doi:10.1038/s41524-019-0153-8 · Cited by 832
Frazier, P. I. (2018) · Recent Advances in Optimization and Modeling of Contemporary Problems · doi:10.1287/educ.2018.0188 · Cited by 826
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
Scalable Bayesian Optimization Using Deep Neural Networks
Snoek, J., Rippel, O., Swersky, K., Kiros, R., Satish, N., Sundaram, N., Patwary, M. A., Prabhat, & Adams, R. P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.05700 · Cited by 613
Human-in-the-loop optimization of hip assistance with a soft exosuit during walking
Ding, Y., Kim, M., Kuindersma, S., & Walsh, C. J. (2018) · Science Robotics · doi:10.1126/scirobotics.aar5438 · Cited by 612
Bayesian Optimization for Adaptive Experimental Design: A Review
Greenhill, S., Rana, S., Gupta, S., Vellanki, P., & Venkatesh, S. (2020) · IEEE Access · doi:10.1109/access.2020.2966228 · Cited by 520
Recent Advances in Bayesian Optimization
Wang, X., Jin, Y., Schmitt, S., & Olhofer, M. (2023) · ACM Computing Surveys · doi:10.1145/3582078 · Cited by 477
Emerging materials intelligence ecosystems propelled by machine learning
Batra, R., Song, L., & Ramprasad, R. (2020) · Nature Reviews Materials · doi:10.1038/s41578-020-00255-y · Cited by 446
Hyper-Parameter Optimization: A Review of Algorithms and Applications
Yu, T., & Zhu, H. C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.05689 · Cited by 437
Global versus local search in constrained optimization of computer models
Schonlau, M., Welch, W. J., & Jones, D. R. (1998) · Institute of Mathematical Statistics Lecture Notes - Monograph Series · doi:10.1214/lnms/1215456182 · Cited by 435
Sequential kriging optimization using multiple-fidelity evaluations
Huang, D., Allen, T. T., Notz, W. I., & Miller, R. A. (2006) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-005-0587-0 · Cited by 414
The Knowledge-Gradient Policy for Correlated Normal Beliefs
Frazier, P., Powell, W., & Dayanik, S. (2009) · INFORMS Journal on Computing · doi:10.1287/ijoc.1080.0314 · Cited by 408
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
Application of Bayesian approach to numerical methods of global and stochastic optimization
Mockus, J. (1994) · Journal of Global Optimization · doi:10.1007/bf01099263 · Cited by 399
Phoenics: A Bayesian Optimizer for Chemistry
Häse, F., Roch, L. M., Kreisbeck, C., & Aspuru-Guzik, A. (2018) · ACS Central Science · doi:10.1021/acscentsci.8b00307 · Cited by 379
A Tutorial on Bayesian Optimization
Frazier, P. I. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.02811 · Cited by 342
Sequential design of computer experiments for the estimation of a probability of failure
Bect, J., Ginsbourger, D., Li, L., Picheny, V., & Vazquez, E. (2012) · Statistics and Computing · doi:10.1007/s11222-011-9241-4 · Cited by 321
Yondo, R., Andrés, E., & Valero, E. (2018) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2017.11.003 · Cited by 311
Strong Bound on Canonical Ultralight Axion Dark Matter from the Lyman-Alpha Forest
Rogers, K. K., & Peiris, H. V. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.071302 · Cited by 303
Calandra, R., Seyfarth, A., Peters, J., & Deisenroth, M. P. (2016) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-015-9463-9 · Cited by 280
Cho, H., Kim, Y., Lee, E., Choi, D., Lee, Y., & Rhee, W. (2020) · IEEE Access · doi:10.1109/access.2020.2981072 · Cited by 280
Topology optimization of heat exchangers: A review
Fawaz, A., Hua, Y., Le Corre, S., Fan, Y., & Luo, L. (2022) · Energy · doi:10.1016/j.energy.2022.124053 · Cited by 273
Bradford, E., Schweidtmann, A. M., & Lapkin, A. (2018) · Journal of Global Optimization · doi:10.1007/s10898-018-0609-2 · Cited by 266
BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Search
White, C., Neiswanger, W., & Savani, Y. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i12.17233 · Cited by 261
Martinez-Cantin, R., de Freitas, N., Brochu, E., Castellanos, J., & Doucet, A. (2009) · Autonomous Robots · doi:10.1007/s10514-009-9130-2 · Cited by 217
A Survey on Policy Search Algorithms for Learning Robot Controllers in a Handful of Trials
Chatzilygeroudis, K., Vassiliades, V., Stulp, F., Calinon, S., & Mouret, J.-B. (2020) · IEEE Transactions on Robotics · doi:10.1109/tro.2019.2958211 · Cited by 160
Optimizing quantum heuristics with meta-learning
Wilson, M., Stromswold, S., Wudarski, F., Hadfield, S., Tubman, N. M., & Rieffel, E. (2019) · arXiv · doi:10.48550/arxiv.1908.03185 · Cited by 77
Optimizing quantum heuristics with meta-learning
Wilson, M., Stromswold, R., Wudarski, F., Hadfield, S., Tubman, N. M., & Rieffel, E. G. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00022-w · Cited by 79
Bayesian Optimization of HPC Systems for Energy Efficiency
Miyazaki, T., Sato, I., & Shimizu, N. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-92040-5_3 · Cited by 27
Raviolo, D., Civera, M., & Zanotti Fragonara, L. (2023) · Buildings · doi:10.3390/buildings13123010 · Cited by 24
(2021) · arXiv (Cornell University) · Cited by 11
Evaluating the impact of noise on the performance of the Variational Quantum Eigensolver
Oliv, M., Matic, A., Messerer, T., & Lorenz, J. M. (2022) · arXiv · doi:10.48550/arxiv.2209.12803 · Cited by 6
Uncertainty Quantification for Bayesian Optimization
Tuo, R., & Wang, W. (2020) · arXiv · doi:10.48550/arxiv.2002.01569 · Cited by 2
Metadata
- Authors
- Kushner, H. J.
- Venue
- Journal of Basic Engineering
- Publisher
- ASME International
- Published
- 1964-03-01
- Volume
- 86
- Issue
- 1
- Pages
- 97-106
- ISSN
- 0021-9223 (ISSN-L)
- OpenAlex
- W2061144551
- Cited by
- 1,082
- References
- 0
- FWCI
- 3.30
- Type
- journal article
- Language
- en
- Open access
- closed
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.