Multiplicative up-drift
Benjamin Doerr, Timo Kötzing · Proceedings of the Genetic and Evolutionary Computation Conference · 2019
Drift analysis aims at translating the expected progress of an evolutionary algorithm (or more generally, a random process) into a probabilistic guarantee on its run time (hitting time). So far, drift arguments have been successfully employed in the rigorous analysis of evolutionary algorithms, however, only for the situation that the progress is constant or becomes weaker when approaching the target.