atlas

Research map / Learning theory and algorithms / Sample complexity

Provable Algorithms for Inference in Topic Models

ICML 2016 · Learning theory and algorithms › Sample complexity · approach: Generalization and limits under data constraints · 16 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
Restrict MLE to the known support R of x* (r-sparse) and optimize log-likelihood over those coordinates onlyMLE for topic proportions in topic models · theoretical analysis (Theorem, n >= c kappa^2 r^2 log k / tau^2)l1 error ||x_mle - x*||_1Helped
Use the linear inverse (recovered x) with smoothing of log(Ax) and an l1-condition-number argument to bound the likelihood of the linear estimatorlinear inverse estimator for topic proportions · theoretical analysis (claim with O~(r^2/(delta^2 eps^2)) samples)expected negative log-likelihood gap to optimumNo clear effect

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