Fused Orthogonal Alternating Least Squares for Tensor Clustering
Jiacheng Wang, Dan Nicolae
Abstract
We introduce a multi-mode tensor clustering method that implements a fused version of the alternating least squares algorithm (Fused-Orth-ALS) for simultaneous tensor factorization and clustering. The statistical convergence rates of recovery and clustering are established when the data are a noise contaminated tensor with a latent low rank CP decomposition structure. Specifically, we show that a modified alternating least squares algorithm can provably recover the true latent low rank factorization structure when the data form an asymmetric tensor with perturbation. Clustering consistency is also established. Finally, we illustrate the accuracy and computational efficient implementation of the Fused-Orth-ALS algorithm by using both simulations and real datasets.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Tensor Completion Made PracticalAllen Liu, Ankur MoitraNeurIPS 2020 · 37 citations
- Towards Multi-Mode Outlier Robust Tensor Ring DecompositionYuning Qiu, Guoxu Zhou, Andong Wang, Zhenhao Huang et al.AAAI 2024 · 8 citations
- More Efficient Sampling for Tensor Decomposition With Worst-Case GuaranteesOsman Asif MalikICML 2022 · 17 citations
- Multi-Mode Tensor Space Clustering Based on Low-Tensor-Rank RepresentationYicong He, George K. AtiaAAAI 2022 · 8 citations
- Guarantees for Alternating Least Squares in Overparameterized Tensor DecompositionsDionysis Arvanitakis, Vaidehi Srinivas, Aravindan VijayaraghavanNeurIPS 2025
