Completed
Ilias Zadik | Revisiting Jerrum’s Metropolis Process for the Planted Clique Problem
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
GRAMSIA - Graphical Models, Statistical Inference, and Algorithms
Automatically move to the next video in the Classroom when playback concludes
- 1 Subhabrata Sen | Mean-field approximations for high-dimensional Bayesian regression
- 2 Elchanan Mossel | Some modern perspectives on the Kesten-Stigum bound for reconstruction on trees.
- 3 Christina Lee Yu | Exploiting Neighborhood Interference w/Low Order Interactions...
- 4 Theo McKenzie | Spectral statistics for sparse random graphs
- 5 Ilias Zadik | Revisiting Jerrum’s Metropolis Process for the Planted Clique Problem
- 6 Florent Krzakala | Are Gaussian data all you need for machine learning theory?
- 7 Yury Polyanskiy | Recent results on broadcasting on trees and stochastic block model
- 8 Alex Wein | Is Planted Coloring Easier than Planted Clique?
- 9 Guy Bresler | Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs
- 10 Patrick Rebeschini | Implicit regularization via uniform convergence
- 11 Pragya Sur | A New Central Limit Theorem for the Augmented IPW estimator in high dimensions
- 12 Yihong Wu | Random graph matching at Otter’s threshold via counting chandeliers
- 13 Jake Abernethy | Optimization, Learning, and Margin-maximization via Playing Games
- 14 Devavrat Shah | On counterfactual inference with unobserved confounding via exponential family
- 15 Lester Mackey | Advances in Distribution Compression
