Painless general-purpose sampling.
Switch branches/tags
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
lib
src
test
.gitignore
.travis.yml
CHANGELOG
LICENSE
README.md
Setup.hs
flat-mcmc.cabal
stack-travis.yaml
stack.yaml

README.md

flat-mcmc

Build Status Hackage Version MIT License

flat-mcmc is a Haskell library for painless, efficient, general-purpose sampling from continuous distributions.

flat-mcmc uses an ensemble sampler that is invariant to affine transformations of space. It wanders a target probability distribution's parameter space as if it had been "flattened" or "unstretched" in some sense, allowing many particles to explore it locally and in parallel.

In general this sampler is useful when you want decent performance without dealing with any tuning parameters or local proposal distributions. Check out the paper describing the algorithm here, and a paper on some potential limitations here, authored by my friends David Huijser and Brendon Brewer. There is also also a robust Python implementation here authored by Dan Foreman-Mackey, a very nice dude who I once moved some furniture with.

flat-mcmc exports an 'mcmc' function that prints a trace to stdout, as well as a 'flat' transition operator that can be used more generally.

import Numeric.MCMC.Flat
import qualified Data.Vector.Unboxed as U (unsafeIndex)

rosenbrock :: Particle -> Double
rosenbrock xs = negate (5  * (x1 - x0 ^ 2) ^ 2 + 0.05 * (1 - x0) ^ 2) where
  x0 = U.unsafeIndex xs 0
  x1 = U.unsafeIndex xs 1

origin :: Ensemble
origin = ensemble [
    particle [negate 1.0, negate 1.0]
  , particle [negate 1.0, 1.0]
  , particle [1.0, negate 1.0]
  , particle [1.0, 1.0]
  ]

main :: IO ()
main = withSystemRandom . asGenIO $ mcmc 12500 origin rosenbrock

trace