Spring 2010 Seminar Series

DATE: February 11th
LOCATION: E51-376
TIME: 4:15pm
Reception immediately following in the ORC Conference Room, E40-106

SPEAKER:
Cynthia Rudin

TITLE
Dynamics of AdaBoost

ABSTRACT
AdaBoost (Freund and Schapire 97) is one of the most successful and popular machine learning algorithms, though some of its basic convergence properties were not understood until recently. I will discuss the recent results on AdaBoost's convergence, which were obtained by analyzing an iterated map that is derived from the algorithm. This map exhibits cyclic behavior that can be understood analytically. This approach allows us to solve a well-studied problem of machine learning, namely whether AdaBoost achieves a "maximum margin" solution.

 

This talk is designed for a general mathematical audience, and no prior knowledge of machine learning is assumed.