Convex Coupled Matrix and tensor completion
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
Letter
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
33
Series
Neural Computation, Volume 30, issue 11, pp. 3095-3127
Abstract
We propose a set of convex low-rank inducing norms for coupled matrices and tensors (hereafter referred to as coupled tensors), in which information is shared between thematrices and tensors through commonmodes. More specifically,we first propose a mixture of the overlapped trace norm and the latent normswith thematrix trace norm, and then, propose a completion model regularized using these norms to impute coupled tensors. A key advantage of the proposed norms is that they are convex and can be used to find a globally optimal solution, whereas existingmethods for coupled learning are nonconvex.We also analyze the excess risk bounds of the completionmodel regularized using our proposed norms and show that they can exploit the low-rankness of coupled tensors, leading to better bounds compared to those obtained using uncoupled norms. Through synthetic and real-data experiments, we show that the proposed completion model compares favorably with existing ones.Description
Keywords
Other note
Citation
Wimalawarne, K, Yamada, M & Mamitsuka, H 2018, 'Convex Coupled Matrix and tensor completion', Neural Computation, vol. 30, no. 11, pp. 3095-3127. https://doi.org/10.1162/neco_a_01123