atlas

Research map / Learning theory and algorithms / Sample complexity

Refined Convergence Rates for Maximum Likelihood Estimation under Finite Mixture Models

ICML 2022 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation · 1 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Measure component error with the Voronoi-based loss D rather than only W_2MLE for strongly identifiable mixtures · Strongly identifiable mixtures, pointwisecomponent convergence rate: (\log n/ n)^{1/4} -> \left(\frac{\log n}{n}\right)^{\frac 1 2}Helped
Measure component error with D-bar rather than only the Wasserstein lossPenalized MLE for location-scale Gaussian mixtures · Location-scale Gaussian mixtures, pointwisecomponent convergence rate: n^{-1/8}; ... n^{-1/4}; ... \log n/ \sqrt nMixed
Use W-tilde to distinguish component rates in uniform estimationPenalized MLE for strongly identifiable mixtures · Strongly identifiable mixtures, uniformcomponent convergence rate: n^{-\frac{1}{2r}} -> n^{-1/2}Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy