8 citations · 23 across the 6 of their papers we have counts for
6 papers
Approximation rates of entropic maps in semidiscrete optimal transport
Ritwik Sadhu, Ziv Goldfeld, Kengo Kato
Entropic optimal transport offers a computationally tractable approximation to the classical problem. In this note, we study the approximation rate of the entropic optimal transpor…
Stability and statistical inference for semidiscrete optimal transport maps
Ritwik Sadhu, Ziv Goldfeld, Kengo Kato
We study statistical inference for the optimal transport (OT) map (also known as the Brenier map) from a known absolutely continuous reference distribution onto an unknown finitely…
Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distances
Sloan Nietert, Ritwik Sadhu, Ziv Goldfeld +1
Sliced Wasserstein distances preserve properties of classic Wasserstein distances while being more scalable for computation and estimation in high dimensions. The goal of this work…
Detecting Planted Partition in Sparse Multi-Layer Networks
Anirban Chatterjee, Sagnik Nandy, Ritwik Sadhu
Multilayer networks are used to represent the interdependence between the relational data of individuals interacting with each other via different types of relationships. To study…
Statistical inference with regularized optimal transport
Ziv Goldfeld, Kengo Kato, Gabriel Rioux +1
Optimal transport (OT) is a versatile framework for comparing probability measures, with many applications to statistics, machine learning, and applied mathematics. However, OT dis…
Limit Distribution Theory for the Smooth 1-Wasserstein Distance with Applications
Ritwik Sadhu, Ziv Goldfeld, Kengo Kato
The smooth 1-Wasserstein distance (SWD) was recently proposed as a means to mitigate the curse of dimensionality in empirical approximation while preserving the Wasserstein…