36 citations · 70 across the 4 of their papers we have counts for
6 papers
Optimal Transport Graph Neural Networks
Benson Chen, Gary Bécigneul, Octavian-Eugen Ganea +2
Current graph neural network (GNN) architectures naively average or sum node embeddings into an aggregated graph representation -- potentially losing structural or semantic informa…
Computationally Tractable Riemannian Manifolds for Graph Embeddings
Calin Cruceru, Gary Bécigneul, Octavian-Eugen Ganea
Representing graphs as sets of node embeddings in certain curved Riemannian manifolds has recently gained momentum in machine learning due to their desirable geometric inductive bi…
Momentum Improves Optimization on Riemannian Manifolds
Foivos Alimisis, Antonio Orvieto, Gary Bécigneul +1
We develop a new Riemannian descent algorithm that relies on momentum to improve over existing first-order methods for geodesically convex optimization. In contrast, accelerated co…
Mixed-curvature Variational Autoencoders
Ondrej Skopek, Octavian-Eugen Ganea, Gary Bécigneul
Euclidean geometry has historically been the typical "workhorse" for machine learning applications due to its power and simplicity. However, it has recently been shown that geometr…
Constant Curvature Graph Convolutional Networks
Gregor Bachmann, Gary Bécigneul, Octavian-Eugen Ganea
Interest has been rising lately towards methods representing data in non-Euclidean spaces, e.g. hyperbolic or spherical, that provide specific inductive biases useful for certain r…
A Continuous-time Perspective for Modeling Acceleration in Riemannian Optimization
Foivos Alimisis, Antonio Orvieto, Gary Bécigneul +1
We propose a novel second-order ODE as the continuous-time limit of a Riemannian accelerated gradient-based method on a manifold with curvature bounded from below. This ODE can be…