0.25
0.5
0.75
1.25
1.5
1.75
2
Fast Mixing for Discrete Point Processes
Published on Aug 20, 20151953 Views
We investigate the systematic mechanisms for designing fast mixing Markov chains Monte Carlo algorithms to sample from discrete point processes. Such processes are defined as probability distributions
Related categories
Chapter list
fast Mixing for Discrete Point Processes00:00
Role of submodularity in probability?00:17
Fast mixing MCMC: control on Hessian02:28
Hessian capture 'curvature' much better than curvature!03:49