.png){kind=icon}
返回
Provable tensor ring completion
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2020.107486.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of size n x ... x n and TR rank [r, ... , r] can be exactly recovered with high probability by solving a convex optimization program, given O(n([d/2])r(2)in(7)(n([d/2])) samples. In the optimization model, a weighted sum of nuclear norms of factors surrogates the TR rank. The proposed TR incoherence condition under which the result holds is similar to the matrix incoherence condition. The experiments on synthetic data verify the recovery guarantee for TR completion. Moreover, the experiments on real-world data show that our method improves the recovery performance compared with the state-of-the-art methods. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Tensor completion
Tensor ring decomposition
Convex optimization
Tensor ring incoherence condition
Nuclear norm minimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
暂无机构信息
引用论文
DC Offset Error Compensation Algorithm for PR Current Control of a Single-Phase Grid-Tied Inverter.png)
Energies
OAAI
EnergiesIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容