SlowGuess/NeurIPS_2023_OCR huggingface dataset:
[35] Youssef Mroueh, Tom Sercu, and Vaibhava Goel. Mcgan: Mean and covariance feature matching gan. In International conference on machine learning, pages 2527-2535. PMLR, 2017.
[36] Victor M Panaretos and Yoav Zemel. Statistical aspects of wasserstein distances. Annual review of statistics and its application, 6:405-431, 2019.
[37] Hermina Petric Maretic, Mireille El Gheche, Giovanni Chierchia, and Pascal Frossard. Got: an optimal transport framework for graph comparison. Advances in Neural Information Processing Systems, 32, 2019.
[38] Abhijeet Phatak, Sharath Raghvendra, Chittaranjan Tripathy, and Kaiyi Zhang. Computing all optimal partial transports. In The Eleventh International Conference on Learning Representations, 2022.
[39] Julien Rabin, Julie Delon, and Yann Gousseau. Circular earth mover's distance for the comparison of local features. In 2008 19th International Conference on Pattern Recognition, pages 1-4. IEEE, 2008.
[40] Sharath Raghevendra and Pankaj K Agarwal. A near-linear time  $\varepsilon$ -approximation algorithm for geometric bipartite matching. Journal of the ACM (JACM), 67(3):1-19, 2020.
[41] Aaditya Ramdas, Nicolás García Trillos, and Marco Cuturi. On wasserstein two-sample testing and related families of nonparametric tests. Entropy, 19(2):47, 2017.
[42] Yossi Rubner, Carlo Tomasi, and Leonidas J Guibas. The earth mover's distance as a metric for image retrieval. International journal of computer vision, 40(2):99, 2000.
[43] R. Sharathkumar. A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates. In 29th International Symposium on Computational Geometry, pages 9-16, 2013.
[44] R Sharathkumar and Pankaj K Agarwal. Algorithms for the transportation problem in geometric settings. In Proceedings of the 23rd annual ACM-SIAM symposium on Discrete Algorithms, pages 306-317. SIAM, 2012.
[45] Peter Williston Shor. *Random planar matching and bin packing*. PhD thesis, Massachusetts Institute of Technology, 1985.
[46] Max Sommerfeld, Jörn Schrieber, Yoav Zemel, and Axel Munk. Optimal transport: Fast probabilistic approximation with exact solvers. J. Mach. Learn. Res., 20(105):1-23, 2019.
[47] NYC Taxi and Limousine Commission (TLC). Trip record data. https://www.nyc.gov/site/tlc/about/tlc-trip-record-data.page, 2023. Accessed: 2023-03-01.
[48] Pravin M Vaidya. Geometry helps in matching. SIAM Journal on Computing, 18(6):1201-1225, 1989.
[49] Jonathan Weed and Francis Bach. Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance. Bernoulli, 25(4A):2620 - 2648, 2019.