paper-with-me

홈 › Papers

Disentanglement Beyond Generative Models with Riemannian ICA

2026-05-21 · Edmond Cunningham arxiv

There is a gap between the theoretical foundations of disentanglement and the practice of modern representation learning. Existing theoretical frameworks, particularly Independent Component Analysis (ICA) and its nonlinear variants, assume a generative model with statistically independent latent variables underlying the data so that disentanglement amounts to identifying the latents that could have generated the data. This generative framework is interpretable and theoretically justified, but its strong assumptions make it difficult to apply to modern representation learning. Modern pretrained encoders often learn features that exhibit disentangled properties without making generative assumptions, yet there is no general theory for interpreting these features as independent factors of variation. We take a step toward such a theory by introducing Riemannian ICA (RICA), which replaces ICA's global generative model with local geometric structure. RICA is founded on the observation that in ICA, the factors of variation underlying a data point can be understood through radial curves emanating from the point that map to axis-aligned lines in the latent space. We formalize this perspective using Riemannian geometry and introduce our theory in a way that is consistent with the existing generative approach. Our main contribution is the disentanglement tensor, which encodes a second-order notion of disentanglement that we call pointwise disentanglement. This tensor depends on the Hessian of the data log likelihood as well as the Ricci curvature induced by the model. In a controlled source recovery setting with known ground-truth sources, RICA recovers sources across several manifolds, while the success of ICA baselines depends on the coordinates used to represent the observations. Our work provides a theoretical basis for studying local disentanglement without assuming a global generative model.

📄 PDF Abstract BibTeX arXiv:2605.22531

Code (0)

등록된 구현이 없습니다.

Tasks

Representation Learning

Similar Papers 제목 키워드 기반

Riemannian Diffusion Schrödinger Bridge

2022-07-07 · James Thornton, Michael Hutchinson, Emile Mathieu, Valentin De Bortoli 외

Score-based generative models exhibit state of the art performance on density estimation and generative modeling tasks. These models typically assume that the data geometry is flat, yet recent extensions have been develo…

Density Estimation

Riemannian Metric Learning: Closer to You than You Imagine

2025-03-07 · Samuel Gruffaz, Josua Sassen

Riemannian metric learning is an emerging field in machine learning, unlocking new ways to encode complex data structures beyond traditional distance metric learning. While classical approaches rely on global distances i…

Causal InferenceMetric LearningRepresentation Learning

Sampling from multi-modal distributions on Riemannian manifolds with training-free stochastic interpolants

2026-01-31 · Alain Durmus, Maxence Noble, Thibaut Pellerin arxiv

In this paper, we propose a general methodology for sampling from un-normalized densities defined on Riemannian manifolds, with a particular focus on multi-modal targets that remain challenging for existing sampling meth…

Disentangling Speaker Traits for Deepfake Source Verification via Chebyshev Polynomial and Riemannian Metric Learning

2026-03-23 · Xi Xuan, Wenxin Zhang, Zhiyu Li, Jennifer Williams 외 arxiv

Speech deepfake source verification systems aims to determine whether two synthetic speech utterances originate from the same source generator, often assuming that the resulting source embeddings are independent of speak…

Metric Learning

Decentralized Online Riemannian Optimization Beyond Hadamard Manifolds

2025-09-09 · Emre Sahinoglu, Shahin Shahrampour arxiv

We study decentralized online Riemannian optimization over manifolds with possibly positive curvature, going beyond the Hadamard manifold setting. Decentralized optimization techniques rely on a consensus step that is we…