A view of estimation of distribution algorithms through the lens of expectation-maximization
Lists
Only you see this
Abstract
We show that a large class of Estimation of Distribution Algorithms, including, but not limited to, Covariance Matrix Adaption, can be written as a Monte Carlo Expectation-Maximization algorithm, and as exact EM in the limit of infinite samples. Because EM sits on a rigorous statistical foundation and has been thoroughly analyzed, this connection provides a new coherent framework with which to reason about EDAs.
BibTeX
@inproceedings{brookes2019view,
author = {David H. Brookes and Akosua Busia and Clara Fannjiang and Kevin Murphy and Jennifer Listgarten},
title = {{A view of estimation of distribution algorithms through the lens of expectation-maximization}},
booktitle = {GECCO Companion},
year = {2019},
doi = {10.1145/3377929.3389938},
}