On the Probability of First Success in Differential Evolution: Hazard Identities and Tail Bounds
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 $A$ as a product of conditional first-hit probabilities (hazards) $p_t=\Prob(E_t\mid\mathcal F_{t-1})$. 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-$p$best/1 mutation, we construct a checkable algorithmic witness event $\mathcal L_t$ 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 constant-hazard bounds are typically conservative. We complement the theory with a Kaplan--Meier survival analysis on the CEC2017 benchmark suite . Across functions and budgets, we identify three distinct empirical regimes: (i) strongly clustered success, where hitting times concentrate in short bursts; (ii) approximately geometric tails, where a constant-hazard model is accurate; and (iii) intractable cases with no observed hits within the evaluation horizon. The results show that while constant-hazard bounds provide valid tail envelopes, the practical behavior of L-SHADE is governed by burst-like transitions rather than homogeneous per-generati on success probabilities.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Moral-hazard-free insurance: mean-variance premium principle and rank-dependent utility theory
This paper investigates a Pareto optimal insurance problem, where the insured maximizes her rank-dependent utility preference and the insurer is risk neutral and employs the mean-variance premium principle. To eliminate …
Working Principles of Binary Differential Evolution
We conduct a first fundamental analysis of the working principles of binary differential evolution (BDE), an optimization heuristic for binary decision variables that was derived by Gong and Tuson (2007) from the very su…
Evolutionary AlgorithmsLearning Density Distribution of Reachable States for Autonomous Systems
State density distribution, in contrast to worst-case reachability, can be leveraged for safety-related problems to better quantify the likelihood of the risk for potentially hazardous situations. In this work, we propos…
Filtering in a hazard rate change-point model with financial and life-insurance applications
This paper develops a continuous-time filtering framework for estimating a hazard rate subject to an unobservable change-point. This framework arises naturally in both financial and insurance applications, where the defa…
Study of the Influence of the Number Normalization Scheme Used in Two Chaotic Pseudo Random Number Generators Used as the Source of Randomness in Differential Evolution
In many publications, authors showed that chaotic pseudo random number generators (PRNGs) may improve performance of the evolutionary algorithms. In this paper, we use two chaotic maps Gingerbread man and Tinkerbell as t…
Evolutionary Algorithms