Click here to flash read.
arXiv:2301.12600v3 Announce Type: replace
Abstract: Bagging is an important technique for stabilizing machine learning models. In this paper, we derive a finite-sample guarantee on the stability of bagging for any model. Our result places no assumptions on the distribution of the data, on the properties of the base algorithm, or on the dimensionality of the covariates. Our guarantee applies to many variants of bagging and is optimal up to a constant. Empirical results validate our findings, showing that bagging successfully stabilizes even highly unstable base algorithms.
Click here to read this post out
ID: 823601; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: April 26, 2024, 7:33 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 10
CC:
No creative common's license
No creative common's license
Comments: