Robust Completion for Rank-1 Tensors with Noises

2025/04/01 by Nie, Jiawang, Tang, Xindong, Zhou, Jinling · 2 citations
#15A69 #65F99 #90C23 #FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.2504.00398

Abstract

This paper studies the rank-1 tensor completion problem for cubic tensors when there are noises for observed tensor entries. First, we propose a robust biquadratic optimization model for obtaining rank-1 completing tensors. When the observed tensor is sufficiently close to be rank-1, we show that this biquadratic optimization produces an accurate rank-1 tensor completion. Second, we give an efficient convex relaxation for solving the biquadratic optimization. When the optimizer matrix is separable, we show how to get optimizers for the biquadratic optimization and how to compute the rank-1 completing tensor. When that matrix is not separable, we apply its spectral decomposition to obtain an approximate rank-1 completing tensor. Numerical experiments are given to explore the efficiency of this biquadratic optimization model and the proposed convex relaxation.

Cited by

• Finite Convergence of the Moment-SOS Hierarchy on the Product of Spheres
• Solving exact and noisy rank-one tensor completion with semidefinite programming

Related

• The Rank-1 Completion Problem for Cubic Tensors
• Solving exact and noisy rank-one tensor completion with semidefinite programming
• Low-Rank Approximation and Completion of Positive Tensors
• Statistically Optimal and Computationally Efficient Low Rank Tensor Completion from Noisy Entries
• Rank one tensor completion problem