Related papers: A coordinate-free condition number for convex prog…
The Gromov-Wasserstein (GW) distance is an extension of the optimal transport problem that allows one to match objects between incomparable spaces. At its core, the GW distance is specified as the solution of a non-convex quadratic program…
We study projection-free methods for constrained Riemannian optimization. In particular, we propose the Riemannian Frank-Wolfe (RFW) method. We analyze non-asymptotic convergence rates of RFW to an optimum for (geodesically) convex…
Motivated by energy based analyses for descent methods in the Euclidean setting, we investigate a generalisation of such analyses for descent methods over Riemannian manifolds. In doing so, we find that it is possible to derive…
Consider a compact Lie group $G$ and a closed subgroup $H<G$. Suppose $\mathcal M$ is the set of $G$-invariant Riemannian metrics on the homogeneous space $M=G/H$. We obtain a sufficient condition for the existence of $g\in\mathcal M$ and…
We propose a Riemannian version of Nesterov's Accelerated Gradient algorithm (RAGD), and show that for geodesically smooth and strongly convex problems, within a neighborhood of the minimizer whose radius depends on the condition number as…
Motivated by the physics of anisotropic conductive materials we consider a linear elliptic operator $\Delta_{\mathcal{W}}$ of divergence type on a Riemannian manifold $(M^{n}, g)$. The operator is determined by the metric $g$ and by a given…
The C. Neumann system describes a particle on the sphere S^n under the influence of a potential that is a quadratic form. We study the case that the quadratic form has l+1 distinct eigenvalues with multiplicity. Each group of m_\sigma equal…
In this note we show that in metric measure spaces satisfying the reduced curvature-dimension condition CD*(K,N) we always have geodesics in the Wasserstein space of probability measures that satisfy the critical convexity inequality of…
We prove that if $(M,g)$ is a topological 3-ball with a $C^4$-smooth Riemannian metric $g$, and mean-convex boundary $\partial M$ then knowledge of least areas circumscribed by simple closed curves $\gamma \subset \partial M$ uniquely…
The construction of conformally invariant gauge conditions for Maxwell and Einstein theories on a manifold M is found to involve two basic ingredients. First, covariant derivatives of a linear gauge (e.g. Lorenz or de Donder), completely…
Gromov-Wasserstein (GW) distance is a powerful tool for comparing and aligning probability distributions supported on different metric spaces. Recently, GW has become the main modeling technique for aligning heterogeneous data for a wide…
Constant weight codes (CWCs) and constant composition codes (CCCs) are two important classes of codes that have been studied extensively in both combinatorics and coding theory for nearly sixty years. In this paper we show that for {\it…
Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…
From optimal transport to robust dimensionality reduction, a plethora of machine learning applications can be cast into the min-max optimization problems over Riemannian manifolds. Though many min-max algorithms have been analyzed in the…
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
This paper considers a generic convex minimization template with affine constraints over a compact domain, which covers key semidefinite programming applications. The existing conditional gradient methods either do not apply to our template…
In this article we study convex integer maximization problems with composite objective functions of the form $f(Wx)$, where $f$ is a convex function on $\R^d$ and $W$ is a $d\times n$ matrix with small or binary entries, over finite sets…
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If…
A central question in geometric measure theory is whether geometric properties of a set translate into analytical ones. In 1960, E. R. Reifenberg proved that if an $n$-dimensional subset $M$ of $\mathbb{R}^{n+k}$ is well approximated by…
A homogeneous Riemannian space $(M= G/H,g)$ is called a geodesic orbit space (shortly, GO-space) if any geodesic is an orbit of one-parameter subgroup of the isometry group $G$. We study the structure of compact GO-spaces and give some…