{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:18:59Z","timestamp":1774678739545,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206725","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"454-459","source":"Crossref","is-referenced-by-count":9,"title":["Adaptive Greedy Rejection Sampling"],"prefix":"10.1109","author":[{"given":"Gergely","family":"Flamich","sequence":"first","affiliation":[{"name":"University of Cambridge,Cambridge,UK"}]},{"given":"Lucas","family":"Theis","sequence":"additional","affiliation":[{"name":"Google Research,London,UK"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034824"},{"key":"ref2","first-page":"21 308","article-title":"Algorithms for the communication of samples","volume-title":"International Conference on Machine Learning","author":"Theis"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.802612"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595216"},{"key":"ref5","article-title":"Minimal random code learning: Getting bits back from compressed model parameters","volume-title":"7th International Conference on Learning Representations, ICLR 2019","author":"Havasi"},{"key":"ref6","first-page":"16 131","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":"ref7","first-page":"12 367","article-title":"Universally quantized neural compression","volume":"33","author":"Agustsson","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref8","article-title":"Optimal compression of locally differentially private mechanisms","volume-title":"Artificial Intelligence and Statistics","author":"Shah","year":"2022"},{"key":"ref9","article-title":"Fast relative entropy coding with A* coding","volume-title":"International Conference on Machine Learning","author":"Flamich"},{"key":"ref10","article-title":"Lossy compression with Gaussian diffusion","author":"Theis","year":"2022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865570"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057034"},{"key":"ref13","author":"Bamler","year":"2022","journal-title":"Understanding entropy coding with asymmetric numeral systems (ANS): a statistician\u2019s perspective"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206725.pdf?arnumber=10206725","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:49Z","timestamp":1773347209000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206725\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206725","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}