Optimizing Monotone Functions Can Be Difficult

10/07/2010
by   Benjamin Doerr, et al.
0

Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotone. Contrary to what one would expect, not all of these functions are easy to optimize. The choice of the constant c in the mutation probability p(n) = c/n can make a decisive difference. We show that if c < 1, then the (1+1) evolutionary algorithm finds the optimum of every such function in Θ(n n) iterations. For c=1, we can still prove an upper bound of O(n^3/2). However, for c > 33, we present a strictly monotone function such that the (1+1) evolutionary algorithm with overwhelming probability does not find the optimum within 2^Ω(n) iterations. This is the first time that we observe that a constant factor change of the mutation probability changes the run-time by more than constant factors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2018

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument

Hillclimbing is an essential part of any optimization algorithm. An impo...
research
07/30/2019

Exponential Slowdown for Larger Populations: The (μ+1)-EA on Monotone Functions

Pseudo-Boolean monotone functions are unimodal functions which are trivi...
research
09/12/2023

Just-in-Time autotuning

Performance portability is a major concern on current architectures. One...
research
04/01/2022

Self-adjusting Population Sizes for the (1, λ)-EA on Monotone Functions

We study the (1,λ)-EA with mutation rate c/n for c≤ 1, where the populat...
research
04/10/2020

A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes

With elementary means, we prove a stronger run time guarantee for the un...
research
10/31/2021

Efficient, Anytime Algorithms for Calibration with Isotonic Regression under Strictly Convex Losses

We investigate the calibration of estimations to increase performance wi...
research
12/02/2021

Constructive approach to the monotone rearrangement of functions

We detail a simple procedure (easily convertible to an algorithm) for co...

Please sign up or login with your details

Forgot password? Click here to reset