A review of message passing algorithms in estimation of distribution algorithms

DOI10.1007/s11047-014-9473-2zbMath1415.68177OpenAlexW2158124032MaRDI QIDQ2003458

Roberto Santana, Alexander Mendiburu, José A. Lozano

Publication date: 8 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-014-9473-2

zbMATH Keywords

propagationmessage passing algorithmshybridizationestimation of distribution algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Level-based analysis of the univariate marginal distribution algorithm

Uses Software

• LibDAI
• apcluster
• APCluster

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• Comprehensive characterization of the behaviors of estimation of distribution algorithms
• On the effective implementation of the iterative proportional fitting procedure
• Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
• A factor graph based genetic algorithm
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
• Exploitation of linkage learning in evolutionary algorithms
• Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
• Mathematical modelling of UMDA\(_{c}\) algorithm with tournament selection. Behaviour on linear and quadratic functions
• Schemata, distributions and graphical models in evolutionary optimization
• Temperature jump and velocity slip in the moment method
• Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
• Introducing assignment functions to Bayesian optimization algorithms
• Scalable optimization via probabilistic modeling. From algorithms to applications.
• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms
• The Impact of Exact Probabilistic Learning Algorithms in EDAs Based on Bayesian Networks
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• Factor graphs and the sum-product algorithm
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• Convergence Theorems of Estimation of Distribution Algorithms
• Adaptive Evolutionary Algorithm Based on a Cliqued Gibbs Sampling over Graphical Markov Model Structure
• Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation
• Continuous Estimation of Distribution Algorithms Based on Factorized Gaussian Markov Networks
• Using Maximum Entropy and Generalized Belief Propagation in Estimation of Distribution Algorithms
• Accuracy of the Bethe approximation for hyperparameter estimation in probabilistic image processing
• On the Uniqueness of Loopy Belief Propagation Fixed Points
• Survey propagation: An algorithm for satisfiability
• A Binary Variable Model for Affinity Propagation
• Phase Transitions in Combinatorial Optimization Problems
• A survey of optimization by building and using probabilistic models

This page was built for publication: A review of message passing algorithms in estimation of distribution algorithms