2000 character limit reached
Shedding Light on the Asymmetric Learning Capability of AdaBoost
Published 8 Jul 2015 in cs.LG, cs.AI, and cs.CV | (1507.02084v1)
Abstract: In this paper, we propose a different insight to analyze AdaBoost. This analysis reveals that, beyond some preconceptions, AdaBoost can be directly used as an asymmetric learning algorithm, preserving all its theoretical properties. A novel class-conditional description of AdaBoost, which models the actual asymmetric behavior of the algorithm, is presented.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
