Hyperbolic Sliced-Wasserstein via Geodesic and Horospherical Projections
- URL: http://arxiv.org/abs/2211.10066v2
- Date: Mon, 26 Jun 2023 09:44:52 GMT
- Title: Hyperbolic Sliced-Wasserstein via Geodesic and Horospherical Projections
- Authors: Cl\'ement Bonet, Laetitia Chapel, Lucas Drumetz, Nicolas Courty
- Abstract summary: It has been shown beneficial for many types of data which present an underlying hierarchical structure to be embedded in hyperbolic spaces.
Many tools of machine learning were extended to such spaces, but only few discrepancies to compare probability distributions defined over those spaces exist.
In this work, we propose to derive novel hyperbolic sliced-Wasserstein discrepancies.
- Score: 17.48229977212902
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: It has been shown beneficial for many types of data which present an
underlying hierarchical structure to be embedded in hyperbolic spaces.
Consequently, many tools of machine learning were extended to such spaces, but
only few discrepancies to compare probability distributions defined over those
spaces exist. Among the possible candidates, optimal transport distances are
well defined on such Riemannian manifolds and enjoy strong theoretical
properties, but suffer from high computational cost. On Euclidean spaces,
sliced-Wasserstein distances, which leverage a closed-form of the Wasserstein
distance in one dimension, are more computationally efficient, but are not
readily available on hyperbolic spaces. In this work, we propose to derive
novel hyperbolic sliced-Wasserstein discrepancies. These constructions use
projections on the underlying geodesics either along horospheres or geodesics.
We study and compare them on different tasks where hyperbolic representations
are relevant, such as sampling or image classification.
Related papers
- Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds [13.851780805245477]
We derive general constructions of Sliced-Wasserstein distances on Cartimatan-Hadamard manifold.
We also propose non-parametric schemes to minimize these new distances by approxing their Wasserstein gradient flows.
arXiv Detail & Related papers (2024-03-11T10:01:21Z) - Leveraging Optimal Transport via Projections on Subspaces for Machine
Learning Applications [0.0]
In this thesis, we focus on alternatives which use projections on subspaces.
The main such alternative is the Sliced-Wasserstein distance.
Back to the original Euclidean Sliced-Wasserstein distance between probability measures, we study the dynamic of gradient flows.
arXiv Detail & Related papers (2023-11-23T10:13:07Z) - Alignment and Outer Shell Isotropy for Hyperbolic Graph Contrastive
Learning [69.6810940330906]
We propose a novel contrastive learning framework to learn high-quality graph embedding.
Specifically, we design the alignment metric that effectively captures the hierarchical data-invariant information.
We show that in the hyperbolic space one has to address the leaf- and height-level uniformity which are related to properties of trees.
arXiv Detail & Related papers (2023-10-27T15:31:42Z) - Hyperbolic vs Euclidean Embeddings in Few-Shot Learning: Two Sides of
the Same Coin [49.12496652756007]
We show that the best few-shot results are attained for hyperbolic embeddings at a common hyperbolic radius.
In contrast to prior benchmark results, we demonstrate that better performance can be achieved by a fixed-radius encoder equipped with the Euclidean metric.
arXiv Detail & Related papers (2023-09-18T14:51:46Z) - Continuous percolation in a Hilbert space for a large system of qubits [58.720142291102135]
The percolation transition is defined through the appearance of the infinite cluster.
We show that the exponentially increasing dimensionality of the Hilbert space makes its covering by finite-size hyperspheres inefficient.
Our approach to the percolation transition in compact metric spaces may prove useful for its rigorous treatment in other contexts.
arXiv Detail & Related papers (2022-10-15T13:53:21Z) - Spherical Sliced-Wasserstein [14.98994743486746]
Sliced-Wasserstein distance (SW) is restricted to data living in Euclidean spaces.
We focus more specifically on the sphere, for which we define a novel SW discrepancy, which we call spherical Sliced-Wasserstein.
Our construction is notably based on closed-form solutions of the Wasserstein distance on the circle, together with a new spherical Radon transform.
arXiv Detail & Related papers (2022-06-17T13:48:50Z) - HRCF: Enhancing Collaborative Filtering via Hyperbolic Geometric
Regularization [52.369435664689995]
We introduce a textitHyperbolic Regularization powered Collaborative Filtering (HRCF) and design a geometric-aware hyperbolic regularizer.
Specifically, the proposal boosts optimization procedure via the root alignment and origin-aware penalty.
Our proposal is able to tackle the over-smoothing problem caused by hyperbolic aggregation and also brings the models a better discriminative ability.
arXiv Detail & Related papers (2022-04-18T06:11:44Z) - Ultrahyperbolic Representation Learning [13.828165530602224]
In machine learning, data is usually represented in a (flat) Euclidean space where distances between points are along straight lines.
We propose a representation living on a pseudo-Riemannian manifold of constant nonzero curvature.
We provide the necessary learning tools in this geometry and extend gradient-based optimization techniques.
arXiv Detail & Related papers (2020-07-01T03:49:24Z) - Augmented Sliced Wasserstein Distances [55.028065567756066]
We propose a new family of distance metrics, called augmented sliced Wasserstein distances (ASWDs)
ASWDs are constructed by first mapping samples to higher-dimensional hypersurfaces parameterized by neural networks.
Numerical results demonstrate that the ASWD significantly outperforms other Wasserstein variants for both synthetic and real-world problems.
arXiv Detail & Related papers (2020-06-15T23:00:08Z) - Fast and Robust Comparison of Probability Measures in Heterogeneous
Spaces [62.35667646858558]
We introduce the Anchor Energy (AE) and Anchor Wasserstein (AW) distances, which are respectively the energy and Wasserstein distances instantiated on such representations.
Our main contribution is to propose a sweep line algorithm to compute AE emphexactly in log-quadratic time, where a naive implementation would be cubic.
We show that AE and AW perform well in various experimental settings at a fraction of the computational cost of popular GW approximations.
arXiv Detail & Related papers (2020-02-05T03:09:23Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.