ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SDBV (Switching Dynamic Binary Value) be the dynamic monotone function defined in the paper, and let Tf(n)T_f(n) denote the expected number of generations required by the (1+1)(1+1)-EA to optimize a dynamic monotone function ff. SDBV near-hardness conjecture. If ff is a hardest dynamic monotone function, then

Tf(n)−TSDBV(n)≤o(n).T_f(n)-T_{\mathrm{SDBV}}(n)\leq o(n).

The paper proves that SDBV minimizes drift and gives its runtime for the standard mutation rate, while experiments suggest that the gap to the truly hardest function decreases with dimension; whether SDBV itself maximizes expected runtime remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.