dorsal/arxiv
View SchemaSimulated Annealing-based Candidate Optimization for Batch Acquisition Functions
| Authors | Sk Md Ahnaf Akif Alvi, Raymundo Arróyave, Douglas Allaire |
|---|---|
| Categories | |
| ArXiv ID | 2601.07258vv1 |
| URL | https://arxiv.org/abs/2601.07258 |
| License | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
Abstract
Bayesian Optimization with multi-objective acquisition functions such as q-Expected Hypervolume Improvement (qEHVI) requires efficient candidate optimization to maximize acquisition function values. Traditional approaches rely on continuous optimization methods like Sequential Least Squares Programming (SLSQP) for candidate selection. However, these gradient-based methods can become trapped in local optima, particularly in complex or high-dimensional objective landscapes. This paper presents a simulated annealing-based approach for candidate optimization in batch acquisition functions as an alternative to conventional continuous optimization methods. We evaluate our simulated annealing approach against SLSQP across four benchmark multi-objective optimization problems: ZDT1 (30D, 2 objectives), DTLZ2 (7D, 3 objectives), Kursawe (3D, 2 objectives), and Latent-Aware (4D, 2 objectives). Our results demonstrate that simulated annealing consistently achieves superior hypervolume performance compared to SLSQP in most test functions. The improvement is particularly pronounced for DTLZ2 and Latent-Aware problems, where simulated annealing reaches significantly higher hypervolume values and maintains better convergence characteristics. The histogram analysis of objective space coverage further reveals that simulated annealing explores more diverse and optimal regions of the Pareto front. These findings suggest that metaheuristic optimization approaches like simulated annealing can provide more robust and effective candidate optimization for multi-objective Bayesian optimization, offering a promising alternative to traditional gradient-based methods for batch acquisition function optimization.
{
"annotation_id": "ddc87db8-4f7e-4929-99ca-e78425511b77",
"date_created": "2026-02-17T05:53:11.335000Z",
"date_modified": "2026-02-17T05:53:11.335000Z",
"file_hash": "c63d5bceda2f728d72b6178d2dc17b1488d18b3b87840519a9aca17c5f750334",
"private": false,
"record": {
"abstract": "Bayesian Optimization with multi-objective acquisition functions such as q-Expected Hypervolume Improvement (qEHVI) requires efficient candidate optimization to maximize acquisition function values. Traditional approaches rely on continuous optimization methods like Sequential Least Squares Programming (SLSQP) for candidate selection. However, these gradient-based methods can become trapped in local optima, particularly in complex or high-dimensional objective landscapes. This paper presents a simulated annealing-based approach for candidate optimization in batch acquisition functions as an alternative to conventional continuous optimization methods. We evaluate our simulated annealing approach against SLSQP across four benchmark multi-objective optimization problems: ZDT1 (30D, 2 objectives), DTLZ2 (7D, 3 objectives), Kursawe (3D, 2 objectives), and Latent-Aware (4D, 2 objectives). Our results demonstrate that simulated annealing consistently achieves superior hypervolume performance compared to SLSQP in most test functions. The improvement is particularly pronounced for DTLZ2 and Latent-Aware problems, where simulated annealing reaches significantly higher hypervolume values and maintains better convergence characteristics. The histogram analysis of objective space coverage further reveals that simulated annealing explores more diverse and optimal regions of the Pareto front. These findings suggest that metaheuristic optimization approaches like simulated annealing can provide more robust and effective candidate optimization for multi-objective Bayesian optimization, offering a promising alternative to traditional gradient-based methods for batch acquisition function optimization.",
"arxiv_id": "2601.07258",
"authors": [
"Sk Md Ahnaf Akif Alvi",
"Raymundo Arr\u00f3yave",
"Douglas Allaire"
],
"categories": [
"cs.LG",
"cond-mat.mtrl-sci",
"stat.ML"
],
"license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
"title": "Simulated Annealing-based Candidate Optimization for Batch Acquisition Functions",
"url": "https://arxiv.org/abs/2601.07258",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "68f2f0aa-8735-486e-b91a-d987cc88afb5",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}