Learning mixtures of arbitrary Gaussians
From MaRDI portal
Recommendations
Cites work
Cited in
(50)- Probability distributions arising from nested Gaussians
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Learning mixtures of separated nonspherical Gaussians
- Gaussian mixtures: entropy and geometric inequalities
- A greedy EM algorithm for Gaussian mixture learning
- Separating populations with wide data: a spectral analysis
- Learning diagonal Gaussian mixture models and incomplete tensor decompositions
- A new efficient algorithm based on DC programming and DCA for clustering
- Mixed membership Gaussians
- Resolution-based complexity control for Gaussian mixture models
- Efficiently learning mixtures of two Gaussians
- Learning Arbitrary Statistical Mixtures of Discrete Distributions
- Tight bounds for learning a mixture of two Gaussians (extended abstract)
- Learning mixtures of Gaussians in high dimensions
- Learning mixtures of arbitrary distributions over large discrete domains
- scientific article; zbMATH DE number 2134447 (Why is no real title available?)
- A probabilistic analysis of EM for mixtures of separated, spherical Gaussians
- Learning Mixtures of Product Distributions over Discrete Domains
- Efficient Greedy Learning of Gaussian Mixture Models
- scientific article; zbMATH DE number 6982931 (Why is no real title available?)
- The search problem in mixture models
- Robust estimators in high-dimensions without the computational intractability
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- Learning mixtures of Bernoulli templates by two-round EM with performance guarantee
- Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
- Trace reconstruction: generalized and parameterized
- scientific article; zbMATH DE number 7307484 (Why is no real title available?)
- Beyond the low-degree algorithm: mixtures of subcubes and their applications
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
- Learning entangled single-sample Gaussians
- Gauss mixture quantization: clustering Gauss mixtures
- Separating Populations with Wide Data: A Spectral Analysis
- Learning Theory
- Polynomial Learning of Distribution Families
- GAT–GMM: Generative Adversarial Training for Gaussian Mixture Models
- A spectral algorithm for learning mixture models
- Optimal estimation and computational limit of low-rank Gaussian mixtures
- Reinforced mixture learning
- Diagonal Gaussian mixture models and higher order tensor decompositions
- On uniqueness of power sum decomposition
- Mixtures of Gaussians are privately learnable with a polynomial number of samples
- Algebraic and analytic approaches for parameter learning in mixture models
- Estimating Gaussian mixtures using sparse polynomial moment systems
- Lower bounds on the total variation distance between mixtures of two Gaussians
- Gaussian mixture identifiability from degree 6 moments
- Robustly learning general mixtures of Gaussians
- Robustly learning mixtures of k arbitrary Gaussians
- Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
- Recovery guarantees for exemplar-based clustering
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
This page was built for publication: Learning mixtures of arbitrary Gaussians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175977)
