The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Basic Enhancement Strategies When Using Bayesian Optimization for Hyperparameter Tuning of Deep Neural Networks
Open accessAbstract
Compared to the traditional machine learning models, deep neural networks (DNN) are known to be highly sensitive to the choice of hyperparameters. While the required time and effort for manual tuning has been rapidly decreasing for the well developed and commonly used DNN architectures, undoubtedly DNN hyperparameter optimization will continue to be a major burden whenever a new DNN architecture needs to be designed, a new task needs to be solved, a new dataset needs to be addressed, or an existing DNN needs to be improved further. For hyperparameter optimization of general machine learning problems, numerous automated solutions have been developed where some of the most popular solutions are based on Bayesian Optimization (BO). In this work, we analyze four fundamental strategies for enhancing BO when it is used for DNN hyperparameter optimization. Specifically, diversification, early termination, parallelization, and cost function transformation are investigated. Based on the analysis, we provide a simple yet robust algorithm for DNN hyperparameter optimization - DEEP-BO (Diversified, Early-termination-Enabled, and Parallel Bayesian Optimization). When evaluated over six DNN benchmarks, DEEP-BO mostly outperformed well-known solutions including GP-Hedge, BOHB, and the speed-up variants that use Median Stopping Rule or Learning Curve Extrapolation. In fact, DEEP-BO consistently provided the top, or at least close to the top, performance over all the benchmark types that we have tested. This indicates that DEEP-BO is a robust solution compared to the existing solutions. The DEEP-BO code is publicly available at https://github.com/snu-adsl/DEEP-BO.
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
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Ioffe, S., & Szegedy, C. (2015) · arXiv · doi:10.48550/arxiv.1502.03167 · Cited by 27,818
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Reinforcement Learning: An Introduction
Johnson, J. D., Li, J., & Chen, Z. (2000) · Neurocomputing · doi:10.1016/s0925-2312(00)00324-6 · Cited by 8,414
Ensemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
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
(2012) · Cited by 8,009
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
Gaussian Processes in Machine Learning
Rasmussen, C. E. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28650-9_4 · Cited by 5,397
Neural Architecture Search with Reinforcement Learning
Zoph, B., & Le, Q. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.01578 · Cited by 3,974
(2011) · Cited by 3,939
On the distribution of points in a cube and the approximate evaluation of integrals
Sobol', I. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90144-9 · Cited by 2,975
Long short-term memory recurrent neural network architectures for large scale acoustic modeling
Sak, H., Senior, A., & Beaufays, F. (2014) · Interspeech 2014 · doi:10.21437/interspeech.2014-80 · Cited by 2,973
Sequential Model-Based Optimization for General Algorithm Configuration
Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25566-3_40 · Cited by 2,469
Brochu, E., Cora, V. M., & de Freitas, N. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.2599 · Cited by 2,011
A New Method of Locating the Maximum Point of an Arbitrary Multipeak Curve in the Presence of Noise
Kushner, H. J. (1964) · Journal of Basic Engineering · doi:10.1115/1.3653121 · Cited by 1,082
Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., & Talwalkar, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.06560 · Cited by 1,018
Automatic early stopping using cross validation: quantifying the criteria
Prechelt, L. (1998) · Neural Networks · doi:10.1016/s0893-6080(98)00010-0 · Cited by 990
Domhan, T., Springenberg, J. T., & Hutter, F. (2015) · FreiDok plus (Universitätsbibliothek Freiburg) · Cited by 670
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
Google Vizier: A Service for Black-Box Optimization
Golovin, D., Solnik, B., Moitra, S., Kochanski, G., Karro, J., & Sculley, D. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098043 · Cited by 571
Gradient-based Hyperparameter Optimization through Reversible Learning
Maclaurin, D., Duvenaud, D., & Adams, R. P. (2015) · arXiv · doi:10.48550/arxiv.1502.03492 · Cited by 509
Bayesian optimization with robust Bayesian neural networks
Springenberg, J. T., Klein, A., Falkner, S., & Hutter, F. (2016) · neural information processing systems · Cited by 300
Population Based Training of Neural Networks
Jaderberg, M., Dalibard, V., Osindero, S., Czarnecki, W. M., Donahue, J., Razavi, A., Vinyals, O., Green, T., Dunning, I., Simonyan, K., et al. (2017) · arXiv · doi:10.48550/arxiv.1711.09846 · Cited by 284
Batched Large-scale Bayesian Optimization in High-dimensional SpacesPreprint
Wang, Z., Gehring, C., Kohli, P., & Jegelka, S. (2017) · International Conference on Artificial Intelligence and Statistics · doi:10.48550/arxiv.1706.01445 · Cited by 266
Efficient Transfer Learning Method for Automatic Hyperparameter Tuning
Yogatama, D., & Mann, G. (2014) · International Conference on Artificial Intelligence and Statistics · Cited by 254
Batch Bayesian Optimization via Local PenalizationPreprint
González, J., Dai, Z., Hennig, P., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.08052 · Cited by 214
Learning Curve Prediction with Bayesian Neural Networks
Klein, A., Falkner, S., Springenberg, J. T., & Hutter, F. (2017) · International Conference on Learning Representations · Cited by 176
Parallel Gaussian process optimization with upper confidence bound and pure explorationPreprint
Contal, E., Buffoni, D., Robicquet, R., & Vayatis, N. (2013) · Cited by 151
The Parallel Knowledge Gradient Method for Batch Bayesian OptimizationPreprint
Wu, J., & Frazier, P. I. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.04414 · Cited by 148
Efficient Benchmarking of Hyperparameter Optimizers via Surrogates
Eggensperger, K., Hutter, F., Hoos, H. H., & Leyton‐Brown, K. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9375 · Cited by 116
Portfolio Allocation for Bayesian OptimizationPreprint
Brochu, E., Hoffman, M. W., & de Freitas, N. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.5419 · Cited by 89
Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration
Contal, E., Buffoni, D., Robicquet, A., & Vayatis, N. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40988-2_15 · Cited by 85
Scalable Hyperparameter Transfer Learning
Perrone, V., Jenatton, R., Seeger, M., & Archambeau, C. (2018) · neural information processing systems · Cited by 85
Scalable Meta-Learning for Bayesian OptimizationPreprint
Feurer, M., Letham, B., & Bakshy, E. (2018) · arXiv (Cornell University) · Cited by 51
On the Difficulty of DNN Hyperparameter Optimization Using Learning Curve Prediction
Choi, D., Cho, H., & Rhee, W. (2018) · IEEE Region 10 Conference (TENCON) · doi:10.1109/tencon.2018.8650070 · Cited by 20
Self-citation
Cited by
Data-driven design of novel halide perovskite alloys
Mannodi-Kanakkithodi, A., & Chan, M. K. Y. (2022) · Energy & Environmental Science · doi:10.1039/d1ee02971a · Cited by 73
Metadata
- Authors
- Cho, H., Kim, Y., Lee, E., Choi, D., Lee, Y., & Rhee, W.
- Venue
- IEEE Access
- Published
- 2020
- Volume
- 8
- Pages
- 52588-52608
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3011974631
- Cited by
- 280
- References
- 38
- FWCI
- 9.38
- Type
- journal article
- Language
- en
- Open access
- gold
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.