CSE Seminar: Rob Schapire

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Thursday April 29, 2010 - Friday April 30, 2010
      2:00 pm - 2:59 pm
  • Location: MiRC 102 A & B
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Playing repeated games: Theory, an algorithm, applications

Full Summary: No summary paragraph submitted.

Rob Schapire

"Playing repeated games: Theory, an algorithm, applications"

Abstract:

This talk will describe a simple, general algorithm for learning to play any matrix game against an unknown adversary.  The algorithm, which is based directly on Littlestone and Warmuth's weighted majority algorithm, can be shown never to perform much worse than the best fixed strategy, even if selected in hindsight.  Moreover, because of the algorithm's moderate resource requirements, it can be used even when working with extremely large game matrices.  Taken together, these properties make the algorithm a good fit for a range of machine-learning applications, including on-line learning and boosting.  Recently, the algorithm has also been applied to reinforcement learning, specifically, to the problem of learning to imitate the behavior of an "expert" while attempting simultaneously to improve on the expert's performance.

Bio:

Robert Schapire received his ScB in math and computer science from Brown University in 1986, and his SM (1988) and PhD (1991) from MIT under the supervision of Ronald Rivest. After a short post-doc at Harvard, he joined the technical staff at AT&T Labs (formerly AT&T Bell Laboratories) in 1991 where he remained for eleven years. At the end of 2002, he became a Professor of Computer Science at Princeton University. His awards include the 1991 ACM Doctoral Dissertation Award, the 2003 Gödel Prize and the 2004 Kanelakkis Theory and Practice Award (both of the last two with Yoav Freund). His main research interest is in theoretical and applied machine learning.

Additional Information

In Campus Calendar
No
Groups

Computational Science and Engineering, College of Computing, School of Computational Science and Engineering

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Louise Russo
  • Workflow Status: Published
  • Created On: Apr 26, 2010 - 1:26pm
  • Last Updated: Oct 7, 2016 - 9:51pm