object Mll
Functions associated with particle filtering of Markov process models against time series data and the computation of marginal model likelihoods.
- Alphabetic
- By Inheritance
- Mll
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
bpf[S, O](x0: Vector[S], t0: Time, data: Ts[O], dataLik: (S, O) ⇒ LogLik, stepFun: (S, Time, Time) ⇒ S)(implicit arg0: State[S]): (LogLik, Time, Vector[S])
A simple bootstrap particle filter with multinomial resampling.
A simple bootstrap particle filter with multinomial resampling. Note that it supports time series of observations on irregular time grids. Note that this is the function which does most of the work for
pfMll
.- x0
A sample from the prior on the state at time
t0
. The size of the sample determines the number of particles used in the particle filter.- t0
The time corresponding to the prior sample
- data
The observed data in the form of a time series
- dataLik
The log-likelihood of the observation model
- stepFun
The transition kernel of the underlying process
- returns
A triple: the first element is the log of an unbiased estimate of the marginal likelihood of the model, the second is just the final time point, and the third is a sample from the posterior distribution of the final time point.
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
pfMll[P, S, O](simX0: (P) ⇒ Vector[S], t0: Time, stepFun: (P) ⇒ (S, Time, Time) ⇒ S, dataLik: (P) ⇒ (S, O) ⇒ LogLik, data: Ts[O])(implicit arg0: State[S]): (P) ⇒ LogLik
A function for evaluating marginal log-likelihoods of parametrised models.
A function for evaluating marginal log-likelihoods of parametrised models. It basically just threads a parameter value through the arguments required for
bpf
.- simX0
A function which when provided with a parameter value will return a sample from the prior on the intial state of a Markov process model. The size of the sample will determine the number of particles used in the particle filter.
- t0
The intial time corresponding to the prior sample
- stepFun
A function, which when provided with a parameter value, will return the transition kernel of a Markov process.
- dataLik
A function, which when provided with a parameter value, will return the log-likelihood of the observation model
- data
The observed data in the form of a time series
- def sample(n: Int, prob: DenseVector[Double]): Vector[Int]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()