AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote

Yi-Shan Wu, Andres R Masegosa, Stephan Sloth Lorenzen, Christian Igel, Yevgeny Seldin

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Statistical-query lower bounds · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
optimize weights with Chebyshev-Cantelli bound using PAC-Bayes-Bennett loss estimate (CCPBB) instead of tandem bound (TND)weighted random forest · UCI/LibSVM binary and multiclass datasetstest loss ratio vs uniform weightingImproved
use CCPBB bound instead of TND bound as the guaranteeweighted random forest · UCI/LibSVM datasetsbound tightness ratio to TNDHurt
use CCTND bound instead of TND boundheterogeneous classifier ensembles · UCI/LibSVM datasetsbound tightness ratio to TNDImproved
optimize weights by first order bound (FO) instead of uniform weightingheterogeneous classifier ensembles · UCI/LibSVM datasetstest loss ratio vs uniform weightingMixed
optimize weights by TND, CCTND or CCPBB instead of uniform weightingheterogeneous classifier ensembles · UCI/LibSVM datasetstest loss ratio vs uniform weightingImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy