A review of message passing algorithms in estimation of distribution algorithms

DOI10.1007/S11047-014-9473-2zbMATH Open1415.68177OpenAlexW2158124032MaRDI QIDQ2003458FDOQ2003458

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

Recommendations

• scientific article; zbMATH DE number 1754721
• Message-Passing Algorithms: Reparameterizations and Splittings
• A Survey on Estimation of Distribution Algorithms
• A review on parallel estimation of distribution algorithms
• Message-passing algorithms for inference and optimization
• Analysis of random sequential message passing algorithms for approximate inference
• A review of estimation of distribution algorithms and Markov networks
• Finite Sample Analysis of Approximate Message Passing Algorithms
• Estimation of distribution algorithms

zbMATH Keywords

hybridizationestimation of distribution algorithmspropagationmessage passing 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)

Cites Work

• LibDAI: a free and open source C++ library for discrete approximate inference in graphical models
• Clustering by Passing Messages Between Data Points
• Title not available (Why is that?)
• Title not available (Why is that?)
• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
• Factor graphs and the sum-product algorithm
• Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
• 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
• Title not available (Why is that?)
• A survey of optimization by building and using probabilistic models
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• Title not available (Why is that?)
• Phase Transitions in Combinatorial Optimization Problems
• Temperature jump and velocity slip in the moment method
• Towards a new evolutionary computation. Advances on estimation of distribution algorithms.
• Survey propagation: An algorithm for satisfiability
• Mathematical modelling of UMDA\(_{c}\) algorithm with tournament selection. Behaviour on linear and quadratic functions
• Schemata, distributions and graphical models in evolutionary optimization
• Comprehensive characterization of the behaviors of estimation of distribution algorithms
• Scalable optimization via probabilistic modeling. From algorithms to applications.
• Title not available (Why is that?)
• On the effective implementation of the iterative proportional fitting procedure
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convergence Theorems of Estimation of Distribution Algorithms
• Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation
• A Binary Variable Model for Affinity Propagation
• Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
• Title not available (Why is that?)
• Exploitation of linkage learning in evolutionary algorithms
• Introducing assignment functions to Bayesian optimization algorithms
• 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
• Adaptive Evolutionary Algorithm Based on a Cliqued Gibbs Sampling over Graphical Markov Model Structure
• 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
• Title not available (Why is that?)
• On the Uniqueness of Loopy Belief Propagation Fixed Points
• The factorized distribution algorithm and the minimum relative entropy principle

Cited In (1)

• Level-based analysis of the univariate marginal distribution algorithm

Uses Software

• LibDAI
• apcluster
• APCluster

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003458)