No confident code implementation found for this paper.
We prove the first generalization bound for large-margin halfspaces that is asymptotically tight in the tradeoff between the margin, the fraction of training points with the given margin, the failure probability and the number of training points.
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!
Tight Margin-Based Generalization Bounds for Voting Classifiers over Finite Hypothesis Sets
Replicable Learning of Large-Margin Halfspaces
Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces
A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
Margin in Abstract Spaces
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
@article{larsen2025tight,
title = {Tight Generalization Bounds for Large-Margin Halfspaces},
author = {Kasper Green Larsen and Natascha Schalburg},
year = {2025},
eprint = {2502.13692},
archivePrefix = {arXiv},
url = {http://arxiv.org/abs/2502.13692v1}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/2502.13692)