arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.09390stat.MLcs.LG
收藏

实信号下ICA的加速似然优化

Accelerating likelihood optimization for ICA on real signals

Inria(法国国家信息与自动化研究所);Université Paris-Saclay(巴黎-萨克雷大学);Institut d’Astrophysique de Paris(巴黎天体物理研究所);CNRS(法国国家科学研究中心)

Pierre Ablin, Jean-François Cardoso, Alexandre Gramfort

摘要:

研究了求解独立成分分析(ICA)极大似然公式的优化方法。我们考虑了白信号约束问题和无约束问题。目标函数的Hessian计算成本很高,这使得牛顿方法对于大数据集不切实际。在文献中提出的许多算法可以重写为拟牛顿方法,其中的海森近似是廉价的计算。这些算法在线性混合假设真正成立的模拟数据上非常快。然而,在真实信号上,我们观察到它们的收敛速度可能会严重受损。在本文中,我们研究了这种行为的起源,并表明最近提出的真实数据预处理ICA(Picard)算法在约束和无约束问题上都克服了这个问题。

英文摘要:

We study optimization methods for solving the maximum likelihood formulation of independent component analysis (ICA). We consider both the the problem constrained to white signals and the unconstrained problem. The Hessian of the objective function is costly to compute, which renders Newton's method impractical for large data sets. Many algorithms proposed in the literature can be rewritten as quasi-Newton methods, for which the Hessian approximation is cheap to compute. These algorithms are very fast on simulated data where the linear mixture assumption really holds. However, on real signals, we observe that their rate of convergence can be severely impaired. In this paper, we investigate the origins of this behavior, and show that the recently proposed Preconditioned ICA for Real Data (Picard) algorithm overcomes this issue on both constrained and unconstrained problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑