breeze.stats.mcmc

AffineStepMetropolisHastings

case class AffineStepMetropolisHastings[T](logLikelihood: (T) ⇒ Double, proposalStep: Rand[T], init: T, burnIn: Long = 0, dropCount: Int = 0)(implicit rand: RandBasis = breeze.stats.distributions.Rand, vectorSpace: VectorSpace[T, _]) extends BaseMetropolisHastings[T] with SymmetricMetropolisHastings[T] with Product with Serializable

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. AffineStepMetropolisHastings
  2. Product
  3. Equals
  4. SymmetricMetropolisHastings
  5. BaseMetropolisHastings
  6. TracksStatistics
  7. Process
  8. MetropolisHastings
  9. Rand
  10. Serializable
  11. Serializable
  12. AnyRef
  13. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AffineStepMetropolisHastings(logLikelihood: (T) ⇒ Double, proposalStep: Rand[T], init: T, burnIn: Long = 0, dropCount: Int = 0)(implicit rand: RandBasis = breeze.stats.distributions.Rand, vectorSpace: VectorSpace[T, _])

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

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

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. def aboveOneCount: Long

  7. def aboveOneFrac: Double

    Definition Classes
    TracksStatistics
  8. def acceptanceCount: Long

  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  10. val burnIn: Long

  11. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. def condition(p: (T) ⇒ Boolean): Rand[T]

    Definition Classes
    Rand
  13. def draw(): T

    Gets one sample from the distribution.

    Gets one sample from the distribution. Equivalent to sample()

    Definition Classes
    BaseMetropolisHastingsRand
  14. def drawOpt(): Option[T]

    Overridden by filter/map/flatmap for monadic invocations.

    Overridden by filter/map/flatmap for monadic invocations. Basically, rejeciton samplers will return None here

    Definition Classes
    Rand
  15. val dropCount: Int

  16. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  17. def filter(p: (T) ⇒ Boolean): Rand[T]

    Definition Classes
    Rand
  18. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  19. def flatMap[E](f: (T) ⇒ Rand[E]): Rand[E]

    Converts a random sampler of one type to a random sampler of another type.

    Converts a random sampler of one type to a random sampler of another type. Examples: randInt(10).flatMap(x => randInt(3 * x.asInstanceOf[Int]) gives a Rand[Int] in the range [0,30] Equivalently, for(x <- randInt(10); y <- randInt(30 *x)) yield y

    f

    the transform to apply to the sampled value.

    Definition Classes
    Rand
  20. def foreach(f: (T) ⇒ Unit): Unit

    Samples one element and qpplies the provided function to it.

    Samples one element and qpplies the provided function to it. Despite the name, the function is applied once. Sample usage:

     for(x <- Rand.uniform) { println(x) } 
    

    f

    the function to be applied

    Definition Classes
    Rand
  21. def get(): T

    Definition Classes
    Rand
  22. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  23. val init: T

  24. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  25. def likelihood(x: T): Double

    Definition Classes
    MetropolisHastings
  26. def likelihoodRatio(start: T, end: T): Double

    Definition Classes
    MetropolisHastings
  27. def logLikelihood(x: T): Double

  28. val logLikelihood: (T) ⇒ Double

  29. def logLikelihoodRatio(start: T, end: T): Double

  30. def logTransitionProbability(start: T, end: T): Double

  31. def map[E](f: (T) ⇒ E): Rand[E]

    Converts a random sampler of one type to a random sampler of another type.

    Converts a random sampler of one type to a random sampler of another type. Examples: uniform.map(_*2) gives a Rand[Double] in the range [0,2] Equivalently, for(x <- uniform) yield 2*x

    f

    the transform to apply to the sampled value.

    Definition Classes
    Rand
  32. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  33. def nextDouble: Double

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  34. final def notify(): Unit

    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  36. def observe(x: T): AffineStepMetropolisHastings[T]

    Force the "next" draw to be x, and return a new process.

    Force the "next" draw to be x, and return a new process.

    Definition Classes
    AffineStepMetropolisHastingsProcess
  37. def proposalDraw(x: T): T

  38. val proposalStep: Rand[T]

  39. def rejectionCount: Long

    Definition Classes
    TracksStatistics
  40. def rejectionFrac: Double

    Definition Classes
    TracksStatistics
  41. def sample(n: Int): IndexedSeq[T]

    Gets n samples from the distribution.

    Gets n samples from the distribution.

    Definition Classes
    Rand
  42. def sample(): T

    Gets one sample from the distribution.

    Gets one sample from the distribution. Equivalent to get()

    Definition Classes
    Rand
  43. def samples: Iterator[T]

    An infinitely long iterator that samples repeatedly from the Rand

    An infinitely long iterator that samples repeatedly from the Rand

    returns

    an iterator that repeatedly samples

    Definition Classes
    Rand
  44. def samplesVector[U >: T](size: Int)(implicit m: ClassTag[U]): DenseVector[U]

    Return a vector of samples.

    Return a vector of samples.

    Definition Classes
    Rand
  45. def step(): (T, Process[T])

    Draw a sample and the next step of the process along with it.

    Draw a sample and the next step of the process along with it.

    Definition Classes
    Process
  46. def steps: Iterator[T]

    Returns an Iterator that automatically moves the Process along as next is called

    Returns an Iterator that automatically moves the Process along as next is called

    Definition Classes
    Process
  47. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  48. def total: Long

  49. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. def withFilter(p: (T) ⇒ Boolean): Rand[T]

    Definition Classes
    Rand

Inherited from Product

Inherited from Equals

Inherited from SymmetricMetropolisHastings[T]

Inherited from BaseMetropolisHastings[T]

Inherited from TracksStatistics

Inherited from Process[T]

Inherited from MetropolisHastings[T]

Inherited from Rand[T]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped