{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:34:14Z","timestamp":1743093254427,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319235240"},{"type":"electronic","value":"9783319235257"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23525-7_19","type":"book-chapter","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T08:20:13Z","timestamp":1440750013000},"page":"311-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Output-Sensitive Adaptive Metropolis-Hastings for Probabilistic Programs"],"prefix":"10.1007","author":[{"given":"David","family":"Tolpin","sequence":"first","affiliation":[]},{"given":"Jan-Willem","family":"van de Meent","sequence":"additional","affiliation":[]},{"given":"Brooks","family":"Paige","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11222-008-9110-y","volume":"18","author":"C Andrieu","year":"2008","unstructured":"Andrieu, C., Thoms, J.: A tutorial on adaptive MCMC. Statistics and Computing 18(4), 343\u2013373 (2008)","journal-title":"Statistics and Computing"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Atchad\u00e9, Y., Fort, G., Moulines, E., Priouret, P.: Adaptive markov chain monte carlo: theory and methods. In: Barber, D., Cemgil, A.T., Chiappa, S. (eds.) Bayesian Time Series Models, pp. 32\u201351. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511984679.003"},{"issue":"2\u20133","key":"19_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the Multiarmed Bandit problem. Machine Learning 47(2\u20133), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"issue":"1","key":"19_CR4","first-page":"1","volume":"21","author":"Y Bai","year":"2011","unstructured":"Bai, Y., Roberts, G.O., Rosenthal, J.S.: On the containment condition for adaptive Markov chain Monte Carlo algorithms. Advances and Applications in Statistics 21(1), 1\u201354 (2011)","journal-title":"Advances and Applications in Statistics"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Gamerman, D., Lopes, H.F.: Markov Chain Monte Carlo: Stochastic Simulation for Bayesian Inference. Chapman and Hall\/CRC (2006)","DOI":"10.1201\/9781482296426"},{"key":"19_CR6","unstructured":"Goodman, N.D., Mansinghka, V.K., Roy, D.M., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: UAI, pp. 220\u2013229 (2008)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: ICSE (FOSE track) (2014)","DOI":"10.1145\/2593882.2593900"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1214\/11-AAP806","volume":"23","author":"K \u0141atuszy\u0144ski","year":"2013","unstructured":"\u0141atuszy\u0144ski, K., Roberts, G.O., Rosenthal, J.S.: Adaptive Gibbs samplers and related MCMC methods. Annals of Applied Probability 23(1), 66\u201398 (2013)","journal-title":"Annals of Applied Probability"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Lauritzen, S.: Graphical Models. Clarendon Press (1996)","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.csda.2004.02.002","volume":"48","author":"RA Levine","year":"2005","unstructured":"Levine, R.A., Yu, Z., Hanley, W.G., Nitao, J.J.: Implementing componentwise hastings algorithms. Computational Stastistics & Data Analysis 48(2), 363\u2013389 (2005)","journal-title":"Computational Stastistics & Data Analysis"},{"key":"19_CR11","unstructured":"Mansinghka, V.K., Selsam, D., Perov, Y.N.: Venture: a higher-order probabilistic programming platform with programmable inference. CoRR abs\/1404.0099 (2014)"},{"key":"19_CR12","unstructured":"van de Meent, J.W., Yang, H., Mansinghka, V., Wood, F.: Particle Gibbs with Ancestor Sampling for Probabilistic Programs. In: AISTATS, pp. 986\u2013994 (2015)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Nori, A.V., Hur, C.K., Rajamani, S.K., Samuel, S.: R2: An efficient mcmc sampler for probabilistic programs. In: AAAI, pp. 2476\u20132482 (2014)","DOI":"10.1609\/aaai.v28i1.9060"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1239\/jap\/1183667414","volume":"44","author":"GO Roberts","year":"2007","unstructured":"Roberts, G.O., Rosenthal, J.S.: Coupling and ergodicity of adaptive MCMC. Journal of Applied Probability 44, 458\u2013475 (2007)","journal-title":"Journal of Applied Probability"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1198\/jcgs.2009.06134","volume":"18","author":"GO Roberts","year":"2009","unstructured":"Roberts, G.O., Rosenthal, J.S.: Examples of adaptive MCMC. Journal of Computational and Graphical Statistics 18(2), 349\u2013367 (2009)","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"19_CR16","unstructured":"Wingate, D., Stuhlm\u00fcller, A., Goodman, N.D.: Lightweight implementations of probabilistic programming languages via transformational compilation. In: AISTATS, pp. 770\u2013778 (2011)"},{"key":"19_CR17","unstructured":"Wood, F., van de Meent, J.W., Mansinghka, V.: A new approach to probabilistic programming inference. In: AISTATS, pp. 1024\u20131032 (2014)"},{"key":"19_CR18","unstructured":"Yang, L., Hanrahan, P., Goodman, N.D.: Generating efficient MCMC kernels from probabilistic programs. In: AISTATS, pp. 1068\u20131076 (2014)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23525-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T20:00:27Z","timestamp":1718049627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23525-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319235240","9783319235257"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23525-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}