Learning in Networks: Performance Limits and Algorithms

Videos from CMO Workshop

, Northwestern University
- 12:02
Spectral algorithms for community detection
Watch video | Download video: 202211141100-Gaudio.mp4 (63M)
, Carnegie Mellon University
- 15:46
Stochastic Bin Packing with Time-Varying Item Sizes
Watch video | Download video: 202211141500-Wang.mp4 (108M)
, Johns Hopkins University
- 10:33
Spectral pseudorandomness and the clique number of the Paley graph
Watch video | Download video: 202211150930-Kunisky.mp4 (103M)
, Princeton University
- 12:00
Correlated stochastic block models: graph matching and community recovery
Watch video | Download video: 202211151100-Racz.mp4 (125M)
, MIT
- 13:07
Uniqueness of BP fixed point for Ising models
Watch video | Download video: 202211151200-Polyanskiy.mp4 (137M)
, University of Illinois
- 15:57
Finite-sample lower bounds on information requirements for causal network inference
Watch video | Download video: 202211151500-Kang.mp4 (111M)
, University of British Columbia
- 10:27
Attributed Graph Alignment: Fundamental Limits and Efficient Algorithms
Watch video | Download video: 202211160930-Wang.mp4 (112M)
, UC Davis
- 12:00
Average-Case Computational Complexity of Tensor Decomposition
Watch video | Download video: 202211161100-Wein.mp4 (112M)
, Duke University
- 10:30
Random graph matching at Otter’s threshold via counting chandeliers
Watch video | Download video: 202211170930-Xu.mp4 (175M)
, University of Chicago
- 13:00
Optimal Full Ranking from Pairwise Comparisons
Watch video | Download video: 202211171200-Gao.mp4 (62M)
, MIT
- 17:38
Title: Revisiting Jerrum’s Metropolis Process for the Planted Clique Problem
Watch video | Download video: 202211171630-Zadik.mp4 (83M)
, Georgia Tech
- 10:16
Detection-Recovery Gap for Planted Dense Cycles
Watch video | Download video: 202211180930-Mao.mp4 (55M)
, University of Illinois
- 12:00
On community detection in preferential attachment networks
Watch video | Download video: 202211181100-Hajek.mp4 (67M)