AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Tight Bounds for Collaborative PAC Learning via Multiplicative Weights

NeurIPS 2018 · Learning theory and algorithms › Sample complexity · approach: PAC learnability theory · 8 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
Use multiplicative weights to adaptively allocate samples across player distributions instead of the grouping strategyMWeights vs. CenLearn · Magic-1, Magic-2, Wine, Eye, Lettersample complexityHelped
Use multiplicative weights rather than uniform sampling from the pooled distributionMWeights vs. Naive · Magic-1 and Magic-2sample complexityHelped
Use uniform sampling from the pooled distribution rather than adaptive allocationNaive · Magic-Evensample complexityHelped
Use multiplicative weights rather than the Blum et al. approachMWeights vs. CenLearn · Real-world datasets (reported across Magic-1 through Letter)sample complexityHelped
Use the Blum et al. approach rather than uniform samplingCenLearn vs. Naive · Real-world datasetssample complexityMixed

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