mlsanityData to 14 Oct 2026

Contrast-Free ICA and Causal Inference via Wasserstein Distances to the Gaussian

arXiv 2607.12832 ↗First posted 14 Jul 2026stat.ML stat.MEcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the squared 2-Wasserstein distance to the standard Gaussian as a non-Gaussianity criterion and use it for linear Independent Component Analysis (ICA) and causal discovery in Linear Non-Gaussian Acyclic Models (LiNGAM). Unlike commonly used parametric contrasts and approximations of information-theoretic quantities, this criterion requires no distributional regularity beyond finite second moments, involves neither approximation nor tuning parameters, and can be computed exactly and efficiently from empirical order statistics. Our analysis relies on a strict subadditivity property of the 2-Wasserstein distance to the Gaussian. At the population level, we prove exact identification of the ICA unmixing matrix, up to signed permutation, and give an analogous characterization of causal orders through sequential least-squares residuals. We then define empirical plug-in estimators and prove distribution-free uniform convergence under finite-moment assumptions, before detailing three practical solvers: a Picard-style orthogonal optimizer for ICA, an exhaustive dynamic program for causal order search, and a greedy order search variant. Empirically, we demonstrate competitive performance for both tasks and provide open-source implementations for source separation and causal discovery.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 13 of its 45 references that are in the map. First posted on arXiv 14 Jul 2026.

Builds on

13 of 45 references.

References · 13

  1. 2018Computational Optimal Transportcited by 780
  2. 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 752
  3. 2018MINE: Mutual Information Neural Estimationcited by 683
  4. 2018Statistical Aspects of Wasserstein Distancescited by 203
  5. 2021Beware of the Simulated DAG! Causal Discovery Benchmarks May Be Easy To Gamecited by 161
  6. 2022DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterizationcited by 140
  7. 2013High-dimensional learning of linear causal networks via inverse covariance estimationcited by 87
  8. 2018On Causal Discovery with Equal Variance Assumptioncited by 59
  9. 2017Faster independent component analysis by preconditioning with Hessian approximationscited by 16
  10. 2013Independent Component Analysis via Distance Covariancecited by 6
  11. 2023Wasserstein Projection Pursuit of Non-Gaussian Signalscited by 3
  12. 2022Distribution-free joint independence testing and robust independent component analysis using optimal transportcited by 1
1 more
  1. 2024Max-sliced Wasserstein concentration and uniform ratio bounds of empirical measures on RKHScited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.