Parsimonious Adaptive Rejection Sampling

10/13/2017
by   Luca Martino, et al.
0

Monte Carlo (MC) methods have become very popular in signal processing during the past decades. The adaptive rejection sampling (ARS) algorithms are well-known MC technique which draw efficiently independent samples from univariate target densities. The ARS schemes yield a sequence of proposal functions that converge toward the target, so that the probability of accepting a sample approaches one. However, sampling from the proposal pdf becomes more computationally demanding each time it is updated. We propose the Parsimonious Adaptive Rejection Sampling (PARS) method, where an efficient trade-off between acceptance rate and proposal complexity is obtained. Thus, the resulting algorithm is faster than the standard ARS approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2015

Layered Adaptive Importance Sampling

Monte Carlo methods represent the "de facto" standard for approximating ...
research
07/25/2021

A Survey of Monte Carlo Methods for Parameter Estimation

Statistical signal processing applications usually require the estimatio...
research
08/17/2013

Adaptive Independent Sticky MCMC algorithms

In this work, we introduce a novel class of adaptive Monte Carlo methods...
research
07/29/2023

Neural Classifiers based Monte Carlo simulation

Acceptance-rejection (AR), Independent Metropolis Hastings (IMH) or impo...
research
12/20/2019

Adaptive Newton-Monte Carlo for efficient and fully error controlled yield optimization

In this paper we present an efficient and fully error controlled algorit...
research
03/23/2021

Efficiently Answering Durability Prediction Queries

We consider a class of queries called durability prediction queries that...
research
02/01/2019

Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits

Monte Carlo (MC) permutation testing is considered the gold standard for...

Please sign up or login with your details

Forgot password? Click here to reset