Select a calendar:
Filter April Events by Event Type:
Events for April 06, 2007
-
Last Day to Withdraw with W
Fri, Apr 06, 2007
Viterbi School of Engineering Student Affairs
University Calendar
Audiences: Everyone Is Invited
Contact: VSOE
-
Honors Program Colloquium: Digital Communications in the Third World
Fri, Apr 06, 2007 @ 01:00 PM - 02:00 PM
Viterbi School of Engineering Student Affairs
Conferences, Lectures, & Seminars
Lecture offered by Mr. Fred Baker, Fellow at Cisco Systems
Location: Olin Hall of Engineering (OHE) - 122
Audiences: Faculty and Honors Program Students
Contact: Erika Chua
-
Competitive National and International Fellowships
Fri, Apr 06, 2007 @ 02:30 PM - 03:30 PM
Viterbi School of Engineering Student Affairs
Workshops & Infosessions
Competitive National and International Fellowships
This session will include information about various competitive fellowships, including Rhodes Scholarships, Marshall Scholarships, Fulbright Grants, Luce Scholarships, Rotary Ambassadorial Scholarships, and many more. Topics to be covered include qualifications required for each fellowship, tips for writing a strong application, and answers to your questions. Students at all academic levels (freshman through senior, plus all graduate students) are welcome and encouraged to attend the information sessions. Most of the fellowships described here require applicants to hold U.S. citizenship. For more information:
USC Office of Academic Recognition Programs
Division of Student Affairs
213-740-9116 arpstaff@usc.edu
www.usc.edu/arp/fellowshipsLocation: Topping Student Center (TSC) 205
Audiences: Everyone Is Invited
Contact: Julie Phaneuf
-
CS Colloquium- Even-Dar
Fri, Apr 06, 2007 @ 03:30 PM - 04:30 PM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Title:Limitations and Challenges in No Regret AlgorithmsEyal Even-DarUniversity of PennsylvaniaAbstract:No regret algorithms have been studied extensively since the pioneering works of Blackwell, Hannan and Robbins in 1950s. In a sequential decision making problem where you are given an advice by N experts at each time step, the no regret algorithms guarantee that you will always do almost as good as the best expert in hindsight. Equipped with such strong theoretical guarantee, no regret algorithms have been applied successfully in many fields including machine learning, economics and game theory.In this talk I will present several challenges to and limitations of no regret algorithms. More specifically, I will consider adding natural constraints and adapting no regret algorithms to dynamic environments. Such scenarios will shed a light on how far these algorithms can be "pushed", while still satisfying the no regret property. Finally, I will consider a routing game where all users use no regret algorithms, and study the efficiency and the stability of such game.Biography:Eyal Even-Dar received his Ph.D. from Tel Aviv University in
2005 and is currently a postdoctoral fellow at the University of Pennsylvania. His interests include computational learning theory, machine learning, game theory and their intersection.Hosted by David KempeRefreshments will be served.
Location: Seaver Science Library (SSL) - 150
Audiences: Everyone Is Invited
Contact: Nancy Levien
