{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T20:44:12Z","timestamp":1783802652469,"version":"3.55.0"},"reference-count":136,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62350069"],"award-info":[{"award-number":["62350069"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62141101"],"award-info":[{"award-number":["62141101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Commun."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/jsac.2025.3560359","type":"journal-article","created":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T13:37:32Z","timestamp":1744724252000},"page":"2333-2348","source":"Crossref","is-referenced-by-count":14,"title":["Information Compression in the AI Era: Recent Advances and Future Challenges"],"prefix":"10.1109","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8084-9332","authenticated-orcid":false,"given":"Jun","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3345-8259","authenticated-orcid":false,"given":"Yong","family":"Fang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Chang’an University, Xi’an, Shaanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2331-8965","authenticated-orcid":false,"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4455-4692","authenticated-orcid":false,"given":"Ayfer","family":"\u00d6zg\u00fcr","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2234-929X","authenticated-orcid":false,"given":"Nir","family":"Shlezinger","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Be’er Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.720552"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2562008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120166"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173943"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865570"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620434"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/QoMEX51781.2021.9465445"},{"key":"ref9","first-page":"675","article-title":"Rethinking lossy compression: The rate-distortion-perception tradeoff","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Blau"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.02138"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CISS59072.2024.10480175"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3393429"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3223408"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4324\/9781315080918-3"},{"key":"ref15","first-page":"14014","article-title":"Lossy compression for lossless prediction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Dubois"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/0600000107"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2021.3125282"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413943"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.720541"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3221976"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2935864"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3269911"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056251"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054469"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849346"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3095726"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/9781108966351"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/49.761034"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1561\/2000000113"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.256489"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22297-0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173899"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.508838"},{"issue":"5","key":"ref36","first-page":"355","article-title":"Quantization and dither: A theoretical survey","volume":"40","author":"Lipshitz","year":"1992","journal-title":"J. Audio Eng. Soc."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/19.492748"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1561\/0100000018"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953329"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2572307"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2700857"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2450721"},{"key":"ref43","first-page":"11517","article-title":"Universal rate-distortion-perception representations for lossy compression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref44","first-page":"25661","article-title":"A theory of the distortion-perception tradeoff in Wasserstein space","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Freirich"},{"key":"ref45","first-page":"24911","article-title":"Optimally controllable perceptual lossy compression","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yan"},{"key":"ref46","first-page":"11682","article-title":"On perceptual lossy compression: The cost of perceptual reconstruction and an optimal training framework","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yan"},{"key":"ref47","article-title":"A coding theorem for the rate-distortion-perception function","author":"Theis","year":"2021","journal-title":"arXiv:2104.13662"},{"key":"ref48","article-title":"Channel-aware optimal transport: A theoretical framework for generative communication","author":"Qu","year":"2024","journal-title":"arXiv:2412.19025"},{"key":"ref49","article-title":"The rate-distortion-perception tradeoff: The role of common randomness","author":"Wagner","year":"2022","journal-title":"arXiv:2202.04147"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3231820"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206646"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CISS59072.2024.10480168"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3509420"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3467282"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3462688"},{"key":"ref56","article-title":"Gaussian rate-distortion-perception coding and entropy-constrained scalar quantization","author":"Xie","year":"2024","journal-title":"arXiv:2409.02388"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00068"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619317"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426691"},{"key":"ref61","first-page":"2726","article-title":"On communication cost of distributed statistical estimation and dimensionality","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Garg"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref63","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Suresh"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3108952"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437818"},{"issue":"236","key":"ref66","first-page":"1","article-title":"Lower bounds for learning distributions under communication constraints via Fisher information","volume":"21","author":"Barnes","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref67","first-page":"1","article-title":"Unified lower bounds for interactive high-dimensional estimation under information constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Acharya"},{"key":"ref68","article-title":"Learning differentially private recurrent language models","author":"Brendan McMahan","year":"2017","journal-title":"arXiv:1710.06963"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref70","first-page":"1","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Alistarh"},{"key":"ref71","first-page":"560","article-title":"SignSGD: Compressed optimisation for non-convex problems","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","volume":"80","author":"Bernstein"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1045"},{"key":"ref73","article-title":"Deep gradient compression: Reducing the communication bandwidth for distributed training","author":"Lin","year":"2017","journal-title":"arXiv:1712.01887"},{"key":"ref74","first-page":"1","article-title":"Gradient sparsification for communication-efficient distributed optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Wangni"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3042094"},{"key":"ref76","first-page":"8253","article-title":"FetchSGD: Communication-efficient federated learning with sketching","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rothchild"},{"key":"ref77","article-title":"Minimal random code learning: Getting bits back from compressed model parameters","author":"Havasi","year":"2018","journal-title":"arXiv:1810.00440"},{"key":"ref78","article-title":"LoRA: Low-rank adaptation of large language models","author":"Hu","year":"2021","journal-title":"arXiv:2106.09685"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3218772"},{"key":"ref80","first-page":"3208","article-title":"Lossless compression of efficient private local randomizers","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Feldman"},{"key":"ref81","first-page":"7680","article-title":"Optimal compression of locally differentially private mechanisms","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Shah"},{"key":"ref82","first-page":"69202","article-title":"Privacy amplification via compression: Achieving the optimal privacy-accuracy-communication trade-off in distributed mean estimation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Chen"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3244092"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3229947"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036955"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2019.8918798"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2020.3034501"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.3390\/e23010104"},{"key":"ref89","first-page":"1141","article-title":"Soft-to-hard vector quantization for end-to-end learning compressible representations","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Agustsson"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2025.3546458"},{"key":"ref91","first-page":"6309","article-title":"Neural discrete representation learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"van den Oord"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSPW59220.2023.10193526"},{"key":"ref93","article-title":"Variable rate image compression with recurrent neural networks","author":"Toderici","year":"2015","journal-title":"arXiv:1511.06085"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3221998"},{"key":"ref95","first-page":"1","article-title":"End-to-end optimized image compression","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Ball\u00e9"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/dcc.2000.838192"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.4324\/9780080479538"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1117\/12.2569255"},{"key":"ref99","first-page":"5929","article-title":"Deep generative models for distribution-preserving lossy compression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Tschannen"},{"key":"ref100","first-page":"48226","article-title":"On the choice of perception loss function for learned video compression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Salehkalaibar"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW50498.2020.00092"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19809-0_32"},{"key":"ref103","first-page":"1","article-title":"Transformer-based transform coding","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhu"},{"key":"ref104","first-page":"13091","article-title":"VCT: A video compression transformer","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"35","author":"Mentzer"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/MBITS.2023.3339111"},{"key":"ref106","first-page":"1","article-title":"Text+sketch: Image compression at ultra low rates","volume-title":"Proc. ICML Workshop Neural Compress., Inf. Theory Appl.","author":"Lei"},{"key":"ref107","first-page":"1","article-title":"Towards image compression with perfect realism at ultra-low bitrates","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Careil"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055912"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1147\/rd.232.0149"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/40.2_and_3.67"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/26.61469"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2002.999958"},{"key":"ref116","first-page":"1","article-title":"A block-sorting lossless data compression algorithm","volume-title":"SRS Res. Rep.","volume":"124","author":"Burrows","year":"1994"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref119","article-title":"LLMZip: Lossless text compression using large language models","author":"Valmeekam","year":"2023","journal-title":"arXiv:2306.04050"},{"key":"ref120","article-title":"Language modeling is compression","author":"Del\u00e9tang","year":"2023","journal-title":"arXiv:2309.10668"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511987"},{"key":"ref122","article-title":"Attention with Markov: A framework for principled analysis of transformers via Markov chains","author":"Makkuva","year":"2024","journal-title":"arXiv:2402.04161"},{"key":"ref123","article-title":"Local to global: Learning dynamics and effect of initialization for transformers","author":"Makkuva","year":"2024","journal-title":"arXiv:2406.03072"},{"key":"ref124","article-title":"The evolution of statistical induction heads: In-context learning Markov chains","author":"Edelman","year":"2024","journal-title":"arXiv:2402.11004"},{"key":"ref125","article-title":"Transformers learn variable-order Markov chains in-context","author":"Zhou","year":"2024","journal-title":"arXiv:2410.05493"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12511"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2019.2919300"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2987203"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3090048"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2023.3288243"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3191354"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3218802"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2023.3247480"},{"key":"ref134","first-page":"1","article-title":"Lossy compression with distribution shift as entropy constrained optimal transport","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Liu"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747823"},{"key":"ref136","first-page":"1387","article-title":"Importance matching lemma for lossy compression with side information","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Phan"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/49\/11039749\/10964264.pdf?arnumber=10964264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T18:46:04Z","timestamp":1763491564000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10964264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":136,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2025.3560359","relation":{},"ISSN":["1558-0008","0733-8716"],"issn-type":[{"value":"1558-0008","type":"electronic"},{"value":"0733-8716","type":"print"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}