September 13, 2016
Suvrit Sra (MIT)
In this talk, I will highlight some aspects of geometry and its role in optimization. In particular, I will talk about optimization problems whose parameters are constrained to lie on a manifold or in a suitable metric space. These geometric...
September 27, 2016
Steve Wright (University of Wisconsin-Madison)
A permutation of n components appears among the variables or in the formulation of several interesting optimization problems, including quadratic assignment, 2-SUM, and projection onto the unit simplex or an l-1 ball. One device used to formulate...
October 4, 2016
Frank Kschischang (University of Toronto)
The vast majority of the world's telecommunications and Internet traffic is carried, for at least part of its journey, over a network of land-based and under-sea fiber-optic cables that span the globe. Recent decades have witnessed steady...
October 25, 2016
Jeffrey Bilmes (University of Washington )
In this talk, we'll first review how submodular functions are useful in data science for various data manipulation problems (e.g., summarization and partitioning), and how certain submodular functions (e.g., sums of concave composed with modular...
November 1, 2016
Bruce Hajek (University of Illinois Urbana-Champaign)
Detecting or estimating a dense community from a network graph offers a rich set of problems involving the interplay of algorithms, complexity, and information limits. The speaker in his talk will present an overview and recent results on the topic.
November 15, 2016
Negar Kiyavash (University of Illinois Urbana-Champaign)
November 22, 2016
Patrick Rebeschini (Yale University)
November 29, 2016
Rebecca Willett (University of Wisconsin-Madison)