Related papers: A coordinate-free condition number for convex prog…

Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…

We study the problem of finding the global Riemannian center of mass of a set of data points on a Riemannian manifold. Specifically, we investigate the convergence of constant step-size gradient descent algorithms for solving this problem.…

Let $T_1,\ldots, T_m$ be a family of $d\times d$ invertible real matrices with $\|T_i\|<1/2$ for $1\leq i\leq m$. For ${\bf a}=(a_1,\ldots, a_m)\in {\Bbb R}^{md}$, let $\pi^{\bf a}\colon \Sigma=\{1,\ldots, m\}^{\Bbb N}\to {\Bbb R}^d$ denote…

We provide a Reifenberg type characterization for $m$-dimensional $C^1$-submanifolds of $\mathbb R^n$. This characterization is also equivalent to Reifenberg-flatness with vanishing constant combined with suitably converging approximating…

In Riemannian optimization, it is well known that the condition number of the Riemannian Hessian at an optimum strongly influences the asymptotic convergence behavior of optimization algorithms. On the manifold of symmetric positive…

Many geometric machine learning and image analysis applications, require a left-invariant metric on the 5D homogeneous space of 3D positions and orientations SE(3)/SO(2). This is done in Equivariant Neural Networks (G-CNNs), or in PDE-Based…

In this work, we study optimization problems of the form $\min_x \max_y f(x, y)$, where $f(x, y)$ is defined on a product Riemannian manifold $\mathcal{M} \times \mathcal{N}$ and is $\mu_x$-strongly geodesically convex (g-convex) in $x$ and…

Motivated by Wick-rotations of pseudo-Riemannian manifolds, we study real geometric invariant theory (GIT) and compatible representations. We extend some of the results from earlier works \cite{W2,W1}, in particular, we give some sufficient…

Here we study what we call bounded rough Riemannian metrics $(M,g)$, which are positive definite, symmetric tensors on each tangent space, $T_pM$, which are bounded and measurable as functions in coordinates. This is enough structure to…

In this paper, we present a conditional gradient type (CGT) method for solving a class of composite optimization problems where the objective function consists of a (weakly) smooth term and a (strongly) convex regularization term. While…

Given a word $w(x_{1},\ldots,x_{r})$, i.e., an element in the free group on $r$ elements, and an integer $d\geq1$, we study the characteristic polynomial of the random matrix $w(X_{1},\ldots,X_{r})$, where $X_{i}$ are Haar-random…

We prove curvature estimates for general curvature functions. As an application we show the existence of closed, strictly convex hypersurfaces with prescribed curvature $F$, where the defining cone of $F$ is $\C_+$. $F$ is only assumed to…

We describe conformal defects of $p$ dimensions in a free scalar theory on a $d$-dimensional flat space as boundary conditions on the conformally flat space $\mathbb{H}^{p+1}\times \mathbb{S}^{d-p-1}$. We classify two types of boundary…

In this paper, we study the design and analysis of a class of efficient algorithms for computing the Gromov-Wasserstein (GW) distance tailored to large-scale graph learning tasks. Armed with the Luo-Tseng error bound…

Given a random $n \times n$ symmetric matrix $\boldsymbol W$ drawn from the Gaussian orthogonal ensemble (GOE), we consider the problem of certifying an upper bound on the maximum value of the quadratic form $\boldsymbol x^\top \boldsymbol…

Let $P$ be a set of $n$ points in $\mathbb{R}^2$. For a given positive integer $w<n$, our objective is to find a set $C \subset P$ of points, such that $CH(P\setminus C)$ has the smallest number of vertices and $C$ has at most $n-w$ points.…

Let A be a Noetherian local domain, N be a finitely generated torsion- free module, and M a proper submodule that is generically equal to N. Let A[N] be an arbitrary graded overdomain of A generated as an A-algebra by N placed in degree 1.…

We propose a general convex optimization problem for computing regularized geodesic distances. We show that under mild conditions on the regularizer the problem is well posed. We propose three different regularizers and provide analytical…

Rank-width of a graph G, denoted by rw(G), is a width parameter of graphs introduced by Oum and Seymour (2006). We investigate the asymptotic behavior of rank-width of a random graph G(n,p). We show that, asymptotically almost surely, (i)…

Motivated by approximation Bayesian computation using mean-field variational approximation and the computation of equilibrium in multi-species systems with cross-interaction, this paper investigates the composite geodesically convex…