1:00-1:45: Pablo Parrilo: Introduction to Sum of Squares.
Applications in optimization, dynamical systems, and beyond. Symmetry reduction and flag algebras.
slides

1:45-2:30: Tselil Schramm: SOS and spectral algorithms. CSPs and random polynomials. Algorithmic speedups.
slides

2:30-3:00: Break

3:00-3:45 : Sam
Hopkins: Duality, Bayesian pseudo-expectations and
rounding. Planted clique problem.
slides

Sum-of-squares proofs and the quest toward optimal algorithms.
Boaz Barak, David Steurer,
arXiv:1404.5236

A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem.
Boaz Barak, Samuel B. Hopkins, Jonathan Kelner, Pravesh K. Kothari, Ankur Moitra, Aaron Potechin,
arXiv:1604.03084

Semidefinite programming relaxations for semialgebraic problems.
P.A. Parrilo, Mathematical Programming Ser. B, Vol. 96,
No.2, pp. 293-320, 2003.
pdf.

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors.
Samuel B. Hopkins, Tselil Schramm, Jonathan Shi, David Steurer,
arXiv:1512.02337