Theoretical Analyses of Univariate Estimation-of-distribution Algorithms


Book Description

Optimization is a core part of technological advancement and is usually heavily aided by computers. However, since many optimization problems are hard, it is unrealistic to expect an optimal solution within reasonable time. Hence, heuristics are employed, that is, computer programs that try to produce solutions of high quality quickly. One special class are estimation-of-distribution algorithms (EDAs), which are characterized by maintaining a probabilistic model over the problem domain, which they evolve over time. In an iterative fashion, an EDA uses its model in order to generate a set of solutions, which it then uses to refine the model such that the probability of producing good solutions is increased. In this thesis, we theoretically analyze the class of univariate EDAs over the Boolean domain, that is, over the space of all length-n bit strings. In this setting, the probabilistic model of a univariate EDA consists of an n-dimensional probability vector where each component denotes the probability to sample a 1 for that ...




Theory of Evolutionary Computation


Book Description

This edited book reports on recent developments in the theory of evolutionary computation, or more generally the domain of randomized search heuristics. It starts with two chapters on mathematical methods that are often used in the analysis of randomized search heuristics, followed by three chapters on how to measure the complexity of a search heuristic: black-box complexity, a counterpart of classical complexity theory in black-box optimization; parameterized complexity, aimed at a more fine-grained view of the difficulty of problems; and the fixed-budget perspective, which answers the question of how good a solution will be after investing a certain computational budget. The book then describes theoretical results on three important questions in evolutionary computation: how to profit from changing the parameters during the run of an algorithm; how evolutionary algorithms cope with dynamically changing or stochastic environments; and how population diversity influences performance. Finally, the book looks at three algorithm classes that have only recently become the focus of theoretical work: estimation-of-distribution algorithms; artificial immune systems; and genetic programming. Throughout the book the contributing authors try to develop an understanding for how these methods work, and why they are so successful in many applications. The book will be useful for students and researchers in theoretical computer science and evolutionary computing.







Multivariate Density Estimation


Book Description

Clarifies modern data analysis through nonparametric density estimation for a complete working knowledge of the theory and methods Featuring a thoroughly revised presentation, Multivariate Density Estimation: Theory, Practice, and Visualization, Second Edition maintains an intuitive approach to the underlying methodology and supporting theory of density estimation. Including new material and updated research in each chapter, the Second Edition presents additional clarification of theoretical opportunities, new algorithms, and up-to-date coverage of the unique challenges presented in the field of data analysis. The new edition focuses on the various density estimation techniques and methods that can be used in the field of big data. Defining optimal nonparametric estimators, the Second Edition demonstrates the density estimation tools to use when dealing with various multivariate structures in univariate, bivariate, trivariate, and quadrivariate data analysis. Continuing to illustrate the major concepts in the context of the classical histogram, Multivariate Density Estimation: Theory, Practice, and Visualization, Second Edition also features: Over 150 updated figures to clarify theoretical results and to show analyses of real data sets An updated presentation of graphic visualization using computer software such as R A clear discussion of selections of important research during the past decade, including mixture estimation, robust parametric modeling algorithms, and clustering More than 130 problems to help readers reinforce the main concepts and ideas presented Boxed theorems and results allowing easy identification of crucial ideas Figures in color in the digital versions of the book A website with related data sets Multivariate Density Estimation: Theory, Practice, and Visualization, Second Edition is an ideal reference for theoretical and applied statisticians, practicing engineers, as well as readers interested in the theoretical aspects of nonparametric estimation and the application of these methods to multivariate data. The Second Edition is also useful as a textbook for introductory courses in kernel statistics, smoothing, advanced computational statistics, and general forms of statistical distributions.




Towards a New Evolutionary Computation


Book Description

Estimation of Distribution Algorithms (EDAs) are a set of algorithms in the Evolutionary Computation (EC) field characterized by the use of explicit probability distributions in optimization. Contrarily to other EC techniques such as the broadly known Genetic Algorithms (GAs) in EDAs, the crossover and mutation operators are substituted by the sampling of a distribution previously learnt from the selected individuals. EDAs have experienced a high development that has transformed them into an established discipline within the EC field. This book attracts the interest of new researchers in the EC field as well as in other optimization disciplines, and that it becomes a reference for all of us working on this topic. The twelve chapters of this book can be divided into those that endeavor to set a sound theoretical basis for EDAs, those that broaden the methodology of EDAs and finally those that have an applied objective.







Evolutionary Computation in Combinatorial Optimization


Book Description

This book constitutes the refereed proceedings of the 20th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020, held as part of Evo*2020, in Seville, Spain, in April 2020, co-located with the Evo*2020 events EuroGP, EvoMUSART and EvoApplications. The 14 full papers presented in this book were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics, to their accurate design and application to combinatorial optimization problems.




Univariate Discrete Distributions


Book Description

This Set Contains: Continuous Multivariate Distributions, Volume 1, Models and Applications, 2nd Edition by Samuel Kotz, N. Balakrishnan and Normal L. Johnson Continuous Univariate Distributions, Volume 1, 2nd Edition by Samuel Kotz, N. Balakrishnan and Normal L. Johnson Continuous Univariate Distributions, Volume 2, 2nd Edition by Samuel Kotz, N. Balakrishnan and Normal L. Johnson Discrete Multivariate Distributions by Samuel Kotz, N. Balakrishnan and Normal L. Johnson Univariate Discrete Distributions, 3rd Edition by Samuel Kotz, N. Balakrishnan and Normal L. Johnson Discover the latest advances in discrete distributions theory The Third Edition of the critically acclaimed Univariate Discrete Distributions provides a self-contained, systematic treatment of the theory, derivation, and application of probability distributions for count data. Generalized zeta-function and q-series distributions have been added and are covered in detail. New families of distributions, including Lagrangian-type distributions, are integrated into this thoroughly revised and updated text. Additional applications of univariate discrete distributions are explored to demonstrate the flexibility of this powerful method. A thorough survey of recent statistical literature draws attention to many new distributions and results for the classical distributions. Approximately 450 new references along with several new sections are introduced to reflect the current literature and knowledge of discrete distributions. Beginning with mathematical, probability, and statistical fundamentals, the authors provide clear coverage of the key topics in the field, including: Families of discrete distributions Binomial distribution Poisson distribution Negative binomial distribution Hypergeometric distributions Logarithmic and Lagrangian distributions Mixture distributions Stopped-sum distributions Matching, occupancy, runs, and q-series distributions Parametric regression models and miscellanea Emphasis continues to be placed on the increasing relevance of Bayesian inference to discrete distribution, especially with regard to the binomial and Poisson distributions. New derivations of discrete distributions via stochastic processes and random walks are introduced without unnecessarily complex discussions of stochastic processes. Throughout the Third Edition, extensive information has been added to reflect the new role of computer-based applications. With its thorough coverage and balanced presentation of theory and application, this is an excellent and essential reference for statisticians and mathematicians.




Estimation of Distribution Algorithms


Book Description

Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation is devoted to a new paradigm for evolutionary computation, named estimation of distribution algorithms (EDAs). This new class of algorithms generalizes genetic algorithms by replacing the crossover and mutation operators with learning and sampling from the probability distribution of the best individuals of the population at each iteration of the algorithm. Working in such a way, the relationships between the variables involved in the problem domain are explicitly and effectively captured and exploited. This text constitutes the first compilation and review of the techniques and applications of this new tool for performing evolutionary computation. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation is clearly divided into three parts. Part I is dedicated to the foundations of EDAs. In this part, after introducing some probabilistic graphical models - Bayesian and Gaussian networks - a review of existing EDA approaches is presented, as well as some new methods based on more flexible probabilistic graphical models. A mathematical modeling of discrete EDAs is also presented. Part II covers several applications of EDAs in some classical optimization problems: the travelling salesman problem, the job scheduling problem, and the knapsack problem. EDAs are also applied to the optimization of some well-known combinatorial and continuous functions. Part III presents the application of EDAs to solve some problems that arise in the machine learning field: feature subset selection, feature weighting in K-NN classifiers, rule induction, partial abductive inference in Bayesian networks, partitional clustering, and the search for optimal weights in artificial neural networks. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation is a useful and interesting tool for researchers working in the field of evolutionary computation and for engineers who face real-world optimization problems. This book may also be used by graduate students and researchers in computer science. `... I urge those who are interested in EDAs to study this well-crafted book today.' David E. Goldberg, University of Illinois Champaign-Urbana.




Parallel Problem Solving from Nature – PPSN XVII


Book Description

This two-volume set LNCS 13398 and LNCS 13399 constitutes the refereed proceedings of the 17th International Conference on Parallel Problem Solving from Nature, PPSN 2022, held in Dortmund, Germany, in September 2022. The 87 revised full papers were carefully reviewed and selected from numerous submissions. The conference presents a study of computing methods derived from natural models. Amorphous Computing, Artificial Life, Artificial Ant Systems, Artificial Immune Systems, Artificial Neural Networks, Cellular Automata, Evolutionary Computation, Swarm Computing, Self-Organizing Systems, Chemical Computation, Molecular Computation, Quantum Computation, Machine Learning, and Artificial Intelligence approaches using Natural Computing methods are just some of the topics covered in this field.