{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:19:02Z","timestamp":1774678742566,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council (EPSRC)","doi-asserted-by":"publisher","award":["EP\/V52024X\/1"],"award-info":[{"award-number":["EP\/V52024X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit-w61686.2024.10591765","type":"proceedings-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T17:31:04Z","timestamp":1721669464000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Some Notes on the Sample Complexity of Approximate Channel Simulation"],"prefix":"10.1109","author":[{"given":"Gergely","family":"Flamich","sequence":"first","affiliation":[{"name":"University of Cambridge,Cambridge,UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lennie","family":"Wells","sequence":"additional","affiliation":[{"name":"University of Cambridge,Cambridge,UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Universally quantized neural compression","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Agustsson","year":"2020"},{"key":"ref2","first-page":"6548","article-title":"Fast relative entropy coding with A* coding","volume-title":"International Conference on Machine Learning","author":"Flamich","year":"2022"},{"key":"ref3","article-title":"Minimal random code learning: Getting bits back from compressed model parameters","volume-title":"International Conference on Learning Representations","author":"Havasi","year":"2018"},{"key":"ref4","first-page":"16131","article-title":"Compressing images by encoding their latent representations with relative entropy coding","volume":"33","author":"Flamich","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref5","article-title":"Compression with bayesian implicit neural representations","volume-title":"Advances in Neural Information Processing Systems","author":"Guo","year":"2023"},{"key":"ref6","article-title":"Recombiner: Robust and enhanced compression with bayesian implicit neural representations","volume-title":"International Conference on Learning Representations","author":"He","year":"2024"},{"key":"ref7","article-title":"On the advantages of stochastic encoders","volume-title":"Neural Compression Workshop at ICLR","author":"Theis","year":"2021"},{"key":"ref8","article-title":"Lossy compression with Gaussian diffusion","author":"Theis","year":"2022","journal-title":"arXiv"},{"key":"ref9","first-page":"7680","article-title":"Optimal compression of locally differentially private mechanisms","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Shah","year":"2022"},{"key":"ref10","article-title":"On channel simulation with causal rejection samplers","author":"Goc","year":"2024","journal-title":"arXiv"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/17-AAP1326"},{"key":"ref12","article-title":"The sample complexity of approximate rejection sampling with applications to smoothed online learning","author":"Block","year":"2023","journal-title":"arXiv preprint"},{"key":"ref13","article-title":"Algorithms for the communication of samples","volume-title":"International Conference on Machine Learning","author":"Theis","year":"2022"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058842"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865570"},{"key":"ref16","article-title":"A* sampling","volume":"27","author":"Maddison","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/10761.003.0008"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40020-9_25"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00652"},{"key":"ref20","article-title":"What makes an image realistic?","author":"Theis","year":"2024","journal-title":"arXiv preprint"},{"key":"ref21","article-title":"High-fidelity generative image compression","volume-title":"Advances in Neural Information Processing Systems","author":"Mentzer","year":"2020"},{"key":"ref22","first-page":"703","article-title":"Restricted boltzmann machines are hard to approximately evaluate or simulate","volume-title":"Proceedings of the 27th International Conference on International Conference on Machine Learning, ICML10, (Madison, WI, USA)","author":"Long","year":"2010"},{"key":"ref23","first-page":"36","article-title":"Various techniques used in connection with random digits","author":"von Neumann","year":"1951","journal-title":"Notes by GE Forsythe"},{"key":"ref24","article-title":"Greedy poisson rejection sampling","volume-title":"Advances in Neural Information Processing Systems","author":"Flamich","year":"2023"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206725"},{"key":"ref26","article-title":"Greedy rejection coding","volume-title":"Advances in Neural Information Processing Systems","author":"Flamich","year":"2023"}],"event":{"name":"2024 IEEE International Symposium on Information Theory Workshops (ISIT-W)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,7]]}},"container-title":["2024 IEEE International Symposium on Information Theory Workshops (ISIT-W)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10591732\/10591733\/10591765.pdf?arnumber=10591765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T04:35:28Z","timestamp":1721709328000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10591765\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit-w61686.2024.10591765","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}