com.cra.figaro.algorithm.decision

DecisionImportance

abstract class DecisionImportance[T, U] extends WeightedSampler with DecisionAlgorithm[T, U]

Importance sampling for decisions. Almost the exact same as normal importance sampling except that it keeps track of utilities and probabilities (to compute expected utility) and it implements DecisionAlgorithm trait.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DecisionImportance
  2. DecisionAlgorithm
  3. WeightedSampler
  4. Sampler
  5. ProbQueryAlgorithm
  6. Algorithm
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DecisionImportance(universe: Universe, utilityNodes: List[Element[_]], decisionTarget: Decision[T, U])

Type Members

  1. type Sample = (Double, Map[Element[_], Any])

    A sample consists of a weight and a map from elements to their values.

    A sample consists of a weight and a map from elements to their values.

    Definition Classes
    WeightedSampler
  2. type WeightSeen[T] = (Element[T], Map[T, Double])

    Attributes
    protected
    Definition Classes
    WeightedSampler

Abstract Value Members

  1. abstract def doDistribution[T](target: Element[T]): Stream[(Double, T)]

    Attributes
    protected
    Definition Classes
    ProbQueryAlgorithm
  2. abstract def doExpectation[T](target: Element[T], function: (T) ⇒ Double): Double

    Attributes
    protected
    Definition Classes
    ProbQueryAlgorithm
  3. abstract def doKill(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm
  4. abstract def doProbability[T](target: Element[T], predicate: (T) ⇒ Boolean): Double

    Attributes
    protected
    Definition Classes
    ProbQueryAlgorithm
  5. abstract def doResume(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm
  6. abstract def doStart(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm
  7. abstract def doStop(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm

Concrete 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. var active: Boolean

    Attributes
    protected
    Definition Classes
    Algorithm
  5. var allWeightsSeen: List[WeightSeen[_]]

    Attributes
    protected
    Definition Classes
    WeightedSampler
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def cleanUp(): Unit

    Called when the algorithm is killed.

    Called when the algorithm is killed. By default, does nothing. Can be overridden.

    Definition Classes
    Algorithm
  8. def cleanup(): Unit

    Cleans up the temporary elements created during sampling.

  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. 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
    WeightedSamplerProbQueryAlgorithm
  11. 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
    WeightedSamplerProbQueryAlgorithm
  12. 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
    ProbQueryAlgorithm
  13. 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
    DecisionImportanceDecisionAlgorithm
  14. 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
    ProbQueryAlgorithm
  15. def doSample(): Unit

    Attributes
    protected
    Definition Classes
    DecisionImportanceWeightedSamplerSampler
  16. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  18. 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
    ProbQueryAlgorithm
  19. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  21. def getTotalWeight: Double

    Total weight of samples taken.

    Total weight of samples taken.

    Definition Classes
    WeightedSampler
  22. 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
  23. 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
  24. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  25. def initialize(): Unit

    Called when the algorithm is started before running any steps.

    Called when the algorithm is started before running any steps. By default, does nothing. Can be overridden.

    Definition Classes
    Algorithm
  26. def isActive: Boolean

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

    Definition Classes
    Any
  28. 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
  29. 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
    ProbQueryAlgorithm
  30. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  31. def newWeightSeen[T](target: Element[T]): WeightSeen[T]

    Attributes
    protected
    Definition Classes
    WeightedSampler
  32. final def notify(): Unit

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

    Definition Classes
    AnyRef
  34. 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
  35. 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
    ProbQueryAlgorithm
  36. 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
    ProbQueryAlgorithm
  37. lazy val queryTargets: List[Element[_]]

    Definition Classes
    WeightedSamplerProbQueryAlgorithm
  38. def resetCounts(): Unit

    Attributes
    protected
    Definition Classes
    DecisionImportanceWeightedSamplerSampler
  39. 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
  40. final def sample(): Sample

    Produce one weighted sample of the given element.

    Produce one weighted sample of the given element. weightedSample takes into account conditions and constraints on all elements in the Universe, including those that depend on this element.

    For decisions, our weight is actually the weight of the sampled state times the sum of the utility nodes. This will be used as the "weight" in the weighted sampler, ie, we are accumulating the expected utility of each state. Note that the weights will not be normalized, but that is ok since strategies are an optimization and everything will be divided by a constant.

    Definition Classes
    DecisionImportanceWeightedSampler
    Annotations
    @tailrec()
  41. 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
  42. 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
  43. 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
  44. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  45. def toString(): String

    Definition Classes
    AnyRef → Any
  46. var totalWeight: Double

    Attributes
    protected
    Definition Classes
    WeightedSampler
  47. val universe: Universe

  48. def update(): Unit

    Attributes
    protected
    Definition Classes
    WeightedSamplerSampler
  49. def updateWeightSeenForTarget[T](sample: Sample, weightSeen: WeightSeen[T]): Unit

    Attributes
    protected
    Definition Classes
    WeightedSampler
  50. def updateWeightSeenForTargetNoLog[T](sample: Sample, weightSeen: WeightSeen[T]): Unit

    Attributes
    protected
  51. def updateWeightSeenWithValue[T](value: T, weight: Double, weightSeen: WeightSeen[T]): Unit

    Attributes
    protected
    Definition Classes
    WeightedSampler
  52. def updateWeightSeenWithValueNoLog[T](value: T, weight: Double, weightSeen: WeightSeen[T]): Unit

    Attributes
    protected
  53. 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
    ProbQueryAlgorithm
  54. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from DecisionAlgorithm[T, U]

Inherited from WeightedSampler

Inherited from Sampler

Inherited from ProbQueryAlgorithm

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped