Tight Margin-Based Generalization Bounds for Voting Classifiers over Finite Hypothesis Sets

Kasper Green Larsen, Natascha Schalburg
11/25/2025
cs.LGmath.ST

No confident code implementation found for this paper.

Abstract

We prove the first margin-based generalization bound for voting classifiers, that is asymptotically tight in the tradeoff between the size of the hypothesis set, the margin, the fraction of training points with the given margin, the number of training samples and the failure probability.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Improved Margin Generalization Bounds for Voting Classifiers

90% match2025

Tight Generalization Bounds for Large-Margin Halfspaces

81% match2025

Fantastic Generalization Measures are Nowhere to be Found

80% match2026

New Bounds on the Accuracy of Majority Voting for Multi-Class Classification

79% match2023

Minimax learning rates for estimating binary classifiers under margin conditions

79% match2025

Which Algorithms Have Tight Generalization Bounds?

78% match2024

Cite this paper

@article{larsen2025tight,
  title  = {Tight Margin-Based Generalization Bounds for Voting Classifiers over Finite Hypothesis Sets},
  author = {Kasper Green Larsen and Natascha Schalburg},
  year   = {2025},
  eprint = {2511.20407},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.20407v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.20407.svg)](https://codeofpaper.com/paper/2511.20407)

Discussion