Tensor recovery from noisy and multi-level quantized measurements

EURASIP Journal on Advances in Signal Processing

Ren Wang¹  Meng Wang¹  Jinjun Xiong² 

[1] Dept. of Electrical, Computer, and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA;IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA;

关键词: Tensor recovery;    CP decomposition;    Low-rank;    Multi-level quantization;    Tensor singular value decomposition;    Nonconvex optimization;   

DOI  :  10.1186/s13634-020-00698-z

来源: Springer

【 摘 要 】

Higher-order tensors can represent scores in a rating system, frames in a video, and images of the same subject. In practice, the measurements are often highly quantized due to the sampling strategies or the quality of devices. Existing works on tensor recovery have focused on data losses and random noises. Only a few works consider tensor recovery from quantized measurements but are restricted to binary measurements. This paper, for the first time, addresses the problem of tensor recovery from multi-level quantized measurements by leveraging the low CANDECOMP/PARAFAC (CP) rank property. We study the recovery of both general low-rank tensors and tensors that have tensor singular value decomposition (TSVD) by solving nonconvex optimization problems. We provide the theoretical upper bounds of the recovery error, which diminish to zero when the sizes of dimensions increase to infinity. We further characterize the fundamental limit of any recovery algorithm and show that our recovery error is nearly order-wise optimal. A tensor-based alternating proximal gradient descent algorithm with a convergence guarantee and a TSVD-based projected gradient descent algorithm are proposed to solve the nonconvex problems. Our recovery methods can also handle data losses and do not necessarily need the information of the quantization rule. The methods are validated on synthetic data, image datasets, and music recommender datasets.

【 授权许可】

CC BY