Optimal AdaBoost Converges

10/11/2022
by   Conor Snedeker, et al.
0

The following work is a preprint collection of formal proofs regarding the convergence properties of the AdaBoost machine learning algorithm's classifier and margins. Various math and computer science papers have been written regarding conjectures and special cases of these convergence properties. Furthermore, the margins of AdaBoost feature prominently in the research surrounding the algorithm. At the zenith of this paper we present how AdaBoost's classifier and margins converge on a value that agrees with decades of research. After this, we show how various quantities associated with the combined classifier converge.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2021

The CSO Classifier: Ontology-Driven Detection of Research Topics in Scholarly Articles

Classifying research papers according to their research topics is an imp...
research
08/04/2010

Algorithmic Detection of Computer Generated Text

Computer generated academic papers have been used to expose a lack of th...
research
12/19/2010

Removing Barriers to Interdisciplinary Research

A significant amount of high-impact contemporary scientific research occ...
research
05/24/2022

Using ACL2 To Teach Students About Software Testing

We report on our experience using ACL2 in the classroom to teach student...
research
01/07/2021

On the Convergence of Tsetlin Machines for the XOR Operator

The Tsetlin Machine (TM) is a novel machine learning algorithm with seve...
research
10/15/2020

On Convergence of Nearest Neighbor Classifiers over Feature Transformations

The k-Nearest Neighbors (kNN) classifier is a fundamental non-parametric...

Please sign up or login with your details

Forgot password? Click here to reset