Sampling from the posterior distribution for a model whose normalizing constant is intractable is a long-standing problem in statistical research. We propose a new algorithm, adaptive auxiliary variable exchange algorithm, or, in short, adaptive exchange (AEX) algorithm, to tackle this problem. The new algorithm can be viewed as a MCMC extension of the exchange algorithm, which generates auxiliary variables via an importance sampling procedure from a Markov chain running in parallel. The convergence of the algorithm is established under mild conditions. Compared to the exchange algorithm, the new algorithm removes the requirement that the auxiliary variables must be drawn using a perfect sampler, and thus can be applied to many models for w...
Udgivelsesdato: JUNMaximum likelihood parameter estimation and sampling from Bayesian posterior dist...
We consider Monte Carlo approximations to the maximum likelihood estimator in models with intractabl...
In the design of efficient simulation algorithms, one is often beset with a poor choice of proposal ...
The Single Variable Exchange algorithm is based on a simple idea; any model that can be simulated ca...
The Single Variable Exchange algorithm is based on a simple idea; any model that can be simulated ca...
The exchange algorithm for handling models with intractable partition functions is combined with new...
Powerful ideas recently appeared in the literature are adjusted and combined to design improved samp...
textabstractThis paper presents the R package AdMit which provides functions to approximate and samp...
A class of adaptive sampling methods is introduced for efficient posterior and predictive simulation...
textabstractThis paper presents the R package AdMit which provides flexible functions to approximate...
International audienceAdaptive Monte Carlo methods are recent variance reduction techniques. In this...
Consider the standard Metropolis-Hastings (MH) algorithm for a given distribution P on x. This work ...
Markov chain Monte Carlo (MCMC) is an important computational technique for generating samples from ...
textabstractA class of adaptive sampling methods is introduced for efficient posterior and predictiv...
In the design of ecient simulation algorithms, one is often beset with a poorchoice of proposal dist...
Udgivelsesdato: JUNMaximum likelihood parameter estimation and sampling from Bayesian posterior dist...
We consider Monte Carlo approximations to the maximum likelihood estimator in models with intractabl...
In the design of efficient simulation algorithms, one is often beset with a poor choice of proposal ...
The Single Variable Exchange algorithm is based on a simple idea; any model that can be simulated ca...
The Single Variable Exchange algorithm is based on a simple idea; any model that can be simulated ca...
The exchange algorithm for handling models with intractable partition functions is combined with new...
Powerful ideas recently appeared in the literature are adjusted and combined to design improved samp...
textabstractThis paper presents the R package AdMit which provides functions to approximate and samp...
A class of adaptive sampling methods is introduced for efficient posterior and predictive simulation...
textabstractThis paper presents the R package AdMit which provides flexible functions to approximate...
International audienceAdaptive Monte Carlo methods are recent variance reduction techniques. In this...
Consider the standard Metropolis-Hastings (MH) algorithm for a given distribution P on x. This work ...
Markov chain Monte Carlo (MCMC) is an important computational technique for generating samples from ...
textabstractA class of adaptive sampling methods is introduced for efficient posterior and predictiv...
In the design of ecient simulation algorithms, one is often beset with a poorchoice of proposal dist...
Udgivelsesdato: JUNMaximum likelihood parameter estimation and sampling from Bayesian posterior dist...
We consider Monte Carlo approximations to the maximum likelihood estimator in models with intractabl...
In the design of efficient simulation algorithms, one is often beset with a poor choice of proposal ...