cs.LGSep 18, 2026

Kinks vs. Smoothness: Identifiability of Real Analytic nICA for Laplace-like Sources

Authors: Isaac Manring, Kejun Huang

Organizations: Department of Computer Science University of Florida Gainesville, FL 32611, USA

Abstract

Many machine learning systems try to explain complex data - like images or financial time series - in terms of hidden, independent factors that generated them. Recovering the true underlying factors, rather than some scrambled version of them, is the central challenge of nonlinear Independent Component Analysis (nICA). We prove identifiability (exact recovery) up to trivial ambiguities for real analytic generating functions when source probability density functions have a finite number of discontinuities in the first derivative. The Laplace distribution is the most prominent example satisfying this assumption. Our proof relies on the contrast between kinks in the source distribution and the smoothness of real analytic functions. Real analytic functions comprise a broad class of generating mechanisms, and can be approximated with Normalizing Flows or Variational Autoencoders with standard activation functions (e.g., tanh, softplus, GELU), so our result applies with minimal changes to existing training pipelines. We perform experiments on real and synthetic data with both Normalizing Flows and Variational Auto-Encoders demonstrating their identifiability properties. In experiments on CelebA data we recover several interpretable latent factors controlling unique attributes across the dataset.

Figures & tables

Appendix figures & tables8 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Foundations of Independent Component Analysis

    Aug 13, 2026Patrick ForréIndependent Component AnalysisIdentifiability

  2. Provable Affine Identifiability of Nonlinear CCA under Latent Distributional Priors

    Oct 6, 2025Zhiwei Han, Stefan Matthes, Hao ShenIndependent Component AnalysisIdentifiability

  3. Unsupervised Disentanglement Without Compromises : How Functional Orthogonality Enforces Identifiability

    Jun 19, 2026Mathieu Cyrille Simon, Pascal Frossard, Christophe De VleeschouwerIdentifiabilityOrthogonality