Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification

Published on Aug 20, 20151886 Views

Motivated by a sampling problem basic to computational statistical inference, we develop a toolset based on spectral sparsification for a family of fundamental problems involving Gaussian sampling, ma

Related categories

Chapter list

Efficient Sampling for Gaussian Graphical Models via Spectral Sparsification00:00
Gaussian Distribution00:07
Nearly-optimal Gaussian sampling00:28
Inverse Square-root Factor02:02
Considering graph G with normalized Laplacian02:40
Random-walk Matrix Polynomial Sparsification03:42
thank you!04:54