mlsanityData to 7 Oct 2026

Bayesian Optimization Over Iterative Learners with Structured Responses: A Budget-aware Planning Approach

arXiv 2206.12708 ↗First posted 25 Jun 2022cs.LG cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

The rising growth of deep neural networks (DNNs) and datasets in size motivates the need for efficient solutions for simultaneous model selection and training. Many methods for hyperparameter optimization (HPO) of iterative learners, including DNNs, attempt to solve this problem by querying and learning a response surface while searching for the optimum of that surface. However, many of these methods make myopic queries, do not consider prior knowledge about the response structure, and/or perform a biased cost-aware search, all of which exacerbate identifying the best-performing model when a total cost budget is specified. This paper proposes a novel approach referred to as bf Budget-bf Aware bf Planning for bf Iterative Learners (BAPI) to solve HPO problems under a constrained cost budget. BAPI is an efficient non-myopic Bayesian optimization solution that accounts for the budget and leverages the prior knowledge about the objective function and cost function to select better configurations and to take more informed decisions during the evaluation (training). Experiments on diverse HPO benchmarks for iterative learners show that BAPI performs better than state-of-the-art baselines in most cases.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 28 of its 56 references that are in the map. First posted on arXiv 25 Jun 2022.

Builds on

28 of 56 references.

References · 28

  1. 2020Scaling Laws for Neural Language Modelscited by 6,411
  2. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  3. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
  4. 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 688
  5. 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 466
  6. 2020AutoGluon-Tabular: Robust and Accurate AutoML for Structured Datacited by 368
  7. 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 219
  8. 2016Fast Bayesian Optimization of Machine Learning Hyperparameters on Large Datasetscited by 131
  9. 2017Multi-fidelity Bayesian Optimisation with Continuous Approximationscited by 120
  10. 2018Maximizing acquisition functions for Bayesian optimizationcited by 113
  11. 2015Batch Bayesian Optimization via Local Penalizationcited by 103
  12. 2019Practical Multi-fidelity Bayesian Optimization for Hyperparameter Tuningcited by 91
16 more
  1. 2014Freeze-Thaw Bayesian Optimizationcited by 86
  2. 2020Max-value Entropy Search for Multi-Objective Bayesian Optimization with Constraintscited by 81
  3. 2016Parallel Bayesian Global Optimization of Expensive Functionscited by 43
  4. 2020Cost-aware Bayesian Optimizationcited by 41
  5. 2020Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Treescited by 41
  6. 2015GLASSES: Relieving The Myopia Of Bayesian Optimisationcited by 38
  7. 2019BINOCULARS for Efficient, Nonmyopic Sequential Experimental Designcited by 35
  8. 2017Probabilistic Matrix Factorization for Automated Machine Learningcited by 31
  9. 2019Why Non-myopic Bayesian Optimization is Promising and How Far Should We Look-ahead? A Study via Rolloutcited by 23
  10. 2021Bayesian Optimization over Hybrid Spacescited by 23
  11. 2019Bayesian Optimization for Iterative Learningcited by 19
  12. 2020Efficient Rollout Strategies for Bayesian Optimizationcited by 19
  13. 2021A Nonmyopic Approach to Cost-Constrained Bayesian Optimizationcited by 18
  14. 2021Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costscited by 18
  15. 2019Gaussian processes with linear operator inequality constraintscited by 16
  16. 2019Hyper-parameter Tuning under a Budget Constraintcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 1; 2026: 2.

8 papers.