{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:31:20Z","timestamp":1768314680300,"version":"3.49.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T00:00:00Z","timestamp":1765238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T00:00:00Z","timestamp":1765238400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006961","name":"California Institute of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006961","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,9]]},"DOI":"10.1109\/cdc57313.2025.11312926","type":"proceedings-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T18:19:56Z","timestamp":1768241996000},"page":"2210-2217","source":"Crossref","is-referenced-by-count":0,"title":["Computing Optimal Transport Plans via Min-Max Gradient Flows"],"prefix":"10.1109","author":[{"given":"Lauren","family":"Conger","sequence":"first","affiliation":[{"name":"California Institute of Technology,Computing and Mathematical Sciences,Pasadena,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franca","family":"Hoffmann","sequence":"additional","affiliation":[{"name":"California Institute of Technology,Computing and Mathematical Sciences,Pasadena,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Baptista","sequence":"additional","affiliation":[{"name":"California Institute of Technology,Computing and Mathematical Sciences,Pasadena,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Mazumdar","sequence":"additional","affiliation":[{"name":"California Institute of Technology,Computing and Mathematical Sciences,Pasadena,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2023.116385"},{"key":"ref2","article-title":"Approximating the Optimal Transport Plan via Particle-Evolving Method","author":"Liu","year":"2021"},{"key":"ref3","article-title":"Coupled Wasserstein Gradient Flows for Min-Max and Cooperative Games","author":"Conger","year":"2024"},{"key":"ref4","article-title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transport","volume":"26","author":"Cuturi","year":"2013","journal-title":"NeurIPS"},{"key":"ref5","article-title":"Near-linear time approximation algorithms for optimal transport via sinkhorn iteration","volume":"30","author":"Altschuler","year":"2017","journal-title":"NeurIPS"},{"issue":"247","key":"ref6","first-page":"1","article-title":"Importance sparsification for sinkhorn algorithm","volume":"24","author":"Li","year":"2023","journal-title":"Journal of Machine Learning Research"},{"key":"ref7","first-page":"4186","article-title":"Sinkhorn Flow as Mirror Flow: A Continuous-Time Framework for Generalizing the Sinkhorn Algorithm","author":"Karimi","year":"2024","journal-title":"AISTATS"},{"key":"ref8","article-title":"Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithm","author":"Deb","year":"2023"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-025-02242-z"},{"key":"ref10","first-page":"1","article-title":"Large-scale optimal transport and mapping estimation","author":"Seguy","year":"2018","journal-title":"ICLR"},{"key":"ref11","article-title":"Wasserstein-2 generative networks","author":"Korotin","year":"2020","journal-title":"ICLR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/130920058"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-017-0599-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-021-09503-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1193-5"},{"key":"ref16","volume-title":"Optimal transport, old and new","author":"Villani","year":"2007"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-022-01148-7"},{"key":"ref18","volume-title":"Gradient Flows in Metric Spaces and in the Space of Probability Measures","author":"Ambrosio","year":"2008"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198507840.001.0001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S0040585X97T989738"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-93-86279-38-5_6"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/9781009414319"}],"event":{"name":"2025 IEEE 64th Conference on Decision and Control (CDC)","location":"Rio de Janeiro, Brazil","start":{"date-parts":[[2025,12,9]]},"end":{"date-parts":[[2025,12,12]]}},"container-title":["2025 IEEE 64th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11311984\/11311968\/11312926.pdf?arnumber=11312926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T09:02:25Z","timestamp":1768294945000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11312926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/cdc57313.2025.11312926","relation":{},"subject":[],"published":{"date-parts":[[2025,12,9]]}}}