{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:17Z","timestamp":1781078237695,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-2045354, CCF-1954927"],"award-info":[{"award-number":["CCF-2045354, CCF-1954927"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649744","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"537-548","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Sampling via Counting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4394-3530","authenticated-orcid":false,"given":"Nima","family":"Anari","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9837-8598","authenticated-orcid":false,"given":"Ruiquan","family":"Gao","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6900-8612","authenticated-orcid":false,"given":"Aviad","family":"Rubinstein","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Nathan Hu, Amin Saberi, and Aaron Schild.","author":"Anari Nima","year":"2020","unstructured":"Nima Anari, Callum Burgess, Kevin Tian, and Thuy-Duong Vuong. 2023. Quadratic speedups in parallel sampling from determinantal distributioPnrso.-In ceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 367-377. Nima Anari, Nathan Hu, Amin Saberi, and Aaron Schild. 2020. Sampling arborescences in parallealr.Xiv preprint arXiv: 2012. 0950.2 Nima Anari, Yizhi Huang, Tianyu Liu, Thuy-Duong Vuong, Brian Xu, and Katherine Yu. 2023. Parallel discrete sampling via continuous walPkrso.I-n ceedings of the 55th Annual ACM Symposium on Theory of Computin, g103-[ 29 ] 116."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.19"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384287"},{"key":"e_1_3_2_1_4_1","volume-title":"ombinatorics and complexity of partition functi o. ns","author":"Barvinok Alexander","unstructured":"Alexander Barvinok. 2016C. ombinatorics and complexity of partition functi o. ns Vol. 30. Springer. [ 33 ] Tom Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared D Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al. 2020. Language models are few-shot learnAedrvsa. nces in neural information processing system, s33, 1877-1901."},{"key":"e_1_3_2_1_5_1","first-page":"37","volume-title":"In62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS","author":"Chakrabarty Deeparnab","year":"2021","unstructured":"Deeparnab Chakrabarty, Yu Chen, and Sanjeev Khanna. 2021. A polynomial lower bound on the number of rounds for parallel submodular function mini-mization. In62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 202. 2IEEE, 37-48."},{"key":"e_1_3_2_1_6_1","volume-title":"Improved lower bounds for submodular function minimization2. 02In2 IEEE 63rd Annual Symposium on Foundations of Computer Science (FO. CIESE)E, 245-254","author":"Chakrabarty Deeparnab","unstructured":"Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, and Aaron Sidford. 2022. Improved lower bounds for submodular function minimization2. 02In2 IEEE 63rd Annual Symposium on Foundations of Computer Science (FO. CIESE)E, 245-254."},{"key":"e_1_3_2_1_7_1","volume-title":"Ming-Wei Chang, Kenton Lee, and Kristina Toutanova.","author":"Chen Charlie","year":"2018","unstructured":"Charlie Chen, Sebastian Borgeaud, Geofrey Irving, Jean-Baptiste Lespiau, Laurent Sifre, and John Jumper. 2023. Accelerating large language model decoding with speculative samplinga. rXiv preprint arXiv:2302.0131.8 Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2018. Bert: pre-training of deep bidirectional transformers for language understanding."},{"key":"e_1_3_2_1_8_1","volume-title":"Alan Frieze, and Ravi Kannan.","author":"Xiv Xiv","year":"1991","unstructured":"arXiv preprint arXiv: 1810. 0480.5 Martin Dyer, Alan Frieze, and Ravi Kannan. 1991. A random polynomial-time algorithm for approximating the volume of convex bodJioeus.rnal of the ACM (JACM ), 38, 1, 1-17."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Weiming Feng Thomas P Hayes and Yitong Yin. 2021. Distributed metropolis sampler with optimal parallelism.PIrnoceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA.S)IAM 2121-2140.","DOI":"10.1137\/1.9781611976465.127"},{"key":"e_1_3_2_1_10_1","first-page":"238","article-title":"A parallel algorithm for finding a separator in planar graphs. I2n8th Annual Symposium on Foundations of Computer Science (sfcs 1987 )","author":"Gazit Hillel","year":"1987","unstructured":"Hillel Gazit and Gary L Miller. 1987. A parallel algorithm for finding a separator in planar graphs. I2n8th Annual Symposium on Foundations of Computer Science (sfcs 1987 ). IEEE, 238-248.","journal-title":"IEEE"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Mark Jerrum Alistair Sinclair and Eric Vigoda. 2004. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_3_2_1_12_1","unstructured":"Journal of the ACM (JACM ) 51 4 671-697."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Mark R Jerrum Leslie G Valiant and Vijay V Vazirani. 1986. Random generation of combinatorial structures from a uniform distribuThetioorne. tical computer science 43 169-188.","DOI":"10.1016\/0304-3975(86)90174-X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/49981.49986"},{"key":"e_1_3_2_1_15_1","unstructured":"Hugo Larochelle and Iain Murray. 2011. The neural autoregressive distribution estimator. InProceedings of the fourteenth international conference on artificial intelligence and statistic.sJMLR Workshop and Conference Proceedings 29-37."},{"key":"e_1_3_2_1_16_1","volume-title":"IInnternational Conference on Machine Learning. PMLR","author":"Lee Holden","year":"2023","unstructured":"Holden Lee. 2023. Parallelising glauber dynamaircXs. iv preprint arXiv:2307.0713.1 Yaniv Leviathan, Matan Kalman, and Yossi Matias. 2023. Fast inference from transformers via speculative decoding. IInnternational Conference on Machine Learning. PMLR, 19274-19286."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384311"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519999"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Andrea Montanari. 2008. Estimating random variables from random sparse observationsE. uropean Transactions on Telecommunicati o1n9s 4 385-403.","DOI":"10.1002\/ett.1289"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Ketan Mulmuley Umesh V Vazirani and Vijay V Vazirani. 1987. Matching is as easy as matrix inversion. IPnroceedings of the nineteenth annual ACM symposium on Theory of computing 345-354.","DOI":"10.1145\/28395.383347"},{"key":"e_1_3_2_1_21_1","first-page":"373","volume-title":"SODA 2012","author":"Raghavendra Prasad","year":"2012","unstructured":"Prasad Raghavendra and Ning Tan. 2012. Approximating csps with global cardinality constraints using SDP hierarchiesP.rIonceedings of the TwentyhTird Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012. SIAM, 373-387."},{"key":"e_1_3_2_1_22_1","volume-title":"ntinuous martingales and Brownian mot.ion","author":"Revuz Daniel","unstructured":"Daniel Revuz and Marc Yor. 201C3o. ntinuous martingales and Brownian mot.ion Vol. 293. Springer Science & Business Media."},{"key":"e_1_3_2_1_23_1","volume-title":"Dorsa Sadigh, and Stefano Ermon.","year":"2022","unstructured":"2023. Parallel sampling of difusion modelasr. Xiv preprint arXiv:2305.1631.7 Andy Shih, Dorsa Sadigh, and Stefano Ermon. 2022. Training and inference on any-order autoregressive models the right wAadyv. ances in Neural Information Processing System, s35, 2762-2775."},{"key":"e_1_3_2_1_24_1","volume-title":"International Conference on Machine Lear n.iPnMgLR, 9791-9800","author":"Song Yang","year":"2021","unstructured":"Yang Song, Chenlin Meng, Renjie Liao, and Stefano Ermon. 2021. Accelerating feedforward computation via parallel nonlinear equation solving. In International Conference on Machine Lear n.iPnMgLR, 9791-9800."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Daniel \u0160tefankovi\u010d Santosh Vempala and Eric Vigoda. 2009. Adaptive simulated annealing: a near-optimal connection between sampling and counting.","DOI":"10.1145\/1516512.1516520"},{"key":"e_1_3_2_1_26_1","unstructured":"Journal of the ACM (JACM ) 56 3 1-36."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Shang-Hua Teng. 1995. Independent sets versus perfect matchingTheos. retical Computer Science 145 1-2 381-390.","DOI":"10.1016\/0304-3975(94)00289-U"},{"key":"e_1_3_2_1_28_1","volume-title":"IInnternational conference on machine lear.ning PMLR, 1747-1756","author":"Den Oord A\u00e4ron Van","year":"2016","unstructured":"A\u00e4ron Van Den Oord, Nal Kalchbrenner, and Koray Kavukcuoglu. 2016. Pixel recurrent neural networks. IInnternational conference on machine lear.ning PMLR, 1747-1756."},{"key":"e_1_3_2_1_29_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez \u0141ukasz Kaiser and Illia Polosukhin. 2017. Atention is all you need. Advances in neural information processing syste m30s."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"},{"key":"e_1_3_2_1_31_1","volume-title":"IInnternational Conference on Machine Lear n.ing PMLR, 10260-10269","author":"Wiggers Auke","year":"2020","unstructured":"Auke Wiggers and Emiel Hoogeboom. 2020. Predictive sampling with forecasting autoregressive models. IInnternational Conference on Machine Lear n.ing PMLR, 10260-10269."},{"key":"e_1_3_2_1_32_1","unstructured":"Zhilin Yang Zihang Dai Yiming Yang Jaime Carbonell Russ R Salakhutdinov and Quoc V Le. 2019. Xlnet: generalized autoregressive pretraining for language understandingA. dvances in neural information processing syste m32s."}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649744","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":32,"alternative-id":["10.1145\/3618260.3649744","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649744","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}