We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We analyze a family of supervised learning algorithms based on sample compression schemes that are stable, in the sense that removing points from the training set which were not selected for the compression set does not alter the resulting classifier. We use this technique to derive a variety of novel or improved data-dependent generalization bounds for several learning algorithms. In particular, we prove a new margin bound for SVM, removing a log factor. The new bound is provably optimal. This resolves a long-standing open question about the PAC margin bounds achievable by SVM.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2011.04586")
get_code_for_paper("2011.04586")
have("2011.04586")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2011.04586.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2011.04586)
Connect an agent — have() is free.