arXiv (OAI Expanded)
open access
On the disintegration of the stochastic majority vote: From PAC-Bayesian bounds to a self-bounding algorithm
Weighted majority votes are central to many successful ensemble methods. PAC-Bayesian theory provides tight generalization guarantees for such models by analyzing the expected risk of stochastic classifiers, while analyzing the risk of deterministic majority votes relies on surrogate bounds. To avoi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Limited effects of action on ensemble processing.#440765
- Simultaneously accounting for the winner's curse and sample structure in Mendelian randomization: bivariate rerandomized inverse variance weighted estimator#684378
- Simultaneously accounting for the winner's curse and sample structure in Mendelian randomization: bivariate rerandomized inverse variance weighted estimator#682603
- Bootstrapping Classical Systems with Quenched Disorder#1034901
- Large fluctuations of extended Rademacher random multiplicative functions#1109176
Record · ID 1122802
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive