Tensor decomposition for learning Gaussian mixtures from moments
From MaRDI portal
Publication:2133926
DOI10.1016/j.jsc.2022.04.002zbMath1492.14094arXiv2106.00555OpenAlexW3167159082WikidataQ114154445 ScholiaQ114154445MaRDI QIDQ2133926
Pierre-Alexandre Mattei, Rima Khouja, Mourrain, Bernard
Publication date: 5 May 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.00555
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Secant varieties, tensor rank, varieties of sums of powers (14N07)
Related Items (2)
Moment Estimation for Nonparametric Mixture Models through Implicit Tensor Decomposition ⋮ Generic identifiability of pairs of ternary forms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Eigenvectors of tensors and algorithms for Waring decomposition
- Symmetric tensor decomposition
- An advancement in clustering via nonparametric density estimation
- Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models
- A comparison of algorithms for fitting the PARAFAC model
- Finite mixture models and model-based clustering
- Imputation through finite Gaussian mixture models
- Rank and optimal computation of generic tensors
- Estimating the dimension of a model
- Tensor decomposition and homotopy continuation
- General tensor decomposition, moment matrices and applications
- Structured low rank decomposition of multivariate Hankel matrices
- Riemannian Newton optimization methods for the symmetric tensor approximation problem
- Homotopy techniques for tensor decomposition and perfect identifiability
- Image classification with the Fisher vector: theory and practice
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- Maximum Block Improvement and Polynomial Optimization
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
- Tensor decompositions for learning latent variable models
- On generic identifiability of symmetric tensors of subgeneric rank
- Learning mixtures of spherical gaussians
- A Decomposition for Three-Way Arrays
- Maximum Likelihood: An Introduction
- Algorithms for Model-Based Gaussian Hierarchical Clustering
- Asymptotic Statistics
- How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- The Geometry of Syzygies
- Approximation by finite mixtures of continuous density functions that vanish at infinity
- Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
- Spectral Learning on Matrices and Tensors
- High-Dimensional Mixture Models for Unsupervised Image Denoising (HDMI)
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
- Model-Based Clustering and Classification for Data Science
- EM for mixtures
This page was built for publication: Tensor decomposition for learning Gaussian mixtures from moments
