Ensemble samplers with affine invariance
Courant Institute of Mathematical Sciences · New York University
Indexed incrossref
Abstract
We propose a family of Markov chain Monte Carlo methods whose performance is unaffected by affine tranformations of space. These algorithms are easy to construct and require little or no additional computational overhead. They should be particularly useful for sampling badly scaled distributions. Computational tests show that the affine invariant methods can be significantly faster than standard MCMC methods on highly skewed distributions.
Citation impact
3,078
total citations
- FWCI
- 12.81
- Percentile
- 100%
- References
- 13
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- Affine transformation
- Mathematics
- Artificial intelligence
- Computer science
- Pure mathematics
No related works found for this paper.