Benchmarking an algorithm for expensive high-dimensional objectives on the bbob and bbob-largescale testbeds.
Zachary HoffmanSteve HuntsmanPublished in: GECCO Companion (2022)
Keyphrases
- high dimensional
- preprocessing
- search space
- detection algorithm
- cost function
- np hard
- dynamic programming
- learning algorithm
- convergence rate
- computational complexity
- experimental evaluation
- improved algorithm
- noisy data
- convex hull
- segmentation algorithm
- computationally efficient
- objective function
- high accuracy
- simulated annealing
- theoretical analysis
- optimization algorithm
- optimal solution
- dimensionality reduction
- multi dimensional
- linear programming
- expectation maximization
- data points
- significant improvement
- k means
- matching algorithm
- feature selection
- neural network