mighty-metropolis

The Metropolis algorithm.

http://github.com/jtobin/mighty-metropolis

Version on this page:	1.2.0
LTS Haskell 23.0:	2.0.0@rev:1
Stackage Nightly 2024-12-09:	2.0.0@rev:1
Latest on Hackage:	2.0.0@rev:1

See all snapshots mighty-metropolis appears in

MIT licensed by Jared Tobin

Maintained by [email protected]

This version can be pinned in stack with:mighty-metropolis-1.2.0@sha256:b701c933b24dd6a556a57677189c1973809454c321ddf729a3f73c82234ce82a,2089

Module documentation for 1.2.0

Numeric
- Numeric.MCMC
  - Numeric.MCMC.Metropolis

Depends on 7 packages(full list with versions):

base, kan-extensions, mcmc-types, mwc-probability, pipes, primitive, transformers

Used by 1 package in lts-13.11(full list with versions):

declarative

The classic Metropolis algorithm.

Wander around parameter space according to a simple spherical Gaussian distribution.

Exports a mcmc function that prints a trace to stdout, a chain function for collecting results in-memory, and a metropolis transition operator that can be used more generally.

import Numeric.MCMC.Metropolis

rosenbrock :: [Double] -> Double
rosenbrock [x0, x1] = negate (5  *(x1 - x0 ^ 2) ^ 2 + 0.05 * (1 - x0) ^ 2)

main :: IO ()
main = withSystemRandom . asGenIO $ mcmc 10000 1 [0, 0] rosenbrock