Coupled Tensor Completion via Low-rank Tensor Ring

The coupled tensor decomposition aims to reveal the latent data structure which may share common factors. Using the recently proposed tensor ring decomposition, in this paper we propose a non-convex method by alternately optimizing the latent factors. We provide an excess risk bound for the proposed alternating minimization model, which shows the improvement in completion performance. The proposed algorithm is validated on synthetic data.