mlsanityData to 14 Oct 2026

Linear Independent Component Analysis via Optimal Transport

arXiv 2607.14081 ↗First posted 15 Jul 2026cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Linear Independent Component Analysis (ICA) recovers jointly independent source signals from their linear mixtures. To achieve this, classical ICA algorithms attempt to maximize non-Gaussianity, measured by negentropy, which is linked to independence by information theory. Because exact negentropy optimization is intractable, they rely on proxy contrast functions, such as fourth-order cumulants and parametric log-likelihoods. We propose instead to use the squared L2-Wasserstein distance to a standard Gaussian as the ICA contrast. We show that the Wasserstein distance between a standard normal distribution and linear projections of the data is maximized when the projection recovers an independent component, and that under a regularity condition on the sources this maximum is separated from every genuine mixture by an explicit margin. We uncover the advantageous properties of the resulting estimator: for sources with a smooth density it is √N-consistent and asymptotically normal with a closed-form variance, whereas for a source with an atom the contrast has a kink at the true direction, which makes the estimator exact with probability tending to one. The proposed OT-ICA algorithm finds this projection by gradient-based optimization. Empirical evaluation on simulated data shows that OT-ICA outperforms proxy-based methods and that the W22 contrast provides more robust signal than proxy contrasts in measuring non-Gaussianity for different distributional mixtures of the latent variables. Application to linear causal disentanglement and EEG artifact removal, along with further applications detailed in the appendix, confirms OT-ICA can be used for applied ICA tasks without distributional assumptions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 63 references that are in the map. First posted on arXiv 15 Jul 2026.

Builds on

14 of 63 references.

References · 14

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2019Max-Sliced Wasserstein Distance and its use for GANscited by 119
  3. 2023Causal Component Analysiscited by 56
  4. 2022Function Classes for Identifiable Nonlinear Independent Component Analysiscited by 53
  5. 2020Projection Robust Wasserstein Distance and Riemannian Optimizationcited by 45
  6. 2020Sliced Iterative Normalizing Flowscited by 38
  7. 2016Iterative Gaussianization: from ICA to Random Rotationscited by 26
  8. 2017Faster independent component analysis by preconditioning with Hessian approximationscited by 16
  9. 2019A proof of the Caffarelli contraction theorem via entropic regularizationcited by 8
  10. 2018Blind Source Separation with Optimal Transport Non-negative Matrix Factorizationcited by 3
  11. 2023Wasserstein Projection Pursuit of Non-Gaussian Signalscited by 3
  12. 2026Contrast-Free ICA and Causal Inference via Wasserstein Distances to the Gaussiancited by 2
2 more
  1. 2013R-Estimation for Asymmetric Independent Component Analysiscited by 1
  2. 2022Independent component analysis in the light of Information Geometrycited by 1

Built on by

Not cited yet.