Fourier Sliced-Wasserstein Embedding for Multisets and Measures
Not on the map. Why?
Abstract (arXiv)
We present the Fourier Sliced-Wasserstein (FSW) embedding - a novel method to embed multisets and measures over ℝd into Euclidean space. Our proposed embedding approximately preserves the sliced Wasserstein distance on distributions, thereby yielding geometrically meaningful representations that better capture the structure of the input. Moreover, it is injective on measures and bi-Lipschitz on multisets - a significant advantage over prevalent methods based on sum- or max-pooling, which are provably not bi-Lipschitz, and, in many cases, not even injective. The required output dimension for these guarantees is near-optimal: roughly 2 N d, where N is the maximal input multiset size. Furthermore, we prove that it is impossible to embed distributions over ℝd into Euclidean space in a bi-Lipschitz manner. Thus, the metric properties of our embedding are, in a sense, the best possible. Through numerical experiments, we demonstrate that our method yields superior multiset representations that improve performance in practical learning tasks. Specifically, we show that (a) a simple combination of the FSW embedding with an MLP achieves state-of-the-art performance in learning the (non-sliced) Wasserstein distance; and (b) replacing max-pooling with the FSW embedding makes PointNet significantly more robust to parameter reduction, with only minor performance degradation even after a 40-fold reduction.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 26 of its 50 references that are in the map. First posted on arXiv 3 Apr 2025.
Builds on
26 of 50 references.
References · 26
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
- 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,401
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2017Deep Setscited by 1,421
- 2019Provably Powerful Graph Networkscited by 389
- 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
- 2018Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithmcited by 112
- 2020On Learning Sets of Symmetric Elementscited by 98
14 more
- 2019On the Limitations of Representing Functions on Setscited by 90
- 2021Universal Approximation of Functions on Setscited by 62
- 2019FSPool: Learning Set Representations with Featurewise Sort Poolingcited by 53
- 2023Smooth, exact rotational symmetrization for deep learning on point cloudscited by 39
- 2022Low Dimensional Invariant Embeddings for Universal Geometric Learningcited by 38
- 2023Neural Injective Functions for Multisets, Measures and Graphs via a Finite Witness Theoremcited by 34
- 2015The Radon cumulative distribution transform and its application to image classificationcited by 28
- 2022Permutation Invariant Representations with Applications to Graph Deep Learningcited by 20
- 2022Group-invariant max filteringcited by 18
- 2024Wasserstein Wormhole: Scalable Optimal Transport Distance with Transformerscited by 14
- 2023Universal Representation of Permutation-Invariant Functions on Vectors and Tensorscited by 10
- 2021SLOSH: Set LOcality Sensitive Hashing via Sliced-Wasserstein Embeddingscited by 9
- 2024FSW-GNN: A Bi-Lipschitz WL-Equivalent Graph Neural Networkcited by 8
- 2023Neural approximation of Wasserstein distance via a universal architecture for symmetric and factorwise group invariant functionscited by 4
Built on by
Citing papers per year: 2025: 6; 2026: 2.
8 papers.
- 2025Constrained Sliced Wasserstein Embeddingcited by 2
- 2025Quantitative Bounds for Sorting-Based Permutation-Invariant Embeddingscited by 2
- 2025On the (Non) Injectivity of Piecewise Linear Janossy Poolingcited by 1
- 2025Toward bilipshiz geometric modelscited by 1
- 2026Quantitative Approximation Rates for Group Equivariant Learningcited by 1
- 2025On the Lipschitz Continuity of Set Aggregation Functions and Neural Networks for Setscited by 0
- 2025Monotone and Separable Set Functions: Characterizations and Neural Modelscited by 0
- 2026Distributionally Robust Set Representation Learning Under Inference-Time Element Corruptioncited by 0
- 2026Distributionally Robust Set Representation Learning Under Inference-Time Element Corruption28 May 2026
- 2026Quantitative Approximation Rates for Group Equivariant Learning23 Feb 2026
- 2025Toward bilipshiz geometric models13 Nov 2025
- 2025Quantitative Bounds for Sorting-Based Permutation-Invariant Embeddings25 Oct 2025
- 2025Monotone and Separable Set Functions: Characterizations and Neural Models24 Oct 2025
- 2025Constrained Sliced Wasserstein Embedding2 Jun 2025
- 2025On the Lipschitz Continuity of Set Aggregation Functions and Neural Networks for Sets30 May 2025
- 2025On the (Non) Injectivity of Piecewise Linear Janossy Pooling26 May 2025