Skip to content

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

Sep 2026 · 0 citations · 71 references
Computer Science Mathematics

TL;DR

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-dimensional Euclidean space.

Abstract

We here develop a functional neural network, termed MatFAE, for learning trajectories on the Riemannian manifold of symmetric positive definite (SPD) matrices. MatFAE features intrinsic layers that map manifold-valued functions to Euclidean vector-valued functions, followed by a functional layer that projects them into a finite-dimensional Euclidean space. Unlike most neural networks for discrete-time sequences, MatFAE treats each sequence as a continuous function and can therefore encode trajectory dynamics (e.g., first-order derivatives) in its latent representations. Additionally, the morphology of the functional weights in the functional layer offers interpretability by revealing the regions of the input functional data that contribute most to the latent representations. We justify the design principles and properties of each intrinsic layer and detail how matrix factorization is handled during backpropagation. We apply MatFAE to a range of fMRI datasets, demonstrating its ability to efficiently learn informative representations from high-dimensional SPD trajectories and its practical value for real-world neuroimaging analysis.

View source

Similar papers

#machine learning Preprint Sep 2026

RW-Flow: One-Step Generation on Compact Manifolds via Wasserstein Gradient Flows

Manifold-valued data, and consequently the distributions they induce, are prevalent across many domains, ranging from the locations of geospatial events, such as earthquakes, to biomolecular torsion angles that encode information about three-dimensional structure. While diffusion and flow-based generative models have b...

Ualibyek Nurgulan, Seungwoo Yoo, Prin Phunyaphibarn et al. · 0 citations
Preprint Aug 2026

Accelerated Learning of High Dimensional Functions with a Tensor-Featured Training Network

This work presents a method to accelerate the optimization of learning high dimensional functions using deep neural network (DNN), and studies the effect of adding features which distill pretrained DNN into TNs using a discretize and decompose strategy.

Karl Pierce, Y. Khoo, Haizhao Yang · 0 citations
Preprint Sep 2026

Approximating Smooth Functionals with ReLU Networks

This is the first work to characterize neural network approximation error for infinite-dimensional functional inputs explicitly through the joint dimensional decay of coordinate magnitudes and directional sensitivities.

Shu-Hao Jiao · 0 citations
2026

Probabilistic Nested Homogeneous Spaces for Dimensionality Reduction

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.

Xi-Ran Fan, B. Vemuri · 0 citations
Preprint Sep 2026

Riemannian Splat Regression Models for Learning Time Fields on Arbitrary Riemannian Manifolds

Motion planning on arbitrary Riemannian manifolds is an important and difficult problem that frustrates typical planning methods for Euclidean spaces. In particular, motion planning methods that approximate optimal time-to-go functions with neural networks, e.g., Neural Time Fields (NTFields), cannot be directly applie...

Anastasios Manganaris, R. Banerjee, Gokul Prabhakaran et al. · 0 citations
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

Related blog posts

GPT-Lab Sep 3, 2026

Adaptive AI Agents in Construction Workflows

Adaptive AI agents can help make BIM data more machine-readable by navigating IFC models, interpreting inconsistent information, and mapping it to defined standards. In this blog, Alok Rawat shares findings from a real-world pilot in construction workflows. The post Adaptive AI Agents in Construction Workflows appeared first on GPT-Lab.

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