Vertical Sliced Wasserstein Distances for Meta-Measures
cs.LG
Submitted: 2026-10-14
Updated: 2026-10-14
License: http://creativecommons.org/licenses/by/4.0/
The gist: Many modern learning problems require comparing probability distributions whose individual observations are themselves probability measures, naturally giving rise to meta-measures in P(P(Ω)).
Terminology
Abstract
Many modern learning problems require comparing probability distributions whose individual observations are themselves probability measures, naturally giving rise to meta-measures in P(P(Ω)). However, optimal transport distances on this space can be prohibitively expensive to evaluate. We introduce the vertical sliced Wasserstein (VSW) distance, a scalable metric on P(P(Ω)). Rather than slicing along the transport geometry of P(Ω), VSW projects each inner measure using continuous test functions and compares the resulting one-dimensional distributions with one-dimensional Wasserstein distance. We prove that VSW is a valid metric on P(P(Ω)), metrizes weak convergence, and admits dimension-independent statistical convergence guarantees. Empirically, VSW provides high accuracy and efficiency compared with existing distances for meta-measures. We further derive a practical particle gradient for the empirical VSW 2 squared objective and demonstrate its use for gradient-based transport of meta-measures. VSW provides a simple and scalable alternative for comparing and optimizing distributions of distributions.
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks