Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

146291437582 · Jun 202019922001200920172026
48 results for Riemannian computing

We provide the first experimental results on non-synthetic datasets for the quasi-diagonal Riemannian gradient descents for neural networks introduced in [Ollivier, 2015]. These include the MNIST, SVHN, and FACE datasets as well as a previously unpublished electroencephalogram dataset. The quasi-diagonal Riemannian alg…

2016-02-25abs ↗pdf ↗

RieCUR improves Robust PCA by combining Riemannian optimization and CUR decompositions.

problem Robust Principal Component Analysis (PCA) to recover low-rank and sparse matrices from their sum.
method Riemannian CUR (RieCUR) algorithm that combines Riemannian optimization and robust CUR decompositions.
result RieCUR achieves state-of-the-art performance in Robust PCA with improved robustness to outliers and comparable computational complexity.

We introduce a new approach for computing curvature of sub-Riemannian manifolds. Curvature is here meant as symplectic invariants of Jacobi curves of geodesics, as introduced by Zelenko and Li. We describe how they can be expressed using a compatible affine connection and induced tensors, without any restriction on our…

2020-01-12abs ↗pdf ↗

Paper proposes a method to classify EEG signals with missing data.

problem Handling missing data in electroencephalogram (EEG) signals for classification.
method Uses an expectation-maximization algorithm with observed-data likelihood to compute covariance matrices, compares to imputed data and Riemannian averages.
result The proposed method generally performs better than existing methods on real EEG data.

Paper presents efficient computation of robust Wasserstein distance using Riemannian optimization.

problem Intractability of optimizing Projection Robust Wasserstein (PRW) distance due to non-convexity and non-smoothness.
method Riemannian optimization to efficiently compute PRW/Wasserstein Projection Pursuit (WPP) distance.
result The original formulation of PRW/WPP can be efficiently computed in practice, providing better behavior than its convex relaxation.

Let (M,g)(M,g) be a Riemannian manifold, L(M)L(M) its frame bundle. We construct new examples of Riemannian metrics on L(M)L(M), which are obtained from Riemannian metrics on the tangent bundle TMTM. We compute the Levi--Civita connection and curvatures of these metrics.

2012-05-04abs ↗pdf ↗

Shape analysis and compuational anatomy both make use of sophisticated tools from infinite-dimensional differential manifolds and Riemannian geometry on spaces of functions. While comprehensive references for the mathematical foundations exist, it is sometimes difficult to gain an overview how differential geometry and…

2018-07-30abs ↗pdf ↗

Neural networks learn discrete tasks on continuous data via emergent geometry.

problem Understanding how neural networks perform discrete computations on continuous data.
method Analysis of Riemannian pullback metric across neural network layers.
result Neural networks learn to discretize continuous inputs and perform logical operations on these discretized variables.

Study uniquely determines Riemannian metric derivatives from boundary data.

problem Determining Riemannian metric derivatives from boundary data.
method Computing the full symbol of the elastic Dirichlet-to-Neumann map.
result The elastic Dirichlet-to-Neumann map uniquely determines all partial derivatives of the Riemannian metric on the boundary.

Study on properties of tangential hypersurfaces in product-like manifolds.

problem Investigating properties of tangential hypersurfaces in product-like manifolds.
method Analyzing basic properties and computing curvature tensor relations.
result Computed relations involving the Riemannian curvature tensor of tangential hypersurfaces.

The Riemannian barycentre is one of the most widely used statistical descriptors for probability distributions on Riemannian manifolds. At present, existing algorithms are able to compute the Riemannian barycentre of a probability distribution, only if i.i.d. samples of this distribution are readily available. However,…

2019-08-23abs ↗pdf ↗

Study geodesic complexity in homogeneous Riemannian manifolds.

problem Geodesic motion planning and complexity in homogeneous Riemannian manifolds.
method Riemannian geometry, stratifications of cut loci, and properties of homogeneous manifolds.
result Established new bounds on geodesic complexity and computed its value for homogeneous Riemannian manifolds.

Study geodesic curves on Heisenberg group, classify them, and compute first step of quadrature.

problem Classifying geodesic curves on the Heisenberg group.
method Completely integrable Hamiltonian system, classification of geodesic curves.
result Complete classification of geodesic curves on the Heisenberg group.

Riemannian geometry improves protein dynamics analysis.

problem Efficient analysis of protein dynamics data in non-linear spaces.
method Developed a local approximation technique for geodesics and a smooth manifold of protein conformations.
result Geodesics approximate molecular dynamics trajectories and provide realistic summary statistics.

We compare different notions of curvature on contact sub-Riemannian manifolds. In particular we introduce canonical curvatures as the coefficients of the sub-Riemannian Jacobi equation. The main result is that all these coefficients are encoded in the asymptotic expansion of the horizontal derivatives of the sub-Rieman…

2015-05-17abs ↗pdf ↗

In the previous paper [GLM2018], we showed that the theory of harmonic maps between Riemannian manifolds may be discretized by introducing triangulations with vertex and edge weights on the domain manifold. In the present paper, we study convergence of the discrete theory to the smooth theory when taking finer and fine…

2019-10-17abs ↗pdf ↗

The analysis of manifold-valued data requires efficient tools from Riemannian geometry to cope with the computational complexity at stake. This complexity arises from the always-increasing dimension of the data, and the absence of closed-form expressions to basic operations such as the Riemannian logarithm. In this pap…

2017-11-23abs ↗pdf ↗

New formulas for geodesics on Stiefel and flag manifolds using trust-region method.

problem Computing geodesics and logarithms on Stiefel and flag manifolds.
method Closed-form geodesic formulas, trust-region solver, Fréchet derivatives.
result Efficient computation of geodesic distance and logarithm map.

Study finds conditions for existence of specific pseudo-Riemannian cobordisms.

problem Existence of Spin(n+1)(n+1)-dimensional cobordisms with specific signature.
method Analyzes Spin(n+1)(n+1)-dimensional cobordisms with signature (2,n1)(2, n-1).
result Computes cobordism groups and necessary/sufficient conditions for existence.

Control Contraction Metrics (CCMs) provide a nonlinear controller design involving an offline search for a Riemannian metric and an online search for a shortest path between the current and desired trajectories. In this paper, we generalize CCMs to Finsler geometry, allowing the use of non-Riemannian metrics. We provid…

2018-03-02abs ↗pdf ↗

It is explained how to find the de~Rham decomposition of a Riemannian manifold and the Wu decomposition of a Lorentzian manifold. For that it is enough to find parallel symmetric bilinear forms on the manifold, and do some linear algebra. This result will allow to compute the connected holonomy group of an arbitrary Ri…

2016-11-04abs ↗pdf ↗

Develops Riemannian geometry for optimization on manifolds with detailed derivations.

problem Abstract high-level optimization on nonlinear spaces like matrix manifolds.
method Systematic derivation of geometric structures and constructions in coordinates and matrix form.
result Unified treatment of Riemannian geometry for optimization on manifolds.

Paper derives sub-Riemannian versions of Kastler-Kalau-Walze and Dabrowski-Sitarz-Zalecki theorems for twisted BCV spaces.

problem Deriving sub-Riemannian versions of the Kastler-Kalau-Walze and Dabrowski-Sitarz-Zalecki theorems for twisted BCV spaces.
method Derives sub-Riemannian versions of the Kastler-Kalau-Walze and Dabrowski-Sitarz-Zalecki theorems for the twisted BCV spaces.
result Computes Connes conformal invariants for the twisted product and sub-Riemannian limits of these invariants for the twisted BCV spaces.

Consider the sum of the first NN eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for NN sufficiently large the map is an embedding. In analogy with a fruitful idea of Kähler geometry, we define (Riemannian) Bergman metrics of degree NN to be thos…

2013-10-18abs ↗pdf ↗

Study of Riemannian geometry on quaternionic unit ball linked to Sp(1,1) group.

problem Understanding the geometry induced by slice Riemannian metric.
method Developed Lie theoretic study, computed isometry group, compared with quaternionic Poincaré geometry.
result Isometry group of slice Riemannian metric is built from symmetries of Sp(1,1) group.

New metrics defined for full-rank correlation matrices, ensuring unique operations.

problem No suitable problem statement as the abstract does not describe a problem to be solved.
method New Riemannian metrics defined on full-rank correlation matrices, providing unique operations.
result Unique Riemannian logarithm and Fréchet mean defined for full-rank correlation matrices.

Researchers calculate entropy of heat kernel on manifolds for very small times.

problem Estimating entropy of heat kernel on compact Riemannian manifolds for small times.
method Asymptotic expansion, polynomial expressions in curvature tensor components.
result First three coefficients of entropy expansion computed and expressed as polynomials.