Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax.

Martin S. Krejca Carsten Witt

Published in: Theor. Comput. Sci. (2020)

Keyphrases

learning algorithm
lower bound
objective function
computational complexity
optimal solution
k means
similarity measure
image segmentation
multiscale
machine learning
decision trees
information extraction
higher order
segmentation algorithm
wavelet coefficients
closed form
contingency tables