[Ml-stat-talks] Princeton Optimization Seminar, Elad Hazan, TODAY 4:30 PM
Amir Ali Ahmadi
a_a_a at princeton.edu
Wed Mar 11 12:01:53 EDT 2015
----- Princeton Optimization Seminar -----
DATE: March 11 (TODAY)
TIME: 4:30 pm
LOCATION: Sherrerd Hall 101
SPEAKER: Elad Hazan, Princeton University
TITLE: Projection-Free Optimization and Online Learning
Modern large data sets prohibit any super-linear time operations. This motivates the study of iterative optimization algorithms with low complexity per iteration. The computational bottleneck in applying state-of-the-art iterative methods is many times the so-called "projection step". We consider projection-free optimization/learning that replaces projections by more efficient linear optimization steps. We describe the first linearly-converging algorithm of this type for polyhedral sets and the implications for attaining optimal-rate stochastic optimization and online learning algorithms.
Elad Hazan joined the faculty at Princeton in 2015 from the Technion, where he had been an associate professor of operations research. His research focuses on the design and analysis of algorithms for basic problems in machine learning and optimization. He is the recipient of (twice) the IBM Goldberg best paper award in 2012 for contributions to sublinear time algorithms for machine learning, and in 2008 for decision making under uncertainty, a European Research Council grant , a Marie Curie fellowship and a Google Research Award (twice). He serves on the steering committee of the Association for Computational Learning and is a program co-chair for COLT 2015.
=== Princeton Optimization Seminar ===
If you would like to subscribe to the mailing list of the optimization seminar series, please visit the link below or send an email with
SUBSCRIBE opt-seminar in the body to listserv at lists.princeton.edu<mailto:listserv at lists.princeton.edu>.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Ml-stat-talks