MA-BBOB: Many-Affine Combinations of BBOB Functions for Evaluating AutoML Approaches in Noiseless Numerical Black-Box Optimization Contexts
Not on the map. Why?
Abstract (arXiv)
Extending a recent suggestion to generate new instances for numerical black-box optimization benchmarking by interpolating pairs of the well-established BBOB functions from the COmparing COntinuous Optimizers (COCO) platform, we propose in this work a further generalization that allows multiple affine combinations of the original instances and arbitrarily chosen locations of the global optima. We demonstrate that the MA-BBOB generator can help fill the instance space, while overall patterns in algorithm performance are preserved. By combining the landscape features of the problems with the performance data, we pose the question of whether these features are as useful for algorithm selection as previous studies suggested. MA-BBOB is built on the publicly available IOHprofiler platform, which facilitates standardized experimentation routines, provides access to the interactive IOHanalyzer module for performance analysis and visualization, and enables comparisons with the rich and growing data collection available for the (MA-)BBOB functions.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 14 of its 43 references that are in the map. First posted on arXiv 18 Jun 2023.
Builds on
14 of 43 references.
References · 14
- 2016COCO: A Platform for Comparing Continuous Optimizers in a Black-Box Settingcited by 138
- 2018Automated Algorithm Selection: Survey and Perspectivescited by 114
- 2018IOHprofiler: A Benchmarking and Profiling Tool for Iterative Optimization Heuristicscited by 28
- 2021IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristicscited by 24
- 2020IOHanalyzer: Detailed Performance Analyses for Iterative Optimization Heuristicscited by 20
- 2021Tuning as a Means of Assessing the Benefits of New Ideas in Interplay with Existing Algorithmic Modulescited by 20
- 2022Per-run Algorithm Selection with Warm-starting using Trajectory-based Featurescited by 20
- 2022BBOB Instance Analysis: Landscape Properties and Algorithm Performance across Problem Instancescited by 10
- 2021OPTION: OPTImization Algorithm Benchmarking ONtologycited by 9
- 2023Using Affine Combinations of BBOB Problems for Performance Assessmentcited by 5
- 2020Evolving test instances of the Hamiltonian completion problemcited by 3
- 2023RF+clust for Leave-One-Problem-Out Performance Predictioncited by 3
2 more
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 3.
7 papers.
- 2025MetaBox-v2: A Unified Benchmark Platform for Meta-Black-Box Optimizationcited by 9
- 2025carps: A Framework for Comparing N Hyperparameter Optimizers on M Benchmarkscited by 3
- 2024Evolutionary Computation and Explainable AI: A Roadmap to Understandable Intelligent Systemscited by 2
- 2026LLM Driven Design of Continuous Optimization Problems with Controllable High-level Propertiescited by 2
- 2025Algorithm Selection with Probing Trajectories: Benchmarking the Choice of Classifier Modelcited by 0
- 2026Pareto-Optimal Anytime Algorithms via Bayesian Racingcited by 0
- 2026A New Approach to Characterising Optimisation Problems Using Programmatic Representation and Complexity Measurescited by 0
- 2026A New Approach to Characterising Optimisation Problems Using Programmatic Representation and Complexity Measures9 Aug 2026
- 2026Pareto-Optimal Anytime Algorithms via Bayesian Racing9 Mar 2026
- 2026LLM Driven Design of Continuous Optimization Problems with Controllable High-level Properties26 Jan 2026
- 2025carps: A Framework for Comparing N Hyperparameter Optimizers on M Benchmarks6 Jun 2025
- 2025MetaBox-v2: A Unified Benchmark Platform for Meta-Black-Box Optimization23 May 2025
- 2025Algorithm Selection with Probing Trajectories: Benchmarking the Choice of Classifier Model20 Jan 2025
- 2024Evolutionary Computation and Explainable AI: A Roadmap to Understandable Intelligent Systems12 Jun 2024