mlsanityData to 14 Oct 2026

Tensor decomposition for learning Gaussian mixtures from moments

arXiv 2106.00555 ↗First posted 1 Jun 2021math.AG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

In data processing and machine learning, an important challenge is to recover and exploit models that can represent accurately the data. We consider the problem of recovering Gaussian mixture models from datasets. We investigate symmetric tensor decomposition methods for tackling this problem, where the tensor is built from empirical moments of the data distribution. We consider identifiable tensors, which have a unique decomposition, showing that moment tensors built from spherical Gaussian mixtures have this property. We prove that symmetric tensors with interpolation degree strictly less than half their order are identifiable and we present an algorithm, based on simple linear algebra operations, to compute their decomposition. Illustrative experimentations show the impact of the tensor decomposition method for recovering Gaussian mixtures, in comparison with other state-of-the-art approaches.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 7 of its 71 references that are in the map. First posted on arXiv 1 Jun 2021.

Builds on

7 of 71 references.

References · 7

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2017Introduction to Tensor Decompositions and their Applications in Machine Learningcited by 46
  3. 2020Spectral Learning on Matrices and Tensorscited by 16
  4. 2019Subspace power method for symmetric tensor decompositioncited by 14
  5. 2017Clustering Patients with Tensor Decompositioncited by 2
  6. 2013Model-Based Hierarchical Clusteringcited by 1
  7. 2020Riemannian Newton optimization methods for the symmetric tensor approximation problemcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 2; 2024: 0; 2025: 1.

5 papers.