ai.hackcv
论文精选 65arXiv

Linear Independent Component Analysis via Optimal Transport· 通过最优传输实现线性独立成分分析

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 measure non-Gaussianity using the squared Wasserstein distance $W_2^2$ to a standard Gaussian. We prove that the Wasserstein distance between a standard normal distribution and linear projections of the data is maximized when the projection recovers an independent component. Based on this observation, we propose the OT-ICA algorithm which finds this projection by gradient-based optimization. Empirical evaluation on simulated data shows that OT-ICA outperforms proxy-based methods for different distributions of the latent variables. Application to EEG artifact removal and econometric price discovery confirm OT-ICA can be used for applied ICA tasks without distributional assumptions.

AI 解读论文

通过最优传输距离优化线性独立成分分析,提高信号恢复准确性。

核心方法
使用平方Wasserstein距离$W_2^2$作为非高斯性度量,并通过基于梯度的优化找到最大化这一距离的投影,从而恢复独立成分。
适合谁读
研究者、工程师和产品开发人员
要解决的问题
经典线性ICA算法在求解独立源信号时依赖于非高斯性代理函数,这些函数可能不是最优解。
关键实验
在模拟数据上验证了OT-ICA优于基于代理的方法,并在EEG去噪和经济学价格发现中得到应用。
主要贡献
提出了OT-ICA算法,不需对潜在变量分布做出假设,实现在多种任务中的有效性。
意义与局限
提供了更优的理论度量和实际应用方法,可能改善各种ICA任务的性能。限制包括计算复杂度和特定任务适应性。
领域:cs.LG作者:Ashutosh Jha、Michel Besserve、Simon Buchholz
相关推荐

本站内容由 LLM 精选聚合,原文版权归 arXiv 所有 · 摘录仅供参考