On the Evolution of Monotone Conjunctions: Drilling for Best Approximations

Dimitrios I. Diochnos

Abstract: We study the evolution of monotone conjunctions using local search; the fitness function that guides the search is correlation with Boolean loss. Building on the work of Diochnos and Turán [6], we generalize Valiant’s algorithm [19] for the evolvability of monotone conjunctions from the uniform distribution \({\mathcal U}_n\) to binomial distributions \({\mathcal B}_n\).