Mismatched Monte Carlo Algorithms For The Planted Clique Problem

Mismatched Monte Carlo Algorithms For The Planted Clique Problem

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


Duration: 30:45
201 views
7

Maria Chiara Angelini (Sapienza - Università di Roma)
https://simons.berkeley.edu/talks/mismatched-monte-carlo-algorithms-planted-clique-problem
Rigorous Evidence for Information-Computation Trade-offs



Other Videos By Simons Institute for the Theory of Computing


2021-09-17The Estimation Error of General First Order Methods
2021-09-17Differential Privacy And The Complexity Of Simple Queries
2021-09-17Refutation and Spectrally Quiet Planting of Cuts and Colorings in Random Graphs
2021-09-17Optimal Spectral Recovery Of A Planted Vector In A Subspace
2021-09-16Extractor-Based Approach To Memory-Sample Tradeoffs
2021-09-16Average-Case Hardness in Proof Complexity
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


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