Riemannian
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Metric-Free Riemannian Optimization
Announce Type: cross Abstract: Riemannian optimization provides a powerful framework for constrained optimization by incorporating problem-specific structure directly into the geometry of the search space. In many applications, however, the explicit evaluation or application of the Riemannian metric can be computationally expensive or numerically unstable, limiting the practical efficiency of otherwise well-founded algorithms. Motivated by such settings, this work investigates to what extent...
Decentralized Online Riemannian Optimization Beyond Hadamard Manifolds
arXiv:2509.07779v2 Announce Type: replace-cross Abstract: We study decentralized online Riemannian optimization over manifolds with possibly positive curvature, going beyond the Hadamard manifold setting. Decentralized optimization techniques rely on a consensus step that is well understood in Euclidean spaces because of their linearity. However, in positively curved Riemannian spaces, a main technical challenge is that geodesic distances may not induce a globally convex structure.
Barycentric Projections of Optimal Transport Plans on Riemannian Manifolds
Announce Type: cross Abstract: Optimal transport couplings are probabilistic objects, while many learning pipelines require deterministic maps. In Euclidean space, barycentric projection converts a coupling into a map by taking conditional expectations, but on a Riemannian manifold curvature and cut loci make this operation nontrivial. We develop a framework for barycentric projections of transport couplings on Riemannian manifolds.
Post-processed frozen-flow methods for the long time sampling of ergodic dynamics on Riemannian manifolds
Announce Type: new Abstract: In this work, we propose a novel intrinsic approach to the approximation of ergodic SDEs on Riemannian manifolds, which include Riemannian Langevin dynamics. In opposition to the standard extrinsic approaches such as penalization methods and projection methods, our methodology does not use embeddings or coordinates and only relies on natural geometric operations: geodesics, parallel transport,... We give a criterion for high order of accuracy for the invariant...
Riemannian Optimization for Hadamard Products of Low-Rank Matrices
arXiv:2606.01216v1 Announce Type: new Abstract: The elementwise Hadamard product of two low-rank matrices provides a parameter-efficient model for data with multiplicative structure, but its modeling is challenging due to the presence of additional symmetries under coupled row/column scalings between the two factors. In order to leverage the geometry of the space, we formulate the learning of such matrices as optimization on a Riemannian quotient manifold. We propose a novel block-diagonal...
Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds
arXiv:2606.02879v1 Announce Type: new Abstract: Informed sampling techniques accelerate sampling-based motion planners by focusing the search on promising regions of the state space, yet most existing methods rely on Euclidean heuristics that become inadmissible under configuration-dependent Riemannian metrics. While scalar eigenvalue bounds restore admissibility by uniformly scaling the Euclidean distance, they discard the directional structure of the metric, producing overly conservative...
Knowledge Manifold: A Riemannian Geometric Framework for Semantic Mapping and Geodesic Analysis of Scientific Literature
arXiv:2606.05907v1 Announce Type: new Abstract: We present the knowledge manifold: a Riemannian geometric space in which a corpus of documents is arranged according to semantic positional relationships derived from character n-gram TF-IDF representations. The framework proceeds in five tightly coupled stages. First, each document is converted to a character-level n-gram TF-IDF vector (4-7 grams, up to 250,000 features, L2-normalized) and embedded in a two-dimensional knowledge map via...
Learning from Demonstrations over Riemannian Manifolds using Neural ODEs: An Extended Abstract
Announce Type: new Abstract: Learning from demonstratins (LfD) is usually performed over Euclidean spaces, while the robot state, e.g. orientation, naturally evolves over curved spaces. Therefore, to ensure natural, complex motion generation, we investigate learning from demonstrations over Riemannian manifolds that are capable of encoding both position and orientation data.
Geodesic Semantic Search: Cartographic Navigation of Citation Graphs with Learned Local Riemannian Maps
arXiv:2602.23665v5 Announce Type: replace Abstract: We present Geodesic Semantic Search (GSS), a retrieval system that learns node-specific Riemannian metrics on citation graphs to enable geometry-aware semantic search. Unlike standard embedding-based retrieval that relies on fixed Euclidean distances, \gss{} learns a low-rank metric tensor $\mL_i \in \R^{d \times r}$ at each node, inducing a local positive semi-definite metric $\mG_i = \mL_i \mL_i^\top + \eps \mI$.
Inversion-Free Natural Gradient Descent on Riemannian Manifolds
arXiv:2604.02969v2 Announce Type: replace-cross Abstract: The natural gradient method is a central tool for statistical optimisation, but its broader application is hindered by the assumption of a Euclidean parameter space, the repeated estimation of the Fisher information matrix (FIM), and the computational cost of its subsequent inversion. This paper proposes an intrinsic, inversion-free natural gradient method for statistical models whose parameters lie on general Riemannian manifolds....