Birs- 24w5214: Computational Complexity of Statistical Inference
-
Title: Computational and statistical limits of inference from gaussian fields?
Speaker:
Link:
-
Title: Fine-Grained Extensions of the Low-Degree Testing Framework
Speaker:
Link:
-
Title: Private block model and graphon estimation via sum-of-squares
Speaker:
Link:
-
Title: From Sparse Random Graphs to Mean-field Models and Back
Speaker:
Link:
-
Title: Finding Planted Clique via Gradient Descent
Speaker:
Link:
-
Title: Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier
Speaker:
Link:
-
Title: Provably learning a multi-head attention layer
Speaker:
Link:
-
Title: Learning multi-index functions with gradient(s) descent(s)
Speaker:
Link:
-
Title: The Kikuchi Matrix Method, part I
Speaker:
Link:
-
Title: The Kikuchi Matrix Method, part II
Speaker:
Link:
-
Title: Cryptography from Planted Graphs: Security with Logarithmic-Size Messages
Speaker:
Link:
-
Title: Detection and recovery of latent geometry in random graphs
Speaker:
Link:
-
Title: Polynomial Time Power-Sum Decomposition of Polynomials
Speaker:
Link:
-
Title: Reinforcement Learning without Intractable Oracles?
Speaker:
Link:
-
Title: Robust recovery for stochastic block models, simplified and generalized
Speaker:
Link:
-
Title: Universal lower bounds against low-degree polynomials
Speaker:
Link:
-
Title:
Speaker:
Link:
-
Title: Hardness vs randomness for statistical inference
Speaker:
Link:
-
Title: Sharp statistical limits for shuffled linear regression
Speaker:
Link:
-
Title: On The Fourier Coefficients of High-Dimensional Random Geometric Graphs
Speaker:
Link: