English
Related papers

Related papers: Identifying latent distances with Finslerian geome…

200 papers

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…

Machine Learning · Computer Science 2025-03-17 JuneYoung Park , YuMi Lee , Tae-Joon Kim , Jang-Hwan Choi

A methodology is developed for data analysis based on empirically constructed geodesic metric spaces. For a probability distribution, the length along a path between two points can be defined as the amount of probability mass accumulated…

Statistics Theory · Mathematics 2019-03-18 Kei Kobayashi , Henry P. Wynn

We present $\texttt{LAMINAR}$, a novel unsupervised machine learning pipeline designed to enhance the representation of structure within data via producing a more-informative distance metric. Analysis methods in the physical sciences often…

Machine Learning · Computer Science 2024-11-14 Christian Kleiber , William H. Oliver , Tobias Buck

A common approach to modeling networks assigns each node to a position on a low-dimensional manifold where distance is inversely proportional to connection likelihood. More positive manifold curvature encourages more and tighter…

Methodology · Statistics 2023-01-03 Shane Lubold , Arun G. Chandrasekhar , Tyler H. McCormick

In this paper the space of images is considered as a Riemannian manifold using the metamorphosis approach, where the underlying Riemannian metric simultaneously measures the cost of image transport and intensity variation. A robust and…

Numerical Analysis · Mathematics 2015-05-28 Benjamin Berkels , Alexander Effland , Martin Rumpf

Classical archetypal analysis is appealing for its interpretability, but its linear geometry can limit performance on data with strongly non-linear structure; at the same time, existing neural extensions improve flexibility while often…

Machine Learning · Computer Science 2026-05-26 Willem Diepeveen , Deanna Needell

In this paper, we propose a method to learn a minimizing geodesic within a data manifold. Along the learned geodesic, our method can generate high-quality interpolations between two given data samples. Specifically, we use an autoencoder…

Computer Vision and Pattern Recognition · Computer Science 2020-08-17 Cong Geng , Jia Wang , Li Chen , Wenbo Bao , Chu Chu , Zhiyong Gao

Modern generative modeling methods have demonstrated strong performance in learning complex data distributions from clean samples. In many scientific and imaging applications, however, clean samples are unavailable, and only noisy or…

Machine Learning · Computer Science 2026-05-29 Willem Diepeveen , Oscar Leong

In this paper we study the local linearization of the Hellinger--Kantorovich distance via its Riemannian structure. We give explicit expressions for the logarithmic and exponential map and identify a suitable notion of a Riemannian inner…

Optimization and Control · Mathematics 2021-09-27 Tianji Cai , Junyi Cheng , Bernhard Schmitzer , Matthew Thorpe

Consider the sum of the first $N$ eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for $N$ sufficiently large the map is an embedding. In analogy with a fruitful idea of…

Differential Geometry · Mathematics 2014-04-30 Eric Potash

We first introduce a class of divergence measures between power spectral density matrices. These are derived by comparing the suitability of different models in the context of optimal prediction. Distances between "infinitesimally close"…

Optimization and Control · Mathematics 2016-11-18 Xianhua Jiang , Lipeng Ning , Tryphon T. Georgiou

We find geodesics, shortest arcs, cut loci, first conjugate loci, distances between arbitrary elements for some left-invariant sub-Riemannian metrics on the Lie groups $SU(2)\times\mathbb{R}$ and $SO(3)\times\mathbb{R}$.

Differential Geometry · Mathematics 2023-06-13 Irina Zubareva

A linear connection on a Finsler manifold is called compatible to the metric if its parallel transports preserve the Finslerian length of tangent vectors. Generalized Berwald manifolds are Finsler manifolds equipped with a compatible linear…

Differential Geometry · Mathematics 2020-01-14 Csaba Vincze , Márk Oláh

Decentralized optimization on Riemannian manifolds is foundational for many modern machine learning and signal processing applications in which data are non-Euclidean and generated and processed in a distributed manner. Although intrinsic…

Optimization and Control · Mathematics 2026-03-19 Duc Toan Nguyen , César A. Uribe

A recently proposed class of models attempts to learn latent dynamics from high-dimensional observations, like images, using priors informed by Hamiltonian mechanics. While these models have important potential applications in areas like…

Machine Learning · Statistics 2021-11-12 Irina Higgins , Peter Wirnsberger , Andrew Jaegle , Aleksandar Botev

Let $V$ be a separable Hilbert space, possibly infinite dimensional. Let $\St(p,V)$ be the Stiefel manifold of orthonormal frames of $p$ vectors in $V$, and let $\Gr(p,V)$ be the Grassmann manifold of $p$ dimensional subspaces of $V$. We…

Differential Geometry · Mathematics 2018-09-28 Philipp Harms , Andrea C. G. Mennucci

In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. We quantify their rates of convergence and produce different…

Optimization and Control · Mathematics 2024-03-18 David Martínez-Rubio , Christophe Roux , Sebastian Pokutta

We investigate the rudiments of Riemannian geometry on orbit spaces $M/G$ for isometric proper actions of Lie groups on Riemannian manifolds. Minimal geodesic arcs are length minimising curves in the metric space $M/G$ and they can hit…

Differential Geometry · Mathematics 2007-05-23 Dmitry Alekseevsky , Andreas Kriegl , Mark Losik , Peter W. Michor

We study the properties of stochastic approximation applied to a tame nondifferentiable function subject to constraints defined by a Riemannian manifold. The objective landscape of tame functions, arising in o-minimal topology extended to a…

Machine Learning · Computer Science 2025-08-13 Johannes Aspman , Vyacheslav Kungurtsev , Reza Roohi Seraji

In many real-world applications data come as discrete metric spaces sampled around 1-dimensional filamentary structures that can be seen as metric graphs. In this paper we address the metric reconstruction problem of such filamentary…

Computational Geometry · Computer Science 2013-05-07 Frédéric Chazal , Jian Sun