Recent Developments in Combinatorial Optimization
In the past several years, there has been a lot of progress on combinatorial optimization. Using techniques in convex optimization, geometry, spectral graph theory and randomization, researchers have developed provably faster algorithms for many classical…
Social Computing Symposium 2016: Post Screen Personas and Listening Machines, Can machine learning be fair?
I’ll talk about how we need to rethink what we mean by an “algorithm” in the context of machine learning, and the implications for whether (and how) we can trust the opaque algorithms that make…
On Paths, Stars and Wyes In Trees
Computational Limits in Statistical Inference: Hidden Cliques and Sum of Squares
Characterizing the computational complexity of statistical inference problems is an outstanding open problem. This is gaining increasing importance given the ubiquity of large scale data analysis and algorithms in application domains as diverse as genomics,…