Biggs, F;
Zantedeschi, V;
Guedj, B;
(2022)
On Margins and Generalisation for Voting Classifiers.
In:
Advances in Neural Information Processing Systems.
NeurIPS
Preview |
Text
2333_on_margins_and_generalisation_.pdf - Published Version Download (1MB) | Preview |
Abstract
We study the generalisation properties of majority voting on finite ensembles of classifiers, proving margin-based generalisation bounds via the PAC-Bayes theory. These provide state-of-the-art guarantees on a number of classification tasks. Our central results leverage the Dirichlet posteriors studied recently by Zantedeschi et al. (2021) for training voting classifiers; in contrast to that work our bounds apply to non-randomised votes via the use of margins. Our contributions add perspective to the debate on the “margins theory” proposed by Schapire et al. (1998) for the generalisation of ensemble classifiers.
| Type: | Proceedings paper |
|---|---|
| Title: | On Margins and Generalisation for Voting Classifiers |
| Event: | 36th Conference on Neural Information Processing Systems (NeurIPS 2022) |
| ISBN-13: | 9781713871088 |
| Open access status: | An open access version is available from UCL Discovery |
| Publisher version: | https://proceedings.neurips.cc/paper_files/paper/2... |
| Language: | English |
| Additional information: | This version is the version of record. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10173691 |
Loading...
Loading...Loading...Loading...Archive Staff Only
 |
View Item |
