SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2106.13624 · NeurIPS · 2021

Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote

Christian Igel, Yi-Shan Wu, Andrés Masegosa, Stephan Lorenzen, Yevgeny Seldin

arXiv · PDF · Open in the Atlas

Code that ran

4 of 8 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 3 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 4 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2106.13624.json · badge: /api/ran/2106.13624.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
stephanlorenzen/majorityvotebounds canonical (classifier label)
classifier basis: classifier_2025
4 ran · 4 no recorded run
FunctionStatusWhere it lives
Binary_Search Ran
ran; our contract draft was wrong, not the code
stephanlorenzen/majorityvotebounds/mvb/bounds/ccpbb.py
pointer only (licence: GPL-3.0) · get_code("21a1e155408babef")
How it ran

The body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

CCPBB Ran
ran, honoured the contract we drafted
stephanlorenzen/majorityvotebounds/mvb/bounds/ccpbb.py
pointer only (licence: GPL-3.0) · get_code("630d823ff5f1c3a2")
How it ran

The body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

_PBB_bound Ran
ran, honoured the contract we drafted
stephanlorenzen/majorityvotebounds/mvb/bounds/ccpbb.py
pointer only (licence: GPL-3.0) · get_code("a14c5fcbaedf201b")
How it ran

The body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

_VAR_bound Ran
ran, honoured the contract we drafted
stephanlorenzen/majorityvotebounds/mvb/bounds/ccpbb.py
pointer only (licence: GPL-3.0) · get_code("558e5739e2ced171")
How it ran

The body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

PBBennett_bound Not yet run
unverified (harvested, no recorded run)
stephanlorenzen/majorityvotebounds/NeurIPS2021/artificialEvaluation/PBBennett_vs_PBBernstein.py
pointer only (licence: GPL-3.0) · get_code("b0d41daeb6a9254e")
How it ran

The body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

PBBernstein_bound Not yet run
unverified (harvested, no recorded run)
stephanlorenzen/majorityvotebounds/NeurIPS2021/artificialEvaluation/PBBennett_vs_PBBernstein.py
pointer only (licence: GPL-3.0) · get_code("5c0ed94cddbce188")
How it ran

The body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

VarCoeff Not yet run
unverified (harvested, no recorded run)
stephanlorenzen/majorityvotebounds/NeurIPS2021/artificialEvaluation/PBBennett_vs_PBBernstein.py
pointer only (licence: GPL-3.0) · get_code("3f25e0d950fb8ef4")
How it ran

The body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

optimizeCCPBB Not yet run
unverified (harvested, no recorded run)
stephanlorenzen/majorityvotebounds/mvb/bounds/ccpbb.py
pointer only (licence: GPL-3.0) · get_code("e5e776b74700e4ba")
How it ran

The body of this sample is withheld: GPL-3.0, as GitHub detects it on this paper's repository, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 8 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 8 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We present a new second-order oracle bound for the expected risk of a weighted majority vote. The bound is based on a novel parametric form of the Chebyshev-Cantelli inequality (a.k.a. one-sided Chebyshev's), which is amenable to efficient minimization. The new form resolves the optimization challenge faced by prior oracle bounds based on the Chebyshev-Cantelli inequality, the C-bounds [Germain et al., 2015], and, at the same time, it improves on the oracle bound based on second order Markov's inequality introduced by Masegosa et al. [2020]. We also derive a new concentration of measure inequality, which we name PAC-Bayes-Bennett, since it combines PAC-Bayesian bounding with Bennett's inequality. We use it for empirical estimation of the oracle bound. The PAC-Bayes-Bennett inequality improves on the PAC-Bayes-Bernstein inequality of Seldin et al. [2012]. We provide an empirical evaluation demonstrating that the new bounds can improve on the work of Masegosa et al. [2020]. Both the parametric form of the Chebyshev-Cantelli inequality and the PAC-Bayes-Bennett inequality may be of independent interest for the study of concentration of measure in other domains. 35th Conference on Neural Information Processing Systems (NeurIPS 2021).

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2106.13624")
get_code_for_paper("2106.13624")
have("2106.13624")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2106.13624.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2106.13624.svg)](https://syntology.ai/paper/2106.13624)

Connect an agent — have() is free.