arXiv Computer Vision

Stochastic Separability of Embedding Manifolds

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
Jul 14

Sharp Concentration Bounds for Bundle-Valued Statistics on Manifolds

arXiv:2607. 10592v1 Announce Type: new Abstract: Many geometric statistics and manifold learning pipelines routinely produce observations -- such as tangent vectors or local frames -- whose natural home is a varying family of fibers attached to different points of a base manifold, rather than a single shared vector space.

By Swagatam Das, Vaclav Snasel
arXiv AI
Aug 24

SPD Matrix Learning for Neuroimaging Analysis: Perspectives, Methods, and Challenges

This review discusses how neuroimaging data can be represented as symmetric positive-definite (SPD) matrices and analyzed using the Riemannian geometry of the SPD manifold. It surveys the evolution from modality-specific SPD representations to geometric shallow and deep learning methods, emphasizing how these approaches maintain structural constraints while integrating modern AI techniques. The paper frames SPD matrix learning as a bridge between classical geometric statistics and contemporary machine learning in neuroimaging and brain‑computer interface research.

By Ce Ju, Reinmar Kobler, Antoine Collas, Motoaki Kawanabe, Cuntai Guan, Bertrand Thirion
arXiv Machine Learning
Sep 7

Relocation of compact sets in $\mathbb{R}^n$ by diffeomorphisms and linear separability of datasets in $\mathbb{R}^n$

The paper develops a theory for relocating a finite number of compact sets in ℝ^n to arbitrary target domains using diffeomorphisms of ℝ^n. It proves that any such collection can be embedded differentiably into ℝ^{n+1} so that the images become linearly separable. The authors apply this result to show that compact datasets in ℝ^n can be made linearly separable by width‑n deep neural networks with Leaky‑ReLU, ELU, or SELU activations, and that mutually disjoint compact datasets can be separated in ℝ^{n+1} by a width‑(n+1) DNN.

By Xiao-Song Yang, Xuan Zhou, Qi Zhou