[Colloquium] Reminder: Talks Next TODAY at TTI-C/International House

[Katherine Cumming]

(1) Learning Theory Program/ML Summer School 
Speaker: Cynthia Rudin, Courant Institute/NYU
Speaker’s Homepage:  http://www.cns.nyu.edu/~rudin/main.html
Time:  Thursday, May 26th @ 2:00pm
Location:  International House-Assembly Hall
Title:  The Dynamics of AdaBoost
Abstract:
One of the most successful and popular learning algorithms is AdaBoost,
which is a classification algorithm designed to construct a "strong"
classifier from a "weak" learning algorithm. Just after the development
of AdaBoost nine years ago, scientists derived margin- based
generalization bounds to explain AdaBoost's unexpectedly good
performance. Their result predicts that AdaBoost yields the best
possible performance if it always achieves a "maximum margin" solution.
Yet, does AdaBoost achieve a maximum margin solution? Empirical and
theoretical studies conducted within this period conjecture the answer
to be "yes".

In order to answer this question, we look toward AdaBoost's dynamics. We
simplify AdaBoost to reveal a nonlinear iterated map. We then analyze
the convergence of AdaBoost for cases where cyclic behavior is found;
this cyclic behavior provides the key to answering the question of
whether AdaBoost always maximizes the margin. As it turns out, the
answer to this question turns out to be the opposite of what was thought
to be true!

In this talk, I will introduce AdaBoost, describe our analysis of
AdaBoost when viewed as a dynamical system, briefly mention a new
boosting algorithm which always maximizes the margin with a fast
convergence rate, and if time permits, I will reveal a surprising new
result about AdaBoost and the problem of bipartite ranking.

Cynthia Rudin: NSF postdoctoral research fellow, BIO-division.
 
(2)  ML Summer School 
Speaker: Gaëlle Loosli, PSI Rouen
Speaker’s Homepage:  http://asi.insa-rouen.fr/~gloosli/
Time:  Thursday, May 26th @ 1:00pm
Location:  TTI-C Conference Room
Title:  The SimpleSVM Toolbox
Abstract:
This demo presents the SimpleSVM Toolbox, an easy-to-use toolbox that is
completely implemented in Matlab. As it uses a recent algorithm for
support vector machines, it is very fast, even on multiclass problems.
For more information on this talk Click
<http://chicago05.mlss.cc/tiki/tiki-read_article.php?articleId=33>  Here

 
(3) Learning Theory Program/ML Summer School 
Speaker:  John Goldsmith, University of Chicago
Speaker’s Homepage: http://humanities.uchicago.edu/faculty/goldsmith/
Time:  Thursday, May 26 @ 3:10pm
Location:  TTI-C, Conference Room
Title:  Unsupervised Learning of Natural Language Morphology
Abstract:
The words in virtually all natural languages have internal structure,
generally quite complex structure; they are composed of substrings of
letters (or phonemes) called morphemes. Linguists are generally in
agreement as to what the right morphological analysis of words is; we
are concerned with developing a learning system which takes a large
sample of words from an arbitrary human language as its input and which
produces an analysis of the morphological structure of these words as
its output. We discuss our work so far on this problem, and current work
in progress. We will look primarily at English and Swahili, and perhaps
more briefly at a number of other languages. See
http://linguistica.uchicago.edu for more details
 
------------------------------------------------------------------------
-----
If you have questions, or would like to meet the speaker, please contact
Katherine at 773-834-1994 or kcumming at tti-c.org. For information on
future TTI-C talks or events, please go to the TTI-C Events
<http://ttic.uchicago.edu/events/events_dyn.php>  page. TTI-C:  1427
East 60th Street (University Press Building 2F), Chicago, IL  60637
 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20050526/efc78490/attachment.htm