Skip to content

Probabilistic Nested Homogeneous Spaces for Dimensionality Reduction

2026 · Proceedings of machine learning research · Vol 282, pp. 1033 - 1047 · 0 citations
Medicine

TL;DR

A novel probabilistic version of the NHS model (PNHS) is presented for dimensionality reduction of high dimensional manifold-valued data in Riemannian homogeneous spaces and has several advantages over its deterministic counterpart namely, the NHS model.

Abstract

Dimensionality reduction is a key ingredient of many machine learning algorithms and is paramount to their success. For manifold-valued data, the nonlinear equivalent of the well-known principal component analysis (PCA), called, principal geodesic analysis (PGA) is used quite often. An alternative to PGA that is more general and flexible, called “Nested Homogeneous Spaces (NHS)” for dimensionality reduction of manifold-valued data was recently introduced. In this paper, we present a novel probabilistic version of the NHS model (PNHS) for dimensionality reduction of high dimensional manifold-valued data in Riemannian homogeneous spaces. The PNHS model has several advantages over its deterministic counterpart namely, the NHS model. In particular, the ability to, quantify uncertainty in parameter estimates and tackle missing data. We demonstrate these advantages via real and synthetic data examples.

View source

Similar papers

Sep 2026

The Geometric Whitney Problem and Approximations by Neural Networks on Manifolds

If a dataset locally looks like a low-dimensional linear space – a condition testable directly from data and derivable from the empirically supported manifold hypothesis under well-behaved conditions – then an approximating manifold M can be constructed and neural networks can approximate C1 functions uniformly on M, w...

Jakob Konstantin Hecker · 0 citations

Geometric Dimensionality Reduction

With a focus on topologically reducing the dimension that data is embedded in, rather than statistically determining the intrinsic dimension of data itself, Geometric Dimensionality Reduction presents a compelling alternate framework to classical compression algorithms.

Daniel Livschitz · 0 citations
Preprint Aug 2026

Efficient Estimation of High Information Projections using Nearest Neighbours

An intuitive method for dimensionality reduction is proposed, which is highly effective for finding interesting projections of multivariate data and aiding the downstream tasks of cluster analysis and outlier detection.

David P. Hofmeyr · 0 citations
#machine learning Preprint Sep 2026

Geometric Feature Learning for Functional Data Valued on the Symmetric Positive Definite Manifold

A functional neural network for learning trajectories on the Riemannian manifold of symmetric positive definite (SPD) matrices, termed MatFAE, which features intrinsic layers that map manifold-valued functions to Euclidean vector-valued functions, followed by a functional layer that projects them into a finite-dimensio...

Samuel V. Singh, Mi-Mi Zhang · 0 citations
Preprint Aug 2026

Convergence analysis of Parametric Probabilistic Manifold Decomposition

A coupled perturbation analysis for the entire PPMD procedure identifies how the principal errors interact and which components limit the accuracy of the nonlinear reduced order model.

Jia-Ming Guo, Dun-Hui Xiao · 0 citations
Preprint Sep 2026

Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances

This paper investigates the numerical resolution of the Beurling-LASSO (BLASSO), a convex optimization framework that promotes sparsity in the space of measures. We consider its application to the estimation of Gaussian mixture models (GMMs) with an unknown number of components and unknown diagonal covariance matrices....

Romane Giard, Y. de Castro, R. Denis et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.