REVIEW 1 cited by
PAC-Bayes Mini-tutorial: A Continuous Union Bound
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
When I first encountered PAC-Bayesian concentration inequalities they seemed to me to be rather disconnected from good old-fashioned results like Hoeffding's and Bernstein's inequalities. But, at least for one flavour of the PAC-Bayesian bounds, there is actually a very close relation, and the main innovation is a continuous version of the union bound, along with some ingenious applications. Here's the gist of what's going on, presented from a machine learning perspective.
Forward citations
Cited by 1 Pith paper
-
Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes
The paper proves a new fast-rate PAC-Bayes generalization bound controlled by the empirical flatness of the posterior, using shifted Rademacher processes.
Discussion (0). Continue with ORCID to comment.