Point Cloud Classification via Deep Set Linearized Optimal Transport
Not on the map. Why?
Abstract (arXiv)
We introduce Deep Set Linearized Optimal Transport, an algorithm designed for the efficient simultaneous embedding of point clouds into an L2-space. This embedding preserves specific low-dimensional structures within the Wasserstein space while constructing a classifier to distinguish between various classes of point clouds. Our approach is motivated by the observation that L2-distances between optimal transport maps for distinct point clouds, originating from a shared fixed reference distribution, provide an approximation of the Wasserstein-2 distance between these point clouds, under certain assumptions. To learn approximations of these transport maps, we employ input convex neural networks (ICNNs) and establish that, under specific conditions, Euclidean distances between samples from these ICNNs closely mirror Wasserstein-2 distances between the true distributions. Additionally, we train a discriminator network that attaches weights these samples and creates a permutation invariant classifier to differentiate between different classes of point clouds. We showcase the advantages of our algorithm over the standard deep set approach through experiments on a flow cytometry dataset with a limited number of labeled point clouds.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 43 references that are in the map. First posted on arXiv 2 Jan 2024.
Builds on
20 of 43 references.
References · 20
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2017Deep Setscited by 1,394
- 2016Learning a Probabilistic Latent Space of Object Shapes via 3D Generative-Adversarial Modelingcited by 558
- 2016Input Convex Neural Networkscited by 407
- 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
- 2019Optimal transport mapping via input convex neural networkscited by 202
- 2019Wasserstein-2 Generative Networkscited by 96
- 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
- 2018Optimal Control Via Neural Networks: A Convex Approachcited by 82
- 2021Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionscited by 52
- 2018On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradientcited by 42
- 2020Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbationscited by 37
8 more
- 2019Quantitative stability of optimal transport maps and linearization of the 2-Wasserstein spacecited by 25
- 2015The Cumulative Distribution Transform and Linear Pattern Classificationcited by 19
- 2020Partitioning signal classes using transport transforms for data analysis and machine learningcited by 15
- 2022Supervised learning of sheared distributions using linearized optimal transportcited by 14
- 2023Linearized Wasserstein dimensionality reduction with approximation guaranteescited by 12
- 2022The Manifold Scattering Transform for High-Dimensional Point Cloud Datacited by 9
- 2017Two-sample Statistics Based on Anisotropic Kernelscited by 6
- 2017People Mover's Distance: Class level geometry using fast pairwise data adaptive transportation costscited by 2
Built on by
Citing papers per year: 2024: 1.
1 paper.