Pedagogical Talk: Failure of Low-Degree Polynomials

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=tTv6jW8RaXM


Duration: 1:11:05
595 views
15

Alex Wein, NYU
https://simons.berkeley.edu/talks/pedagogical-talk-failure-local-algorithms
Computational Phase Transitions



Other Videos By Simons Institute for the Theory of Computing


2020-09-28Attacking the Off-Policy Problem With Duality
2020-09-28Offline Deep Reinforcement Learning Algorithms
2020-09-28Learning from the Past Without Great Exploration
2020-09-28MOPO: Model-Based Offline Policy Optimization
2020-09-25Pedagogical Talk: Frameworks for Information-Computation Tradeoffs
2020-09-25Reducibility and Statistical-Computational Gaps from Secret Leakage
2020-09-25Berkeley in the 80s, Episode 4: Andrew Yao
2020-09-25Free Energy Wells and Overlap Gap Property in Sparse PCA
2020-09-25The Overlap Gap Property in Principal Submatrix Recovery
2020-09-24Phase Retrieval in High Dimensions: Statistical and Computational Phase Transitions
2020-09-24Pedagogical Talk: Failure of Low-Degree Polynomials
2020-09-24The Rank of Sparse Random Matrices
2020-09-24Sampling From the Random Cluster Model at All Temperatures on Random Graphs
2020-09-24Correlation Decay for Hard Spheres via Markov Chains
2020-09-23Nodal Domains of G(n,p) Graphs
2020-09-23Pedagogical Talk: Random Optimisation Problems
2020-09-23Information/Computation Gaps in Heavy-Tailed Statistics
2020-09-23The Sum-of-Squares Approach to Clustering Non-Spherical Gaussian Mixtures
2020-09-23Thresholds of Descending Algorithms in Inference Problems
2020-09-23Optimization of Full-RSB Spherical Spin Glasses
2020-09-22A Positivity-First Approach to Sum-of-Squares Over the Hypercube


Tags:
Alex Wein
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Computational Phase Transitions