A Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness

A Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness

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


Duration: 1:06:50
1,014 views
15

Guy Bresler (Massachusetts Institute of Technology)
https://simons.berkeley.edu/talks/few-simple-average-case-reduction-techniques-and-their-surprising-effectiveness
Rigorous Evidence for Information-Computation Trade-offs



Other Videos By Simons Institute for the Theory of Computing


2021-09-16Tight Algorithmic Thresholds for Spin Glass Hamiltonians
2021-09-16The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials
2021-09-16Optimizing Noncommutative Polynomials: The SYK Model
2021-09-15Putting Quantum Supremacy on a Rigorous Footing
2021-09-15Mismatched Monte Carlo Algorithms For The Planted Clique Problem
2021-09-15Phase Retrieval In High Dimensions: Statistical And Computational Phase Transitions
2021-09-15All-or-Nothing Statistical and Computational Phase Transitions in Sparse Spiked Matrix Estimation
2021-09-15Signal Recovery With Generative Priors
2021-09-15Local Convexity Of The Tap Free Energy And Amp Convergence For Z2-Synchronization
2021-09-15The Initial Search Phase Of Stochastic Gradient Descent For High-Dimensional Inference Tasks
2021-09-14A Few Simple Average-Case Reduction Techniques And Their Surprising Effectiveness
2021-09-14Are Generative Models The New Sparsity?
2021-09-14To Be (Hard) or Not Be:...
2021-09-14The Overlap Gap Property For Inference: Power And Limitations
2021-09-14Computational Barriers to Estimation from Low-Degree Polynomials
2021-09-14Charting the Landscape of Memory/Data Tradeoffs in Continuous Optimization: ...
2021-09-14New Techniques For Proving Fine-Grained Average-Case Hardness
2021-09-14Robust Parameter Estimation For Random Graphs
2021-09-14Planted Geometric Matching Problems
2021-09-13Sum Of Squares Lower Bounds Versus Low-Degree Polynomial Lower Bounds
2021-09-13Smoothed CSP Refutation Is As Easy As Random, For Both Efficient Algorithms And Certificates


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Rigorous Evidence for Information-Computation Trade-offs
Guy Bresler