arrow
返回

(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error

delete2023-06-01
delete1
delete
OA
AI
B
Benjamin Doerr
A
Andrei Lissovoi
P
Pietro S. Oliveto *
DOI:10.1016/j.artint.2023.103906delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Recently it has been proven that simple GP systems can efficiently evolve a conjunction of n variables if they are equipped with the minimal required components. In this paper, we make a considerable step forward by analysing the behaviour and performance of a GP system for evolving a Boolean conjunction or disjunction of n variables using a complete function set that allows the expression of any Boolean function of up to n variables. First we rigorously prove that a GP system using the complete truth table to evaluate the program quality, and equipped with both the AND and OR operators and positive literals, evolves the exact target function in O (ln log(2) n) iterations in expectation, where l >= n is a limit on the size of any accepted tree. Additionally, we show that when a polynomial sample of possible inputs is used to evaluate the solution quality, conjunctions or disjunctions with any polynomially small generalisation error can be evolved with probability 1 - O (log(2) (n)/n). The latter result also holds if GP uses AND, OR and positive and negated literals, thus has the power to express any Boolean function of n distinct variables. To prove our results we introduce a super-multiplicative drift theorem that gives significantly stronger runtime bounds when the expected progress is only slightly super-linear in the distance from the optimum. (c) 2023 Published by Elsevier B.V.
Keyword:
Genetic programming
Computational complexity
Theory
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Artificial Intelligence Review 封面图
Artificial Intelligence Review
IF:
13.9
论文数:
6.1K
被引数:
1.9W

机构

U
University of Sheffield
学者数:
3.0W
论文数: 2.9W
被引数: 3.9W
E
Ecole Polytechnique
学者数:
6.6K
论文数: 4.8K
被引数: 211
I
institut polytechnique de paris
学者数:
1.3W
论文数: 1.0W
被引数: 6
学者 查看更多机构
引用论文

引用论文

err2014-03-01
err0
PREAI
err
err分享
err收藏
err分享
err收藏
err分享
err收藏
Automated Self-Optimization in Heterogeneous Wireless Communications Networks
err2019-02-01
err13
PREAI
errLynch, David; Fenton, Michael; Fagan, David; Kucera, Stepan; Claussen, Holger; O'Neill, Michael
err分享
err收藏
学者 查看更多内容