Copyright	(c) Adam Scibior 2015-2020
License	MIT
Maintainer	leonhard.markert@tweag.io
Stability	experimental
Portability	GHC
Safe Haskell	None
Language	Haskell2010

Control.Monad.Bayes.Traced.Basic

Description

Synopsis

data Traced m a
hoistT :: (forall x. m x -> m x) -> Traced m a -> Traced m a
marginal :: Monad m => Traced m a -> m a
mhStep :: MonadSample m => Traced m a -> Traced m a
mh :: MonadSample m => Int -> Traced m a -> m [a]

Documentation

data Traced m a Source #

Tracing monad that records random choices made in the program.

Instances

Instances details

Monad m => Monad (Traced m) Source #
Instance details Defined in Control.Monad.Bayes.Traced.Basic Methods (>>=) :: Traced m a -> (a -> Traced m b) -> Traced m b # (>>) :: Traced m a -> Traced m b -> Traced m b # return :: a -> Traced m a #
Monad m => Functor (Traced m) Source #
Instance details Defined in Control.Monad.Bayes.Traced.Basic Methods fmap :: (a -> b) -> Traced m a -> Traced m b # (<$) :: a -> Traced m b -> Traced m a #
Monad m => Applicative (Traced m) Source #
Instance details Defined in Control.Monad.Bayes.Traced.Basic Methods pure :: a -> Traced m a # (<>) :: Traced m (a -> b) -> Traced m a -> Traced m b # liftA2 :: (a -> b -> c) -> Traced m a -> Traced m b -> Traced m c # (>) :: Traced m a -> Traced m b -> Traced m b # (<*) :: Traced m a -> Traced m b -> Traced m a #
MonadInfer m => MonadInfer (Traced m) Source #
Instance details Defined in Control.Monad.Bayes.Traced.Basic
MonadCond m => MonadCond (Traced m) Source #
Instance details Defined in Control.Monad.Bayes.Traced.Basic Methods score :: Log Double -> Traced m () Source #
MonadSample m => MonadSample (Traced m) Source #
Instance details Defined in Control.Monad.Bayes.Traced.Basic Methods random :: Traced m Double Source # uniform :: Double -> Double -> Traced m Double Source # normal :: Double -> Double -> Traced m Double Source # gamma :: Double -> Double -> Traced m Double Source # beta :: Double -> Double -> Traced m Double Source # bernoulli :: Double -> Traced m Bool Source # categorical :: Vector v Double => v Double -> Traced m Int Source # logCategorical :: (Vector v (Log Double), Vector v Double) => v (Log Double) -> Traced m Int Source # uniformD :: [a] -> Traced m a Source # geometric :: Double -> Traced m Int Source # poisson :: Double -> Traced m Int Source # dirichlet :: Vector v Double => v Double -> Traced m (v Double) Source #

hoistT :: (forall x. m x -> m x) -> Traced m a -> Traced m a Source #

marginal :: Monad m => Traced m a -> m a Source #

Discard the trace and supporting infrastructure.

mhStep :: MonadSample m => Traced m a -> Traced m a Source #

A single step of the Trace Metropolis-Hastings algorithm.

mh :: MonadSample m => Int -> Traced m a -> m [a] Source #

Full run of the Trace Metropolis-Hastings algorithm with a specified number of steps.