{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:32:05Z","timestamp":1761294725698,"version":"3.37.3"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2213223"],"award-info":[{"award-number":["CCF-2213223"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/jsait.2024.3387463","type":"journal-article","created":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T17:32:20Z","timestamp":1713288740000},"page":"221-235","source":"Crossref","is-referenced-by-count":3,"title":["Training Generative Models From Privatized Data via Entropic Optimal Transport"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2161-0595","authenticated-orcid":false,"given":"Daria","family":"Reshetova","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7355-9487","authenticated-orcid":false,"given":"Wei-Ning","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Stanford University, Stanford, CA, USA"}]},{"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"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3588432.3591500"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/genetics\/iyad063"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01565"},{"key":"ref6","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. 26th Int. Conf. Neural Inf. Process. Syst.","volume":"26","author":"Cuturi"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517791"},{"key":"ref8","first-page":"4541","article-title":"Statistical bounds for entropic optimal transport: Sample complexity and the central limit theorem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Mena"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991375"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref11","first-page":"1","article-title":"Practical locally private heavy hitters","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Bassily"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3344722"},{"key":"ref13","first-page":"1028","article-title":"Breaking the dimension dependence in sparse distribution estimation under communication constraints","volume-title":"Proc. 34th Annu. Conf. Learn. Theory","author":"Chen"},{"key":"ref14","first-page":"3312","article-title":"Breaking the communication-privacy-accuracy trilemma","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Chen"},{"key":"ref15","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Suresh"},{"key":"ref16","article-title":"Protection against reconstruction and its applications in private federated learning","author":"Bhowmick","year":"2018","journal-title":"arXiv:1812.00984"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437818"},{"key":"ref18","first-page":"12673","article-title":"GS-WGAN: A gradient-sanitized approach for learning differentially private generators","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Chen"},{"key":"ref19","first-page":"12480","article-title":"Don\u2019t generate me: Training differentially private generative models with sinkhorn divergence","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Cao"},{"key":"ref20","article-title":"Differentially private generative adversarial network","author":"Xie","year":"2018","journal-title":"arXiv:1802.06739"},{"key":"ref21","article-title":"Differentially private releasing via deep generative model","volume-title":"arXiv:1801.01594","author":"Zhang","year":"2018"},{"key":"ref22","article-title":"Towards principled methods for training generative adversarial networks","author":"Arjovsky","year":"2017","journal-title":"arXiv:1701.04862"},{"key":"ref23","first-page":"3481","article-title":"Which training methods for GANs do actually converge?","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mescheder"},{"key":"ref24","article-title":"Learning to noise: Application-agnostic data sharing with local differential privacy","author":"Mansbridge","year":"2020","journal-title":"arXiv:2010.12464"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"ref26","first-page":"1574","article-title":"Sample complexity of sinkhorn divergences","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Stat.","author":"Genevay"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref29","first-page":"214","article-title":"Wasserstein generative adversarial networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Arjovsky"},{"key":"ref30","article-title":"Wasserstein-2 generative networks","author":"Korotin","year":"2019","journal-title":"arXiv:1909.13082"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2018.10.010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975480"},{"key":"ref33","article-title":"Minimum intrinsic dimension scaling for entropic optimal transport","author":"Stromme","year":"2023","journal-title":"arXiv:2306.03398"},{"key":"ref34","article-title":"Generalization properties of optimal transport GANs with latent distribution learning","author":"Luise","year":"2020","journal-title":"arXiv:2007.14641"},{"key":"ref35","first-page":"1608","article-title":"Learning generative models with sinkhorn divergences","volume-title":"Proc. Int. Conf. Artif. Intell. Stati.","author":"Genevay"},{"issue":"78","key":"ref36","first-page":"1","article-title":"POT: Python optimal transport","volume":"22","author":"Flamary","year":"2021","journal-title":"J. Mach. Learn. Res."},{"journal-title":"The MNIST database of handwritten digits","year":"1998","author":"LeCun","key":"ref37"},{"key":"ref38","article-title":"Unsupervised representation learning with deep convolutional generative adversarial networks","author":"Radford","year":"2015","journal-title":"arXiv:1511.06434"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch181"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-12-374370-1.x0001-8"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00223"},{"key":"ref42","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref43","article-title":"Fashion-MNIST: A novel image dataset for benchmarking machine learning algorithms","author":"Xiao","year":"2017","journal-title":"arXiv:1708.07747"},{"key":"ref44","first-page":"5769","article-title":"Improved training of Wasserstein GANs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Gulrajani"},{"key":"ref45","article-title":"Private GANs, revisited","author":"Bie","year":"2023","journal-title":"arXiv:2302.02936"},{"key":"ref46","first-page":"6629","article-title":"GANs trained by a two time-scale update rule converge to a local nash equilibrium","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Heusel"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996454"},{"key":"ref48","article-title":"Entropic estimation of optimal transport maps","author":"Pooladian","year":"2021","journal-title":"arXiv:2109.12004"},{"volume-title":"Foundations of Machine Learning","year":"2018","author":"Mohri","key":"ref49"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1909.0016"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10461668\/10500703.pdf?arnumber=10500703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:06:03Z","timestamp":1736543163000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10500703\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/jsait.2024.3387463","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2024]]}}}