atlas

Research map / Learning theory and algorithms / Sample complexity

Constants Matter: The Performance Gains of Active Learning

ICML 2022 · Learning theory and algorithms › Sample complexity · approach: Generalization and limits under data constraints

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
Adaptive uncertainty-sampling variant (half random, half uncertainty gradient steps) instead of random MLE samplingwell-specified logistic regression on sphere · theory, expected excess errorexcess error rate in nNo clear effect
Adaptive sampling (Algorithm 1) instead of random samplinglogistic regression on sphere · theory, excess error boundupper bound constant dependence on err*: adaptive bound scales with err*·d/n vs random d log d/nHelped
Adaptive sampling vs random sampling on excess error scaling with Bayes error (ablation)logistic regression on sphere, synthetic experiments · Figure 4 (M varied, n=1000, d=10)test excess error vs limiting errorMixed
Random sampling MLE in high dimension (ablation)logistic regression on sphere · Figure 5 (n=100·d, r=1, M=20)test excess error vs dimensionNo 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