Estimating Gaussian mixtures using sparse polynomial moment systems
From MaRDI portal
Cites work
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A spectral algorithm for learning mixture models
- Algebraic geometry and local differential geometry
- Algebraic identifiability of Gaussian mixtures
- Bronowski's conjecture and the identifiability of projective varieties
- CHIME: clustering of high-dimensional Gaussian mixtures with EM algorithm and its optimality
- Consistency of the MLE under mixture models
- Contributions to the mathematical theory of evolution.
- Deep learning
- Early identification of an impending rockslide location via a spatially-aided Gaussian mixture model
- Efficiently learning mixtures of two Gaussians
- Estimating the components of a mixture of normal distributions
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- How many zeroes? Counting solutions of systems of polynomials via toric geometry at infinity
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 3601710 (Why is no real title available?)
- scientific article; zbMATH DE number 1069614 (Why is no real title available?)
- scientific article; zbMATH DE number 2006091 (Why is no real title available?)
- scientific article; zbMATH DE number 2038305 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 960150 (Why is no real title available?)
- Identifiability of Finite Mixtures
- Identifying the number of components in Gaussian mixture models using numerical algebraic geometry
- Injectivity of real rational mappings: the case of a mixture of two Gaussian laws
- Large Sample Properties of Generalized Method of Moments Estimators
- Learning mixtures of arbitrary Gaussians
- Learning Theory
- Local minima structures in Gaussian mixture models
- Maximum Likelihood Estimates for Gaussian Mixtures Are Transcendental
- Moment varieties of Gaussian mixtures
- Multivariate Normal Mixtures: A Fast Consistent Method of Moments
- Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
- Normal moments and Hermite polynomials
- Numerically solving polynomial systems with Bertini
- On The Complexity of Computing Mixed Volumes
- On the Identifiability of Finite Mixtures
- Optimal estimation of Gaussian mixtures via denoised method of moments
- Polyedres de Newton et nombres de Milnor
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Polynomial Learning of Distribution Families
- Settling the polynomial learnability of mixtures of Gaussians
- Solutions to systems of binomial equations
- The BKK root count in $\mathbf {C}^n$
- The landscape of empirical risk for nonconvex losses
- Using Algebraic Geometry
Cited in
(2)
This page was built for publication: Estimating Gaussian mixtures using sparse polynomial moment systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7026064)
