[Colloquium] Show & Tell Series at TTI-C (Tuesday 1/4/05)

[Katherine Cumming]

TOYOTA TECHNOLOGICAL INSTITUTE 
SHOW AND TELL SERIES TALK
 
Speaker: David McAllester
Speaker's homepage: http://www.tti-c.org//mcallester.html
 
Title: Generalization bounds for structured labels
 
 
Time: Tuesday, January 4th, 12:15pm
Place: TTI-C conference room (1427 E. 60th St. - 2nd Floor) Lunch
provided
 
Abstract:
There has recently been considerable interest in classification problems
with structured labels, such as the problem of assigning a sequence of
part of speech tags to a word string or assigning a parse tree to a word
string.  A major advance in the theory of structured labeling was made
by Taskar, Guestrin and Koller who gave an exponentially improved
generalization bound for the structured label case.  This talk will
review this bound and present a PAC-Bayesian proof.  The PAC-Bayesian
proof provides insight into the structure of the bound and also allows
some nontrivial tightening.  The relationship between the bound and
algorithms will also be discussed.
 
 
 
If you have questions, or would like to meet the speaker, please contact
Katherine at 4-1994 or kcumming at tti-c.org For information on future
TTI-C talks or events, please go to the TTI-C Events page:
http://www.tti-c.org/events.shtml
 
 
 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20041229/3143ec5d/attachment.htm