Research map / Learning theory and algorithms / Kernels and regression theory
Erratum: Risk Bounds for the Majority Vote: From a PAC-Bayesian Analysis to a Learning Algorithm
Louis-Philippe Vignault, Audrey Durand, Pascal Germain
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Second Order PAC-Bayesian Bounds for the Weighted Majority Vote (NeurIPS 2020 · similarity 0.90)
- PAC-Bayesian Bounds on Rate-Efficient Classifiers (ICML 2022 · similarity 0.90)
- How many classifiers do we need? (NeurIPS 2024 · similarity 0.84)
- Controlling Multiple Errors Simultaneously with a PAC-Bayes Bound (NeurIPS 2024 · similarity 0.83)
- Tight Bounds on the Distortion of Randomized and Deterministic Distributed Voting (NeurIPS 2025 · similarity 0.83)
- Don’t Label Twice: Quantity Beats Quality when Comparing Binary Classifiers on a Budget (ICML 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
