Estimating Riemannian Metric with Noise-Contaminated Intrinsic Distance
Jiaming Qiu, Xiongtao Dai
摘要
We extend metric learning by studying the Riemannian manifold structure of the underlying data space induced by similarity measures between data points. The key quantity of interest here is the Riemannian metric, which characterizes the Riemannian geometry and defines straight lines and derivatives on the manifold. Being able to estimate the Riemannian metric allows us to gain insights into the underlying manifold and compute geometric features such as the geodesic curves. We model the observed similarity measures as noisy responses generated from a function of the intrinsic geodesic distance between data points. A new local regression approach is proposed to learn the Riemannian metric tensor and its derivatives based on a Taylor expansion for the squared geodesic distances, accommodating different types of data such as continuous, binary, or comparative responses. We develop theoretical foundation for our method by deriving the rates of convergence for the asymptotic bias and variance of the estimated metric tensor. The proposed method is shown to be versatile in simulation studies and real data applications involving taxi trip time in New York City and MNIST digits.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- Learning Flat Latent Manifolds with VAEsNutan Chen, Alexej Klushyn, Francesco Ferroni, Justin Bayer 等ICML 2020 · 被引用 52 次
- Ultrahyperbolic Representation LearningMarc T. Law, Jos StamNeurIPS 2020 · 被引用 28 次
- Latent Graph Inference using Product ManifoldsHaitz Sáez de Ocáriz Borde, Anees Kazi, Federico Barbero, Pietro LiòICLR 2023 · 被引用 1 次
- Differentially Private Geodesic RegressionAditya Kulkarni, Carlos SotoICML 2026
- Neural Bregman Divergences for Distance LearningFred Lu, Edward Raff, Francis FerraroICLR 2023 · 被引用 3 次
