com.cra.figaro.experimental.marginalmap
StructuredMarginalMAPVE
Companion object StructuredMarginalMAPVE
class StructuredMarginalMAPVE extends StructuredMarginalMAPAlgorithm with DecompositionMarginalMAP
A structured marginal MAP algorithm that uses VE to compute MAP queries.
 Alphabetic
 By Inheritance
 StructuredMarginalMAPVE
 DecompositionMarginalMAP
 DecompositionStructuredAlgorithm
 OneTimeStructuredMarginalMAP
 OneTimeMarginalMAP
 OneTimeStructured
 OneTime
 StructuredMarginalMAPAlgorithm
 MarginalMAPAlgorithm
 StructuredAlgorithm
 Algorithm
 AnyRef
 Any
 Hide All
 Show All
 Public
 All
Instance Constructors
Type Members

class
NotATargetException
[T] extends AlgorithmException
 Definition Classes
 MarginalMAPAlgorithm
Value Members

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

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

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

val
active: Boolean
 Attributes
 protected
 Definition Classes
 Algorithm

final
def
asInstanceOf[T0]: T0
 Definition Classes
 Any

def
check[T](target: Element[T]): Unit
 Attributes
 protected
 Definition Classes
 MarginalMAPAlgorithm

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

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

def
clone(): AnyRef
 Attributes
 protected[java.lang]
 Definition Classes
 AnyRef
 Annotations
 @throws( ... )

val
collection: ComponentCollection
 Definition Classes
 StructuredAlgorithm

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
 StructuredMarginalMAPAlgorithm → MarginalMAPAlgorithm

def
doKill(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doMostLikelyValue[T](target: Element[T]): T
 Attributes
 protected
 Definition Classes
 OneTimeMarginalMAP → MarginalMAPAlgorithm

def
doResume(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doStart(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doStop(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

final
def
eq(arg0: AnyRef): Boolean
 Definition Classes
 AnyRef

def
equals(arg0: Any): Boolean
 Definition Classes
 AnyRef → Any

def
finalize(): Unit
 Attributes
 protected[java.lang]
 Definition Classes
 AnyRef
 Annotations
 @throws( classOf[java.lang.Throwable] )

final
def
getClass(): Class[_]
 Definition Classes
 AnyRef → Any

def
hashCode(): Int
 Definition Classes
 AnyRef → Any

def
initialElements: List[Element[_]]
Initial elements to pass to the bottomup strategy for decomposition.
Initial elements to pass to the bottomup strategy for decomposition. Defaults to a list containing all problem targets and all evidence elements in the universe.
 Definition Classes
 DecompositionStructuredAlgorithm

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 toplevel elements are correctly added to the toplevel problem.
 Definition Classes
 DecompositionStructuredAlgorithm → StructuredAlgorithm → Algorithm

def
isActive: Boolean
 Definition Classes
 Algorithm

final
def
isInstanceOf[T0]: Boolean
 Definition Classes
 Any

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

val
mapElements: Element[_]*
 Definition Classes
 StructuredMarginalMAPAlgorithm → MarginalMAPAlgorithm

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.

final
def
ne(arg0: AnyRef): Boolean
 Definition Classes
 AnyRef

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

final
def
notify(): Unit
 Definition Classes
 AnyRef

final
def
notifyAll(): Unit
 Definition Classes
 AnyRef

val
problem: Problem
Inference problem to be solved.
Inference problem to be solved.
 Definition Classes
 StructuredAlgorithm

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
 StructuredMarginalMAPAlgorithm → StructuredAlgorithm

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
 StructuredMarginalMAPAlgorithm → StructuredAlgorithm

def
rangingStrategy: RangingStrategy
Uses the default ranging strategy with
ParticleGenerator.defaultNumSamplesFromAtomics
values.Uses the default ranging strategy with
ParticleGenerator.defaultNumSamplesFromAtomics
values. Definition Classes
 OneTimeStructured → StructuredAlgorithm

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
 DecompositionStructuredAlgorithm → StructuredAlgorithm

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

def
run(): Unit
Run the algorithm, performing its computation to completion.
Run the algorithm, performing its computation to completion.
 Definition Classes
 OneTimeStructured → OneTime

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

def
solvingStrategy(): MarginalMAPVEStrategy
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
 StructuredMarginalMAPVE → StructuredAlgorithm

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

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

final
def
synchronized[T0](arg0: ⇒ T0): T0
 Definition Classes
 AnyRef

var
targetFactors: Map[Variable[_], Factor[_]]
 Attributes
 protected
 Definition Classes
 StructuredMarginalMAPAlgorithm

def
toString(): String
 Definition Classes
 AnyRef → Any

val
universe: Universe
 Definition Classes
 StructuredAlgorithm

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

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

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