arXiv Machine Learning

Learning Submanifolds for Subsequent Inference on Random Dot Product Graphs, Part 1: Theory

The paper introduces a framework for restricted inference on random dot product graphs whose latent positions lie on an unknown low‑dimensional support manifold. It proposes semisupervised decision rules that employ Isomap manifold learning to build a low‑dimensional Euclidean representation of the observed graph, and then apply an isometrically invariant function to map point configurations to actions. The authors analyze how the risk of these rules converges to that of an oracle rule as the amount of auxiliary data sampled from the manifold increases.

arXiv Machine Learning
Aug 20

Learning Random Geometric Graphs Drawn in Probabilistic Metric Spaces

The paper introduces a data‑driven method for learning Random Geometric Graphs (RGGs) in probabilistic metric spaces. It defines a distance function based on the cumulative distribution of a disparity variable that captures differences in vertex connectivity and correlation of attached random variables, enabling edges to exist with a specified probability. The approach includes a rejection‑sampling technique for edge probability estimation and a closed‑form posterior for learning the inter‑observable correlation matrix, and it is demonstrated on highly multivariate real datasets.

By Dalia Chakrabarty, Kangrui Wang, Chuqiao Zhang, Ye Liu
arXiv Machine Learning
Aug 10

Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions

arXiv:2409. 18804v3 Announce Type: replace-cross Abstract: Denoising Diffusion Probabilistic Models (DDPM) are powerful state-of-the-art methods used to generate synthetic data from high-dimensional data distributions and are widely used for image, audio, and video generation as well as many more applications in science and beyond.

By Iskander Azangulov, George Deligiannidis, Judith Rousseau
arXiv Machine Learning
Sep 7

Nested Inductive Bias Framework for SPD Manifold Learning

The paper introduces a Nested Inductive Bias framework that uses a two‑stage diffeomorphic composition to pull back non‑Euclidean target geometries onto symmetric positive definite (SPD) manifolds. This approach allows the construction of curvature‑aligned Riemannian classifiers that respect both matrix constraints and the intrinsic relational geometry of data. Empirical results on kinematic, signal processing, and synthetic benchmarks show that class separability degrades when metric curvature does not match the data distribution, and the authors also propose the Rational Conformal Metric (RCM) for robust vectorized architectures.

By Tushar Das
arXiv Machine Learning
Jul 14

Riemannian Denoising Diffusion Probabilistic Models

arXiv:2505. 04338v3 Announce Type: replace Abstract: We propose Riemannian Denoising Diffusion Probabilistic Models (RDDPMs) for learning distributions on submanifolds of Euclidean space that are level sets of functions, including most of the manifolds relevant to applications.

By Zichen Liu, Wei Zhang, Christof Sch\"utte, Tiejun Li