Abstract
The sum of squares hierarchy is a powerful method for solving statistical inference problems and sum of squares lower bounds give compelling evidence that these problems are hard. However, analyzing the sum of squares hierarchy can be quite challenging. In recent years, low-degree polynomials have been studied as an alternative method for analyzing statistical inference problems which is simpler yet still extremely effective. In this talk, I will describe how sum of squares lower bounds and low-degree polynomial lower bounds are related. I will then compare what is known about sum of squares lower bounds to what is known about low-degree polynomial lower bounds.