Copyright	(c) Adam Scibior 2015-2020
License	MIT
Maintainer	[email protected]
Stability	experimental
Portability	GHC
Safe Haskell	None
Language	Haskell2010

Control.Monad.Bayes.Traced.Dynamic

Description

Synopsis

data TracedT (m :: Type -> Type) a
hoist :: (forall x. m x -> m x) -> TracedT m a -> TracedT m a
marginal :: Monad m => TracedT m a -> m a
freeze :: forall (m :: Type -> Type) a. Monad m => TracedT m a -> TracedT m a
mhStep :: forall (m :: Type -> Type) a. MonadDistribution m => TracedT m a -> TracedT m a
mh :: MonadDistribution m => Int -> TracedT m a -> m [a]

Documentation

data TracedT (m :: Type -> Type) a Source #

A tracing monad where only a subset of random choices are traced and this subset can be adjusted dynamically.

Instances

Instances details

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

hoist :: (forall x. m x -> m x) -> TracedT m a -> TracedT m a Source #

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

Discard the trace and supporting infrastructure.

freeze :: forall (m :: Type -> Type) a. Monad m => TracedT m a -> TracedT m a Source #

Freeze all traced random choices to their current values and stop tracing them.

mhStep :: forall (m :: Type -> Type) a. MonadDistribution m => TracedT m a -> TracedT m a Source #

A single step of the Trace Metropolis-Hastings algorithm.

mh :: MonadDistribution m => Int -> TracedT m a -> m [a] Source #

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