AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Supervised learning through the lens of compression

NeurIPS 2016 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 19 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
move from standard sample compression to agnostic sample compression, for multiclass learningsample compression schemes · multiclass categorization (theory, no experiments)compression sizeHelped
assume non-trivial compression exists, e.g. size m^0.99sample compression · multiclass categorization (theory)compression size: m^0.99 -> roughly log mHelped
assume uniform convergence propertymulticlass classes · theorycompression sizeHelped
move from zero/one loss to general loss functionsPAC versus agnostic PAC learnability · three-valued loss (theory)equivalence of PAC and agnostic PACHurt
use exact compression instead of approximate compression, for general losseslinear regression example · general loss (theory)equivalence with learnabilityHurt

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