Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm (Q5502136)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm |
scientific article; zbMATH DE number 6473001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm |
scientific article; zbMATH DE number 6473001 |
Statements
17 August 2015
0 references
majority vote
0 references
ensemble methods
0 references
learning theory
0 references
PAC-Bayesian theory
0 references
sample compression
0 references
0.8170093894004822
0 references
0.7503582835197449
0 references
0.7503582835197449
0 references
