{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:59:46Z","timestamp":1764277186112,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10994-023-06350-9","type":"journal-article","created":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T19:01:16Z","timestamp":1687892476000},"page":"2845-2869","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mirror variational transport: a particle-based algorithm for distributional optimization on constrained domains"],"prefix":"10.1007","volume":"112","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0380-4197","authenticated-orcid":false,"given":"Dai Hai","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Sakurai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,27]]},"reference":[{"key":"6350_CR1","first-page":"28405","volume":"34","author":"K Ahn","year":"2021","unstructured":"Ahn, K., & Chewi, S. (2021). Efficient constrained sampling via the mirror-Langevin algorithm. Advances in Neural Information Processing Systems, 34, 28405\u201328418.","journal-title":"Advances in Neural Information Processing Systems"},{"unstructured":"Arjovsky, M., Chintala, S., & Bottou, L. (2017). Wasserstein generative adversarial networks. In International conference on machine learning (pp. 214\u2013223). PMLR.","key":"6350_CR2"},{"issue":"3","key":"6350_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., & Teboulle, M. (2003). Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3), 167\u2013175.","journal-title":"Operations Research Letters"},{"doi-asserted-by":"crossref","unstructured":"Bowman, S.\u00a0R., Vilnis, L., Vinyals, O., Dai, A.\u00a0M., Jozefowicz, R., & Bengio, S. (2015). Generating sentences from a continuous space. arXiv preprint arXiv:1511.06349","key":"6350_CR4","DOI":"10.18653\/v1\/K16-1002"},{"unstructured":"Cheng, X., & Bartlett, P. (2018). Convergence of Langevin MCMC in KL-divergence. In Algorithmic learning theory (pp. 186\u2013211). PMLR.","key":"6350_CR5"},{"unstructured":"Cuturi, M. (2013). Sinkhorn distances: Lightspeed computation of optimal transport. Advances in Neural Information Processing Systems, 26.","key":"6350_CR6"},{"doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008). Efficient projections onto the l 1-ball for learning in high dimensions. In Proceedings of the 25th international conference on Machine learning (pp. 272\u2013279).","key":"6350_CR7","DOI":"10.1145\/1390156.1390191"},{"issue":"1","key":"6350_CR8","first-page":"723","volume":"13","author":"A Gretton","year":"2012","unstructured":"Gretton, A., Borgwardt, K. M., Rasch, M. J., Sch\u00f6lkopf, B., & Smola, A. (2012). A kernel two-sample test. The Journal of Machine Learning Research, 13(1), 723\u2013773.","journal-title":"The Journal of Machine Learning Research"},{"issue":"8","key":"6350_CR9","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., & Schmidhuber, J. (1997). Long short-term memory. Neural Computation, 9(8), 1735\u20131780.","journal-title":"Neural Computation"},{"unstructured":"Hsieh, Y.-P., Kavis, A., Rolland, P., & Cevher, V. (2018). Mirrored Langevin dynamics. Advances in Neural Information Processing Systems, 31.","key":"6350_CR10"},{"key":"6350_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107514","volume":"107","author":"W Joo","year":"2020","unstructured":"Joo, W., Lee, W., Park, S., & Moon, I.-C. (2020). Dirichlet variational autoencoder. Pattern Recognition, 107, 107514.","journal-title":"Pattern Recognition"},{"unstructured":"Kingma, D.\u00a0P., & Welling, M. (2013) Auto-encoding variational Bayes. arXiv preprint arXiv:1312.6114","key":"6350_CR12"},{"doi-asserted-by":"crossref","unstructured":"Koziel, S., & Michalewicz, Z. (1998). A decoder-based evolutionary algorithm for constrained parameter optimization problems. In Parallel problem solving from nature-PPSN V: 5th International conference Amsterdam, 1998 Proceedings (Vol. 5, pp. 231\u2013240). Springer.","key":"6350_CR13","DOI":"10.1007\/BFb0056866"},{"unstructured":"Liu, L., Zhang, Y., Yang, Z., Babanezhad, R., & Wang, Z. (2021). Infinite-dimensional optimization for zero-sum games via variational transport. In International conference on machine learning (pp. 7033\u20137044). PMLR.","key":"6350_CR14"},{"unstructured":"Liu, Q., & Wang, D. (2016). Stein variational gradient descent: A general purpose Bayesian inference algorithm. Advances in Neural Information Processing Systems, 29.","key":"6350_CR15"},{"unstructured":"Ma, Y.-A., Chen, T., & Fox, E. (2015). A complete recipe for stochastic gradient MCMC. Advances in Neural Information Processing Systems, 28.","key":"6350_CR16"},{"issue":"1","key":"6350_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z., & Schoenauer, M. (1996). Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1), 1\u201332.","journal-title":"Evolutionary Computation"},{"key":"6350_CR18","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1007\/s10994-021-05991-y","volume":"110","author":"DH Nguyen","year":"2021","unstructured":"Nguyen, D. H., Nguyen, C. H., & Mamitsuka, H. (2021). Learning subtree pattern importance for Weisfeiler\u2013Lehman based graph kernels. Machine Learning, 110, 1585\u20131607.","journal-title":"Machine Learning"},{"doi-asserted-by":"crossref","unstructured":"Nguyen, D.\u00a0H., & Tsuda, K. (2023). On a linear fused Gromov\u2013Wasserstein distance for graph structured data. Pattern Recognition (p. 109351).","key":"6350_CR19","DOI":"10.1016\/j.patcog.2023.109351"},{"unstructured":"Rosasco, L., Belkin, M., & De Vito, E. (2009). A note on learning with integral operators. In COLT. Citeseer.","key":"6350_CR20"},{"issue":"1","key":"6350_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s13373-017-0101-1","volume":"7","author":"F Santambrogio","year":"2017","unstructured":"Santambrogio, F. (2017). $$\\{$$Euclidean, metric, and Wasserstein$$\\}$$ gradient flows: An overview. Bulletin of Mathematical Sciences, 7(1), 87\u2013154.","journal-title":"Bulletin of Mathematical Sciences"},{"unstructured":"Shi, J., Liu, C., & Mackey, L. (2021). Sampling with mirrored stein operators. arXiv preprint arXiv:2106.12506","key":"6350_CR22"},{"doi-asserted-by":"crossref","unstructured":"Villani, C. et\u00a0al. (2009). Optimal transport: Old and new (Vol. 338). Springer.","key":"6350_CR23","DOI":"10.1007\/978-3-540-71050-9"},{"unstructured":"Welling, M., & Teh, Y.\u00a0W. (2011). Bayesian learning via stochastic gradient Langevin dynamics. In Proceedings of the 28th international conference on machine learning (ICML-11) (pp. 681\u2013688).","key":"6350_CR24"},{"unstructured":"Wibisono, A. (2018). Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problem. In Conference on learning theory (pp. 2093\u20133027). PMLR.","key":"6350_CR25"},{"unstructured":"Xu, P., Chen, J., Zou, D., & Gu, Q. (2018). Global convergence of Langevin dynamics based algorithms for nonconvex optimization. Advances in Neural Information Processing Systems, 31.","key":"6350_CR26"},{"unstructured":"Zhang, H., & Sra, S. (2016). First-order methods for geodesically convex optimization. In Conference on learning theory (pp. 1617\u20131638). PMLR.","key":"6350_CR27"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06350-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-023-06350-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06350-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T00:04:15Z","timestamp":1719446655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-023-06350-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,27]]},"references-count":27,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["6350"],"URL":"https:\/\/doi.org\/10.1007\/s10994-023-06350-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2023,6,27]]},"assertion":[{"value":"16 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}