- About
- Courses
- Research
- Computational Social Science
- Critical Data Studies
- Data Science
- Economics and Information
- Education Technology
- Ethics, Law and Policy
- Human-Computer Interaction
- Human-Robot Interaction
- Incentives and Computation
- Infrastructure Studies
- Interface Design and Ubiquitous Computing
- Natural Language Processing
- Network Science
- Social Computing and Computer-supported Cooperative Work
- Technology and Equity
- People
- Career
- Undergraduate
- Info Sci Majors
- BA - Information Science (College of Arts & Sciences)
- BS - Information Science (CALS)
- BS - Information Science, Systems, and Technology
- MPS Early Credit Option
- Independent Research
- CPT Procedures
- Student Associations
- Undergraduate Minor in Info Sci
- Our Students and Alumni
- Graduation Info
- Contact Us
- Info Sci Majors
- Masters
- PHD
- Prospective PhD Students
- Admissions
- Degree Requirements and Curriculum
- Grad Student Orgs
- For Current PhDs
- Diversity and Inclusion
- Our Students and Alumni
- Graduation Info
- Program Contacts and Student Advising
Speaker
Wed, 10/09/2013 - 16:00
301 College Ave Seminar Room
Categories
Please join us for the Information Science Colloquium with guest, Robert Kleinberg from Cornell's Computer Science department.
Talk Title: Multi-Armed Bandits and the Web
Abstract: For more than fifty years, the multi-armed bandit problem has been the predominant theoretical model for investigating how to make the most efficient use of limited experimentation resources for optimization. In the past decade, the emergence of the Web as a platform for automated experimentation at a massive scale has inspired a variety of new opportunities and challenges in this area. I will survey some new algorithms that have been developed to address these challenges. Inspired by applications to e-commerce, crowdsourcing, Web search, and advertising, the algorithms touch on broader issues in experimental design: how to leverage side information when searching among a massive number of alternatives, how to design nearly optimal experimentation policies in the presence of supply limits, and how to make the best use of feedback in the form of relative preference judgments.
Bio: Bobby Kleinberg is an Associate Professor of Computer Science at Cornell University. His research studies the design and analysis of algorithms, and their applications to electronic commerce, networking, information retrieval, and other areas. Prior to receiving his doctorate from MIT in 2005, Kleinberg spent three years at Akamai Technologies, where he assisted in designing the world's largest Internet Content Delivery Network. He is the recipient of a Microsoft Research New Faculty Fellowship, an Alfred P. Sloan Foundation Fellowship, and an NSF CAREER Award.
Refreshments will be served.