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 investigate a stochastic counterpart of majority votes over finite ensembles of classifiers, and study its generalization properties. While our approach holds for arbitrary distributions, we instantiate it with Dirichlet distributions: this allows for a closed-form and differentiable expression for the expected risk, which then turns the generalization bound into a tractable training objective. The resulting stochastic majority vote learning algorithm achieves state-of-the-art accuracy and benefits from (non-vacuous) tight generalization bounds, in a series of numerical experiments when compared to competing algorithms which also minimize PAC-Bayes objectives -- both with uninformed (data-independent) and informed (data-dependent) priors.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.12535")
get_code_for_paper("2106.12535")
have("2106.12535")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.12535.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.12535)
Connect an agent — have() is free.