Playlist: 31 videos

Rigorous Evidence for Information-Computation Trade-offs

0:26:0

Tight Algorithmic Thresholds for Spin Glass Hamiltonians

Mark Sellke (Stanford University)
https://simons.berkeley.edu/talks/algorithmic-phase-transition-random-k-sat-low-degree-polynomials
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:58:50

Average-Case Hardness in Proof Complexity

Susanna F. de Rezende (Czech Academy of Sciences)
https://simons.berkeley.edu/talks/tbd-354
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:44:56

Extractor-Based Approach To Memory-Sample Tradeoffs

Sumegha Garg (Harvard University)
https://simons.berkeley.edu/talks/extractor-based-approach-memory-sample-tradeoffs
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:26:51

Optimal Spectral Recovery Of A Planted Vector In A Subspace

Alexander Wein (UC Berkeley)
https://simons.berkeley.edu/talks/optimal-spectral-recovery-planted-vector-subspace
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:23:0

Refutation and Spectrally Quiet Planting of Cuts and Colorings in Random Graphs

Jess Banks (UC Berkeley)
https://simons.berkeley.edu/talks/tbd-351
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:59:41

Differential Privacy And The Complexity Of Simple Queries

Jonathan Ullman (Northeastern University)
https://simons.berkeley.edu/talks/differential-privacy-and-complexity-simple-queries
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:26:46

The Estimation Error of General First Order Methods

Michael Celentano (UC Berkeley)
https://simons.berkeley.edu/talks/tbd-352
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:28:55

Non-Gaussian Component Analysis: Statistical Query Hardness and its Applications

Ilias Diakonikolas (University of Wisconsin-Madison)
https://simons.berkeley.edu/talks/tbd-349
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:30:56

SQ Lower Bounds for Learning Halfspaces with Massart Noise

Daniel Kane (UC San Diego)
https://simons.berkeley.edu/talks/tbd-346
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:30:51

Towards Lower Bounds for Efficient Robust Estimation From Worst Case Assumptions

Jerry Li (Microsoft Research)
https://simons.berkeley.edu/talks/tbd-350
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page