Decreasing the Computing Time of Bayesian Optimization using Generalizable Memory Pruning
Alexander E. Siemenn, Tonio Buonassisi

TL;DR
This paper introduces a generalizable memory pruning wrapper for Bayesian optimization that significantly reduces computation time across various models and data sets without compromising convergence.
Contribution
It presents a novel, model-agnostic memory pruning method that decreases Bayesian optimization's computational complexity from polynomial to a non-increasing pattern, applicable to any surrogate model and acquisition function.
Findings
Reduced wall-clock time from polynomial to sawtooth pattern
Demonstrated effectiveness across multiple data sets and models
Maintained convergence performance despite pruning
Abstract
Bayesian optimization (BO) suffers from long computing times when processing highly-dimensional or large data sets. These long computing times are a result of the Gaussian process surrogate model having a polynomial time complexity with the number of experiments. Running BO on high-dimensional or massive data sets becomes intractable due to this time complexity scaling, in turn, hindering experimentation. Alternative surrogate models have been developed to reduce the computing utilization of the BO procedure, however, these methods require mathematical alteration of the inherit surrogate function, pigeonholing use into only that function. In this paper, we demonstrate a generalizable BO wrapper of memory pruning and bounded optimization, capable of being used with any surrogate model and acquisition function. Using this memory pruning approach, we show a decrease in wall-clock computing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms · Gaussian Processes and Bayesian Inference · Advanced Bandit Algorithms Research
MethodsGaussian Process · Pruning
