arXiv AI By Marios Papamichalis, Regina Ruane

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

Read the original on arXiv AI →

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."

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

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