Related papers: Semi-Riemannian Manifold Optimization

Kohonen's Self-Organizing Maps (SOMs) have proven to be a successful data-reduction method to identify the intrinsic lower-dimensional sub-manifold of a data set that is scattered in the higher-dimensional feature space. Motivated by the…

Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…

We analyze convergence of gradient-descent methods on Riemannian manifolds. In particular, we study randomization of Riemannian gradient algorithms for minimizing smooth cost functions (of Morse-Bott type). We prove that randomized gradient…

Improving a result of Eschenburg and Kim we give a criterion for semisimplicity of pseudo-Riemannian extrinsic symmetric spaces in terms of the shape operator with respect to the mean curvature vector.

In this paper, we derived biharmonic equations for pseudo-Riemannian submanifolds of pseudo-Riemannian manifolds which includes the biharmonic equations for submanifolds of Riemannian manifolds as a special case. As applications, we proved…

Variance parameter estimation in linear mixed models is a challenge for many classical nonlinear optimization algorithms due to the positive-definiteness constraint of the random effects covariance matrix. We take a completely novel view on…

The numerical solution of partial differential equations on high-dimensional domains gives rise to computationally challenging linear systems. When using standard discretization techniques, the size of the linear system grows exponentially…

This paper starts by introducing results from geometric measure theory to prove symmetric decreasing rearrangement inequalities on $\mathbb{R}^n$, which give multiple proofs of the isoperimetric and P\'{o}lya-Szeg\H{o} inequalities. Then we…

In this paper, we develop an approach to exploiting kernel methods with manifold-valued data. In many computer vision problems, the data can be naturally represented as points on a Riemannian manifold. Due to the non-Euclidean geometry of…

In this paper, a descent method for nonsmooth multiobjective optimization problems on complete Riemannian manifolds is proposed. The objective functions are only assumed to be locally Lipschitz continuous instead of convexity used in…

We consider two Riemannian geometries for the manifold $\mathcal{M}(p,m\times n)$ of all $m\times n$ matrices of rank $p$. The geometries are induced on $\mathcal{M}(p,m\times n)$ by viewing it as the base manifold of the submersion…

Computing optimal, collision-free trajectories for high-dimensional systems is a challenging problem. Sampling-based planners struggle with the dimensionality, whereas trajectory optimizers may get stuck in local minima due to inherent…

For addressing optimisation tasks on finite dimensional quantum systems, we give a comprehensive account of the foundations of gradient flows on Riemannian manifolds including new developments: we extend former results from Lie groups such…

In the present work we define the rolling of one pseudo-Riemannian manifold over another without slipping and twisting. We compare the definition of the rolling without slipping and twisting of two manifolds isometrically embedded into a…

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…

The space of all Riemannian metrics on a smooth second countable finite dimensional manifold is itself a smooth manifold modeled on the space of symmetric (0,2)-tensor fields with compact support. It carries a canonical Riemannian metric…

Meta-learning, or "learning to learn," aims to enable models to quickly adapt to new tasks with minimal data. While traditional methods like Model-Agnostic Meta-Learning (MAML) optimize parameters in Euclidean space, they often struggle to…

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 biases, e.g., hierarchical structures benefit from hyperbolic…

Tubular neighborhoods play an important role in differential topology. We have applied these constructions to geometry of almost Hermitian manifolds. At first, we consider deformations of tensor structures on a normal tubular neighborhood…

Nonlinear dimensionality reduction methods provide a valuable means to visualize and interpret high-dimensional data. However, many popular methods can fail dramatically, even on simple two-dimensional manifolds, due to problems such as…