Componentwise adaptation for high dimensional MCMC (Q2488398): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On adaptive Markov chain Monte Carlo algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Markov Chain Monte Carlo through Regeneration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive proposal distribution for random walk Metropolis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive Metropolis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Componentwise adaptation for high dimensional MCMC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo sampling methods using Markov chains and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-regenerative Markov chain Monte Carlo with adaptation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02789703 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028147833 / rank
 
Normal rank

Latest revision as of 09:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Componentwise adaptation for high dimensional MCMC
scientific article

    Statements

    Componentwise adaptation for high dimensional MCMC (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2006
    0 references
    A single component adaptive Metropolis (SCAM) sampling algorithm is described in which the variance of (Gaussian) proposal one-dimensional distribution varies at each step depending on the variancies of previously generated sample. The target components of the SCAM suffer from the poor mixing distribution when the target is highly correlated. So it is recommended to rotate the proposal distribution to the (estimated) principal components of the target distribution. Simulation examples with Gaussian targets in various dimensions up to 1000 are considered.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    principal components
    0 references
    multivariate distribution
    0 references
    random vectors generating
    0 references
    Markov chain Monte Carlo (MCMC) method
    0 references
    numerical examples
    0 references
    single component adaptive Metropolis sampling algorithm
    0 references
    0 references
    0 references