AI & ML
Linear Independent Component Analysis via Optimal Transport
arXiv stat.ML0 views
arXiv:2607.14081v2 Announce Type: replace-cross Abstract: 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 $L_2$-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 $\sqrt{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 $W_2^2$ 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.
Source:https://arxiv.org/abs/2607.14081PreviousIn-Context Residual Calibration for Uncertainty Quantification of Energy Time Series over GraphsNextGeneralised Score Matching on Convex Domains
Related posts

10 Open-Source Robotics Repositories for 3D Perception, VLA Policies, and Sensor Calibration
0dev.to
My self-modifying system tried to wire a gate-passing module into its own protection enforcer. It was refused three times.
0dev.to
Last night an AI agent performed brain surgery on a mouse
0Hacker News
The Card-Update Page Gets One Visit. Design for That Visit.
0dev.to UX
SaaS Partner Scout: A Script for Identifying GitHub SaaS Project Contributors
0dev.to GitHub
WARN Act and Retaliation — Can Your Employer Punish You for Asking About a Layoff Notice?
0dev.to Data