atlas

Research map / Learning theory and algorithms / Sample complexity

Lifelong Learning with Weighted Majority Votes

NeurIPS 2016 · Learning theory and algorithms › Sample complexity · approach: PAC learnability theory · 13 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
Learn each new task via weighted majority votes over stored base hypotheses (reuse representation) instead of learning every task in isolation, when the task is γ-separated-compatible with the base setLifelong learning of majority votes (Algorithm 1) · Theoretical sample complexity (stream of realizable tasks)total labeled examplesHelped
Replace linear combinations of base predictors with weighted majority votes to obtain stability of the representation under arbitrary marginal distributionsLifelong learning representation stability · Theoretical analysis (arbitrary marginals, discrepancy-bounded)error propagation controlHelped
Unknown task horizon and effective dimension handled via doubling trick (Algorithm 2) instead of knowing n and kLifelong learning algorithm · Theoretical sample complexitytotal labeled examplesMixed

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