Learning mixtures of arbitrary gaussians
From MaRDI portal
Publication:5175977
DOI10.1145/380752.380808zbMath1323.68440OpenAlexW1969015668MaRDI QIDQ5175977
Arora Sanjeev, Ravindran Kannan
Publication date: 27 February 2015
Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/380752.380808
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Characterization and structure theory of statistical distributions (62E10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
GAT–GMM: Generative Adversarial Training for Gaussian Mixture Models, Random measurement bases, quantum state distinction and applications to the hidden subgroup problem, Learning diagonal Gaussian mixture models and incomplete tensor decompositions, A new efficient algorithm based on DC programming and DCA for clustering, A spectral algorithm for learning mixture models, Recovery guarantees for exemplar-based clustering, New and efficient DCA based algorithms for minimum sum-of-squares clustering, Database-friendly random projections: Johnson-Lindenstrauss with binary coins., Optimal estimation and computational limit of low-rank Gaussian mixtures, Mixed membership Gaussians, Separating populations with wide data: a spectral analysis, Separating Populations with Wide Data: A Spectral Analysis, Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms, Robust Estimators in High-Dimensions Without the Computational Intractability, Unnamed Item, Learning mixtures of separated nonspherical Gaussians, Unnamed Item, Probability distributions arising from nested Gaussians, Gaussian mixtures: entropy and geometric inequalities, Unnamed Item, Polynomial Learning of Distribution Families
Cites Work
