Estimation of Distribution Algorithms and Minimum Relative Entropy

[1]  P. Grünwald.  The Minimum Description Length Principle and Reasoning under Uncertainty , 1998 .

[2]  Yong Gao,et al.  Space Complexity of Estimation of Distribution Algorithms , 2005, Evolutionary Computation.

[3]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[4]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .

[5]  Alexander K. Hartmann,et al.  Ground state of the Bethe lattice spin glass and running time of an exact optimization algorithm , 2003 .

[6]  Yee Whye Teh,et al.  Bethe free energy and contrastive divergence approximations for undirected graphical models , 2003 .

[7]  Jonathan Harel,et al.  Poset belief propagation-experimental results , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[8]  Adwait Ratnaparkhi,et al.  A Simple Introduction to Maximum Entropy Models for Natural Language Processing , 1997 .

[9]  R. Kikuchi.  A Theory of Cooperative Phenomena , 1951 .

[10]  Gabriele Kern-Isberner,et al.  Characterizing the Principle of Minimum Cross-Entropy Within a Conditional-Logical Framework , 1998, Artif. Intell..

[11]  Alden H. Wright,et al.  An Estimation of Distribution Algorithm Based on Maximum Entropy , 2004, GECCO.

[12]  R. B. Robbins.  Some Applications of Mathematics to Breeding Problems. , 1917, Genetics.

[13]  Ray A. Jarvis,et al.  Clustering Using a Similarity Measure Based on Shared Near Neighbors , 1973, IEEE Transactions on Computers.

[14]  Robert J. McEliece,et al.  Belief Propagation on Partially Ordered Sets , 2003, Mathematical Systems Theory in Biology, Communications, Computation, and Finance.

[15]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[16]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[17]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[18]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[19]  Rich Caruana,et al.  Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.

[20]  T. Mahnig,et al.  A new adaptive Boltzmann selection schedule SDS , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[21]  R. Peierls.  On Ising's model of ferromagnetism , 1936, Mathematical Proceedings of the Cambridge Philosophical Society.

[22]  Johnz Willett.  Similarity and Clustering in Chemical Information Systems , 1987 .

[23]  I. Good,et al.  The Maximum Entropy Formalism. , 1979 .

[24]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[25]  T. Mahnig,et al.  Evolutionary algorithms: from recombination to search distributions , 2001 .

[26]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[27]  T. Stoppard.  Rosencrantz & Guildenstern Are Dead , 1967 .

[28]  Alan L. Yuille,et al.  CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation , 2002, Neural Computation.

[29]  W. Deming,et al.  On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known , 1940 .

[30]  S. Aji,et al.  The Generalized Distributive Law and Free Energy Minimization , 2001 .

[31]  Adnan Darwiche,et al.  Inference in belief networks: A procedural guide , 1996, Int. J. Approx. Reason..

[32]  I. Good,et al.  The Maximum Entropy Formalism. , 1979 .

[33]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[34]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[35]  Jos Uffink,et al.  Can the maximum entropy principle be explained as a consistency requirement , 1995 .

[36]  Bart Naudts,et al.  Symmetry in the representation of an optimization problem , 2003 .

[37]  L. Onsager.  Crystal statistics. I. A two-dimensional model with an order-disorder transition , 1944 .

[38]  Roberto Santana,et al.  Estimation of Distribution Algorithms with Kikuchi Approximations , 2005, Evolutionary Computation.

[39]  G. Schwarz.  Estimating the Dimension of a Model , 1978 .

[40]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[41]  Michael I. Jordan.  Learning in Graphical Models , 1999, NATO ASI Series.

[42]  Frank Jensen,et al.  Optimal junction Trees , 1994, UAI.

[43]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[44]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[45]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[46]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[47]  C. N. Liu,et al.  Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.

[48]  Elena Marchiori,et al.  Evolutionary Algorithms for the Satisfiability Problem , 2002, Evolutionary Computation.

[49]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[50]  Lee Altenberg,et al.  The Schema Theorem and Price's Theorem , 1994, FOGA.

[51]  William T. Freeman,et al.  Understanding belief propagation and its generalizations , 2003 .

[52]  William T. Freeman,et al.  Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[53]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

[54]  Bruce Tidor,et al.  An Analysis of Selection Procedures with Particular Attention Paid to Proportional and Boltzmann Selection , 1993, International Conference on Genetic Algorithms.

[55]  Heinz Mühlenbein,et al.  Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.

[56]  Gilbert Syswerda,et al.  Simulated Crossover in Genetic Algorithms , 1992, FOGA.

[57]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[58]  H. Mühlenbein,et al.  Gene Pool Recombination in Genetic Algorithms , 1996 .

[59]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[60]  D. Wolpert,et al.  No Free Lunch Theorems for Search , 1995 .

[61]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[62]  Russell G. Almond.  Graphical belief modeling , 1995 .

[63]  David E. Goldberg,et al.  Hierarchical BOA Solves Ising Spin Glasses and MAXSAT , 2003, GECCO.

[64]  Heinz Mühlenbein,et al.  Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning , 2002, Int. J. Approx. Reason..

[65]  David B. Fogel,et al.  Evolutionary Computation: The Fossil Record , 1998 .

[66]  Heinz Mühlenbein,et al.  A Maximum Entropy Approach to Sampling in EDA ? The Single Connected Case , 2003, CIARP.

[67]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[68]  H. Geiringer.  On the Probability Theory of Linkage in Mendelian Heredity , 1944 .

[69]  David Maxwell Chickering,et al.  Learning Bayesian Networks: The Combination of Knowledge and Statistical Data , 1994, Machine Learning.

[70]  S. Kullback.  Probability Densities with Given Marginals , 1968 .

[71]  Heinz Mühlenbein,et al.  Stochastic Analysis of Cellular Automata and the Voter Model , 2002, ACRI.

[72]  U. Montanari,et al.  Nonserial Dynamic Programming: On the Optimal Strategy of Variable Elimination for the Rectangular Lattice , 1972 .

[73]  J. Darroch,et al.  Generalized Iterative Scaling for Log-Linear Models , 1972 .

[74]  Jorma Rissanen,et al.  Stochastic Complexity in Statistical Inquiry , 1989, World Scientific Series in Computer Science.

[75]  I. Csiszár.  $I$-Divergence Geometry of Probability Distributions and Minimization Problems , 1975 .

[76]  A. Ochoa,et al.  A factorized distribution algorithm based on polytrees , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[77]  Alex S. Fukunaga,et al.  Evolving Local Search Heuristics for SAT Using Genetic Programming , 2004, GECCO.

[78]  Payam Pakzad,et al.  Estimation and Marginalization Using the Kikuchi Approximation Methods , 2005, Neural Computation.

[79]  Nir Friedman,et al.  Learning Bayesian Networks with Local Structure , 1996, UAI.

[80]  Heinz Mühlenbein,et al.  Stochastic Analysis of Cellular Automata with Application to the Voter Model , 2002, Adv. Complex Syst..

[81]  D. Goldberg,et al.  Building block superiority, multimodality and synchronization problems , 2001 .

[82]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[83]  Yang Xiang,et al.  A “Microscopic” Study of Minimum Entropy Search in Learning Decomposable Markov Networks , 2004, Machine Learning.

[84]  Sylvia Richardson,et al.  Markov chain concepts related to sampling algorithms , 1995 .

[85]  E. Ising.  Beitrag zur Theorie des Ferromagnetismus , 1925 .

[86]  Paul A. Viola,et al.  MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

[87]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[88]  Joseph C. Culberson,et al.  On the Futility of Blind Search: An Algorithmic View of No Free Lunch , 1998, Evolutionary Computation.

[89]  Philip M. Lewis,et al.  Approximating Probability Distributions to Reduce Storage Requirements , 1959, Information and Control.

[90]  Shumeet Baluja,et al.  Using a priori knowledge to create probabilistic models for optimization , 2002, Int. J. Approx. Reason..

[91]  S. Kullback,et al.  Contingency tables with given marginals. , 1968, Biometrika.

[92]  E. T. Jaynes,et al.  Where do we Stand on Maximum Entropy , 1979 .

[93]  Rodney W. Johnson,et al.  Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy , 1980, IEEE Trans. Inf. Theory.

[94]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

[95]  Nir Friedman,et al.  On the Sample Complexity of Learning Bayesian Networks , 1996, UAI.

[96]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[97]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .