Beyond independent component analysis: identifiability and algorithms

• URL: http://arxiv.org/abs/2510.07525v1
• Date: Wed, 08 Oct 2025 20:38:56 GMT
• Title: Beyond independent component analysis: identifiability and algorithms
• Authors: Alvaro Ribot, Anna Seigal, Piotr Zwiernik,
• Abstract summary: We show that pairwise mean independence answers the question of how much one can relax independence.<n>Our results apply to distributions with the required zero pattern at any cumulant tensor.
• Score: 0.8793721044482612
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Independent Component Analysis (ICA) is a classical method for recovering latent variables with useful identifiability properties. For independent variables, cumulant tensors are diagonal; relaxing independence yields tensors whose zero structure generalizes diagonality. These models have been the subject of recent work in non-independent component analysis. We show that pairwise mean independence answers the question of how much one can relax independence: it is identifiable, any weaker notion is non-identifiable, and it contains the models previously studied as special cases. Our results apply to distributions with the required zero pattern at any cumulant tensor. We propose an algebraic recovery algorithm based on least-squares optimization over the orthogonal group. Simulations highlight robustness: enforcing full independence can harm estimation, while pairwise mean independence enables more stable recovery. These findings extend the classical ICA framework and provide a rigorous basis for blind source separation beyond independence.

Related papers

• Meta-Dependence in Conditional Independence Testing [11.302018782958205]
  We study a "meta-dependence" between conditional independence properties using the following geometric intuition.<n>We provide a simple-to-compute measure of this meta-dependence using information projections and consolidate our findings empirically using both synthetic and real-world data.
  arXiv  Detail & Related papers  (2025-04-17T02:41:22Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
  This work introduces a novel principle for disentanglement we call mechanism sparsity regularization. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors. We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
  arXiv  Detail & Related papers  (2024-01-10T02:38:21Z)
• Non-Parametric Inference of Relational Dependence [17.76905154531867]
  This work examines the problem of estimating independence in data drawn from relational systems. We propose a consistent, non-parametric, scalable kernel test to operationalize the relational independence test for non-i.i.d. observational data.
  arXiv  Detail & Related papers  (2022-06-30T03:42:20Z)
• On the Identifiability of Nonlinear ICA: Sparsity and Beyond [20.644375143901488]
  How to make the nonlinear ICA model identifiable up to certain trivial indeterminacies is a long-standing problem in unsupervised learning. Recent breakthroughs reformulate the standard independence assumption of sources as conditional independence given some auxiliary variables. We show that under specific instantiations of such constraints, the independent latent sources can be identified from their nonlinear mixtures up to a permutation.
  arXiv  Detail & Related papers  (2022-06-15T18:24:22Z)
• Nonparametric Conditional Local Independence Testing [69.31200003384122]
  Conditional local independence is an independence relation among continuous time processes. No nonparametric test of conditional local independence has been available. We propose such a nonparametric test based on double machine learning.
  arXiv  Detail & Related papers  (2022-03-25T10:31:02Z)
• Exploiting Independent Instruments: Identification and Distribution Generalization [3.701112941066256]
  We exploit the independence for distribution generalization by taking into account higher moments. We prove that the proposed estimator is invariant to distributional shifts on the instruments. These results hold even in the under-identified case where the instruments are not sufficiently rich to identify the causal function.
  arXiv  Detail & Related papers  (2022-02-03T21:49:04Z)
• Independent mechanism analysis, a new concept? [3.2548794659022393]
  Identifiability can be recovered in settings where additional, typically observed variables are included in the generative process. We provide theoretical and empirical evidence that our approach circumvents a number of nonidentifiability issues arising in nonlinear blind source separation.
  arXiv  Detail & Related papers  (2021-06-09T16:45:00Z)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)
• Nonparametric Score Estimators [49.42469547970041]
  Estimating the score from a set of samples generated by an unknown distribution is a fundamental task in inference and learning of probabilistic models. We provide a unifying view of these estimators under the framework of regularized nonparametric regression. We propose score estimators based on iterative regularization that enjoy computational benefits from curl-free kernels and fast convergence.
  arXiv  Detail & Related papers  (2020-05-20T15:01:03Z)
• CausalVAE: Structured Causal Disentanglement in Variational Autoencoder [52.139696854386976]
  The framework of variational autoencoder (VAE) is commonly used to disentangle independent factors from observations. We propose a new VAE based framework named CausalVAE, which includes a Causal Layer to transform independent factors into causal endogenous ones. Results show that the causal representations learned by CausalVAE are semantically interpretable, and their causal relationship as a Directed Acyclic Graph (DAG) is identified with good accuracy.
  arXiv  Detail & Related papers  (2020-04-18T20:09:34Z)
• Automated extraction of mutual independence patterns using Bayesian comparison of partition models [7.6146285961466]
  Mutual independence is a key concept in statistics that characterizes the structural relationships between variables. Existing methods to investigate mutual independence rely on the definition of two competing models. We propose a general Markov chain Monte Carlo (MCMC) algorithm to numerically approximate the posterior distribution on the space of all patterns of mutual independence.
  arXiv  Detail & Related papers  (2020-01-15T16:21:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.