A Dual Framework for Low-rank Tensor Completion
Nimishakavi, Madhav, Jawanpuria, Pratik Kumar, Mishra, Bamdev
–Neural Information Processing Systems
One of the popular approaches for low-rank tensor completion is to use the latent trace norm regularization. However, most existing works in this direction learn a sparse combination of tensors. In this work, we fill this gap by proposing a variant of the latent trace norm that helps in learning a non-sparse combination of tensors. We develop a dual framework for solving the low-rank tensor completion problem. Overall, the optimal solution is shown to lie on a Cartesian product of Riemannian manifolds.
Neural Information Processing Systems
Feb-14-2020, 16:57:06 GMT
- Technology: