Fetching the paper…
Reading the bibliography…
We obtain essentially matching upper and lower bounds for the expected max-sliced 1-Wasserstein distance between a probability measure on a separable Hilbert space and its empirical distribution from $n$ samples.
U. Haagerup, The best constants in the Khintchine inequality, Studia Math. 70 (1981), no. 3, 231-283 (1982)
1982
Earlier work this paper cites.
R. Latała and K. Oleszkiewicz, On the best constant in the Khinchin-Kahane inequality, Studia Mathematica 109.1 (1994): 101-104
1994
Earlier work this paper cites.
M. Raab and A. Steger, “Balls into bins”-A simple and tight analysis, International Workshop on Randomization and Approximation Techniques in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998
1998
Earlier work this paper cites.
M. Rudelson, Random vectors in the isotropic position, Journal of Functional Analysis 164.1 (1999): 60-72
1999
Earlier work this paper cites.
M. Talagrand, The generic chaining: upper and lower bounds of stochastic processes. Springer Science & Business Media, 2005
2005
Earlier work this paper cites.
R. Adamczak, A. E. Litvak, A. Pajor and N. Tomczak-Jaegermann, Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles, Journal of the American Mathematical Society, 23:535-561, 2009
2009
Earlier work this paper cites.
J. Wang, R. Gao, and Y. Xie, Two-sample test using projected Wasserstein distance, IEEE International Symposium on Information Theory (ISIT), 2021. Updated version: arxiv: 2010.11970
2010
Earlier work this paper cites.
R. Adamczak, A. E. Litvak, A. Pajor and N. Tomczak-Jaegermann, Sharp bounds on the rate of convergence of the empirical covariance matrix, Comptes Rendus. Mathématique 349.3-4 (2011): 195-200
2011
Earlier work this paper cites.
J. Rabin, G. Peyré, J. Delon, and M. Bernot, Wasserstein barycenter and its application to texture mixing, In International Conference on Scale Space and Variational Methods in Computer Vision, pages 435-446. Springer, 2011
2011
Earlier work this paper cites.
R. Vershynin, Introduction to the non-asymptotic analysis of random matrices. Compressed sensing, 210-268, Cambridge University Press, Cambridge, 2012
2012
Earlier work this paper cites.
R. Vershynin, How close is the sample covariance matrix to the actual covariance matrix?, Journal of Theoretical Probability 25.3 (2012): 655-686
2012
Earlier work this paper cites.
D. Berend and A. Kontorovich, A sharp estimate of the binomial mean absolute deviation with applications, Statistics & Probability Letters 83.4 (2013): 1254-1259
2013
Earlier work this paper cites.
M. Ledoux and M. Talagrand. Probability in Banach Spaces: isoperimetry and processes, Springer Science & Business Media, 2013
2013
Earlier work this paper cites.
N. Srivastava and R. Vershynin, Covariance estimation for distributions with 2 + ϵ 2+\epsilon moments, Annals of Probability 41 (2013), 3081-3111
2013
Earlier work this paper cites.
V. Koltchinskii and K. Lounici, Concentration inequalities and moment bounds for sample covariance operators. Bernoulli, 23:110-133, 2014
2014
Earlier work this paper cites.
S. Mendelson and G. Paouris, On the singular values of random matrices, Journal of the European Mathematical Society, 16:823-834, 2014
2014
Cited alongside, same era.
R. van Handel, Probability in high dimension, Lecture Notes (Princeton University) (2014)
2014
Cited alongside, same era.
N. Bonneel, J. Rabin, G. Peyré, and H. Pfister, Sliced and Radon Wasserstein barycenters of measures, Journal of Mathematical Imaging and Vision, 1(51):22-45, 2015
2015
Cited alongside, same era.
N. Fournier and A. Guillin, On the rate of convergence in Wasserstein distance of the empirical measure, Probability Theory and Related Fields 162.3-4 (2015): 707-738
2015
Cited alongside, same era.
J. A. Tropp, An introduction to matrix concentration inequalities, Foundations and Trends in Machine Learning 8.1-2 (2015): 1-230
2015
Cited alongside, same era.
M. J. Wainwright, High-dimensional statistics: A non-asymptotic viewpoint. Vol. 48. Cambridge University Press, 2019
2019
Later among the works it cites.
J. Wu, Z. Huang, D. Acharya, W. Li, J. Thoma, D. P. Paudel, and L. V. Gool, Sliced Wasserstein generative models, In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 3713-3722, 2019
2019
Later among the works it cites.
T. Lin, C. Fan, N. Ho, M. Cuturi and M. Jordan, Projection robust Wasserstein distance and Riemannian optimization. Advances in Neural Information Processing Systems, 33 (2020): 9383-9397
2020
Later among the works it cites.
T. Lin, Z. Zheng, E. Chen, M. Cuturi, M. I. Jordan, On projection robust optimal transport: Sample complexity and model misspecification, In International Conference on Artificial Intelligence and Statistics PMLR 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Carrière, M. Cuturi, and S. Oudot, Sliced Wasserstein kernel for persistence diagrams, In International Conference on Machine Learning (ICML), 2017
2017
Cited alongside, same era.
I. Deshpande, Z. Zhang, and A. G. Schwing, Generative modeling using the sliced Wasserstein distance, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2018
2018
Cited alongside, same era.
S. Kolouri, P. E. Pope, C. E. Martin, and G. K. Rohde. Sliced Wasserstein autoencoders. In International Conference on Learning Representations, 2018
2018
Cited alongside, same era.
K. Tikhomirov, Sample covariance matrices of heavy-tailed distributions, International Mathematics Research Notices 2018.20 (2018): 6254-6289
2018
Cited alongside, same era.
J. A. Tropp, Second-order matrix concentration inequalities. Appl. Comput. Harmon. Anal., 44(3):700-736, 2018
2018
Cited alongside, same era.
R. Vershynin, High-dimensional probability: An introduction with applications in data science, Vol. 47. Cambridge University Press, 2018
2018
Cited alongside, same era.
S. Bobkov and M. Ledoux, One-dimensional empirical measures, order statistics, and Kantorovich transport distances, Vol. 261. No. 1259. American Mathematical Society, 2019
2019
Cited alongside, same era.
2022
Later among the works it cites.
K. Nguyen and N. Ho, Amortized projection optimization for sliced Wasserstein generative models, Advances in Neural Information Processing Systems 35 (2022): 36985-36998
2022
Later among the works it cites.
S. Nietert, Z. Goldfeld, R. Sadhu and K. Kato, Statistical, robustness, and computational guarantees for sliced Wasserstein distances, Advances in Neural Information Processing Systems, 35, 28179-28193 (2022)
2022
Later among the works it cites.
J. Niles-Weed and P. Rigollet, Estimation of Wasserstein distances in the spiked transport model, Bernoulli 28.4 (2022): 2663-2688
2022
Later among the works it cites.
2022
Later among the works it cites.
C. Bonet, P. Berg, N. Courty, F. Septier, L. Drumetz, and M.-T. Pham, Spherical sliced-Wasserstein, In International Conference on Learning Representations, 2023
2023
Later among the works it cites.
M. Quellmalz, R. Beinert, G. Steidl, Sliced optimal transport on the sphere, Inverse Problems 39 (10), 105005, 2023
2023
Later among the works it cites.
P. Abdalla and N. Zhivotovskiy, Covariance estimation: Optimal dimension-free guarantees for adversarial corruption and heavy tails, Journal of the European Mathematical Society, 2024
2024
Closest in time.
K. Nguyen and N. Ho, Energy-based sliced Wasserstein distance, Advances in Neural Information Processing Systems 36 (2024)
2024
Closest in time.