mlsanityData to 7 Oct 2026

Jointly Modeling and Clustering Tensors in High Dimensions

arXiv 2104.07773 ↗First posted 15 Apr 2021stat.ME math.ST stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We consider the problem of jointly modeling and clustering populations of tensors by introducing a high-dimensional tensor mixture model with heterogeneous covariances. To effectively tackle the high dimensionality of tensor objects, we employ plausible dimension reduction assumptions that exploit the intrinsic structures of tensors such as low-rankness in the mean and separability in the covariance. In estimation, we develop an efficient high-dimensional expectation-conditional-maximization (HECM) algorithm that breaks the intractable optimization in the M-step into a sequence of much simpler conditional optimization problems, each of which is convex, admits regularization and has closed-form updating formulas. Our theoretical analysis is challenged by both the non-convexity in the EM-type estimation and having access to only the solutions of conditional maximizations in the M-step, leading to the notion of dual non-convexity. We demonstrate that the proposed HECM algorithm, with an appropriate initialization, converges geometrically to a neighborhood that is within statistical precision of the true parameter. The efficacy of our proposed method is demonstrated through comparative numerical experiments and an application to a medical study, where our proposal achieves an improved clustering accuracy over existing benchmarking methods.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 56 references that are in the map. First posted on arXiv 15 Apr 2021.

Builds on

25 of 56 references.

References · 25

  1. 2014Statistical guarantees for the EM algorithm: From population to sample-based analysiscited by 131
  2. 2017Tensor SVD: Statistical and Computational Limitscited by 52
  3. 2018Singularity, Misspecification, and the Convergence Rate of EMcited by 38
  4. 2019Nonconvex Low-Rank Tensor Completion from Noisy Datacited by 35
  5. 2020Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limitscited by 29
  6. 2020On the Minimax Optimality of the EM Algorithm for Learning Two-Component Mixed Linear Regressioncited by 24
  7. 2017Statistically Optimal and Computationally Efficient Low Rank Tensor Completion from Noisy Entriescited by 23
  8. 2015Parsimonious Tensor Response Regressioncited by 20
  9. 2015Regularized EM Algorithms: A Unified Framework and Statistical Guaranteescited by 19
  10. 2015Provable Sparse Tensor Decompositioncited by 16
  11. 2017Tensor Graphical Lasso (TeraLasso)cited by 16
  12. 2017Multilayer tensor factorization with applications to recommender systemscited by 16
13 more
  1. 2018Provable Convex Co-clustering of Tensorscited by 13
  2. 2020Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimalitycited by 13
  3. 2017Dynamic Tensor Clusteringcited by 12
  4. 2018Sparse and Low-rank Tensor Estimation via Cubic Sketchingscited by 11
  5. 2016Cross: Efficient Low-rank Tensor Completioncited by 10
  6. 2016Simultaneous Clustering and Estimation of Heterogeneous Graphical Modelscited by 10
  7. 2018Covariate-Adjusted Tensor Classification in High-Dimensionscited by 10
  8. 2020A Doubly-Enhanced EM Algorithm for Model-Based Tensor Clusteringcited by 8
  9. 2017Effective Tensor Sketching via Sparsificationcited by 5
  10. 2019Sparse Tensor Additive Regressioncited by 5
  11. 2020Partially Observed Dynamic Tensor Response Regressioncited by 4
  12. 2018Generalized Connectivity Matrix Response Regression with Applications in Brain Connectivity Studiescited by 1
  13. 2019Clustering Higher Order Data: An Application to Pediatric Multi-variable Longitudinal Datacited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.