返回
Tensor Completion Using Spectral (k, p)Support Norm
DOI:10.1109/ACCESS.2018.2811396.png)
摘要
En 中文
In this paper, the goal is to reconstruct a tensor, i.e., a multi-dimensional array, when only subsets of its entries are observed. For well-posedness, the tensor is assumed to have a low-Tucker-rank structure. To estimate the underlying tensor from its partial observations, we first propose an estimator based on a newly defined balanced spectral (k, p)-support norm. To efficiently compute the estimator, we come up with a scalable algorithm for the minimization of the spectral (k, p)-support norm. Instead of directly solving the primal problem which involves full SVD in each iteration, the proposed algorithm benefits from the Lagrangian dual through minimizing the dual norm of the (k, p)-support norm which only computes the first k leading singular values and singular vectors in each iteration. To explore the statistical performance of the proposed estimator, upper bounds on the sample complexity and estimation error are then established. Simulation studies confirm that the error bounds can predict the scalable behavior of the estimation error. Experimental results on synthetic and real datasets demonstrate that the spectral (k, p)-support norm based method outperforms the nuclear norm based ones.
Keyword:
Tensor completion
square deal
atomic norm
sample complexity
APG
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
DC Offset Error Compensation Algorithm for PR Current Control of a Single-Phase Grid-Tied Inverter
Energies
IF0
Heavy metal tolerance of marine phytoplankton. IV. Combined effect of zinc and cadmium on growth and uptake in some marine diatoms海洋浮游植物对重金属的耐受性。四。锌和镉对某些海洋硅藻生长和吸收的综合影响

