| CARVIEW |
Select Language
HTTP/2 200
x-frame-options: SAMEORIGIN
via: 1.1 google, 1.1 varnish, 1.1 varnish, 1.1 varnish
cache-control: max-age=3600
x-cloud-trace-context: 6d9241cef6688122f22fe2183845dec6
content-type: text/html; charset=utf-8
last-modified: Wed, 18 Jan 2023 01:33:16 GMT
server: Google Frontend
content-security-policy: frame-ancestors 'none'
accept-ranges: bytes
age: 71481
date: Wed, 31 Dec 2025 23:23:03 GMT
x-served-by: cache-lga21938-LGA, cache-lga21930-LGA, cache-bom-vanm7210094-BOM
x-cache: MISS, HIT, MISS
x-timer: S1767223383.955613,VS0,VE250
content-length: 47964
[2106.13624] Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote
Skip to main content
[v1] Fri, 25 Jun 2021 13:23:20 UTC (998 KB)
[v2] Tue, 17 Jan 2023 10:20:00 UTC (899 KB)
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors.
Donate
Computer Science > Machine Learning
arXiv:2106.13624 (cs)
[Submitted on 25 Jun 2021 (v1), last revised 17 Jan 2023 (this version, v2)]
Title:Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote
View a PDF of the paper titled Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote, by Yi-Shan Wu and 4 other authors
View PDF
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.
| Comments: | aligned with the camera-ready version published at NeurIPS 2021 |
| Subjects: | Machine Learning (cs.LG); Machine Learning (stat.ML) |
| Cite as: | arXiv:2106.13624 [cs.LG] |
| (or arXiv:2106.13624v2 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2106.13624
arXiv-issued DOI via DataCite
|
Submission history
From: Yi-Shan Wu [view email][v1] Fri, 25 Jun 2021 13:23:20 UTC (998 KB)
[v2] Tue, 17 Jan 2023 10:20:00 UTC (899 KB)
Full-text links:
Access Paper:
- View PDF
- TeX Source
View a PDF of the paper titled Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote, by Yi-Shan Wu and 4 other authors
Current browse context:
cs.LG
References & Citations
DBLP - CS Bibliography
export BibTeX citation
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender
(What is IArxiv?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.