AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

More Supervision, Less Computation: Statistical-Computational Tradeoffs in Weakly Supervised Learning

Xinyang Yi, Zhaoran Wang, Zhuoran Yang, Constantine Caramanis, Han Liu

NeurIPS 2016 · Learning theory and algorithms › Sample complexity · approach: Minimax estimation rates

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
increase degree of supervision alpha (fewer label flips)information-theoretic minimax detection rate for weakly supervised sparse mean testing · theory: Gaussian model, s-sparse mean difference, known Σminimax signal strength γ*_nImproved
increase degree of supervision alpha (fewer label flips)computationally tractable (statistical query) detection rate · theory: statistical query model, known Σcomputational boundary γ*_nImproved
unlabeled-regime comparison: alpha near 0 (no supervision) vs alpha small but nonzeroweakly supervised detection · theory: small alpha regioninformation-theoretic and computational ratesNo 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