Scalable Bayesian inference for heat kernel Gaussian processes on manifolds

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: He, Junhui, Ma, Guoxuan, Kang, Jian, Yang, Ying
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866912586672373760
author He, Junhui
Ma, Guoxuan
Kang, Jian
Yang, Ying
author_facet He, Junhui
Ma, Guoxuan
Kang, Jian
Yang, Ying
contents We establish a scalable manifold learning method and theory, motivated by the problem of estimating fMRI activation manifolds in the Human Connectome Project (HCP). Our primary contribution is the development of an efficient estimation technique for heat kernel Gaussian processes in the exponential family model. This approach handles large sample sizes $n$, preserves the intrinsic geometry of data, and significantly reduces computational complexity from $\mathcal{O}(n^3)$ to $\mathcal{O}(n)$ via a novel reduced-rank approximation of the graph Laplacian's transition matrix and a Truncated Singular Value Decomposition for the eigenpair computation. The numerical experiments demonstrate the scalability and improved accuracy of our method for manifold learning tasks involving complex large-scale data.
format Preprint
id arxiv_https___arxiv_org_abs_2405_13342
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Scalable Bayesian inference for heat kernel Gaussian processes on manifolds
He, Junhui
Ma, Guoxuan
Kang, Jian
Yang, Ying
Methodology
Statistics Theory
We establish a scalable manifold learning method and theory, motivated by the problem of estimating fMRI activation manifolds in the Human Connectome Project (HCP). Our primary contribution is the development of an efficient estimation technique for heat kernel Gaussian processes in the exponential family model. This approach handles large sample sizes $n$, preserves the intrinsic geometry of data, and significantly reduces computational complexity from $\mathcal{O}(n^3)$ to $\mathcal{O}(n)$ via a novel reduced-rank approximation of the graph Laplacian's transition matrix and a Truncated Singular Value Decomposition for the eigenpair computation. The numerical experiments demonstrate the scalability and improved accuracy of our method for manifold learning tasks involving complex large-scale data.
title Scalable Bayesian inference for heat kernel Gaussian processes on manifolds
topic Methodology
Statistics Theory
url https://arxiv.org/abs/2405.13342