Skip to content
Preprint

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

Jul 2026 · 1 citation · 45 references
Mathematics

TL;DR

This work defines 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.

Abstract

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.

View source

Similar papers

#data science Preprint Jul 2026

Linear Independent Component Analysis via Optimal Transport

It is proved 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 the OT-ICA algorithm which finds this projection by gradient-based optimization is proposed.

Ashutosh Jha, M. Besserve, Simon Buchholz · 1 citation
Nov 2026

Statistical inference for Bures-Wasserstein flows

A statistical framework for conducting inference on collections of time-varying covariance operators (covariance flows) over a general, possibly infinite dimensional, Hilbert space is developed, and asymptotic theory is fully developed based on interpretable and verifiable assumptions.

Leonardo V. Santoro, Victor M. Panaretos · 0 citations
Preprint Aug 2026

Robust Scale Estimation in Additive Noise via Weighted Order Statistics

This manuscript develops a non-parametric and robust framework for estimating the scale of additive noise in weakly sparse systems. The method does not require independence, prescribed dependence, or temporal regularity of the noise sequence. We introduce a class of order-statistic estimators based on comparing the sor...

Jorge Ignacio González Cázares, Arturo Jaramillo · 0 citations
#machine learning Preprint Aug 2026

Causal Discovery in Equal Variance Linear Gaussian DAGs via SURE-Tuned Ridge Regression

This work proposes SURE-Ridge, a non-iterative, closed-form estimator for equal variance linear Gaussian SEM, which achieves the lowest structural Hamming distance in the small-sample regime and the lowest run time across all sample sizes tested, compared with NOTEARS, DAGMA, and GBNSL baselines.

Sambit Mishra, Urbashi Mitra · 2 citations
Preprint Aug 2026

Exact Algebraic Computation of Learning Coefficients for Two-Dimensional Singular Models

This work presents the first deterministic algorithm that computes local RLCTs exactly for any two-dimensional model whose Kullback-Leibler distance is contact equivalent to a polynomial, derive a bound on its complexity, and demonstrate its effectiveness for a broad class of models, with applications including polynom...

Grégoire Sergeant-Perthuis, E. Tsigaridas, Jules Tsukahara Cqsb et al. · 0 citations
Preprint Jul 2026

Distance Profile Embedding for Independence and Conditional Independence Testing of Random Objects

The Distance Profile Embedding is introduced, a novel representation that maps random objects from general metric spaces into a Hilbert space of square-integrable functions and it is proved that this mapping is injective and preserves full distributional information without requiring isometric Hilbert embeddings or one...

W. Tan, Bing Li, Lingzhou Xue · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.