arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1507.04436stat.ML
收藏

联合张量分解与离群切片抑制及其应用

Joint Tensor Factorization and Outlying Slab Suppression with Applications

Xiao Fu, Kejun Huang, Wing-Kin Ma, Nicholas D. Sidiropoulos, Rasmus Bro

AI总结:

本文针对存在离群切片的低秩张量分解问题,提出基于组稀疏性和$\ell_p$最小化的交替优化框架,其收敛性易于分析,并在语音分离、荧光分析和社交网络挖掘等任务中验证了有效性。

摘要:

我们考虑在存在离群切片的情况下对低秩张量进行分解。这一问题在实践中具有重要意义,因为在许多实际应用中收集的数据,例如语音、荧光以及某些社交网络数据,都符合这一范式。先前的工作通过迭代地选择固定数量的切片并进行拟合来处理该问题,但这一过程可能不收敛。我们从促进组稀疏性的角度来形式化该问题,并提出一个交替优化框架来处理相应的基于 $\ell_p$($0<p\leq 1$)最小化的低秩张量分解问题。所提出的算法具有与普通三线性交替最小二乘(TALS)算法相似的每次迭代复杂度。在交替优化及其变体的框架下,所提出算法的收敛性也易于分析。此外,正则化和约束可以很容易地加入,以利用关于潜在载荷因子的先验信息。我们使用盲语音分离、荧光数据分析以及社交网络挖掘的仿真和真实数据实验来展示所提出算法的有效性。

英文摘要:

We consider factoring low-rank tensors in the presence of outlying slabs. This problem is important in practice, because data collected in many real-world applications, such as speech, fluorescence, and some social network data, fit this paradigm. Prior work tackles this problem by iteratively selecting a fixed number of slabs and fitting, a procedure which may not converge. We formulate this problem from a group-sparsity promoting point of view, and propose an alternating optimization framework to handle the corresponding $\ell_p$ ($0<p\leq 1$) minimization-based low-rank tensor factorization problem. The proposed algorithm features a similar per-iteration complexity as the plain trilinear alternating least squares (TALS) algorithm. Convergence of the proposed algorithm is also easy to analyze under the framework of alternating optimization and its variants. In addition, regularization and constraints can be easily incorporated to make use of \emph{a priori} information on the latent loading factors. Simulations and real data experiments on blind speech separation, fluorescence data analysis, and social network mining are used to showcase the effectiveness of the proposed algorithm.

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

↑