On the Probability of First Success in Differential Evolution: Hazard Identities and Tail Bounds
Dimitar Nedanovski, Svetoslav Nenov, Dimitar Pilev

TL;DR
This paper introduces a hazard-based framework to analyze the first success times in Differential Evolution algorithms, providing distribution-free identities, tail bounds, and empirical insights into success regimes.
Contribution
It develops a hazard identity approach for DE, constructs checkable events for explicit hazard bounds, and empirically characterizes success regimes on benchmark functions.
Findings
Hazard identities yield distribution-free survival bounds.
Empirical regimes include burst-like success and geometric tails.
Constant-hazard bounds are conservative but valid.
Abstract
We study first-hitting times in Differential Evolution (DE) through a conditional hazard frame work. Instead of analyzing convergence via Markov-chain transition kernels or drift arguments, we ex press the survival probability of a measurable target set as a product of conditional first-hit probabilities (hazards) . This yields distribution-free identities for survival and explicit tail bounds whenever deterministic lower bounds on the hazard hold on the survival event. For the L-SHADE algorithm with current-to-best/1 mutation, we construct a checkable algorithmic witness event under which the conditional hazard admits an explicit lower bound depending only on sampling rules, population size, and crossover statistics. This separates theoretical constants from empirical event frequencies and explains why worst-case…
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
TopicsEvolution and Genetic Dynamics · Markov Chains and Monte Carlo Methods · Reinforcement Learning in Robotics
