- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes a Bayesian optimization method for high-dimensional space, where embedding is optimized using objective evaluations. It combines an evolutionary algorithm, which is used to searching embeddings, and BO, which is used for searching the optimum in the embedding space. In the experiments, the proposed method is compared with existing BO methods on optimization of synthetic functions, rover trajectory planning and hyperparameter tuning in support-vector regression.
Critical strengths
It searches embedding that is useful for Bayesian optimization.
Critical weaknesses
The technical contribution of the proposed method is incremental. There have been proposed many embedding existing methods for BO, and existing methods for learning embeddings. The use of an evolutionary algorithm for optimization is not well motivated.
For learning the embeddings using the evolutionary algorithm, it requires a lot of evaluations of expensive black-box functions. In Figure 2, the number of evaluations used for learning the embedding should be included for fair comparison. Since the total cost is large, it is unclear in what kinds of situations the proposed method is useful.
There are many hyperparameters in the proposed method, whose appropriate values might be different across tasks.
Questions for authors
How do we tune the hyperparameters of the proposed method?