The average number of critical rank-one approximations to a tensor

DOI10.1080/03081087.2016.1164660MaRDI QIDQ2953399zbMATH OpenOpenAlexFDO

Authors Jan Draisma, Emil Horobeţ

Publication date 4 January 2017

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1408.3507

zbMATH Keywords

optimizationMonte Carlo methodscritical pointeigenvectorsingular valuerandom tensorscritical rank-one approximationsrank-one tensors

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20) Vector spaces, linear dependence, rank, lineability (15A03) Critical points of functions and mappings on manifolds (58K05)

Abstract: Motivated by the many potential applications of low-rank multi-way tensor approximations, we set out to count the rank-one tensors that are critical points of the distance function to a general tensor v. As this count depends on v, we average over v drawn from a Gaussian distribution, and find formulas that relates this average to problems in random matrix theory.

Recommendations

• Best rank-\(k\) approximations for tensors: generalizing Eckart-Young
• Generic and typical ranks of multi-way arrays
• On the average condition number of tensor rank decompositions
• The average condition number of most tensor rank decomposition problems is infinite
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem

Cites work

• A central limit theorem for the determinant of a Wigner matrix
• Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
• Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
• Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
• Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
• Eigenvectors of tensors and algorithms for Waring decomposition
• Most tensor problems are NP-hard
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Symmetric Tensors and Symmetric Tensor Rank
• Symmetric tensor decomposition
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Tensor rank is NP-complete
• The number of eigenvalues of a tensor
• The number of singular vector tuples and uniqueness of best rank-one approximation of tensors

Cited in

(10)

• The Expected Number of Eigenvalues of a Real Gaussian Tensor
• How many eigenvalues of a random symmetric tensor are real?
• The Euclidean distance degree of an algebraic variety
• On the average condition number of tensor rank decompositions
• The number of real eigenvectors of a real polynomial
• A very brief introduction to nonnegative tensors from the geometric viewpoint
• Probabilistic Schubert calculus
• Asymptotics of degrees and ED degrees of Segre products
• Certifying the global optimality of quartic minimization over the sphere
• Best rank-\(k\) approximations for tensors: generalizing Eckart-Young

This page was built for publication: The average number of critical rank-one approximations to a tensor

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