Related papers: Sub-Riemannian Fast Marching in SE(2)

Sparsity-based representations have recently led to notable results in various visual recognition tasks. In a separate line of research, Riemannian manifolds have been shown useful for dealing with features and models that do not lie in…

The geodesics for a sub-Riemannian metric on a three-dimensional contact manifold $M$ form a 1-parameter family of curves along each contact direction. However, a collection of such contact curves on $M$, locally equivalent to the solutions…

When solving the time-dependent radiative transport equation (RTE), implicit time discretization is often employed for its robustness and stability. This results in a sequence of steady-state RTEs with identical cross-sections but varying…

In this paper, we study the use of outer metrics, in particular Sobolev-type metrics on the diffeomorphism group in the context of PDE-constrained shape optimization. Leveraging the structure of the diffeomorphism group we analyze the…

In this paper we introduce a theoretical framework for semi-discrete optimization using ideas from optimal transport. Our primary motivation is in the field of deep learning, and specifically in the task of neural architecture search. With…

We study optimization over Riemannian embedded submanifolds, where the objective function is relatively smooth in the ambient Euclidean space. Such problems have broad applications but are still largely unexplored. We introduce two…

In this paper, we generalize the results of ($\textit{Groups, Geom. Dyn.}$, forthcoming) to describe the split left-invariant Riemannian distances on higher-rank Sol-type groups $G=\mathbf{N}\rtimes \mathbb{R}^k$. We show that the rough…

We present a new implementation of radiation hydrodynamics (RHD) in the adaptive mesh refinement (AMR) code RAMSES. The multi-group radiative transfer (RT) is performed on the AMR grid with a first-order Godunov method using the M1 closure…

The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems. The…

We are interested in the geometry of the group $\mathcal{D}_q(M)$ of diffeomorphisms preserving a contact form $\theta$ on a manifold $M$. We define a Riemannian metric on $\mathcal{D}_q(M)$, compute the corresponding geodesic equation, and…

Several important algorithms for machine learning and data analysis use pairwise distances as input. On Riemannian manifolds these distances may be prohibitively costly to compute, in particular for large datasets. To tackle this problem,…

We study the stochastic Riemannian gradient algorithm for matrix eigen-decomposition. The state-of-the-art stochastic Riemannian algorithm requires the learning rate to decay to zero and thus suffers from slow convergence and sub-optimal…

We express parallel transport for several common matrix Lie groups with a family of pseudo-Riemannian metrics in terms of matrix exponential and exponential actions. The metrics are constructed from a deformation of a bi-invariant metric…

This paper describes a novel framework for computing geodesic paths in shape spaces of spherical surfaces under an elastic Riemannian metric. The novelty lies in defining this Riemannian metric directly on the quotient (shape) space, rather…

In this work we address the problem of real-time dynamic medical MRI and X Ray CT image reconstruction from parsimonious samples Fourier frequency space for MRI and sinogram tomographic projections for CT. Today the de facto standard for…

We propose a globally-accelerated, first-order method for the optimization of smooth and (strongly or not) geodesically-convex functions in a wide class of Hadamard manifolds. We achieve the same convergence rates as Nesterov's accelerated…

Computing distances on Riemannian manifolds is a challenging problem with numerous applications, from physics, through statistics, to machine learning. In this paper, we introduce the metric-constrained Eikonal solver to obtain continuous,…

Symmetric Positive Definite (SPD) matrices have been widely used for data representation in many visual recognition tasks. The success mainly attributes to learning discriminative SPD matrices with encoding the Riemannian geometry of the…

In this paper, we present an approach to solving the Riemann problem in one-dimensional relativistic hydrodynamics, where the most computationally expensive steps of the exact solver are replaced by compact, highly specialized neural…

Computing an array of all pairs of geodesic distances between the pixels of an image is time consuming. In the sequel, we introduce new methods exploiting the redundancy of geodesic propagations and compare them to an existing one. We show…