{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:35:21Z","timestamp":1763202921385,"version":"3.29.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T00:00:00Z","timestamp":1727136000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T00:00:00Z","timestamp":1727136000000},"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":[[2024,9,24]]},"DOI":"10.1109\/allerton63246.2024.10735319","type":"proceedings-article","created":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T18:31:52Z","timestamp":1730745112000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Differentially Private Sinkhorn Algorithm"],"prefix":"10.1109","author":[{"given":"Jiaqi","family":"Wang","sequence":"first","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziv","family":"Goldfeld","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"volume-title":"Optimal Transport: Old and New","year":"2008","author":"Villani","key":"ref1"},{"key":"ref2","first-page":"214","article-title":"Wasserstein generative adversarial networks","volume-title":"Proceedings of the 34th International Conference on Machine Learning","author":"Arjovsky","year":"2017"},{"key":"ref3","article-title":"Joint distribution optimal transportation for domain adaptation","volume":"30","author":"Courty","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/15-aos1401"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/21-AOS2136"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0036141096303359"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0583-7"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1561\/9781680835519","volume-title":"Computational Optimal Transport: With Applications to Data Science","author":"Peyr\u00e9","year":"2019"},{"key":"ref9","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume":"26","author":"Cuturi","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref10","first-page":"1574","article-title":"Sample complexity of sinkhorn divergences","volume-title":"The 22nd international conference on artificial intelligence and statistics","author":"Genevay","year":"2019"},{"key":"ref11","article-title":"Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem","volume":"32","author":"Mena","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/16m1080173"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch185"},{"issue":"2","key":"ref15","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1137\/21M1410634","article-title":"On the linear convergence of the multi-marginal Sinkhorn algorithm","volume":"32","author":"Carlier","year":"2022","journal-title":"SIAM Journal on Optimization"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/csf.2017.11"},{"volume-title":"An explicit analysis of the entropic penalty in linear programming","year":"2018","author":"Weed","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/21m145505x"},{"key":"ref19","first-page":"612","volume-title":"Privately Solving Linear Programs","author":"Hsu","year":"2014"},{"key":"ref20","article-title":"Private optimization without constraint violations","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Medina","year":"2020"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch185"},{"key":"ref22","first-page":"464","volume-title":"Private empirical risk minimization: Efficient algorithms and tight error bounds","author":"Bassily","year":"2014"},{"key":"ref23","first-page":"1948","article-title":"Private convex optimization via exponential mechanism","volume-title":"Proceedings of Thirty Fifth Conference on Learning Theory","volume":"178","author":"Gopi","year":"2022"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.14649"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/395"},{"key":"ref26","first-page":"8810","article-title":"Differentially private sliced wasserstein distance","volume-title":"Proceedings of Machine Learning Research","volume":"139","author":"Rakotomamonjy","year":"2021"},{"key":"ref27","first-page":"12 480","article-title":"Don\u2019t generate me: Training differentially private generative models with sinkhorn divergence","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Cao","year":"2021"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.1109\/GLOBECOM48099.2022.10001511","volume-title":"Differentially private admm-based distributed discrete optimal transport for resource allocation","author":"Hughes","year":"2022"},{"volume-title":"An algorithmic foundation for fair, secure, and differentially private distributed discrete optimal transport","year":"2021","author":"Hughes","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/16m1106018"},{"key":"ref31","article-title":"An optimal transport approach for the schr\u00f6dinger bridge problem and convergence of sinkhorn algorithm","volume":"85","author":"Marino","year":"2019","journal-title":"Journal of Scientific Computing"},{"issue":"71","key":"ref32","first-page":"2489","article-title":"Beyond the regret minimization barrier: Optimal algorithms for stochastic strongly-convex optimization","volume":"15","author":"Hazan","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/csf.2017.11"}],"event":{"name":"2024 60th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2024,9,24]]},"location":"Urbana, IL, USA","end":{"date-parts":[[2024,9,27]]}},"container-title":["2024 60th Annual Allerton Conference on Communication, Control, and Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10735178\/10735179\/10735319.pdf?arnumber=10735319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T04:00:50Z","timestamp":1732680050000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10735319\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,24]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/allerton63246.2024.10735319","relation":{},"subject":[],"published":{"date-parts":[[2024,9,24]]}}}