CMA-ES with Individual Adaptive Reevaluation for Black-Box Value-At-Risk Optimization

Noisy black-box continuous optimization using evolution strategies (ES) involves a trade-off between computational cost and estimation precision. While several approaches have been proposed to address this issue, most focus on optimizing the expected objective value, leaving Value-at-Risk (VaR) optimization largely unexplored. To address the trade-off problem in black-box VaR optimization, we propose an individual adaptive reevaluation mechanism that adjusts the number of reevaluations of the noisy objective function for each solution to estimate the VaR. This mechanism dynamically adapts the number of reevaluations for each solution by monitoring ranking deviations using bootstrapping. The proposed method is integrated into CMA-ES, named IR-CMA-ES, and evaluated against two baselines: CMA-ES with Monte Carlo VaR estimation using fixed reevaluation, and UH-CMA-ES modified for VaR optimization. Experiments under various noise settings demonstrate the competitive performance of IR-CMA-ES.

Authors

Institutions

Publication Details

Journal
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Published
2025-07-14
DOI
https://doi.org/10.1145/3712255.3726637
Primary Topic
Simulation Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CMA-ES with Individual Adaptive Reevaluation for Black-Box Value-At-Risk Optimization

Youhei Akimoto, Daiki Morinaga, Ze Kai Ng
Proceedings of the Genetic and Evolutionary Computation Conference Companion
Simulation Techniques and Applications
article

CMA-ES with Individual Adaptive Reevaluation for Black-Box Value-At-Risk Optimization

Youhei Akimoto, Daiki Morinaga, Ze Kai Ng
article en

Abstract

Noisy black-box continuous optimization using evolution strategies (ES) involves a trade-off between computational cost and estimation precision. While several approaches have been proposed to address this issue, most focus on optimizing the expected objective value, leaving Value-at-Risk (VaR) optimization largely unexplored. To address the trade-off problem in black-box VaR optimization, we propose an individual adaptive reevaluation mechanism that adjusts the number of reevaluations of the noisy objective function for each solution to estimate the VaR. This mechanism dynamically adapts the number of reevaluations for each solution by monitoring ranking deviations using bootstrapping. The proposed method is integrated into CMA-ES, named IR-CMA-ES, and evaluated against two baselines: CMA-ES with Monte Carlo VaR estimation using fixed reevaluation, and UH-CMA-ES modified for VaR optimization. Experiments under various noise settings demonstrate the competitive performance of IR-CMA-ES.

Proceedings of the Genetic and Evolutionary Computation Conference Companion
University of Tsukuba (JP), RIKEN Center for Advanced Intelligence Project (JP)
Climate action
Openalex Percentile: Top 41%
Simulation Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.