Warm Starting of CMA-ES for Contextual Optimization Problems
Yuta Sekino, Kento Uchida, Shinichi Shirakawa

TL;DR
This paper introduces CMA-ES-CWS, a novel warm starting method for evolutionary algorithms that leverages past optimization results and Gaussian process regression to efficiently solve contextual optimization problems.
Contribution
The paper presents CMA-ES-CWS, combining warm starting with Gaussian process regression to improve optimization in contextual problems, outperforming existing methods.
Findings
CMA-ES-CWS outperforms existing methods in numerical simulations.
The approach effectively utilizes past context data for better initialization.
Results demonstrate improved optimization efficiency and accuracy.
Abstract
Several practical applications of evolutionary computation possess objective functions that receive the design variables and externally given parameters. Such problems are termed contextual optimization problems. These problems require finding the optimal solutions corresponding to the given context vectors. Existing contextual optimization methods train a policy model to predict the optimal solution from context vectors. However, the performance of such models is limited by their representation ability. By contrast, warm starting methods have been used to initialize evolutionary algorithms on a given problem using the optimization results on similar problems. Because warm starting methods do not consider the context vectors, their performances can be improved on contextual optimization problems. Herein, we propose a covariance matrix adaptation evolution strategy with contextual warm…
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
MethodsGaussian Process
