mcmc

Sample from a posterior using Markov chain Monte Carlo

https://github.com/dschrempf/mcmc#readme

Version on this page:0.2.3
LTS Haskell 22.14:0.8.2.0
Stackage Nightly 2024-03-28:0.8.2.0
Latest on Hackage:0.8.2.0

See all snapshots mcmc appears in

GPL-3.0-or-later licensed by Dominik Schrempf
Maintained by [email protected]
This version can be pinned in stack with:mcmc-0.2.3@sha256:87c8604c6cf198d1f52e670a99ab5bb19c4848f9922f142dde378713fefe5d35,2435

Markov chain Monte Carlo

Sample from a posterior using Markov chain Monte Carlo methods.

At the moment, the library is tailored to the Metropolis-Hastings algorithm since it covers most use cases. However, implementation of more algorithms is planned in the future.

Documentation

The source code contains detailed documentation about general concepts as well as specific functions.

Examples

Have a look at the example MCMC analyses. They can be built with Stack and are attached to this repository.

git clone https://github.com/dschrempf/mcmc.git
cd mcmc
stack build

For example, estimate the accuracy of an archer with

stack exec archery

Changes

Markov chain Monte Carlo sampling - ChangeLog

Unreleased changes

0.2.3

  • Contrary proposals.
  • Change how monitors are lifted (use normal function, not a lens).
  • Priors.
  • Remove concurrent monitors (was slow).
  • Improve MCMC sampler output.

0.2.2

  • Move away from hpack.

0.2.1

  • Consistently use ByteString instead of Text.
  • Verbosity levels.
  • Improved handling of proposals, moves, and monitors.
  • Bactrian moves.
  • Many small changes.

0.1.3

Many changes; notably it is now possible to continue a Markov chain run.