Loopy substructural local search for the Bayesian optimization algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5752 LNCS, Issue , 2009, Pages 61-75

  Lima, Claudio F ^a   Pelikan, Martin ^b   Lobo, Fernando G ^a   Goldberg, David E ^c  

^a UNIVERSITY OF ALGARVE   (Portugal)

^b UNIVERSITY OF MISSOURI ST LOUIS   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN OPTIMIZATION ALGORITHMS; BELIEF PROPAGATION; GRAPHICAL MODEL; LOCAL SEARCH; LOCAL SEARCH METHOD; LOOPY BELIEF PROPAGATION; OPTIMAL SOLUTIONS; PROBABILISTIC MODELS;

BAYESIAN NETWORKS; GRAPHIC METHODS; HEURISTIC METHODS; LEARNING ALGORITHMS;

OPTIMIZATION;

EID: 70350510104     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03751-1_5     Document Type: Conference Paper

References (26)

1. Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: BOA: The Bayesian Optimization Algorithm. In: Banzhaf, W., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999, pp. 525-532. Morgan Kaufmann, San Francisco (1999)
2. Pelikan, M.: Hierarchical Bayesian Optimization Algorithm: Toward a New Generation of Evolutionary Algorithms. Springer, Heidelberg (2005)
3. Larrañaga, P., Lozano, J.A. (eds.): Estimation of distribution algorithms: a new tool for Evolutionary Computation. Kluwer Academic Publishers, Boston (2002)
4. Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21(1), 5-20 (2002)
5. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report C3P 826, Caltech Concurrent Computation Program, California Institute of Technology, Pasadena, CA (1989)
6. Hart, W.E.: Adaptive global optimization with local search. PhD thesis, University of California, San Diego, CA (1994)
7. Sastry, K., Goldberg, D.E.: Let's get ready to rumble: Crossover versus mutation head to head. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 126-137. Springer, Heidelberg (2004)
8. Lima, C.F., Pelikan, M., Sastry, K., Butz, M., Goldberg, D.E., Lobo, F.G.: Substructural neighborhoods for local search in the bayesian optimization algorithm. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervos, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 232-241. Springer, Heidelberg (2006)
9. Pearl, J.: Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo (1988)
10. Pelikan, M., Sastry, K.: Fitness inheritance in the bayesian optimization algorithm. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 48-59. Springer, Heidelberg (2004)
11. Lima, C.F.: Substructural Local Search in Discrete Estimation of Distribution Algorithms. PhD thesis, University of Algarve, Faro, Portugal (2009)
12. Kschischang, F., Frey, B., Loeliger, H.A.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47(2), 498-519 (2001)
13. Mooij, J.M.: Understanding and Improving Belief Propagation. PhD thesis, Radboud University Nijmegen, Nijmegen, Netherlands (2008)
14. Kindermann, R., Snell, J.L.: Markov Random Fields and Their Applications. American Mathematics Society, Providence (1980)
15. Mendiburu, A., Santana, R., Lozano, J.A., Bengoetxea, E.: A parallel framework for loopy belief propagation. In: GECCO 2007: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation, pp. 2843-2850. ACM, New York (2007)
16. Braunstein, A., Mezard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Structures and Algorithms 27(2), 201-226 (2005)
17. Feige, U., Mossel, E., Vilenchik, D.: Complete convergence of message passing algorithms for some satisfiability problems. In: Diaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 339-350. Springer, Heidelberg (2006)
18. Bayati, M., Shah, D., Sharma, M.: Max-product for maximum weight matching: Convergence, correctness, and LP duality. IEEE Transactions on Information Theory 54(3), 1241-1251 (2008)
19. Mendiburu, A., Santana, R., Lozano, J.A.: Introducing belief propagation in estimation of distribution algorithms: A parallel approach. Technical Report EHU-KAT-IK-11-07, Department of Computer Science and Artificial Intelligence, University of the Basque Country (2007)
20. Etxeberria, R., Larrañaga, P.: Global optimization using Bayesian networks. In: Rodriguez, A.A.O., et al. (eds.) Second Symposium on Artificial Intelligence (CIMAF 1999), Habana, Cuba, pp. 332-339 (1999)
21. Henrion, M.: Propagation of uncertainty in Bayesian networks by logic sampling. In: Lemmer, J.F., Kanal, L.N. (eds.) Uncertainty in Artificial Intelligence, pp. 149-163. Elsevier, Amsterdam (1988)
22. Elidan, G., Mcgraw, I., Koller, D.: Residual belief propagation: Informed scheduling for asynchronous message passing. In: Proceedings of the Twenty-second Conference on Uncertainty in AI, UAI (2006)
23. Yu, T.L., Sastry, K., Goldberg, D.E., Pelikan, M.: Population sizing for entropybased model building in genetic algorithms. In: Thierens, D., et al. (eds.) Proceedings of the ACM SIGEVO Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 601-608. ACM Press, New York (2007)
24. Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. Foundations of Genetic Algorithms 2, 93-108 (1993)
25. Goldberg, D.E.: The Design of Innovation -Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, Norwell (2002)
26. Thierens, D., Goldberg, D.E.: Mixing in genetic algorithms. In: Forrest, S. (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, CA, pp. 38-45. Morgan Kaufmann, San Francisco (1993)