AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

The Sample Complexity of Semi-Supervised Learning with Nonparametric Mixture Models

Chen Dan, Liu Leqi, Bryon Aragam, Pradeep K Ravikumar, Eric P Xing

NeurIPS 2018 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
use density information (MLE) instead of majority vote (MV) to estimate the permutationSSL permutation estimator · Synthetic and MNIST mixturesrecovery of true permutation: n = 20 vs n = 40Improved
misspecify the learned mixture (Lambda != Lambda*) and increase overlapMLE estimator · Synthetic and MNIST mixturesrecovery of true permutationMixed
increase number of classes to K = 16MLE, Greedy, MV · Gaussian mixturerecovery of true permutation: 50%Hurt
use the proposed SSL classifier instead of supervised LeNet with few labelsMNIST classifier · MNISTclassification accuracy: 96%Improved

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