Los puntos clave no están disponibles para este artículo en este momento.
Markov chain Monte Carlo (MCMC) algorithms are widely used for fitting hierarchical models to data.MCMC is the predominant tool used in Bayesian analyses to generate samples from the posterior distribution of model parameters conditional on observed data.MCMC is not a single algorithm, but rather a framework in which various sampling methods (samplers) are assigned to operate on subsets of unobserved parameters.There exists a vast set of valid samplers to draw upon, which differ in complexity, autocorrelation of samples produced, and applicability.Hamiltonian Monte Carlo HMC; Radford M. Neal ( 2011) sampling is one such technique, applicable to continuous-valued parameters, which uses gradients to generate large transitions in parameter space.The resulting samples have low autocorrelation, and therefore have high information content, relative for example to an equal-length sequence of highly autocorrelated samples.The No-U-Turn (NUTS) variety of HMC sampling HMC-NUTS; Hoffman & Gelman (2014) greatly increases the usability of HMC by introducing a recursive tree of numerical integration steps that makes it unnecessary to pre-specify a fixed number of steps.Hoffman & Gelman (2014) also introduce a self-tuning scheme for the step size, resulting in a fully automated HMC sampler with no need for manual tuning.
Turek et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: