Low-Degree Hardness of Random Optimization Problems

Explore the intricacies of random optimization problems in this 19-minute IEEE conference talk. Delve into topics such as max independent set, planted problems, and spherical spin glass results. Gain insights from experts David Gamarnik, Aukosh Jagannath, and Alexander S. Wein as they discuss ensemble OGP and provide valuable comments on the subject. Discover what's missing in current approaches and expand your understanding of low-degree hardness in random optimization.