arXiv AI

Radial Compensation: The Inverse Base-Distribution Problem for Chart-Based Generative Models on Riemannian Manifolds

The paper addresses a flaw in latent‑variable generative models on Riemannian manifolds such as spheres and hyperbolic spaces, where the usual practice of sampling a Gaussian in a tangent space and mapping it onto the manifold inadvertently imposes a fixed chi‑distribution on distances from a base point. The authors formulate and solve the inverse problem: given a desired distance distribution, they derive the exact tangent‑space density that yields it, prove its uniqueness for isotropic, chart‑independent likelihoods, and provide a lower bound on the cost of ignoring this issue in variational autoencoders. Experiments with exact normalization audits show that the compensated prior is chart‑invariant, stable across scales, and leads to significant improvements in curvature recovery and protein‑orientation likelihoods. whyItMatters":"By correcting the implicit distance distribution, the method enables more accurate and stable generative modeling on curved spaces, directly improving performance on tasks such as protein orientation."

arXiv AI
Sep 18

Spherical Cauchy Variational Autoencoders: Heavy Angular Tails and Exact KL Evaluation

The paper introduces the spherical Cauchy distribution as a new hyperspherical posterior for variational autoencoders, avoiding the complications of the von Mises–Fisher and Power Spherical alternatives. By using stereographic projection and a Möbius transformation, the authors obtain exact posterior samples and a closed‑form KL divergence that terminates in a finite polynomial for even dimensions and admits certified truncation for odd dimensions. Empirical results show that the spherical Cauchy yields faster inference and lower reconstruction loss on MNIST and improved negative log‑likelihood on smallNORB compared to existing methods.

By Lukas Sablica, Kurt Hornik
arXiv Machine Learning
Sep 21

Beyond Gaussian Worlds: Latent Geometry Matters for JEPAs

The paper extends the analysis of Joint-Embedding Predictive Architectures (JEPAs) beyond Euclidean latent spaces to Riemannian manifolds. It shows that when latent variables lie on a sphere and the target distribution matches this spherical geometry, every optimal representation recovers the latent state up to an orthogonal transformation, demonstrating that Gaussian uniqueness is not universal. Experiments confirm that geometrically compatible targets improve linear recovery, especially in high-dimensional toroidal settings.

By L\'eo Nicollier (CB, ATT), Enric Meinhardt-Llopis (CB), Marc Pic (ATT), Pablo Mus\'e (CB, IFUMI), Gabriele Facciolo (CB)
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