We study the best low-rank Tucker decomposition of symmetric tensors. The motivating application is decomposing higher-order multivariate moments. Moment tensors have special structure and are important to various data science problems. We advocate for a projected gradient descent (PGD) method and higher-order eigenvalue decomposition (HOEVD) approximation as computation schemes. Most importantly, we develop scalable adaptations of the basic PGD and HOEVD methods to decompose sample moment tensors. With the help of implicit and streaming techniques, we evade the overhead cost of building and storing the moment tensor. Such reductions make computing the Tucker decomposition realizable for large data instances in high dimensions. Numerical experiments demonstrate the efficiency of the algorithms and the applicability of moment tensor decompositions to real-world datasets. Finally we study the convergence on the Grassmannian manifold and prove that the update sequence derived by the PGD solver achieves first- and second-order criticality.
symmetric tensor, Tucker decomposition, scalable algorithm
Full access: https://epubs.siam.org/eprint/Q2B2E8MW9AH22Z8TVTTG/full
@article{JiKiKoWa24,
author = {Ruhui Jin and Joe Kileel and Tamara G. Kolda and Rachel Ward},
title = {Scalable Symmetric {Tucker} Tensor Decomposition},
journal = {SIAM Journal on Matrix Analysis and Applications},
volume = {45},
number = {4},
pages = {1746--1781},
month = {October},
year = {2024},
doi = {10.1137/23M1582928},
url = {https://epubs.siam.org/eprint/Q2B2E8MW9AH22Z8TVTTG/full},
eprint = {2204.10824},
}