{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T16:14:40Z","timestamp":1769271280129,"version":"3.49.0"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Faculty Fellowship from the New York University Center for Data Science (NYU), and a Seed Grant Award from Apple"},{"name":"Eric and Wendy Schmidt Fund with the Institute for Advanced Study"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tit.2024.3475290","type":"journal-article","created":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T17:43:55Z","timestamp":1728323035000},"page":"90-113","source":"Crossref","is-referenced-by-count":4,"title":["Shifted Composition I: Harnack and Reverse Transport Inequalities"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7367-0097","authenticated-orcid":false,"given":"Jason M.","family":"Altschuler","sequence":"first","affiliation":[{"name":"Department of Statistics and Data Science, University of Pennsylvania, Philadelphia, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2701-0703","authenticated-orcid":false,"given":"Sinho","family":"Chewi","sequence":"additional","affiliation":[{"name":"Department of Statistics and Data Science, Yale University, New Haven, CT, USA"}]}],"member":"263","reference":[{"key":"ref1","first-page":"109","article-title":"The shifted composition rule","volume-title":"Proc. Int. Zurich Seminar Inf. Commun. (IZS)","author":"Altschuler"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00227-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s004400050137"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpur.2010.03.001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.bulsci.2005.10.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00056"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1561\/9781680835359"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2482978"},{"key":"ref9","first-page":"3788","article-title":"Privacy of noisy stochastic gradient descent: More iterations without more privacy loss","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Altschuler"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3653446"},{"key":"ref11","first-page":"2509","article-title":"Resolving the mixing time of the Langevin algorithm to its stationary distribution for log-concave sampling","volume-title":"Proc. Conf. Learn. Theory","volume":"195","author":"Altschuler"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1081\/PDE-100002243"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S0036141096303359"},{"key":"ref14","volume-title":"Gradient Flows in Metric Spaces and in the Space of Probability Measures","author":"Ambrosio","year":"2008"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport: Old and New","volume":"338","author":"Villani","year":"2009"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0005070"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOP600"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/058"},{"key":"ref21","first-page":"2984","article-title":"Improved analysis for a proximal algorithm for sampling","volume-title":"Proc. Conf. Learn. Theory","volume":"178","author":"Chen"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2017.08.015"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3150\/21-BEJ1346"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2009.07.001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1142\/8737"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2011.07.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.bulsci.2012.12.003"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10959-018-0830-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jde.2021.06.031"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/009117906000001204"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2007.12.047"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2009.01.007"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v14-1513"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00028-009-0032-8"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11118-009-9162-4"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1142\/S0219025711004353"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-7934-5","volume-title":"Harnack Inequal. for Stochastic Partial Differential Equations","author":"Wang","year":"2013"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpur.2012.10.007"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2017.05.006"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2018.12.012"},{"key":"ref41","article-title":"Log-Harnack inequality and Bismut formula for singular McKean\u2013Vlasov SDEs","author":"Huang","journal-title":"arXiv:2207.11536"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.3150\/10-BEJ308"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s11118-011-9231-3"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s11118-014-9451-4"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-015-0413-y"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1142\/9789814383585_0020"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31089-3"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOP875"},{"key":"ref49","article-title":"Shifted composition II: Shift Harnack inequalities and curvature upper bounds","author":"Altschuler","year":"2023","journal-title":"arXiv:2401.00071"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008641618547"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1214\/11-AIHP464"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11970-0_9"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1215\/00127094-2017-0048"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-024-01286-0"},{"key":"ref55","article-title":"Spectral monotonicity under Gaussian convolution","author":"Klartag","year":"2021","journal-title":"arXiv:2107.09496"},{"key":"ref56","first-page":"8092","article-title":"Rapid convergence of the unadjusted Langevin algorithm: isoperimetry suffices","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Vempala"},{"key":"ref57","volume-title":"Convex Analysis","volume":"11","author":"Rockafellar","year":"1997"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511802256"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.5802\/crmath.486"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/BF02399203"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/5464688"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1022677381"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-7824(01)01208-9"},{"issue":"1","key":"ref65","first-page":"183","article-title":"Logarithmic Sobolev inequalities: Conditions and counterexamples","volume":"46","author":"Wang","year":"2001","journal-title":"J. Operator Theory"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2017.03.015"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0157-1_3"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1093\/qjmath\/52.2.171"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024868720071"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1006\/jfan.2002.3968"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1155\/S0161171204210365"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-005-0021-3"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1214\/009117904000000531"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20828-2"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10816277\/10706129.pdf?arnumber=10706129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T07:42:57Z","timestamp":1735198977000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10706129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":74,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3475290","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}