{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T14:27:52Z","timestamp":1749997672560,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1715753"],"award-info":[{"award-number":["1715753"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2355"],"award-info":[{"award-number":["N00014-15-1-2355"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10994-021-06060-0","type":"journal-article","created":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T18:10:09Z","timestamp":1633111809000},"page":"3135-3155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Data driven conditional optimal transport"],"prefix":"10.1007","volume":"110","author":[{"given":"Esteban G.","family":"Tabak","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6368-6252","authenticated-orcid":false,"given":"Giulio","family":"Trigila","sequence":"additional","affiliation":[]},{"given":"Wenjun","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,1]]},"reference":[{"key":"6060_CR1","unstructured":"Beck, J., & Daley, M. (1993). Art restoration: The culture, the business and the scandal. John Murray."},{"issue":"1","key":"6060_CR2","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1214\/09-AOAS285","volume":"4","author":"HA Chipman","year":"2010","unstructured":"Chipman, H. A., George, E. I., McCulloch, R. E., et al. (2010). Bart: Bayesian additive regression trees. The Annals of Applied Statistics, 4(1), 266\u2013298.","journal-title":"The Annals of Applied Statistics"},{"key":"6060_CR3","unstructured":"Cover, T.\u00a0M., & Thomas, J. \u00a0A. (2012). Elements of information theory. Wiley."},{"key":"6060_CR4","unstructured":"Dinh, L., Sohl-Dickstein, J., & Bengio, S. (2016). Density estimation using real nvp. arXiv preprint arXiv:1605.08803."},{"issue":"1","key":"6060_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.3160280102","volume":"28","author":"MD Donsker","year":"1975","unstructured":"Donsker, M. D., & Varadhan, S. R. S. (1975). Asymptotic evaluation of certain Markov process expectations for large time, I. Communications on Pure and Applied Mathematics, 28(1), 1\u201347.","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"6060_CR6","unstructured":"Essid, M., Tabak, E.\u00a0G., & Trigila, G. (2019). An implicit gradient-descent procedure for minimax problems. Submitted to Machine Learning."},{"key":"6060_CR7","unstructured":"Finlay, C., Jacobsen, J.-H., Nurbekyan, L., & Oberman, A. (2020). How to train your neural ode: The world of Jacobian and kinetic regularization. In International conference on machine learning (pp. 3154\u20133164). PMLR."},{"key":"6060_CR8","doi-asserted-by":"crossref","unstructured":"Grover, A., Dhar, M., & Ermon, S. (2017). Flow-gan: Combining maximum likelihood and adversarial learning in generative models. arXiv preprint arXiv:1705.08868.","DOI":"10.1609\/aaai.v32i1.11829"},{"key":"6060_CR9","unstructured":"Hahn, P. R., Dorie, V., & Murray, J. S. (2019). Atlantic causal inference conference (acic) data analysis challenge 2017. arXiv preprint arXiv:1905.09515."},{"key":"6060_CR200","unstructured":"Nowozin, S., Botond C., & Ryota T (2016). f-gan: Training generative neural samplers using variational divergence minimization. In: Proceedings of the 30th international conference on neural information processing systems (pp. 271\u2013279)."},{"key":"6060_CR10","unstructured":"Oliva, J. B., Dubey, A., Zaheer, M., Poczos, B., Salakhutdinov, R., Xing, E. P., & Schneider, J. (2018). Transformation autoregressive networks. arXiv preprint arXiv:1801.09819."},{"issue":"11","key":"6060_CR11","doi-asserted-by":"publisher","first-page":"3073","DOI":"10.1109\/TIP.2011.2142318","volume":"20","author":"J Rabin","year":"2011","unstructured":"Rabin, J., Delon, J., & Gousseau, Y. (2011). Removing artefacts from color and contrast modifications. IEEE Transactions on Image Processing, 20(11), 3073\u20133085.","journal-title":"IEEE Transactions on Image Processing"},{"key":"6060_CR12","doi-asserted-by":"crossref","unstructured":"Rabin, J., Ferradans, S., & Papadakis, N. (2014). Adaptive color transfer with relaxed optimal transport. In 2014 IEEE international conference on image processing (ICIP) (pp. 4852\u20134856). IEEE.","DOI":"10.1109\/ICIP.2014.7025983"},{"key":"6060_CR13","unstructured":"Rezende, D. J., & Mohamed, S. (2015). Variational inference with normalizing flows. arXiv preprint arXiv:1505.05770."},{"key":"6060_CR14","unstructured":"Tabak, E. G., & Turner, C. V. (2013). A family of non-parametric density estimation algorithms. In CPAM, LXVI."},{"key":"6060_CR15","doi-asserted-by":"crossref","unstructured":"Tabak, E. G., & Vanden-Eijnden, E. (2010). Density estimation by dual ascent of the log-likelihood. Communications of the Mathematical Science, 8.","DOI":"10.4310\/CMS.2010.v8.n1.a11"},{"key":"6060_CR16","unstructured":"Tai, Y.-W., Jia, J., & Tang, C.-K. (2005). Local color transfer via probabilistic segmentation by expectation-maximization. In 2005 IEEE computer society conference on computer vision and pattern recognition (CVPR\u201905) (Vol. 1, pp. 747\u2013754). IEEE."},{"key":"6060_CR17","doi-asserted-by":"crossref","unstructured":"Trigila, G., & Tabak, E. G. (2016). Data-driven optimal transport. Communications on Pure and Applied Mathematics, 69(4), 613\u2013648.","DOI":"10.1002\/cpa.21588"},{"key":"6060_CR18","doi-asserted-by":"crossref","unstructured":"Villani, C. (2003). Topics in optimal transportation. Number\u00a058. American Mathematical Soc.","DOI":"10.1090\/gsm\/058"},{"key":"6060_CR19","unstructured":"Yang, H., & Tabak, E.\u00a0G. (2019). Conditional density estimation, latent variable discovery and optimal transport. arXiv preprint arXiv:1910.14090."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06060-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06060-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06060-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T02:07:42Z","timestamp":1664590062000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06060-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,1]]},"references-count":20,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["6060"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06060-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2021,10,1]]},"assertion":[{"value":"10 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}