arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.08895stat.MEmath.OCmath.STstat.TH
收藏

基于快速黎曼优化的广义低秩稀疏张量估计

Generalized Low-rank plus Sparse Tensor Estimation by Fast Riemannian Optimization

Jian-Feng Cai, Jingyang Li, Dong Xia

摘要:

我们研究了一个广义的框架来估计潜在的低秩加稀疏张量,其中低秩张量通常捕获多路主成分,稀疏张量解释了潜在的模型错误指定或低秩部分无法解释的异构信号。该框架是灵活的,涵盖了线性和非线性模型,可以很容易地处理连续或分类变量。我们提出了一个快速算法,结合黎曼梯度下降和一个新的梯度修剪过程。在适当的条件下,该算法线性收敛,并能同时估计低秩张量和稀疏张量。根据损失函数的梯度建立了最终估计的统计误差界。在特定的统计模型下,误差界限通常是尖锐的,鲁棒张量PCA和超图网络中孤立点的社团检测。此外,我们的方法实现了非平凡的误差界重尾张量PCA的噪声具有有限的$2+\varepsilon$时刻。我们应用我们的方法来分析国际贸易流量数据集和统计学家超图合著网络,都产生了新的和有趣的发现。

英文摘要:

We investigate a generalized framework to estimate a latent low-rank plus sparse tensor, where the low-rank tensor often captures the multi-way principal components and the sparse tensor accounts for potential model mis-specifications or heterogeneous signals that are unexplainable by the low-rank part. The framework is flexible covering both linear and non-linear models, and can easily handle continuous or categorical variables. We propose a fast algorithm by integrating the Riemannian gradient descent and a novel gradient pruning procedure. Under suitable conditions, the algorithm converges linearly and can simultaneously estimate both the low-rank and sparse tensors. The statistical error bounds of final estimates are established in terms of the gradient of loss function. The error bounds are generally sharp under specific statistical models, e.g., the robust tensor PCA and the community detection in hypergraph networks with outlier vertices. Moreover, our method achieves non-trivial error bounds for heavy-tailed tensor PCA whenever the noise has a finite $2+\varepsilon$ moment. We apply our method to analyze the international trade flow dataset and the statistician hypergraph co-authorship network, both yielding new and interesting findings.

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

↑