Efficient sampling of fast and slow cosmological parameters

University of Sussex

Indexed inarxivcrossref

Abstract

Physical parameters are often constrained from the data likelihoods using sampling methods. Changing some parameters can be much more computationally expensive (``slow'') than changing other parameters (``fast parameters''). I describe a method for decorrelating fast and slow parameters so that parameter sampling in the full space becomes almost as efficient as sampling in the slow subspace when the covariance is well known and the distributions are simple. This gives a large reduction in computational cost when there are many fast parameters. The method can also be combined with a fast ``dragging'' method proposed by Neal arXiv:math/0502099 that can be more robust and efficient when parameters cannot be fully…

Citation impact

567
total citations
FWCI
21.22
Percentile
100%
References
12
Citations per year

Authors

1

Topics & keywords

Keywords
  • Sampling (signal processing)
  • Subspace topology
  • Algorithm
  • Computer science
  • A priori and a posteriori
  • Reduction (mathematics)
  • Covariance
  • Code (set theory)
No related works found for this paper.

Funding