mlsanityData to 14 Oct 2026

Beyond Unimodal Bases: Pullback Geometry for Multimodal Data

arXiv 2610.00708 ↗First posted 30 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Data-driven Riemannian geometry provides nonlinear interpolation and geometric representations of high-dimensional data. For these operations to be statistically meaningful, paths between observations should preferentially traverse high-likelihood regions. Existing scalable pullback constructions typically use a unimodal Gaussian latent distribution, assuming that the data reside close to a single manifold. For multimodal data, mapping separated modes or local structures into one Gaussian region can require substantial transport deformation and compromise the resulting geometry. We introduce a pullback geometry for data supported on mixtures of manifolds. Using a latent Gaussian mixture, we define its Riemannian metric as the matrix square of the responsibility-weighted expected component precision. The metric is smooth and positive definite and recovers the existing Gaussian construction in the single-component limit. For structured overlapping mixtures, we establish conditions under which the log-density is concave along geodesics, providing a formal connection between the proposed geometry and paths through high-likelihood regions, and derive the corresponding local curvature relations. We instantiate this geometry in a normalizing flow with adaptive mixture learning, allowing the number of active components to emerge from the data and supporting component-wise reconstruction and local effective-dimension estimation. Experiments on synthetic geometric data, a controlled multi-view image setting with a known reference trajectory, and MNIST show reduced transport distortion, competitive path support, close reference-trajectory recovery, and improved interpolation realism. These results extend scalable pullback geometry beyond datasets that reside close to a single manifold while retaining tractable and interpretable local structure.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 18 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

12 of 18 references.

References · 12

  1. 2016Density estimation using Real NVPcited by 2,042
  2. 2016Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoderscited by 220
  3. 2017Latent Space Oddity: on the Curvature of Deep Generative Modelscited by 174
  4. 2017The Riemannian Geometry of Deep Generative Modelscited by 82
  5. 2019Semi-Supervised Learning with Normalizing Flowscited by 76
  6. 2024Pulling back symmetric Riemannian geometry for data analysiscited by 8
  7. 2023GC-Flow: A Graph-Based Flow Network for Effective Clusteringcited by 5
  8. 2025Manifold Learning with Normalizing Flows: Towards Regularity, Expressivity and Iso-Riemannian Geometrycited by 5
  9. 2025Iso-Riemannian Optimization on Learned Data Manifoldscited by 4
  10. 2025Learning Geometry and Topology via Multi-Chart Flowscited by 3
  11. 2026Riemannian Metric Matching for Scalable Geometric Modeling of Distributionscited by 2
  12. 2026Riemannian Archetypal Analysis: Interpretable non-linear data analysis on deformed star distributionscited by 1

Built on by

Not cited yet.