paper-with-me

홈 › Papers

From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms

2022-06-18 · Weijie Zheng, Benjamin Doerr

Estimation-of-distribution algorithms (EDAs) are optimization algorithms that learn a distribution on the search space from which good solutions can be sampled easily. A key parameter of most EDAs is the sample size (population size). If the population size is too small, the update of the probabilistic model builds on few samples, leading to the undesired effect of genetic drift. Too large population sizes avoid genetic drift, but slow down the process. Building on a recent quantitative analysis of how the population size leads to genetic drift, we design a smart-restart mechanism for EDAs. By stopping runs when the risk for genetic drift is high, it automatically runs the EDA in good parameter regimes. Via a mathematical runtime analysis, we prove a general performance guarantee for this smart-restart scheme. This in particular shows that in many situations where the optimal (problem-specific) parameter values are known, the restart scheme automatically finds these, leading to the asymptotically optimal performance. We also conduct an extensive experimental analysis. On four classic benchmark problems, we clearly observe the critical influence of the population size on the performance, and we find that the smart-restart scheme leads to a performance close to the one obtainable with optimal parameter values. Our results also show that previous theory-based suggestions for the optimal population size can be far from the optimal ones, leading to a performance clearly inferior to the one obtained via the smart-restart scheme. We also conduct experiments with PBIL (cross-entropy algorithm) on two combinatorial optimization problems from the literature, the max-cut problem and the bipartition problem. Again, we observe that the smart-restart mechanism finds much better values for the population size than those suggested in the literature, leading to a much better performance.

📄 PDF Abstract BibTeX arXiv:2206.09090

Code (0)

등록된 구현이 없습니다.

Tasks

Combinatorial Optimization

Similar Papers 제목 키워드 기반

From Understanding Genetic Drift to a Smart-Restart Parameter-less Compact Genetic Algorithm

2020-04-15 · Benjamin Doerr, Weijie Zheng

One of the key difficulties in using estimation-of-distribution algorithms is choosing the population size(s) appropriately: Too small values lead to genetic drift, which can cause enormous difficulties. In the regime wi…

Fail-Fast, Restart-Smart: Early Failure Prediction and Restart for SWE Agentic Tasks

2026-08-04 · Chenyu Wang, Yunbo Lyu, Junda He, Zhou Yang 외 arxiv

Software engineering (SWE) agents resolve repository-level issues through long trajectories that grow increasingly expensive as context accumulates. Failed runs tend to be longer and exhibit redundant exploration or loop…

Online Distributional Prediction via Latent Cluster Geometry Under Drift and Corruption

2026-06-17 · Navyansh Mahla, Prateek Chanda, Ganesh Ramakrishnan arxiv

Online learning in non-stationary streams is often formulated as tracking a point estimate, but many applications require predicting the full data-generating distribution. We study online distributional prediction under …

On-line Search History-assisted Restart Strategy for Covariance Matrix Adaptation Evolution Strategy

2019-03-16 · Yang Lou, Shiu Yin Yuen, Guanrong Chen, Xin Zhang

Restart strategy helps the covariance matrix adaptation evolution strategy (CMA-ES) to increase the probability of finding the global optimum in optimization, while a single run CMA-ES is easy to be trapped in local opti…

A Relaxed Drift Diffusion Model for Phylogenetic Trait Evolution

2015-12-29

Understanding the processes that give rise to quantitative measurements associated with molecular sequence data remains an important issue in statistical phylogenetics. Examples of such measurements include geographic co…

Bayesian Inference