Fast Spectral Algorithms from Sum-of-Squares Analyses

Explore a 39-minute lecture by Tselil Schramm from UC Berkeley on fast spectral algorithms derived from sum-of-squares analyses. Delve into the intersection of hierarchies, extended formulations, and matrix-analytic techniques as part of the Simons Institute's series on advanced algorithmic concepts. Gain insights into cutting-edge research that bridges theoretical computer science and practical algorithm design.