A Bilevel Optimization Method for Tensor Recovery Under Metric Learning Constraints

arXiv2209.00545MaRDI QIDQ6409494FDOQ6409494

Authors: Maryam Bagherian, Davoud Ataee Tarzanagh, Ivo D. Dinov, Joshua D. Welch 

Publication date: 1 September 2022

Abstract: Tensor completion and tensor decomposition are important problems in many domains. In this work, we leverage the connection between these problems to learn a distance metric that improves both decomposition and completion. We show that the optimal Mahalanobis distance metric for the completion task is closely related to the Tucker decomposition of the completed tensor. Then, we formulate a bilevel optimization problem to perform joint tensor completion and decomposition, subject to metric learning constraints. The metric learning constraints also allow us to flexibly incorporate similarity side information and coupled matrices, when available, into the tensor recovery process. We derive an algorithm to solve the bilevel optimization problem and prove its global convergence. When evaluated on real data, our approach performs significantly better compared to previous methods.

This page was built for publication: A Bilevel Optimization Method for Tensor Recovery Under Metric Learning Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409494)