Related papers: A Grassmann Manifold Handbook: Basic Geometry and …
Projection-based model reduction is among the most widely adopted methods for constructing parametric Reduced-Order Models (ROM). Utilizing the snapshot data from solving full-order governing equations, the Proper Orthogonal Decomposition…
This entry contains the core material of my habilitation thesis, soon to be officially submitted. It provides a self-contained presentation of the original results in this thesis, in addition to their detailed proofs. The motivation of…
The aim of this paper is to present a short introduction to supergeometry on pure odd supermanifolds. (Pseudo)differential forms, Cartan calculus (DeRham differential, Lie derivative, "inner" product), metric, inner product, Killing's…
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…
Many machine learning applications are naturally formulated as optimization problems on Riemannian manifolds. The main idea behind Riemannian optimization is to maintain the feasibility of the variables while moving along a descent…
The purpose of this article is to introduce projective geometry over composition algebras : the equivalent of projective spaces and Grassmannians over them are defined. It will follow from this definition that the projective spaces are in…
Generative adversarial networks (GANs) have emerged as a powerful unsupervised method to model the statistical patterns of real-world data sets, such as natural images. These networks are trained to map random inputs in their latent space…
We propose an extremely versatile approach to address a large family of matrix nearness problems, possibly with additional linear constraints. Our method is based on splitting a matrix nearness problem into two nested optimization problems,…
Manifold learning seeks a low dimensional representation that faithfully captures the essence of data. Current methods can successfully learn such representations, but do not provide a meaningful set of operations that are associated with…
This paper proposes a general framework of Riemannian adaptive optimization methods. The framework encapsulates several stochastic optimization algorithms on Riemannian manifolds and incorporates the mini-batch strategy that is often used…
These notes on Riemannian geometry use the bases bundle and frame bundle, as in Geometry of Manifolds, to express the geometric structures. It has more problems and omits the background material. It starts with the definition of Riemannian…
Machine learning problems have an intrinsic geometric structure as central objects including a neural network's weight space and the loss function associated with a particular task can be viewed as encoding the intrinsic geometry of a given…
The Riemannian geometry is one of the main theoretical pieces in Modern Mathematics and Physics. The study of Riemann Geometry in the relevant literature is performed by using a well defined analytical path. Usually it starts from the…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
Real world data often lie on low-dimensional Riemannian manifolds embedded in high-dimensional spaces. This motivates learning degenerate normalizing flows that map between the ambient space and a low-dimensional latent space. However, if…
Let $\mathcal{H}$ be a reproducing kernel Hilbert space of functions on a set $X$. We study the problem of finding a minimal geodesic of the Grassmann manifold of $\mathcal{H}$ that joins two subspaces consisting of functions which vanish…
In recent years, stochastic variance reduction algorithms have attracted considerable attention for minimizing the average of a large but finite number of loss functions. This paper proposes a novel Riemannian extension of the Euclidean…
We explore the use of tools from Riemannian geometry for the analysis of symmetric positive definite matrices (SPD). An SPD matrix is a versatile data representation that is commonly used in chemical engineering (e.g.,…
Riemannian geometry is a mathematical field which has been the cornerstone of revolutionary scientific discoveries such as the theory of general relativity. Despite early uses in robot design and recent applications for exploiting data with…
Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank…