Evolutionary MCMC Sampling and Optimization in Discrete Spaces

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 736-743

  Strens, Malcolm J A ^a  

^a QINETIQ   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DECISION MAKING; FUNCTIONS; GENETIC ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL OPERATORS; MONTE CARLO METHODS; PROBABILITY; SAMPLING; SIMULATED ANNEALING;

BAYESIAN INFERENCE; DECISION TREES; DISCRETE SPACES; SAMPLING DOMAIN;

LEARNING SYSTEMS;

EID: 1942420644     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Baluja, S., & Caruana, R. (1995). Removing the genetics from the standard genetic algorithm. Proceedings of the Twelth International Conference on Machine Learning (pp. 38-46). San Mateo, CA: Morgan Kaufmann Publishers.
2. Geyer, C. (1992). Practical Markov chain Monte Carlo (with discussion). Statistical Science, 7, 473-511.
3. Green, P. J. (1995). Reversible jump markov chain monte carlo computation and bayesian model determination. Biometrika, 82, 711-732.
4. Holland, J. H. (1975). Adaptation in natural and artifical systems. MI: University of Michigan Press.
5. Jaakkola, T., & Jordan, M. I. (1999). Variational probabilistic inference and the QMR-DT network. Journal of Artificial Intelligence Research, 10, 291-322.
6. Liang, F., & Wong, W. H. (2001). Real-parameter evolutionary Monte Carlo with applications to Bayesian mixture models. Journal of the American Statistical Association, 96, 653.
7. Lozano, J. A., Larranaga, P., Grana, M., & Albizuri, F. X. (1999). Genetic algorithms: bridging the convergence gap. Theoretical Computer Science, 229, 11-22.
8. Mahfoud, S. W., & Goldberg, D. E. (1995). Parallel recombinative simulated annealing: a genetic algorithm. Parallel Computing, 21, 1-28.
9. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, B. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087-1092.
10. Neal, R. (1998). Annealed importance sampling (Technical Report 9805 (revised)). Department of Statistics, University of Toronto.
11. Pelikan, M., Goldberg, D. E., & Cantu-Paz, E. (1999). BOA: The bayesian optimization algorithm. Proceedings of the Genetic and Evolutionary Computation Conference (pp. 525-532). Orlando, Florida, USA: Morgan Kaufmann.
12. Shwe, M., Middleton, B., Heckerman, D., Henrion, M., Horvitz, E., Lehmann, H., & Cooper, G. (1991). Probabilistic diagnosis using a reformulation of the INTERNIST-1/QMR knowledge base: Part I. The probabilistic model and inference algorithms. SIAM Journal on Computing, 30, 241-250.
13. Storn, R., & Price, K. (1995). Differential evolution -a simple and efficient adaptive scheme for global optimization over continuous spaces (Technical Report TR-95-012). Berkeley, CA.
14. Strens, M., Bernhardt, M., & Everett, N. (2002). Markov chain monte carlo sampling using direct search optimization. Proceedings of the Nineteenth International Conference on Machine Learning. San Francisco: Morgan Kaufmann.