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.
PAC-Bayesian bounds are known to be tight and informative when studying the generalization ability of randomized classifiers. However, they require a loose and costly derandomization step when applied to some families of deterministic models such as neural networks. As an alternative to this step, we introduce new PAC-Bayesian generalization bounds that have the originality to provide disintegrated bounds, i.e., they give guarantees over one single hypothesis instead of the usual averaged analysis. Our bounds are easily optimizable and can be used to design learning algorithms. We illustrate this behavior on neural networks, and we show a significant practical improvement over the state-of-the-art framework.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.08649")
get_code_for_paper("2102.08649")
have("2102.08649")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2102.08649.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2102.08649)
Connect an agent — have() is free.