Computational Complexity of Statistical Inference

Videos from BIRS Workshop

, Stanford
- 10:17
Computational and statistical limits of inference from gaussian fields?
Watch video | Download video: 202402260907-Koehler.mp4 (307M)
, University of California, Davis
- 11:11
Fine-Grained Extensions of the Low-Degree Testing Framework
Watch video | Download video: 202402261032-Wein.mp4 (90M)
, ETH Zurich
- 14:07
Private block model and graphon estimation via sum-of-squares
Watch video | Download video: 202402261312-Steurer.mp4 (271M)
, MIT
- 14:46
From Sparse Random Graphs to Mean-field Models and Back
Watch video | Download video: 202402261410-Gamarnik.mp4 (121M)
, University of Waterloo
- 15:26
Finding Planted Clique via Gradient Descent
Watch video | Download video: 202402261446-Jagannath.mp4 (175M)
, MIT
- 16:18
Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier
Watch video | Download video: 202402261545-Lange.mp4 (104M)
, Harvard University
- 16:51
Provably learning a multi-head attention layer
Watch video | Download video: 202402261618-Chen.mp4 (109M)
, EPFL
- 17:31
Learning multi-index functions with gradient(s) descent(s)
Watch video | Download video: 202402261651-Krzkala.mp4 (118M)
, Carnegie Mellon University
- 10:13
The Kikuchi Matrix Method, part I
Watch video | Download video: 202402270903-Kothari.mp4 (217M)
, CMU
- 11:05
The Kikuchi Matrix Method, part II
Watch video | Download video: 202402271033-Manohar.mp4 (99M)
, Technion
- 10:15
Cryptography from Planted Graphs: Security with Logarithmic-Size Messages
Watch video | Download video: 202402280905-Ishai.mp4 (253M)
, Center for Discrete Mathematics and Theoretical Computer Science
- 11:19
Detection and recovery of latent geometry in random graphs
Watch video | Download video: 202402281030-Liu.mp4 (134M)
, MIT
- 12:14
Polynomial Time Power-Sum Decomposition of Polynomials
Watch video | Download video: 202402281119-Bafna.mp4 (128M)
, Massachusetts Institute of Technology
- 15:05
Reinforcement Learning without Intractable Oracles?
Watch video | Download video: 202402281431-Moitra.mp4 (89M)
, UC Berkeley
- 20:25
Robust recovery for stochastic block models, simplified and generalized
Watch video | Download video: 202402281947-Wu.mp4 (104M)
, Johns Hopkins University
- 21:10
Universal lower bounds against low-degree polynomials
Watch video | Download video: 202402282030-Kunisky.mp4 (168M)
, Carnegie Mellon University
- 10:16
Dense-Sparse Learning Parity with Noise
Watch video | Download video: 202402290906-Jain.mp4 (205M)
, University of Ottawa
- 11:45
Hardness vs randomness for statistical inference
Watch video | Download video: 202402291107-Bogdanov.mp4 (101M)
, Duke University
- 20:40
Sharp statistical limits for shuffled linear regression
Watch video | Download video: 202402292007-Xu.mp4 (90M)
, MIT
- 21:21
On The Fourier Coefficients of High-Dimensional Random Geometric Graphs
Watch video | Download video: 202402292041-Bangachev.mp4 (129M)
, Santa fe Institute
- 10:16
Tensor networks, tensor cumulants, and tensor PCA
Watch video | Download video: 202403010906-Moore.mp4 (311M)
, MIT
- 10:59
A Constructive Proof of the Spherical Parisi Formula
Watch video | Download video: 202403011023-Huang.mp4 (115M)