|
Activity Number:
|
465
- SPEED: Statistical Computing: Methods, Implementation, and Application, Part 1
|
|
Type:
|
Contributed
|
|
Date/Time:
|
Wednesday, July 31, 2019 : 8:30 AM to 10:20 AM
|
|
Sponsor:
|
Section on Statistical Computing
|
|
Abstract #304818
|
Presentation
|
|
Title:
|
Sampling Using Langevin Diffusion
|
|
Author(s):
|
Riddhiman Bhattacharya*
|
|
Companies:
|
University of Minnesota
|
|
Keywords:
|
Langevin;
MCMC;
diffusion
|
|
Abstract:
|
We study the Langevin diffusion and the underdamped Langevin diffusion when the log of the target is smooth and strongly concave. We present the Ozaki discretization MCMC algorithm and compare it with the Euler discretization algorithm both theoretically and computationally. We also compare both these algorithms to the Random Walk Metropolis Hastings Algorithm in the aforementioned ways. We also examine the algorithm as the time horizon goes to infinity at different rates.
|
Authors who are presenting talks have a * after their name.
Back to the full JSM 2019 program
|
