Table of Contents
Fetching ...

Linearized Optimal Transport pyLOT Library: A Toolkit for Machine Learning on Point Clouds

Jun Linwu, Varun Khurana, Nicholas Karris, Alexander Cloninger

TL;DR

This work introduces pyLOT, a Python toolkit for Linearized Optimal Transport that embeds measure-valued data into a Hilbert space $L^2(\sigma)$ via the transport map $T_\sigma^{\mu}$ from a reference $\sigma$, enabling standard linear ML on point clouds. It details the LOT framework, discusses theoretical underpinnings and convergence properties, and demonstrates practical efficacy on high-resolution 3D tooth scans, including dimensionality reduction, classification, and fast LOT barycenter generation. The results show that LOT embeddings offer competitive classification performance with substantial computational savings compared to traditional Wasserstein barycenters, and iterative reference updates further improve barycenter quality. Overall, pyLOT provides a scalable, versatile toolkit for processing and analyzing measure-valued data in ML pipelines, with potential extensions to time-series and broader pre-processing stages.

Abstract

The pyLOT library offers a Python implementation of linearized optimal transport (LOT) techniques and methods to use in downstream tasks. The pipeline embeds probability distributions into a Hilbert space via the Optimal Transport maps from a fixed reference distribution, and this linearization allows downstream tasks to be completed using off the shelf (linear) machine learning algorithms. We provide a case study of performing ML on 3D scans of lemur teeth, where the original questions of classification, clustering, dimension reduction, and data generation reduce to simple linear operations performed on the LOT embedded representations.

Linearized Optimal Transport pyLOT Library: A Toolkit for Machine Learning on Point Clouds

TL;DR

This work introduces pyLOT, a Python toolkit for Linearized Optimal Transport that embeds measure-valued data into a Hilbert space via the transport map from a reference , enabling standard linear ML on point clouds. It details the LOT framework, discusses theoretical underpinnings and convergence properties, and demonstrates practical efficacy on high-resolution 3D tooth scans, including dimensionality reduction, classification, and fast LOT barycenter generation. The results show that LOT embeddings offer competitive classification performance with substantial computational savings compared to traditional Wasserstein barycenters, and iterative reference updates further improve barycenter quality. Overall, pyLOT provides a scalable, versatile toolkit for processing and analyzing measure-valued data in ML pipelines, with potential extensions to time-series and broader pre-processing stages.

Abstract

The pyLOT library offers a Python implementation of linearized optimal transport (LOT) techniques and methods to use in downstream tasks. The pipeline embeds probability distributions into a Hilbert space via the Optimal Transport maps from a fixed reference distribution, and this linearization allows downstream tasks to be completed using off the shelf (linear) machine learning algorithms. We provide a case study of performing ML on 3D scans of lemur teeth, where the original questions of classification, clustering, dimension reduction, and data generation reduce to simple linear operations performed on the LOT embedded representations.

Paper Structure

This paper contains 21 sections, 1 theorem, 37 equations, 7 figures, 6 tables.

Key Result

Theorem 2.1

If $\sigma \ll \lambda$ (the Lebesgue measure), the optimal transport map $T_{\sigma}^{\mu}$ is uniquely defined as the gradient of a convex function $\varphi$, i.e. $T_{\sigma}^{\mu}(x) = \nabla \varphi(x)$, where $\varphi$ is the unique convex function that satisfies $(\nabla \varphi)_\sharp \sigm

Figures (7)

  • Figure 1: LOT interpretations.
  • Figure 2: Tooth Comparison
  • Figure 3: PCA VS. LDA Cluster
  • Figure 4: Fixed Weight Tooth Samples (Tarsius)
  • Figure 5: Barycenter Comparision (Fixed Weight)
  • ...and 2 more figures

Theorems & Definitions (1)

  • Theorem 2.1: Brenier's theorem brenier-1991