Sum-Of-Squares Lower Bound for Statistical Problems

Sum-Of-Squares Lower Bound for Statistical Problems

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


Duration: 1:01:45
925 views
13

Samuel Hopkins (UC Berkeley)
https://simons.berkeley.edu/talks/sum-squares-lower-bound-statistical-problems
Average-Case Complexity: From Cryptography to Statistical Learning



Other Videos By Simons Institute for the Theory of Computing


2021-11-30Constrained Optimization On Riemannian Manifolds
2021-11-30Near Optimal Sample Complexity For Matrix And Tensor Normal Models Via Geodesic Convexity
2021-11-30Computing The Nc-Rank Via Discrete Convex Optimization On Cat(0) Spaces
2021-11-29Norm Minimization, Invariant Theory, And Quantum Tomography
2021-11-19Discussion: Structure and RL
2021-11-17Panel on Verifiable Quantum Advantage | Quantum Colloquium
2021-11-17Interactive Protocols for Classically-Verifiable Quantum Advantage with an Ion-Trap Quantum Computer
2021-11-11On the Cryptographic Hardness of Learning Single Periodic Neurons
2021-11-11Worst-Case Robustness in Machine Learning
2021-11-11Computational trade-offs in graph models
2021-11-11Sum-Of-Squares Lower Bound for Statistical Problems
2021-11-10Analyzing Average-Case Complexity by Meta-Complexity
2021-11-10Panel on Achieving Quantum Advantage in the NISQ Era | Quantum Colloquium
2021-11-09On The Hardness Of Average-Case k-SUM
2021-11-09Low-Complexity Cryptography and Simple Hard-to-Learn Functions
2021-11-09Indistinguishability Obfuscation and Learning Problems
2021-11-09Average-Case Hardness Of CSPs
2021-11-08On Breaking Encryption With A Statistical Zero-Knowledge Oracle
2021-11-06Function Space View Of Bounded Weight Norm Networks
2021-11-05The Planted Matching Problem: Sharp Threshold And Infinite-Order Phase Transition
2021-11-05Scalable And Reliable Inference For Probabilistic Modeling


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Average-Case Complexity: From Cryptography to Statistical Learning
Samuel Hopkins