arXiv · 2309.15105
On the minimal algebraic complexity of the rank-one approximation problem for general inner products
Abstract
We study the algebraic complexity of Euclidean distance minimization from a generic tensor to a variety of rank-one tensors. The Euclidean Distance (ED) degree of the Segre-Veronese variety counts the number of complex critical points of this optimization problem. We regard this invariant as a function of inner products. We prove that Frobenius inner product is a local minimum of the ED degree, and conjecture that it is a global minimum. We prove our conjecture in the case of matrices and symmetric binary and $3\times 3\times 3$ tensors. We discuss the above optimization problem for other algebraic varieties, classifying all possible values of the ED degree. Our approach combines tools from Singularity Theory, Morse Theory, and Algebraic Geometry.
Explore related subjects
Keep this discovery
Khazhgali Kozhasov, Alan Muniz, Yang Qi, Luca Sodomaco. 2023-09-26. On the minimal algebraic complexity of the rank-one approximation problem for general inner products. https://doi.org/10.1090/mcom%2F4176
Cite the original work for its findings. Save a collection to share your selection of sources.