{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:45Z","timestamp":1750219785554,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3590707","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"303-306","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparison of MCMC Adaptation Schemes: A Preliminary Empirical Study"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0567-5528","authenticated-orcid":false,"given":"Bowen","family":"Liu","sequence":"first","affiliation":[{"name":"Computer Science Department\/AI Lab, Vrije Universiteit Brussel, Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7874-6609","authenticated-orcid":false,"given":"Edna","family":"Milgo","sequence":"additional","affiliation":[{"name":"Computer Science Department\/AI Lab, Vrije Universiteit Brussel, Brussels, Belgium"},{"name":"Department of Physics, Mathematics and Computer Science\/School of Science and Aerospace Studies, Moi University, Eldoret, Kenya"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8699-7494","authenticated-orcid":false,"given":"Nixon","family":"Ronoh","sequence":"additional","affiliation":[{"name":"Computer Science Department\/AI Lab, Vrije Universiteit Brussel, Brussels, Belgium"},{"name":"Department of Physics, Mathematics and Computer Science\/School of Science and Aerospace Studies, Moi University, Eldoret, BE, Kenya"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9020-0510","authenticated-orcid":false,"given":"Manderick","family":"Bernard","sequence":"additional","affiliation":[{"name":"Computer Science Department\/AI Lab, Vrije Universiteit Brussel, Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A tutorial on adaptive MCMC. Statistics and Computing 18-4","author":"Andrieu Christophe","year":"2008","unstructured":"Christophe Andrieu and Johannes Thoms . 2008. A tutorial on adaptive MCMC. Statistics and Computing 18-4 ( 2008 ), 343--373. Christophe Andrieu and Johannes Thoms. 2008. A tutorial on adaptive MCMC. Statistics and Computing 18-4 (2008), 343--373."},{"key":"e_1_3_2_1_2_1","volume-title":"Brooks and Andrew Gelman","author":"Stephen","year":"1998","unstructured":"Stephen P. Brooks and Andrew Gelman . 1998 . General Methods for Monitoring Convergence of Iterative Simulations. Journal of Computational and Graphical Statistics 7-4 (1998), 434--455. Stephen P. Brooks and Andrew Gelman. 1998. General Methods for Monitoring Convergence of Iterative Simulations. Journal of Computational and Graphical Statistics 7-4 (1998), 434--455."},{"key":"e_1_3_2_1_3_1","volume-title":"Weak convergence and optimal scaling of random walk Metropolis algorithms. The annals of applied probability 7, 1","author":"Gelman Andrew","year":"1997","unstructured":"Andrew Gelman , Walter R Gilks , and Gareth O Roberts . 1997. Weak convergence and optimal scaling of random walk Metropolis algorithms. The annals of applied probability 7, 1 ( 1997 ), 110--120. Andrew Gelman, Walter R Gilks, and Gareth O Roberts. 1997. Weak convergence and optimal scaling of random walk Metropolis algorithms. The annals of applied probability 7, 1 (1997), 110--120."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011136"},{"key":"e_1_3_2_1_5_1","volume-title":"Adaptive proposal distribution for random walk Metropolis algorithm. Computational Statistics 14-3","author":"Haario Heikki","year":"1999","unstructured":"Heikki Haario , Eero Saksman , and Johanna Tamminen . 1999. Adaptive proposal distribution for random walk Metropolis algorithm. Computational Statistics 14-3 ( 1999 ), 375--395. Heikki Haario, Eero Saksman, and Johanna Tamminen. 1999. Adaptive proposal distribution for random walk Metropolis algorithm. Computational Statistics 14-3 (1999), 375--395."},{"key":"e_1_3_2_1_6_1","volume-title":"An adaptive Metropolis algorithm. Bernoulli 7-2","author":"Haario Heikki","year":"2001","unstructured":"Heikki Haario , Eero Saksman , and Johanna Tamminen . 2001. An adaptive Metropolis algorithm. Bernoulli 7-2 ( 2001 ), 223--242. Heikki Haario, Eero Saksman, and Johanna Tamminen. 2001. An adaptive Metropolis algorithm. Bernoulli 7-2 (2001), 223--242."},{"key":"e_1_3_2_1_7_1","unstructured":"Nikolaus Hansen. 2016. The CMA Evolution Strategy: A Tutorial. (2016). http:\/\/www.lri.fr\/~hansen\/cmatutorial.pdf  Nikolaus Hansen. 2016. The CMA Evolution Strategy: A Tutorial. (2016). http:\/\/www.lri.fr\/~hansen\/cmatutorial.pdf"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144082"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3228374.3228868"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725496"},{"volume-title":"Congress on Evolutionary Computation (CEC, IEEE), 1--8.","author":"Christian","key":"e_1_3_2_1_11_1","unstructured":"Christian L. M\u00fcller and Ivo F. Sbalzarini. 2010. Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling . Congress on Evolutionary Computation (CEC, IEEE), 1--8. Christian L. M\u00fcller and Ivo F. Sbalzarini. 2010. Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling. Congress on Evolutionary Computation (CEC, IEEE), 1--8."}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23 Companion"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590707","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3590707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:49Z","timestamp":1750178269000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":11,"alternative-id":["10.1145\/3583133.3590707","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3590707","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}