CORTEXA
← Browse
arxivstat.MLcs.LG2026-06-29

Highly Data Parallelizable Estimation of the Sliced-Wasserstein Distance Using Cumulative Distribution Functions

Christophe Vauthier, Quentin Mérigot, Anna Korba

The Sliced Wasserstein (SW) distance has emerged as a computationally attractive alternative to the Wasserstein distance by leveraging one-dimensional optimal transport along random projections. Standard estimators of the SW distance rely on Monte Carlo averages of one-dimensional Wasserstein distances computed via quantile functions, which require sorting projected samples and access to full datasets. In this work, we introduce a new class of estimators for the Sliced Wasserstein distance based on cumulative distribution functions (CDFs) of projected measures, that avoid sorting and scale via massive dataset parallelism. This class includes several estimators, some of them being indexed by hyperparameters controlling their variance or smoothness. We show that they are especially well suited to scenarios in which CDFs are more tractable than quantile functions, such as mixtures of Gaussians, and moreover that they are also naturally compatible with federated learning, since CDFs of projected data can be computed and aggregated locally without requiring the exchange of raw samples.

View free PDFSource page

Related papers

arxivstat.MLcs.LG2026-06-29

Adjusted Wasserstein distances for bridging empirical and true distributions with applications to MDS

Flor Martinez-Sermeno, Arturo Jaramillo, Johan Van Horebeek

This paper examines how metric adjustments to Multidimensional Scaling (MDS) can enhance its effectiveness as a visual tool for pattern recognition. The distance under consideration, referred to as Max-D-SW, is an adjustment of the Max-Sliced Wasserstein distance. In contrast to…

View free PDFSource page
arxivcs.LGcs.DSstat.MEstat.ML2026-07-21

Total Variation Distance Estimation in Autoregressive Models

Eric Price, Kevin Tian, Zhiyang Xun, Yusong Zhu

Modern LLM deployments use a number of implementation choices and inference optimizations (e.g., batching, custom kernels, and quantization) on top of fixed weights, so two engines serving "the same model" can produce meaningfully different distributions. We study the problem of…

View free PDFSource page
arxivstat.MLcs.LGstat.COstat.ME2026-07-16

cGAP: Generalized Association Plots with HOMALS-Guided Heatmaps for Visualization of High-Dimensional Categorical Data

Chun-houh Chen, Shun-Chuan Chang, Chiun-How Kao, Yi-Ju Lee, Shang-Ying Shiu, Yin-Jing Tien, et al.

High-dimensional categorical data arise in genetics, biomedicine, and the social sciences, yet visualization tools for such data remain far less developed than those for continuous variables. Existing methods either scale poorly, rely heavily on low-dimensional displays detached…

View free PDFSource page
arxivstat.MLcs.LG2026-07-15

Parallel gradient boosting for flexible estimation of conditional distributions

Rémy Chapelle, Nicolas Vayatis, Bruno Falissard, Mohammed Sedki

Boosting is one of the most successful learning techniques for standard classification and regression tasks. Its extension to multi-output prediction problems has found an increasing number of applications in recent years. Among them is the prediction of entire conditional distri…

View free PDFSource page
arxivcs.LGstat.ML2026-06-26

Improving Patient Subtyping on Longitudinal Data using Representations from Mamba-based Architecture

Md Mozaharul Mottalib, Rahmatollah Beheshti

Effective sub-typing (also known as grouping or clustering) of patients using their electronic health record (EHR) data can greatly inform precision medicine efforts. However, subtyping temporal EHR datasets is known to be challenging due to inherent EHR issues, including complex…

View free PDFSource page