The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Ensemble samplers with affine invariance
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905 · cited 3×
“Our ensemble methods are motivated in part by the Nelder Mead [11] 1Here xk is walker k in an ensemble of L walkers.”
MethodInfluentialMonte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
(2007) · Springer eBooks · doi:10.1007/978-0-387-71107-2 · Cited by 2,687
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
Monte Carlo Methods in Statistical Mechanics: Foundations and New Algorithms
Sokal, A. (1997) · NATO ASI Series · doi:10.1007/978-1-4899-0319-8_6 · Cited by 536
Multigrid Monte Carlo method. Conceptual foundations
Goodman, J., & Sokal, A. D. (1989) · Physical Review D · doi:10.1103/physrevd.40.2035 · Cited by 200
Self-citationWhat Do We Know about the Metropolis Algorithm ?
Diaconis, P. W., & Saloff‐Coste, L. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1576 · Cited by 142
Cited by
<tt>emcee</tt>: The MCMC Hammer
Foreman-Mackey, D., Hogg, D. W., Lang, D., & Goodman, J. (2013) · Publications of the Astronomical Society of the Pacific · doi:10.1086/670067 · Cited by 12,414
Self-citationStan : A Probabilistic Programming Language
Carpenter, B., Gelman, A., Hoffman, M. D., Lee, D., Goodrich, B., Betancourt, M., Brubaker, M., Guo, J., Li, P., & Riddell, A. (2017) · Journal of Statistical Software · doi:10.18637/jss.v076.i01 · Cited by 7,754
“Two flavors of ensemble samplers are also in the works: an affine invariant ensemble sampler (Goodman and Weare 2010) and a differential evolution sampler (Ter Braak 2006).”
MethodBinary Companions of Evolved Stars in APOGEE DR14: Search Method and Catalog of ∼5000 Companions
Price-Whelan, A. M., Hogg, D. W., Rix, H.-W., De Lee, N., Majewski, S. R., Nidever, D. L., Troup, N., Fernández-Trincado, J. G., García-Hernández, D. A., Longa-Peña, P., et al. (2018) · The Astronomical Journal · doi:10.3847/1538-3881/aac387 · Cited by 3,756
Riess, A. G., Yuan, W., Macri, L. M., Scolnic, D., Brout, D., Casertano, S., Jones, D. O., Murakami, Y., Anand, G. S., Breuval, L., et al. (2022) · The Astrophysical Journal Letters · doi:10.3847/2041-8213/ac5c5b · Cited by 2,380
dynesty: a dynamic nested sampling package for estimating Bayesian posteriors and evidences
Speagle, J. S. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa278 · Cited by 2,230
Metadata
- Authors
- Goodman, J., & Weare, J.
- Venue
- Communications in Applied Mathematics and Computational Science
- Publisher
- Mathematical Sciences Publishers
- Published
- 2010-01-31
- Volume
- 5
- Issue
- 1
- Pages
- 65-80
- ISSN
- 1559-3940 (ISSN-L)
- 2157-5452
- OpenAlex
- W2101687185
- Cited by
- 3,075
- References
- 7
- FWCI
- 11.85
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.