Object

breeze.stats.distributions.MarkovChain

Kernels

Related Doc: package MarkovChain

Permalink

object Kernels

Provides Markov transition kernels for a few common MCMC techniques

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Kernels
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  12. def metropolis[T](proposal: (T) ⇒ Rand[T])(logMeasure: (T) ⇒ Double)(implicit rand: RandBasis = Rand): (T) ⇒ Rand[T]

    Permalink

    Note this is not Metropolis-Hastings

    Note this is not Metropolis-Hastings

    proposal

    the symmetric proposal distribution generator

    logMeasure

    the distribution we want to sample from

  13. def metropolisHastings[T](proposal: (T) ⇒ Density[T] with Rand[T])(logMeasure: (T) ⇒ Double)(implicit rand: RandBasis = Rand): (T) ⇒ Rand[T]

    Permalink

    proposal

    the proposal distribution generator

    logMeasure

    the distribution we want to sample from

  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. def slice(logMeasure: (Double) ⇒ Double, valid: (Double) ⇒ Boolean)(implicit rand: RandBasis = Rand): (Double) ⇒ Rand[Double]

    Permalink

    Creates a slice sampler for a function.

    Creates a slice sampler for a function. logMeasure should be an (unnormalized) log pdf.

    logMeasure

    an unnormalized probability measure

    returns

    a slice sampler

  18. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  19. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  20. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped