atlas

Research map / Learning theory and algorithms / Kernels and regression theory

On Margins and Generalisation for Voting Classifiers

NeurIPS 2022 · Learning theory and algorithms › Kernels and regression theory · approach: PAC-Bayes bounds · 0 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 the Dirichlet margin bound instead of existing margin boundsVoting classifiers · Classification datasets from UCI, LIBSVM, and Zalandogeneralization boundHelped
Use the Dirichlet margin bound instead of the PAC-Bayes bound used as the optimization objectiveOutputs of PAC-Bayes algorithms · Binary and multiclass classification datasetsgeneralization boundHelped
Use the optimization-friendly expected-margin-loss variant as the training objectiveVoting classifiers with random-forest voters · Classification datasetstest errorNo clear effect
Expand the search space for KDirichlet margin bound with decision stumps · ADULTgeneralization bound: 0.36 ± 0.10Helped
Optimize the Dirichlet margin bound directly rather than apply it algorithm-free to weights from another algorithmVoting classifiers with decision-stump voters · Classification datasetsgeneralization boundMixed

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