mlsanityData to 14 Oct 2026

Diagonally-Weighted Generalized Method of Moments Estimation for Gaussian Mixture Modeling

arXiv 2507.20459 ↗First posted 28 Jul 2025cs.LG cs.NA math.NAcited by 1

Not on the map. Why?

Abstract (arXiv)

Since Pearson [Philosophical Transactions of the Royal Society of London. A, 185 (1894), pp. 71-110] first applied the method of moments (MM) for modeling data as a mixture of one-dimensional Gaussians, moment-based estimation methods have proliferated. Among these methods, the generalized method of moments (GMM) improves the statistical efficiency of MM by weighting the moments appropriately. However, the computational complexity and storage complexity of MM and GMM grow exponentially with the dimension, making these methods impractical for high-dimensional data or when higher-order moments are required. Such computational bottlenecks are more severe in GMM since it additionally requires estimating a large weighting matrix. To overcome these bottlenecks, we propose the diagonally-weighted GMM (DGMM), which achieves a balance among statistical efficiency, computational complexity, and numerical stability. We apply DGMM to study the parameter estimation problem for weakly separated heteroscedastic low-rank Gaussian mixtures and design a computationally efficient and numerically stable algorithm that obtains the DGMM estimator without explicitly computing or storing the moment tensors. We implement the proposed algorithm and empirically validate the advantages of DGMM: in numerical studies, DGMM attains smaller estimation errors while requiring substantially shorter runtime than MM and GMM. The code and data will be available upon publication at https://github.com/liu-lzhang/dgmm.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 88 references that are in the map. First posted on arXiv 28 Jul 2025.

Builds on

18 of 88 references.

References · 18

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  3. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  4. 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 315
  5. 2018On the Intrinsic Dimensionality of Image Representationscited by 57
  6. 2019A Unified Framework for Structured Graph Learning via Spectral Constraintscited by 53
  7. 2022Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluationscited by 32
  8. 2015Learning Mixtures of Gaussians in High Dimensionscited by 29
  9. 2023The Emergence of Reproducibility and Generalizability in Diffusion Modelscited by 21
  10. 2013Smoothed Analysis of Tensor Decompositionscited by 19
  11. 2013The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixturescited by 18
  12. 2013A Two-round Variant of EM for Gaussian Mixturescited by 11
6 more
  1. 2020Likelihood landscape and maximum likelihood estimation for the discrete orbit recovery modelcited by 9
  2. 2022Tensor Moments of Gaussian Mixture Models: Theory and Applicationscited by 7
  3. 2021Maximum likelihood for high-noise group orbit estimation and single-particle cryo-EMcited by 6
  4. 2022Optimal Estimation and Computational Limit of Low-rank Gaussian Mixturescited by 6
  5. 2021Estimating Gaussian mixtures using sparse polynomial moment systemscited by 5
  6. 2021The generalized method of moments for multi-reference alignmentcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.