mighty-metropolis: The Metropolis algorithm.
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, as well as 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
Downloads
- mighty-metropolis-1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 1.0.0, 1.0.1, 1.0.2, 1.0.3, 1.0.4, 1.1.0, 1.2.0, 2.0.0 |
---|---|
Dependencies | base (<5), mcmc-types (>=1.0.1), mwc-probability (>=1.0.1), pipes, primitive, transformers [details] |
License | MIT |
Author | Jared Tobin |
Maintainer | jared@jtobin.ca |
Category | Numeric |
Home page | http://github.com/jtobin/mighty-metropolis |
Source repo | head: git clone http://github.com/jtobin/mighty-metropolis.git |
Uploaded | by JaredTobin at 2015-10-08T08:33:11Z |
Distributions | LTSHaskell:2.0.0, NixOS:2.0.0, Stackage:2.0.0 |
Reverse Dependencies | 1 direct, 1 indirect [details] |
Downloads | 5521 total (1 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2015-10-08 [all 1 reports] |