Playlist: 31 videos

Rigorous Evidence for Information-Computation Trade-offs

0:57:41

Smoothed CSP Refutation Is As Easy As Random, For Both Efficient Algorithms And Certificates

Pravesh K. Kothari (Carnegie Mellon University)
https://simons.berkeley.edu/talks/smoothed-csp-refutation-easy-random-both-efficient-algorithms-and-certificates
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:29:6

Sum Of Squares Lower Bounds Versus Low-Degree Polynomial Lower Bounds

Aaron Potechin (University of Chicago)
https://simons.berkeley.edu/talks/sum-squares-lower-bounds-versus-low-degree-polynomial-lower-bounds
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:31:26

Planted Geometric Matching Problems

Dmitriy (Tim) Kunisky (NYU)
Planted Geometric Matching Problems
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:24:15

Robust Parameter Estimation For Random Graphs

Jayadev Acharya (Cornell University)
https://simons.berkeley.edu/talks/robust-parameter-estimation-random-graphs
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:43:51

New Techniques For Proving Fine-Grained Average-Case Hardness

Andrea Lincoln (UC Berkeley)
https://simons.berkeley.edu/talks/new-techniques-proving-fine-grained-average-case-hardness
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:44:40

Charting the Landscape of Memory/Data Tradeoffs in Continuous Optimization: A Survey of Open Problems

Gregory Valiant (Stanford University)
https://simons.berkeley.edu/talks/tbd-348
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:28:55

Computational Barriers to Estimation from Low-Degree Polynomials

Tselil Schramm (Stanford University)
https://simons.berkeley.edu/talks/tbd-355
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:36:15

The Overlap Gap Property For Inference: Power And Limitations

Ilias Zadik (Massachusetts Institute of Technology)
https://simons.berkeley.edu/talks/overlap-gap-property-inference-power-and-limitations
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:35:56

To Be (Hard) or Not Be: The Spiked Matrix-Tensor Model

Florent Krzakala (École polytechnique fédérale de Lausanne)
https://simons.berkeley.edu/talks/tbd-347
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page
0:29:16

Are Generative Models The New Sparsity?

Bruno Loureiro (EPFL)
https://simons.berkeley.edu/talks/are-generative-models-new-sparsity
Rigorous Evidence for Information-Computation Trade-offs
Visit talk page