com.cra.figaro.algorithm.decision

AnytimeDecisionMetropolisHastings

Related Doc: package decision

class AnytimeDecisionMetropolisHastings[T, U] extends DecisionMetropolisHastings[T, U] with UnweightedSampler with AnytimeProbQuerySampler

Anytime Decision Metropolis-Hastings sampler.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. AnytimeDecisionMetropolisHastings
  2. AnytimeProbQuerySampler
  3. AnytimeSampler
  4. AnytimeProbQuery
  5. Anytime
  6. ProbQueryAlgorithm
  7. UnweightedSampler
  8. ProbQuerySampler
  9. BaseProbQuerySampler
  10. BaseProbQueryAlgorithm
  11. DecisionMetropolisHastings
  12. DecisionAlgorithm
  13. MetropolisHastings
  14. BaseUnweightedSampler
  15. Sampler
  16. Algorithm
  17. AnyRef
  18. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AnytimeDecisionMetropolisHastings(universe: Universe, scheme: ProposalScheme, burnIn: Int, interval: Int, utilityNodes: List[Element[_]], decisionTarget: Decision[T, U])

Type Members

  1. case class ComputeDistribution[T](target: Element[T]) extends Service with Product with Serializable

    A message instructing the handler to compute the distribution of the target element.

    A message instructing the handler to compute the distribution of the target element.

    Definition Classes
    AnytimeProbQuery
  2. case class ComputeExpectation[T](target: Element[T], function: (T) ⇒ Double) extends Service with Product with Serializable

    A message instructing the handler to compute the expectation of the target element under the given function.

    A message instructing the handler to compute the expectation of the target element under the given function.

    Definition Classes
    AnytimeProbQuery
  3. case class ComputeProbability[T](target: Element[T], predicate: (T) ⇒ Boolean) extends Service with Product with Serializable

    A message instructing the handler to compute the probability of the predicate for the target element.

    A message instructing the handler to compute the probability of the predicate for the target element.

    Definition Classes
    AnytimeProbQuery
  4. case class ComputeProjection[T](target: Element[T]) extends Service with Product with Serializable

    A message instructing the handler to compute the projection of the target element.

    A message instructing the handler to compute the projection of the target element.

    Definition Classes
    AnytimeProbQuery
  5. case class Distribution[T](distribution: Stream[(Double, T)]) extends Response with Product with Serializable

    A message from the handler containing the distribution of the previously requested element.

    A message from the handler containing the distribution of the previously requested element.

    Definition Classes
    AnytimeProbQuery
  6. case class Expectation(expectation: Double) extends Response with Product with Serializable

    A message from the handler containing the expected value of the previously requested element and function.

    A message from the handler containing the expected value of the previously requested element and function.

    Definition Classes
    AnytimeProbQuery
  7. type LastUpdate[T] = (T, Int)

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  8. class NotATargetException[T] extends AlgorithmException

    Definition Classes
    BaseProbQueryAlgorithm
  9. case class Probability(probability: Double) extends Response with Product with Serializable

    A message from the handler containing the probability of the previously requested predicate and element.

    A message from the handler containing the probability of the previously requested predicate and element.

    Definition Classes
    AnytimeProbQuery
  10. case class Projection[T](projection: List[(T, Double)]) extends Response with Product with Serializable

    A message from the handler containing the projection of the previously requested element.

    A message from the handler containing the projection of the previously requested element.

    Definition Classes
    AnytimeProbQuery
  11. class Runner extends Actor

    A class representing the actor running the algorithm.

    A class representing the actor running the algorithm.

    Definition Classes
    Anytime
  12. type Sample = Map[Element[_], Any]

    A sample is a map from elements to their values.

    A sample is a map from elements to their values.

    Definition Classes
    BaseUnweightedSampler
  13. type TimesSeen[T] = Map[T, Int]

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  14. type WeightSeen[T] = (Element[T], Map[T, Double])

    Attributes
    protected
    Definition Classes
    DecisionMetropolisHastings

Value Members

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

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

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

    Definition Classes
    AnyRef → Any
  4. def accept(state: State): Unit

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  5. def acceptRejectRatio: Double

    Get the acceptance ratio for the sampler.

    Get the acceptance ratio for the sampler.

    Definition Classes
    MetropolisHastings
  6. var accepts: Int

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  7. var active: Boolean

    Attributes
    protected
    Definition Classes
    Algorithm
  8. var allLastUpdates: Map[Element[_], LastUpdate[_]]

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  9. var allTimesSeen: Map[Element[_], TimesSeen[_]]

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  10. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  11. def awaitResponse(response: Future[Any], duration: Duration): Response

    Attributes
    protected
    Definition Classes
    Anytime
  12. val blockSize: Int

    Number of samples that should be taken in a single step of the algorithm.

    Number of samples that should be taken in a single step of the algorithm.

    Definition Classes
    AnytimeSampler
  13. def cleanUp(): Unit

    Clean up the sampler, freeing memory.

    Clean up the sampler, freeing memory.

    Definition Classes
    AnytimeDecisionMetropolisHastingsAlgorithm
  14. def cleanup(): Unit

    Cleans up the temporary elements created during sampling

    Cleans up the temporary elements created during sampling

    Definition Classes
    DecisionMetropolisHastings
  15. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  16. def computeDistribution[T](target: Element[T]): Stream[(Double, T)]

    Return an estimate of the expectation of the function under the marginal probability distribution of the target.

    Return an estimate of the expectation of the function under the marginal probability distribution of the target.

    Definition Classes
    BaseProbQuerySamplerBaseProbQueryAlgorithm
  17. def computeExpectation[T](target: Element[T], function: (T) ⇒ Double): Double

    Return an estimate of the expectation of the function under the marginal probability distribution of the target.

    Return an estimate of the expectation of the function under the marginal probability distribution of the target.

    Definition Classes
    BaseProbQuerySamplerBaseProbQueryAlgorithm
  18. def computeProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target.

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target.

    Definition Classes
    BaseProbQueryAlgorithm
  19. def computeProjection[T](target: Element[T]): List[(T, Double)]

    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    UnweightedSamplerBaseProbQueryAlgorithm
  20. def computeScores(): Double

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  21. def computeUtility(): Map[(T, U), DecisionSample]

    Compute the utility of each parent/decision tuple and return a DecisionSample.

    Compute the utility of each parent/decision tuple and return a DecisionSample. Each decision algorithm must define how this is done since it is used to set the policy for a decision. For sampling algorithms, this will me a map of parent/decision tuples to a utility and a weight for that combination. For factored algorithms, the DecisionSample will contain the exact expected utility with a weight of 1.0.

    Definition Classes
    DecisionMetropolisHastingsDecisionAlgorithm
  22. val customConf: Config

    The actor running the algorithm.

    The actor running the algorithm.

    Definition Classes
    Anytime
  23. var debug: Boolean

    Set this flag to true to obtain debugging information.

    Set this flag to true to obtain debugging information.

    Definition Classes
    MetropolisHastings
  24. def decideToAccept(newState: State): Boolean

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  25. var dissatisfied: Set[Element[_]]

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  26. def distribution[T](target: Element[T]): Stream[(Double, T)]

    Return an estimate of the marginal probability distribution over the target that lists each element with its probability.

    Return an estimate of the marginal probability distribution over the target that lists each element with its probability. The result is a lazy stream. It is up to the algorithm how the stream is ordered. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  27. def doDistribution[T](target: Element[T]): Stream[(Double, T)]

    Attributes
    protected
    Definition Classes
    AnytimeProbQueryBaseProbQueryAlgorithm
  28. def doExpectation[T](target: Element[T], function: (T) ⇒ Double): Double

    Attributes
    protected
    Definition Classes
    AnytimeProbQueryBaseProbQueryAlgorithm
  29. def doInitialize(): Unit

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  30. def doKill(): Unit

    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  31. def doProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

    Attributes
    protected
    Definition Classes
    AnytimeProbQueryBaseProbQueryAlgorithm
  32. def doProjection[T](target: Element[T]): List[(T, Double)]

    Attributes
    protected
    Definition Classes
    AnytimeProbQueryBaseProbQueryAlgorithm
  33. def doResume(): Unit

    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  34. final def doSample(): Unit

    Attributes
    protected
    Definition Classes
    DecisionMetropolisHastingsMetropolisHastingsBaseUnweightedSamplerSampler
  35. def doStart(): Unit

    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  36. def doStop(): Unit

    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  37. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  39. def expectation[T](target: Element[T], function: (T) ⇒ Double): Double

    Return an estimate of the expectation of the function under the marginal probability distribution of the target.

    Return an estimate of the expectation of the function under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  40. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  42. def getDissatisfied: Set[Element[_]]

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  43. def getSampleCount: Int

    Number of samples taken

    Number of samples taken

    Definition Classes
    BaseUnweightedSampler
  44. def getTotalWeight: Double

    Total weight of samples taken, in log space

    Total weight of samples taken, in log space

    Definition Classes
    UnweightedSamplerBaseProbQuerySampler
  45. def getUtility(p: T, d: U): DecisionSample

    Get the total utility and weight for a specific value of a parent and decision.

    Get the total utility and weight for a specific value of a parent and decision.

    Definition Classes
    DecisionAlgorithm
  46. def getUtility(): Map[(T, U), DecisionSample]

    Get the total utility and weight for all sampled values of the parent and decision.

    Get the total utility and weight for all sampled values of the parent and decision.

    Definition Classes
    DecisionAlgorithm
  47. def handle(service: Service): Response

    A handler of services provided by the algorithm.

    A handler of services provided by the algorithm.

    Definition Classes
    AnytimeProbQueryAnytime
  48. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  49. def initConstrainedValues(): Unit

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  50. def initUpdates(): Unit

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  51. def initialize(): Unit

    Initialize the sampler.

    Initialize the sampler.

    Definition Classes
    AnytimeDecisionMetropolisHastingsAnytimeSamplerAlgorithm
  52. def isActive: Boolean

    Definition Classes
    Algorithm
  53. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  54. def kill(): Unit

    Kill the algorithm so that it is inactive.

    Kill the algorithm so that it is inactive. It will no longer be able to provide answers.Throws AlgorithmInactiveException if the algorithm is not active.

    Definition Classes
    Algorithm
  55. def mean(target: Element[Double]): Double

    Return the mean of the probability density function for the given continuous element.

    Return the mean of the probability density function for the given continuous element.

    Definition Classes
    BaseProbQueryAlgorithm
  56. implicit var messageTimeout: Timeout

    default message timeout.

    default message timeout. Increase if queries to the algorithm fail due to timeout

    Definition Classes
    Anytime
  57. def mhStep(): State

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  58. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  59. def newLastUpdate[T](target: Element[T]): LastUpdate[T]

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  60. def newTimesSeen[T](target: Element[T]): TimesSeen[T]

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  61. def newWeightSeen[T](target: Element[T]): WeightSeen[T]

    Attributes
    protected
    Definition Classes
    DecisionMetropolisHastings
  62. final def notify(): Unit

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

    Definition Classes
    AnyRef
  64. def posteriorElement[T](target: Element[T], universe: Universe = Universe.universe): Element[T]

    Return an element representing the posterior probability distribution of the given element.

    Return an element representing the posterior probability distribution of the given element.

    Definition Classes
    ProbQueryAlgorithm
  65. def probability[T](target: Element[T], value: T): Double

    Return an estimate of the probability that the target produces the value.

    Return an estimate of the probability that the target produces the value. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  66. def probability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target.

    Return an estimate of the probability of the predicate under the marginal probability distribution of the target. Throws NotATargetException if called on a target that is not in the list of targets of the algorithm. Throws AlgorithmInactiveException if the algorithm is inactive.

    Definition Classes
    BaseProbQueryAlgorithm
  67. def proposeAndUpdate(): State

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  68. lazy val queryTargets: List[Element[_]]

    Definition Classes
    BaseUnweightedSampler
  69. var rejects: Int

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  70. def resetCounts(): Unit

    Attributes
    protected
    Definition Classes
    DecisionMetropolisHastingsBaseUnweightedSamplerSampler
  71. def resume(): Unit

    Resume the computation of the algorithm, if it has been stopped.

    Resume the computation of the algorithm, if it has been stopped. Throws AlgorithmInactiveException if the algorithm is not active.

    Definition Classes
    Algorithm
  72. def runScheme(): State

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  73. def runStep(): Unit

    Run a single step of the algorithm.

    Run a single step of the algorithm. The algorithm must be able to provide answers after each step.

    Definition Classes
    AnytimeSamplerAnytime
  74. var runner: ActorRef

    Definition Classes
    Anytime
  75. var running: Boolean

    Definition Classes
    Anytime
  76. def sample(): (Boolean, Sample)

    Produce a single sample.

    Produce a single sample. In decision MH, we always update the target (parent and decision) since the utilities mights have changed

    Definition Classes
    DecisionMetropolisHastingsMetropolisHastingsBaseUnweightedSampler
  77. var sampleCount: Int

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  78. def setPolicy(e: Decision[T, U]): Unit

    Sets the policy for the given decision.

    Sets the policy for the given decision. This will get the computed utility of the algorithm and call setPolicy on the decision. Note there is no error checking here, so the decision in the argument must match the target decision in the algorithm.

    Definition Classes
    DecisionAlgorithm
  79. def shutdown: Unit

    Release all resources from this anytime algorithm.

    Release all resources from this anytime algorithm.

    Definition Classes
    Anytime
  80. def start(): Unit

    Start the algorithm and make it active.

    Start the algorithm and make it active. After it returns, the algorithm must be ready to provide answers. Throws AlgorithmActiveException if the algorithm is already active.

    Definition Classes
    Algorithm
  81. def stop(): Unit

    Stop the algorithm from computing.

    Stop the algorithm from computing. The algorithm is still ready to provide answers after it returns. Throws AlgorithmInactiveException if the algorithm is not active.

    Definition Classes
    Algorithm
  82. def stopUpdate(): Unit

    Override the stopUpdate function in anytime to call the sampler update function

    Override the stopUpdate function in anytime to call the sampler update function

    Definition Classes
    AnytimeSamplerAnytime
  83. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  84. var system: ActorSystem

    Definition Classes
    Anytime
  85. def test(numSamples: Int, predicates: Seq[Predicate[_]], elementsToTrack: Seq[Element[_]]): (Double, Map[Predicate[_], Double], Map[Element[_], Double])

    Test Metropolis-Hastings by repeatedly running a single step from the same initial state.

    Test Metropolis-Hastings by repeatedly running a single step from the same initial state. For each of a set of predicates, the fraction of times the predicate is satisfied by the resulting state is returned. By the resulting state, we mean the new state if it is accepted and the original state if not.

    Definition Classes
    MetropolisHastings
  86. def toString(): String

    Definition Classes
    AnyRef → Any
  87. def undo(state: State): Unit

    Attributes
    protected
    Definition Classes
    MetropolisHastings
  88. val universe: Universe

    Definition Classes
    BaseUnweightedSampler
  89. def update(): Unit

    Attributes
    protected
    Definition Classes
    DecisionMetropolisHastingsBaseUnweightedSamplerSampler
  90. def updateTimesSeenForTarget[T](elem: Element[T], newValue: T): Unit

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  91. def updateTimesSeenWithValue[T](value: T, timesSeen: TimesSeen[T], seen: Int): Unit

    Attributes
    protected
    Definition Classes
    BaseUnweightedSampler
  92. def updateWeightSeenForTarget[T](sample: (Double, Map[Element[_], Any]), weightSeen: WeightSeen[T]): Unit

    Attributes
    protected
    Definition Classes
    DecisionMetropolisHastings
  93. def updateWeightSeenWithValue[T](value: T, weight: Double, weightSeen: WeightSeen[T]): Unit

    Attributes
    protected
    Definition Classes
    DecisionMetropolisHastings
  94. def variance(target: Element[Double]): Double

    Return the variance of the probability density function for the given continuous element.

    Return the variance of the probability density function for the given continuous element.

    Definition Classes
    BaseProbQueryAlgorithm
  95. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnytimeProbQuerySampler

Inherited from AnytimeSampler

Inherited from AnytimeProbQuery

Inherited from Anytime

Inherited from ProbQueryAlgorithm

Inherited from UnweightedSampler

Inherited from ProbQuerySampler

Inherited from BaseProbQuerySampler[Element]

Inherited from DecisionMetropolisHastings[T, U]

Inherited from DecisionAlgorithm[T, U]

Inherited from MetropolisHastings

Inherited from BaseUnweightedSampler

Inherited from Sampler

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped