atlas

Research map / Learning theory and algorithms / Prediction and decision losses

How many classifiers do we need?

NeurIPS 2024 · Learning theory and algorithms › Prediction and decision losses · approach: Data attribution and recourse · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Analyzes how disagreement and a newly defined polarization among classifiers govern majority-vote error as the number of ensemble members grows, proposing a neural polarization law (4/3) and an extrapolation estimator from three classifiers.

Problem

Predicting how majority-vote ensemble error changes with the number of classifiers, since existing bounds based on average error and disagreement are loose and uninformative in practice.

Approach

Introduces polarization (a ratio of P(W>1/2) to E[W^2]) that yields tight majority-vote bounds linear in disagreement, conjectures interpolating neural nets are 4/3-polarized, and uses a U-statistic asymptotic result to extrapolate majority-vote error from three sampled classifiers.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use the proposed finite-ensemble bound instead of the C-bound or the prior disagreement-based boundmajority-vote error estimation · CIFAR-10 and CIFAR-10.1upper-bound tightnessHelped
estimate majority-vote error from three classifiers using the proposed extrapolationmajority-vote error estimation · CIFAR-10, CIFAR-10.1, Fashion-MNIST, Kuzushiji-MNIST, and MNISTmajority-vote error estimation accuracyHelped
vary classifier hyperparameters or architectureneural-network ensembles · CIFAR-10polarizationNo clear effect
evaluate the same ensembles on an out-of-distribution datasetResNet18 ensembles trained on CIFAR-10 · CIFAR-10.1polarizationNo clear effect
use the proposed extrapolated error estimators instead of prior majority-vote error boundsmajority-vote error estimation · image-classification model and dataset pairsestimation accuracyHelped

Surprising findings

Limitations

Experimental setup

Datasets: CIFAR-10 CIFAR-10.1 MNIST Fashion-MNIST Kuzushiji-MNIST

Benchmarks: CIFAR-10 CIFAR-10.1 MNIST Fashion-MNIST Kuzushiji-MNIST

Metrics: polarization majority vote error rate bound tightness

Baselines: C-bound tandem loss bound (Masegosa et al.) first-order bound (2x average error)

Builds on: C-bound tandem loss competence condition

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