Regular simplex tensors: optimization landscape, conjecture proof, and beyond

Abstract

The concept of tensor eigenpairs has attracted increasing research attention in the past decades. Recent works have focused on a special class termed regular simplex tensors, which are constructed from an equiangular tight frame of n vectors in (n-1) dimensional space for n >= 3 and order m >= 3. Existing works focus on analyzing the robustness of eigenpairs obtained by the tensor power method. At the end of that work, a conjecture was made that if they exist, the only robust eigenvectors of a regular simplex tensor, up to sign equivalence, are the vectors in the regular simplex frame. A subsequent study theoretically proved that this holds for the simplest triangle case where n = 3. However, for cases with higher n, the process becomes complicated in both checking all eigenpairs and determining the explicit formula for the robustness criterion. In this paper, to deal with this issue, a connection between robust and locally optimal eigenpairs is built, recognizing the latter as another pivotal concept in the field of optimization. Then, we turn to checking the local optimality of all eigenpairs, for which we have developed an efficient model with a favorable structure that facilitates the enumeration of all eigenpairs and delineates the optimization landscape for the model. Then, integrating the two advances enables us to narrow the scope of the robust eigenpairs to those locally maximized ones, which are exactly the vectors in the regular simplex frame. Finally, the proof of the conjecture reduces to only examining the vectors in the frame, whose robustness can be easily checked for any higher n and m. This work shows that, up to sign equivalence, excluding the exceptional cases (m, n) = (3, 3)/(3, 4)/(4, 3) where no robust eigenpairs exist, the only robust eigenvectors of a regular simplex tensor are the vectors in the regular simplex frame.