A Study on the Global Convergence Time Complexity of Estimation of Distribution Algorithms
R. Rastegar, M. R. Meybodi
Abstract
The Estimation of Distribution Algorithm is a new class of population based search methods in that a probabilistic model of individuals is estimated based on the high quality individuals and used to generate the new individuals. In this paper we compute 1) some upper bounds on the number of iterations required for global convergence of EDA 2) the exact number of iterations needed for EDA to converge to global optima.
Create a lesson
Related papers
Can Language Models Play the Wikipedia Game?
Alexander Hickey, Joanna Knight, James Bishop
RATED: Reliability-Aware AI Agent Tool Retrieval via Execution Dynamics
Weiliang Chen, Song Liao
X-AgentRed: Red-Teaming Personal Agents in Evolving Multi-Service Ecosystems
Yeonsung Jung, Zhiyuan Wang, Zifan Wang et al.
Studying Comics at Scale with Artificial Intelligence: The PAGE Framework and Three Studies of American Comics and Japanese Manga
Emilio Ferrara
UkrMeme: Multimodal Explainable Persuasion Detection in Ukrainian Memes
Nazar Andrushko, Vera Schmitt, Veronika Solopova
A Privileged Teacher That Only Scores Cannot Search: Critique-Conditioned On-Policy Self-Distillation for Reasoning
Mayug Maniparambil, Ayush Rai, Ekansh Verma et al.