analiza aiqbench
This research establishes theoretical guarantees for recovering true latent factors in nonlinear Independent Component Analysis (nICA) when sources exhibit specific non-smoothness, such as kinks found in Laplace distributions. The findings demonstrate that standard generative models using real analytic activations can achieve exact identifiability under these conditions, offering a pathway to more interpretable AI systems for complex data like images and financial time series.
Kinks vs. Smoothness: Identifiability of Real Analytic nICA for Laplace-like Sources
arXiv:2609.21926v1 Announce Type: new 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.
Title:Kinks vs. Smoothness: Identifiability of Real Analytic nICA for Laplace-like Sources
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.
Machine Learning (cs.LG)
arXiv:2609.21926 [cs.LG]
(or arXiv:2609.21926v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.21926 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 287 cuvinte
Subiecte conexe

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · 24 sept. 2026

NBCUniversal’s Seamless Migration: Unlocking Scalable Analytics with Databricks
Databricks · 29 iul. 2026

Vertical Advantage: Transforming Industries with Lakebase and Agentic AI
Databricks · 27 aug. 2026

Why do models task game?
AI Alignment Forum · 6 aug. 2026