Professor
Complete university lecture series taught by Santosh Vempala.
Simons Institute research symposium investigating the algorithmic and complexity-theoretic foundations of non-convex optimization, overparameterized generalization, and statistical-computational gaps.
Self-contained public lectures, keynote addresses, and research seminars.
Examine the computational complexity of linear optimization over convex bodies, presenting nearly quadratic lower bounds for randomized algorithms in the membership oracle model.
Search or browse every recorded session across courses and talks.
