Evolutionary Monte Carlo: Applications to Cp model sampling and change point problem

Statistica Sinica

Volumn 10, Issue 2, 2000, Pages 317-342

  Liang, Faming ^a   Wong, Wing Hung ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Change point identification; Crossover; Exchange; Genetic algorithm; Markov chain Monte Carlo; Metropolis algorithm; Mutation; Parallel tempering; Regression variable selection; Simulated annealing

Indexed keywords

EID: 0034403006     PISSN: 10170405     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (42)

1. Aarts, E. and Korst, J. (1989). Simulated Annealing and Boltzmann Machine. John Wiley, New York.
2. Brown, P. J. and Vannucci, M. (1998). Multivariate Bayesian variable selection and prediction. J. Roy. Statist. Soc. Ser. B 60, 627-641.
3. Chatterjee, S., Carrera, C. and Lynch, L. A. (1996). Genetic algorithms and traveling salesman problems. European J. Operational Research 93, 490-510.
4. Cohoon, J. P., Hedge, S. U., Martin, W. N. and Richards, D. (1991). Distributed genetic algorithms for the floorplan design problem. IEEE Trans. on CAD 10, 484-492.
5. Davis, L. (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.
6. Gelman, A. and Rubin, D. B. (1992). Inference from iterative simulation using multiple sequences (with discussion). Statist. Sci. 7, 457-472.
7. Geman, S. and Geman, D. (1984). Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Trans. Pattern Anal. and Machine Intelligence 6, 721-741.
8. George, E. I. and McCulloch, R. E. (1993). Variable selection via Gibbs sampling. J. Amer. Statist. Assoc. 88, 881-889.
9. George, E. I. and MiCulloch, R. E. (1995). Stochastic search variable selection. Markov Chain Monte Carlo in Practice (Edited by W. R. Gilks, S. Richardson and D. J. Spiegelhalter), 203-214. Chapman & Hall, London.
10. Geyer, C. J. (1991). Markov chain Monte Carlo maximum likelihood. In Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface (Edited by E. M. Keramigas), 156-163. Interface Foundations, Fairfax.
11. Geyer, C. J. and Thompson, E. A. (1995). Annealing Markov chain Monte Carlo with applications to pedigree analysis. J. Amer. Statist. Assoc. 90, 909-920.
12. Gilks, W. R., Richardson, S. and Spiegelhalter, D. J. (1995). Introducing Markov chain Monte Carlo. In Markov Chain Monte Carlo in Practice (Edited by W. R. Gilks, S. Richardson and D. J. Spiegelhalter), 1-19. Chapman & Hall, London.
13. Gilks, W. R., Roberts, G. O. and George, E. I. (1994). Adaptive direction sampling. Statistician 43, 179-189.
14. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning, Addison Wesley.
15. Goldberg, D. E. (1990). Genetic algorithms and Walsh functions: part I, a gentle introduction. Complex Systems 3, 129-152.
16. Green, P. J. (1995). Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika 82, 711-732.
17. Grefenstette, J. J. (1992). Deception considered harmful. In Foundations of Genetic Algorithms 2 (Edited by L. Darrel Whitley). Morgan Kaufmann, San Mateo.
18. Grenander, U. and Miller, M. I. (1994). Representations of knowledge in complex systems. J. Roy. Statist. Soc. Ser. B 56, 549-603.
19. Hastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97-109.
20. Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
21. Hukushima, K. and Nemoto, K. (1996). Exchange Monte Carlo method and application to spin glass simulations. J. Phys. Soc. Jpn. 65, 1604-1608.
22. Kirkpatrick, S., Gelatt, Jr., C. D. and Vecchi, M. P. (1983). Optimization by simulated annealing. Science 220, 671-680.
23. LaMotte, L. R. and Hocking, R. R. (1970). Computational efficiency in the selection of regression variables. Technometrics 12, 83-93.
24. Liang, F. and Wong, W. H. (1999a). Dynamic weighting in simulations of spin systems. Phys. Lett. A 252, 257-262.
25. Liang, F. and Wong, W. H. (1999b). Real parameter evolutionary Monte Carlo with applications in Bayesian neural networks. Technical Report, Department of Statistics and Applied Probability, NUS.
26. Liang, F. and Wong, W. H. (1999c). Automatic Bayesian variable selection in linear selection and the related non-Bayesian methods. Technical Report, Department of Statistics and Applied Probability, NUS.
27. Lienig, L. (1997). A parallel genetic algorithm for performance-driven VLSI routing. IEEE Trans. on Evolutionary Comp. 1, 29-39.
28. Liu, J. S., Liang, F. and Wong, W. H. (1998). The use of multi-try method and local optimization in Metropolis sampling. J. Amer. Statist. Assoc., (in press).
29. p. Technometrics 15, 661-676.
30. Marinari, E. and Parisi, G. (1992). Simulated tempering: a new Monte Carlo scheme. Europhys. Lett. 19, 451-458.
31. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. and Teller, E. (1953). Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087-1091.
32. Nix, A. and Vose, M. D. (1991). Modeling genetic algorithms with Markov chains. Ann. Math. Artificial Intelligence 5, 79-88.
33. Patton, A. L., Punch III, W. F. and Goodman, E. D. (1995). A standard GA approach to native protein conformation prediction. Proceedings of the Sixth International Conference on Genetic Algorithms, 574-581.
34. Phillips, D. B. and Smith, A. F. M. (1995). Bayesian model comparison via jump diffusions. In Markov Chain Monte Carlo in Practice (Edited W. R. Gilks, S. Richardson and D. J. Spiegelhalter), 215-239. Chapman & Hall, London.
35. Randelman, R. E. and Grest, G. S. (1986). N-city traveling salesman problem: optimization by simulated annealing. J. Statist. Phys. 45, 885-890.
36. Spears, W. M. (1992). Crossover or mutation? In Foundations of Genetic Algorithms 2 (Edited by L. D. Whitley). Morgan Kaufmann, San Mateo.
37. Swedsen, R. H. and Wang, J. S. (1987). Nonuniversal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett. 58, 86-88.
38. Unger, R. and Moult, J. (1993). Genetic algorithms for protein folding simulations. J. Molecular Biology 231, 75-81.
39. Weisberg, S. (1985). Applied Linear Regression. John Wiley, New York.
40. Wong, D. F., Leong, H. W. and Liu, C. L. (1988). Simulated Annealing for VLSI design. Kluwer, Boston.
41. Wong, W. H. and Liang, F. (1997). Dynamic weighting in Monte Carlo and optimization. Proc. Natl. Acad. Sci. USA 94, 14220-14224.
42. Wright, A. H. (1991). Genetic algorithms for real parameter optimization. In Foundations of Genetic Algorithms (Edited by G. J. E. Rawlins), 205-218. Morgan Kaufmann, San Mateo.