Guardado en:
Detalles Bibliográficos
Autores principales: McKimm, Hector, Wang, Andi Q, Pollock, Murray, Robert, Christian P, Roberts, Gareth O
Formato: Preprint
Publicado: 2022
Materias:
Acceso en línea:https://arxiv.org/abs/2210.09901
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911780790337536
author McKimm, Hector
Wang, Andi Q
Pollock, Murray
Robert, Christian P
Roberts, Gareth O
author_facet McKimm, Hector
Wang, Andi Q
Pollock, Murray
Robert, Christian P
Roberts, Gareth O
contents Enriching Brownian motion with regenerations from a fixed regeneration distribution $μ$ at a particular regeneration rate $κ$ results in a Markov process that has a target distribution $π$ as its invariant distribution. For the purpose of Monte Carlo inference, implementing such a scheme requires firstly selection of regeneration distribution $μ$, and secondly computation of a specific constant $C$. Both of these tasks can be very difficult in practice for good performance. We introduce a method for adapting the regeneration distribution, by adding point masses to it. This allows the process to be simulated with as few regenerations as possible and obviates the need to find said constant $C$. Moreover, the choice of fixed $μ$ is replaced with the choice of the initial regeneration distribution, which is considerably less difficult. We establish convergence of this resulting self-reinforcing process and explore its effectiveness at sampling from a number of target distributions. The examples show that adapting the regeneration distribution guards against poor choices of fixed regeneration distribution and can reduce the error of Monte Carlo estimates of expectations of interest, especially when $π$ is skewed.
format Preprint
id arxiv_https___arxiv_org_abs_2210_09901
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Sampling using Adaptive Regenerative Processes
McKimm, Hector
Wang, Andi Q
Pollock, Murray
Robert, Christian P
Roberts, Gareth O
Computation
Enriching Brownian motion with regenerations from a fixed regeneration distribution $μ$ at a particular regeneration rate $κ$ results in a Markov process that has a target distribution $π$ as its invariant distribution. For the purpose of Monte Carlo inference, implementing such a scheme requires firstly selection of regeneration distribution $μ$, and secondly computation of a specific constant $C$. Both of these tasks can be very difficult in practice for good performance. We introduce a method for adapting the regeneration distribution, by adding point masses to it. This allows the process to be simulated with as few regenerations as possible and obviates the need to find said constant $C$. Moreover, the choice of fixed $μ$ is replaced with the choice of the initial regeneration distribution, which is considerably less difficult. We establish convergence of this resulting self-reinforcing process and explore its effectiveness at sampling from a number of target distributions. The examples show that adapting the regeneration distribution guards against poor choices of fixed regeneration distribution and can reduce the error of Monte Carlo estimates of expectations of interest, especially when $π$ is skewed.
title Sampling using Adaptive Regenerative Processes
topic Computation
url https://arxiv.org/abs/2210.09901