{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T08:54:18Z","timestamp":1775897658311,"version":"3.50.1"},"reference-count":70,"publisher":"Informa UK Limited","issue":"4","funder":[{"name":"Outstanding Innovative Talents Cultivation"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101606"],"award-info":[{"award-number":["12101606"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001042"],"award-info":[{"award-number":["12001042"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271522"],"award-info":[{"award-number":["12271522"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Graphical Statistics"],"published-print":{"date-parts":[[2023,10,2]]},"DOI":"10.1080\/10618600.2023.2165500","type":"journal-article","created":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T15:50:49Z","timestamp":1673279449000},"page":"1512-1523","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Approximation of Gromov-Wasserstein Distance Using Importance Sparsification"],"prefix":"10.1080","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5286-7525","authenticated-orcid":false,"given":"Mengyu","family":"Li","sequence":"first","affiliation":[{"name":"Institute of Statistics and Big Data, Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6068-8415","authenticated-orcid":false,"given":"Jun","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Beijing Institute of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4192-5360","authenticated-orcid":false,"given":"Hongteng","family":"Xu","sequence":"additional","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7111-0966","authenticated-orcid":false,"given":"Cheng","family":"Meng","sequence":"additional","affiliation":[{"name":"Center for Applied Statistics, Institute of Statistics and Big Data, Renmin University of China, Beijing, China"}]}],"member":"301","published-online":{"date-parts":[[2023,2,15]]},"reference":[{"key":"e_1_3_4_2_1","volume-title":"7th International Conference on Learning Representations","author":"Alaux J.","year":"2019","unstructured":"Alaux, J., Grave, E., Cuturi, M., and Joulin, A. (2019), \u201cUnsupervised Hyper-Alignment for Multilingual Word Embeddings,\u201d in 7th International Conference on Learning Representations, New Orleans, LA, USA."},{"key":"e_1_3_4_3_1","doi-asserted-by":"crossref","unstructured":"Alvarez-Melis D. and Jaakkola T. (2018) \u201cGromov-Wasserstein Alignment of Word Embedding Spaces \u201d in Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing pp. 1881\u20131890 Brussels Belgium. ACL.","DOI":"10.18653\/v1\/D18-1214"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/fld.264"},{"key":"e_1_3_4_5_1","unstructured":"Blumberg A. J. Carriere M. Mandell M. A. Rabadan R. and Villar S. (2020) \u201cMREC: A Fast and Versatile Framework for Aligning and Matching Point Clouds with Applications to Single Cell Molecular Data \u201d arXiv preprint arXiv:2001.01666."},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-014-0506-3"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024192"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002050050044"},{"key":"e_1_3_4_9_1","first-page":"2321","volume-title":"International Conference on Machine Learning","author":"Brogat-Motte L.","year":"2022","unstructured":"Brogat-Motte, L., Flamary, R., Brouard, C., Rousu, J., and d\u2019Alch\u00e9 Buc, F. (2022), \u201cLearning to Predict Graphs with Fused Gromov-Wasserstein Barycenters,\u201d in International Conference on Machine Learning, pp. 2321\u20132335. PMLR."},{"key":"e_1_3_4_10_1","first-page":"851","volume-title":"International Conference on Machine Learning","author":"Bunne C.","year":"2019","unstructured":"Bunne, C., Alvarez-Melis, D., Krause, A., and Jegelka, S. (2019), \u201cLearning Generative Models Across Incomparable Spaces,\u201d in International Conference on Machine Learning, pp. 851\u2013861. PMLR."},{"key":"e_1_3_4_11_1","first-page":"2903","article-title":"\u201cPartial Optimal Tranport with Applications on Positive-Unlabeled Learning,\u201d in","volume":"33","author":"Chapel L.","year":"2020","unstructured":"Chapel, L., Alaya, M. Z., and Gasso, G. (2020), \u201cPartial Optimal Tranport with Applications on Positive-Unlabeled Learning,\u201d in Advances in Neural Information Processing Systems, (Vol. 33), 2903\u20132913.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-016-9331-y"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3303"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2018.03.008"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz026"},{"key":"e_1_3_4_16_1","doi-asserted-by":"crossref","unstructured":"Chowdhury S. Miller D. and Needham T. (2021) \u201cQuantized Gromov-Wasserstein \u201d in Joint European Conference on Machine Learning and Knowledge Discovery in Databases pp. 811\u2013827 Springer.","DOI":"10.1007\/978-3-030-86523-8_49"},{"key":"e_1_3_4_17_1","first-page":"712","volume-title":"Proceedings of the 24th International Conference on Artificial Intelligence and Statistics","volume":"130","author":"Chowdhury S.","year":"2021","unstructured":"Chowdhury, S., and Needham, T. (2021), \u201cGeneralized Spectral Clustering via Gromov-Wasserstein Learning,\u201d in Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (Vol. 130), pp. 712\u2013720. PMLR."},{"key":"e_1_3_4_18_1","first-page":"2292","article-title":"\u201cSinkhorn Distances: Lightspeed Computation of Optimal Transport,\u201d in","volume":"26","author":"Cuturi M.","year":"2013","unstructured":"Cuturi, M. (2013), \u201cSinkhorn Distances: Lightspeed Computation of Optimal Transport,\u201d in Advances in Neural Information Processing Systems (Vol. 26), pp. 2292\u20132300.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_19_1","first-page":"10648","volume-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern RecognitionIEEE","author":"Deshpande I.","year":"2019","unstructured":"Deshpande, I., Hu, Y.-T., Sun, R., Pyrros, A., Siddiqui, N., Koyejo, S., Zhao, Z., Forsyth, D., and Schwing, A. G. (2019), \u201cMax-Sliced Wasserstein Distance and its Use for GANs,\u201d in Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 10648\u201310656. IEEE."},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13244"},{"key":"e_1_3_4_21_1","first-page":"216","article-title":"\u201cScalable Kkernels for Graphs with Continuous Attributes,\u201d in","volume":"26","author":"Feragen A.","year":"2013","unstructured":"Feragen, A., Kasenburg, N., Petersen, J., de Bruijne, M., and Borgwardt, K. (2013), \u201cScalable Kkernels for Graphs with Continuous Attributes,\u201d in Advances in Neural Information Processing Systems (Vol. 26), pp. 216\u2013224.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_22_1","volume-title":"ICLR Workshop on Representation Learning on Graphs and Manifolds","author":"Fey M.","year":"2019","unstructured":"Fey, M., and Lenssen, J. E. (2019), \u201cFast Graph Representation Learning with PyTorch Geometric,\u201d in ICLR Workshop on Representation Learning on Graphs and Manifolds."},{"key":"e_1_3_4_23_1","first-page":"1574","volume-title":"22nd International Conference on Artificial Intelligence and Statistics","author":"Genevay A.","year":"2019","unstructured":"Genevay, A., Chizat, L., Bach, F., Cuturi, M., and Peyr\u00e9, G. (2019), \u201cSample Complexity of Sinkhorn Divergences,\u201d in 22nd International Conference on Artificial Intelligence and Statistics, pp. 1574\u20131583. PMLR."},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557339"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.25080\/TCWV9851"},{"key":"e_1_3_4_26_1","first-page":"227","article-title":"\u201cOn the Transfer of Masses,\u201d","volume":"37","author":"Kantorovich L.","year":"1942","unstructured":"Kantorovich, L. (1942), \u201cOn the Transfer of Masses,\u201d Doklady Akademii Nauk, 37, 227\u2013229 (in Russian).","journal-title":"Doklady Akademii Nauk"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.commatsci.2020.110144"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-021-06035-1"},{"key":"e_1_3_4_29_1","first-page":"31","volume-title":"International Workshop on Cost-Sensitive Learning","author":"Kriege N. M.","year":"2018","unstructured":"Kriege, N. M., Fey, M., Fisseler, D., Mutzel, P., and Weichert, F. (2018), \u201cRecognizing Cuneiform Signs Using Graph based Methods,\u201d in International Workshop on Cost-Sensitive Learning, pp. 31\u201344. PMLR."},{"key":"e_1_3_4_30_1","first-page":"3934","volume-title":"International Conference on Artificial Intelligence and Statistics","author":"Le T.","year":"2021","unstructured":"Le, T., Ho, N., and Yamada, M. (2021), \u201cFlow-based Alignment Approaches for Probability Measures in Different Spaces,\u201d in International Conference on Artificial Intelligence and Statistics, pp. 3934\u20133942. PMLR."},{"key":"e_1_3_4_31_1","unstructured":"Li T. Meng C. Yu J. and Xu H. (2022) \u201cHilbert Curve Projection Distance for Distribution Comparison \u201d arXiv preprint arXiv:2205.15059."},{"key":"e_1_3_4_32_1","doi-asserted-by":"crossref","unstructured":"Liao Q. Chen J. Wang Z. Bai B. Jin S. and Wu H. (2022a) \u201cFast Sinkhorn I: An O(N) Algorithm for the Wasserstein-1 Metric \u201d arXiv preprint arXiv:2202.10042.","DOI":"10.4310\/CMS.2022.v20.n7.a11"},{"key":"e_1_3_4_33_1","doi-asserted-by":"crossref","unstructured":"Liao Q. Wang Z. Chen J. Bai B. Jin S. and Wu H. (2022b) \u201cFast Sinkhorn II: Collinear Triangular Matrix and Linear Time Accurate Computation of Optimal Transport \u201d arXiv preprint arXiv:2206.09049.","DOI":"10.1007\/s10915-023-02403-2"},{"key":"e_1_3_4_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1041420"},{"key":"e_1_3_4_35_1","unstructured":"Lin T. Ho N. and Jordan M. I. (2019) \u201cOn the Acceleration of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport \u201d arXiv preprint arXiv:1906.01437."},{"key":"e_1_3_4_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00162521"},{"key":"e_1_3_4_37_1","volume-title":"Monte Carlo Strategies in Scientific Computing","author":"Liu J. S.","year":"2008","unstructured":"Liu, J. S. (2008), Monte Carlo Strategies in Scientific Computing, New York: Springer."},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3503161.3548067"},{"key":"e_1_3_4_39_1","first-page":"861","article-title":"\u201cA Statistical Perspective on Algorithmic Leveraging,\u201d","volume":"16","author":"Ma P.","year":"2015","unstructured":"Ma, P., Mahoney, M. W., and Yu, B. (2015), \u201cA Statistical Perspective on Algorithmic Leveraging,\u201d The Journal of Machine Learning Research, 16, 861\u2013911.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9093-5"},{"key":"e_1_3_4_41_1","first-page":"8118","article-title":"\u201cLarge-Scale Optimal Transport Map Estimation Using Projection Pursuit,\u201d in","volume":"32","author":"Meng C.","year":"2019","unstructured":"Meng, C., Ke, Y., Zhang, J., Zhang, M., Zhong, W., and Ma, P. (2019), \u201cLarge-Scale Optimal Transport Map Estimation Using Projection Pursuit,\u201d in Advances in Neural Information Processing Systems (Vol. 32), pp. 8118\u20138129.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_42_1","first-page":"7130","volume-title":"International Conference on Machine Learning","author":"Muzellec B.","year":"2020","unstructured":"Muzellec, B., Josse, J., Boyer, C., and Cuturi, M. (2020), \u201cMissing Data Imputation Using Optimal Transport,\u201d in International Conference on Machine Learning, pp. 7130\u20137140. PMLR."},{"key":"e_1_3_4_43_1","unstructured":"Nadjahi K. (2021) \u201cSliced-Wasserstein Distance for Large-Scale Machine Learning: Theory Methodology and Extensions \u201d PhD thesis Institut polytechnique de Paris."},{"key":"e_1_3_4_44_1","first-page":"10","volume-title":"Online Proceedings of the Eleventh Workshop on Mining and Learning with Graphs","author":"Neumann M.","year":"2013","unstructured":"Neumann, M., Moreno, P., Antanas, L., Garnett, R., and Kersting, K. (2013), \u201cGraph Kernels for Object Category Prediction in Task-Dependent Robot Grasping,\u201d in Online Proceedings of the Eleventh Workshop on Mining and Learning with Graphs, pp. 10\u20136, Chicago, Illinois, USA. ACM."},{"key":"e_1_3_4_45_1","first-page":"2825","article-title":"\u201cScikit-Learn: Machine Learning in Python,\u201d","volume":"12","author":"Pedregosa F.","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., and Duchesnay, E. (2011), \u201cScikit-Learn: Machine Learning in Python,\u201d The Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_4_46_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"e_1_3_4_47_1","first-page":"2664","volume-title":"International Conference on Machine Learning","author":"Peyr\u00e9 G.","year":"2016","unstructured":"Peyr\u00e9, G., Cuturi, M., and Solomon, J. (2016), \u201cGromov-Wasserstein Averaging of Kernel and Distance Matrices,\u201d in International Conference on Machine Learning, pp. 2664\u20132672. PMLR."},{"key":"e_1_3_4_48_1","first-page":"7673","volume-title":"International Conference on Machine Learning","author":"Pham K.","year":"2020","unstructured":"Pham, K., Le, K., Ho, N., Pham, T., and Bui, H. (2020), \u201cOn Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm,\u201d in International Conference on Machine Learning, pp. 7673\u20137682. PMLR."},{"key":"e_1_3_4_49_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1971.10482356"},{"key":"e_1_3_4_50_1","doi-asserted-by":"crossref","unstructured":"Reddi S. J. Sra S. P\u00f3czos B. and Smola A. (2016) \u201cStochastic Frank-Wolfe Methods for Nonconvex Optimization \u201d in 2016 54th Annual Allerton Conference on Communication Control and Computing (Allerton) pp. 1244\u20131251 IEEE.","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"e_1_3_4_51_1","unstructured":"Sato R. Cuturi M. Yamada M. and Kashima H. (2020) \u201cFast and Robust Comparison of Probability Measures in Heterogeneous Spaces \u201d arXiv preprint arXiv:2002.01615."},{"key":"e_1_3_4_52_1","first-page":"13468","article-title":"\u201cLinear Time Sinkhorn Divergences Using Positive Features,\u201d","volume":"33","author":"Scetbon M.","year":"2020","unstructured":"Scetbon, M., and Cuturi, M. (2020), \u201cLinear Time Sinkhorn Divergences Using Positive Features,\u201d Advances in Neural Information Processing Systems (Vol. 33), pp. 13468\u201313480.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_53_1","first-page":"19347","volume-title":"International Conference on Machine Learning","author":"Scetbon M.","year":"2022","unstructured":"Scetbon, M., Peyr\u00e9, G., and Cuturi, M. (2022), \u201cLinear-Time Gromov Wasserstein Distances Using Low Rank Couplings and Costs,\u201d in International Conference on Machine Learning, pp. 19347\u201319365. PMLR."},{"key":"e_1_3_4_54_1","first-page":"8766","article-title":"\u201cThe Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation,\u201d in","volume":"34","author":"S\u00e9journ\u00e9 T.","year":"2021","unstructured":"S\u00e9journ\u00e9, T., Vialard, F.-X., and Peyr\u00e9, G. (2021), \u201cThe Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation,\u201d in Advances in Neural Information Processing Systems (Vol. 34), pp. 8766\u20138779.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_55_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.343"},{"key":"e_1_3_4_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925903"},{"key":"e_1_3_4_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11511-006-0002-8"},{"key":"e_1_3_4_58_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci034143r"},{"key":"e_1_3_4_59_1","first-page":"6275","volume-title":"International Conference on Machine Learning","author":"Titouan V.","year":"2019","unstructured":"Titouan, V., Courty, N., Tavenard, R., and Flamary, R. (2019a), \u201cOptimal Transport for Structured Data with Application on Graphs,\u201d in International Conference on Machine Learning, pp. 6275\u20136284. PMLR."},{"key":"e_1_3_4_60_1","first-page":"4753","article-title":"\u201cSliced Gromov-Wasserstein,\u201d in","volume":"32","author":"Titouan V.","year":"2019","unstructured":"Titouan, V., Flamary, R., Courty, N., Tavenard, R., and Chapel, L. (2019b), \u201cSliced Gromov-Wasserstein,\u201d in Advances in Neural Information Processing Systems (Vol. 32), pp. 4753\u201314763.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_61_1","doi-asserted-by":"publisher","DOI":"10.3390\/a13090212"},{"key":"e_1_3_4_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9"},{"key":"e_1_3_4_63_1","volume-title":"10th International Conference on Learning Representations","author":"Vincent-Cuaz C.","year":"2022","unstructured":"Vincent-Cuaz, C., Flamary, R., Corneli, M., Vayer, T., and Courty, N. (2022), \u201cSemi-relaxed Gromov-Wasserstein Divergence with Applications on Graphs,\u201d in 10th International Conference on Learning Representations."},{"key":"e_1_3_4_64_1","first-page":"433","volume-title":"Uncertainty in Artificial Intelligence","author":"Xie Y.","year":"2020","unstructured":"Xie, Y., Wang, X., Wang, R., and Zha, H. (2020), \u201cA Fast Proximal Point Method for Computing Exact Wasserstein Distance,\u201d in Uncertainty in Artificial Intelligence, pp. 433\u2013453. PMLR."},{"key":"e_1_3_4_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3153126"},{"key":"e_1_3_4_66_1","first-page":"3052","article-title":"\u201cScalable Gromov-Wasserstein Learning for Graph Partitioning and Matching,\u201d in","volume":"32","author":"Xu H.","year":"2019","unstructured":"Xu, H., Luo, D., and Carin, L. (2019), \u201cScalable Gromov-Wasserstein Learning for Graph Partitioning and Matching,\u201d in Advances in Neural Information Processing Systems (Vol. 32), pp. 3052\u20133062.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_67_1","first-page":"6932","volume-title":"International Conference on Machine Learning","author":"Xu H.","year":"2019","unstructured":"Xu, H., Luo, D., Zha, H., and Carin, L. (2019), \u201cGromov-Wasserstein Learning for Graph Matching and Node Embedding,\u201d in International Conference on Machine Learning, pp. 6932\u20136941. PMLR."},{"key":"e_1_3_4_68_1","first-page":"2969","volume-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence","author":"Yan Y.","year":"2018","unstructured":"Yan, Y., Li, W., Wu, H., Min, H., Tan, M., and Wu, Q. (2018), \u201cSemi-supervised Optimal Transport for Heterogeneous Domain Adaptation,\u201d in Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 2969\u20132975."},{"key":"e_1_3_4_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_4_70_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2020.1773832"},{"key":"e_1_3_4_71_1","first-page":"e1587","article-title":"Projection-Based Techniques for High-Dimensional Optimal Transport Problems","author":"Zhang J.","year":"2022","unstructured":"Zhang, J., Ma, P., Zhong, W., and Meng, C. (2022), \u201cProjection-Based Techniques for High-Dimensional Optimal Transport Problems,\u201d Wiley Interdisciplinary Reviews: Computational Statistics, e1587.","journal-title":"Wiley Interdisciplinary Reviews: Computational Statistics"}],"container-title":["Journal of Computational and Graphical Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10618600.2023.2165500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T17:50:21Z","timestamp":1732125021000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10618600.2023.2165500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,15]]},"references-count":70,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,10,2]]}},"alternative-id":["10.1080\/10618600.2023.2165500"],"URL":"https:\/\/doi.org\/10.1080\/10618600.2023.2165500","relation":{},"ISSN":["1061-8600","1537-2715"],"issn-type":[{"value":"1061-8600","type":"print"},{"value":"1537-2715","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,15]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-09-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}