t

com.cra.figaro.experimental.marginalmap

AnytimeStructuredMarginalMAP

trait AnytimeStructuredMarginalMAP extends StructuredMarginalMAPAlgorithm with AnytimeStructured with AnytimeMarginalMAP

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AnytimeStructuredMarginalMAP
  2. AnytimeMarginalMAP
  3. AnytimeStructured
  4. Anytime
  5. StructuredMarginalMAPAlgorithm
  6. MarginalMAPAlgorithm
  7. StructuredAlgorithm
  8. Algorithm
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class Runner extends Actor

    A class representing the actor running the algorithm.

    A class representing the actor running the algorithm.

    Definition Classes
    Anytime
  2. case class ComputeMostLikelyValue [T](target: Element[T]) extends Service with Product with Serializable

    A message instructing the handler to compute the most likely value of the target element.

    A message instructing the handler to compute the most likely value of the target element.

    Definition Classes
    AnytimeMarginalMAP
  3. case class MostLikelyValue [T](value: T) extends Response with Product with Serializable

    A message from the handler containing the most likely value of the previously requested element.

    A message from the handler containing the most likely value of the previously requested element.

    Definition Classes
    AnytimeMarginalMAP
  4. class NotATargetException [T] extends AlgorithmException
    Definition Classes
    MarginalMAPAlgorithm

Abstract Value Members

  1. abstract def refiningStrategy(): RefiningStrategy

    Strategy to use for refinement at a single iteration.

    Strategy to use for refinement at a single iteration. This may return a new strategy for each iteration.

    returns

    A refining strategy to be used for a single iteration.

    Definition Classes
    StructuredAlgorithm
  2. abstract def solvingStrategy(): SolvingStrategy

    Strategy to use for solving at a single iteration.

    Strategy to use for solving at a single iteration. This may return a new strategy for each iteration.

    returns

    A solving strategy to be used for a single iteration.

    Definition Classes
    StructuredAlgorithm

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. val active: Boolean
    Attributes
    protected
    Definition Classes
    Algorithm
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def awaitResponse(response: Future[Any], duration: Duration): Response
    Attributes
    protected
    Definition Classes
    Anytime
  7. def check[T](target: Element[T]): Unit
    Attributes
    protected
    Definition Classes
    MarginalMAPAlgorithm
  8. def checkConstraintBounds(): Unit

    Verify that all constraint factors satisfy the bounds needed for the correctness of this algorithm.

    Verify that all constraint factors satisfy the bounds needed for the correctness of this algorithm. This gets executed before solving. By default, this method does nothing; subclasses can override this to throw an exception if the bounds requirements are not met.

    Definition Classes
    StructuredAlgorithm
  9. 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
  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. val collection: ComponentCollection
    Definition Classes
    StructuredAlgorithm
  12. def computeMostLikelyValue[T](target: Element[T]): T

    Returns the most likely value for the target element.

    Returns the most likely value for the target element. Throws an IllegalArgumentException if the range of the target contains star.

    Definition Classes
    StructuredMarginalMAPAlgorithmMarginalMAPAlgorithm
  13. val customConf: Config

    The actor running the algorithm.

    The actor running the algorithm.

    Definition Classes
    Anytime
  14. def doKill(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  15. def doMostLikelyValue[T](target: Element[T]): T
    Attributes
    protected
    Definition Classes
    AnytimeMarginalMAPMarginalMAPAlgorithm
  16. def doResume(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  17. def doStart(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  18. def doStop(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    AnytimeAlgorithm
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  22. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  23. def handle(service: Service): Response

    A handler of services provided by the algorithm.

    A handler of services provided by the algorithm.

    Definition Classes
    AnytimeMarginalMAPAnytime
  24. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  25. def initialize(): Unit

    Initialize the problem by adding all permanent elements to it.

    Initialize the problem by adding all permanent elements to it. This is to ensure that all top-level elements are correctly added to the top-level problem.

    Definition Classes
    StructuredAlgorithmAlgorithm
  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. val mapElements: Element[_]*
  30. implicit val messageTimeout: Timeout

    default message timeout.

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

    Definition Classes
    Anytime
  31. def mostLikelyValue[T](target: Element[T]): T

    Returns an estimate of the max a posteriori value of the target.

    Returns an estimate of the max a posteriori value of the target.

    Definition Classes
    MarginalMAPAlgorithm
    Exceptions thrown

    AlgorithmInactiveException if the algorithm is inactive.

    NotATargetException if called on a target that is not in the list of MAP elements.

  32. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  33. def neededBounds(): Set[Bounds]

    All bounds for which this algorithm needs to compute solutions.

    All bounds for which this algorithm needs to compute solutions. This is determined by looking for components that have * in their range, and have constraint factors associated with them. If such a component exists, we need both lower and upper bounds. Otherwise, just one of the bounds suffices because they are equivalent; it defaults to lower in this case.

    returns

    All bounds for which this algorithm should compute solutions.

    Definition Classes
    StructuredAlgorithm
  34. final def notify(): Unit
    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  36. val problem: Problem

    Inference problem to be solved.

    Inference problem to be solved.

    Definition Classes
    StructuredAlgorithm
  37. def problemTargets: List[Element[_]]

    List of targets that should not be eliminated when solving the problem.

    List of targets that should not be eliminated when solving the problem.

    returns

    Targets for the problem.

    Definition Classes
    StructuredMarginalMAPAlgorithmStructuredAlgorithm
  38. def processSolutions(solutions: Map[Bounds, Solution]): Unit

    Extract the solution in a way that allows fast queries to the algorithm.

    Extract the solution in a way that allows fast queries to the algorithm. This usually involves storing some form of the solution in a variable, but the exact implementation is up to the algorithm that overrides this.

    solutions

    A map from bounds to computed solutions for those bounds. Contains one key for each of the bounds needed, according to neededBounds().

    Definition Classes
    StructuredMarginalMAPAlgorithmStructuredAlgorithm
  39. def rangingStrategy: RangingStrategy

    Uses the default ranging strategy with one value per iteration.

    Uses the default ranging strategy with one value per iteration.

    Definition Classes
    AnytimeStructuredStructuredAlgorithm
  40. 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
  41. def runStep(): Unit

    Run a single iteration of refinement/solving, then record the solutions.

    Run a single iteration of refinement/solving, then record the solutions.

    Definition Classes
    StructuredAlgorithm
  42. val runner: ActorRef
    Definition Classes
    Anytime
  43. val running: Boolean
    Definition Classes
    Anytime
  44. def shutdown: Unit

    Release all resources from this anytime algorithm.

    Release all resources from this anytime algorithm.

    Definition Classes
    Anytime
  45. 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
  46. 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
  47. def stopUpdate(): Unit

    Optional function to run when the algorithm is stopped (not killed).

    Optional function to run when the algorithm is stopped (not killed). Used in samplers to update lazy values.

    Definition Classes
    Anytime
  48. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  49. val system: ActorSystem
    Definition Classes
    Anytime
  50. var targetFactors: Map[Variable[_], Factor[_]]
    Attributes
    protected
    Definition Classes
    StructuredMarginalMAPAlgorithm
  51. def toString(): String
    Definition Classes
    AnyRef → Any
  52. val universe: Universe
    Definition Classes
    StructuredAlgorithm
  53. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  54. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  55. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnytimeMarginalMAP

Inherited from AnytimeStructured

Inherited from Anytime

Inherited from MarginalMAPAlgorithm

Inherited from StructuredAlgorithm

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped