Research map / Learning theory and algorithms / Clustering
Mixtures Closest To A Given Measure: A Semidefinite Programming Approach
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Refined Convergence Rates for Maximum Likelihood Estimation under Finite Mixture Models (ICML 2022 · similarity 0.89)
- Toward Global Convergence of Gradient EM for Over-Paramterized Gaussian Mixture Models (NeurIPS 2024 · similarity 0.87)
- Gaussian Mixture Models in Hilbert Spaces via Kernel Methods (NeurIPS 2026 · similarity 0.87)
- Achieving Optimal Clustering in Gaussian Mixture Models with Anisotropic Covariance Structures (NeurIPS 2024 · similarity 0.86)
- Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters (NeurIPS 2026 · similarity 0.86)
- Learning Mixtures of Gaussian Processes through Random Projection (ICML 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
