Λέσχη Φίλων Στατιστικής - GrStats forum
AUEB-Stats Seminars 12/01/2024: Skew-symmetric sampling schemes and locally balancing algorithms by Georgios Vasdekis (University College London) Forumgrstats

Join the forum, it's quick and easy

Λέσχη Φίλων Στατιστικής - GrStats forum
AUEB-Stats Seminars 12/01/2024: Skew-symmetric sampling schemes and locally balancing algorithms by Georgios Vasdekis (University College London) Forumgrstats
Λέσχη Φίλων Στατιστικής - GrStats forum
Would you like to react to this message? Create an account in a few clicks or log in to continue.
Για προβλήματα εγγραφής και άλλες πληροφορίες επικοινωνήστε με : grstats.forum@gmail.com ή grstats@stat-athens.aueb.gr

Go down
avatar
GRStats2
Posts : 56
Join date : 2022-11-19

AUEB-Stats Seminars 12/01/2024: Skew-symmetric sampling schemes and locally balancing algorithms by Georgios Vasdekis (University College London) Empty AUEB-Stats Seminars 12/01/2024: Skew-symmetric sampling schemes and locally balancing algorithms by Georgios Vasdekis (University College London)

Thu 11 Jan 2024 - 9:34


AUEB STATS SEMINARS 2023-2024

Georgios Vasdekis
University College London

Title: "Skew-symmetric sampling schemes and locally balancing algorithms"

Friday, 12/01/2024
13:15
Troias Amphitheatre

ABSTRACT
Locally balancing algorithms are a new class of MCMC algorithms, recently introduced in (Livingstone and Zanella, 2022). One of these algorithms, the Barker algorithm, has been shown to be robust to heteroskedasticity of the posterior target and the step size of the algorithm. At the same time, the algorithm seems to preserve high dimensional properties of state of the art MCMC, making it an interesting alternative to the existing literature. In the first part of the talk we will review the main results on these locally balancing algorithms. It turns out that in order to sample from the Barker algorithm, one can use ideas of sampling from skew-symmetric distributions. We will transfer these ideas in the context of discretising and simulating from diffusion processes and we will suggest a new class of unadjusted MCMC algorithms, which are robust with respect to the step size.
This is joint work with S. Livingstone, N. Nusken and R. Zhang.

🔎  https://www.facebook.com/events/1611949359615934?ref=newsfeed
Back to top
Permissions in this forum:
You cannot reply to topics in this forum