Select a calendar:
Filter October Events by Event Type:
Events for October 06, 2008
-
Mathematics for System Safety Analysis - Oct. 6-8, 2008
Mon, Oct 06, 2008
Aviation Safety and Security Program
Conferences, Lectures, & Seminars
MATH 09-1
For more information and to register for Aviation Safety and Security Program courses, please visit http://viterbi.usc.edu/aviation.Audiences: Registered Attendees Only
Contact: Viterbi Professional Programs
-
CANCELED! Webcor Builders Information Session
Mon, Oct 06, 2008
Viterbi School of Engineering Career Connections
Workshops & Infosessions
THIS INFORMATION SESSION HAS BEEN CANCELED
Audiences: None Available
Contact: RTH 218 Viterbi Career Services
-
Meet USC
Mon, Oct 06, 2008
Viterbi School of Engineering Undergraduate Admission
Workshops & Infosessions
This half day program is designed for prospective freshmen and family members. Meet USC includes an information session on the University and the Admission process; a student led walking tour of campus and a meeting with us in the Viterbi School. Meet USC is designed to answer all of your questions about USC, the application process and financial aid.Reservations are required for Meet USC. This program occurs twice, once at 9:00 a.m. and again at 1:00 p.m. Please visit http://www.usc.edu/admission/undergraduate/visit/meet_usc.html to check availability and make an appointment. Be sure to list an Engineering major as your "intended major" on the webform!
Location: USC Admission Center
Audiences: Prospective Freshmen and Family Members - RESERVATIONS REQUIRED
Contact: Viterbi Undergraduate Admission
-
Multi-Armed Bandits in Metric Spaces
Mon, Oct 06, 2008 @ 11:00 AM
Thomas Lord Department of Computer Science
Conferences, Lectures, & Seminars
Speaker: Alex Slivkins, Microsoft Research - SVC
Host: Prof. David KempeAbstract:
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials so as to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is quite well understood, bandit problems with large strategy sets are still a topic of very active investigation, motivated by practical applications such as online auctions and web advertisement. The goal of such research is to identify broad and natural classes of strategy sets and payoff functions which enable the design of efficient solutions.In this work we study a very general setting for the multi-armed bandit problem in which the strategies form a metric space, and the payoff function satisfies a Lipschitz condition with respect to the metric. We refer to this problem as the "Lipschitz MAB problem". We present a complete solution for the multi-armed problem in this setting. That is, for every metric space (L,X) we define an isometry invariant which bounds from below the performance of Lipschitz MAB algorithms for X, and we present an algorithm which comes arbitrarily close to meeting this bound. Furthermore, our technique gives even better results for benign payoff functions. (STOC'08: joint work with Bobby Kleinberg and Eli Upfal)Biography:
Alex Slivkins is a researcher at Microsoft Research, Silicon Valley Center. Before that he has been an undergrad at Caltech, a grad student at Cornell CS dept, and a postdoc at Brown. He is interested in the design and analysis of algorithms, the theory of large distributed networks, and machine learning. Specific topics of interest include metric embeddings, locality-aware overlay networks, and multi-armed bandits.Location: James H. Zumberge Hall Of Science (ZHS) - 163
Audiences: Everyone Is Invited
Contact: CS Colloquia
-
BME 533 Seminar Series: Stephan Erberich, Ph.D.
Mon, Oct 06, 2008 @ 12:30 PM - 01:50 PM
Alfred E. Mann Department of Biomedical Engineering
Conferences, Lectures, & Seminars
Stephan Erberich, PhD,
“Multi-Center Biomedical Image Exchange in Clinic and Research using HealthGrid Technologies"
Location: Olin Hall of Engineering (OHE) - 132
Audiences: Everyone Is Invited
Contact: Mischalgrace Diasanta
