com.cra.figaro.algorithm.sampling

MetropolisHastingsAnnealer

abstract class MetropolisHastingsAnnealer extends UnweightedAnnealer

Metropolis-Hastings based Annealer

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MetropolisHastingsAnnealer
  2. UnweightedAnnealer
  3. Sampler
  4. MPEAlgorithm
  5. Algorithm
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MetropolisHastingsAnnealer(universe: Universe, proposalScheme: ProposalScheme, annealSchedule: Schedule, burnIn: Int, interval: Int, targets: Element[_]*)

    annealSchedule

    The schedule that determines how to anneal the model

    burnIn

    The number of iterations to run before annealing starts

    interval

    The number of iterations to perform before recording the annealing state .

Abstract Value Members

  1. abstract def doKill(): Unit

    Attributes
    protected
    Definition Classes
    Algorithm
  2. abstract def doResume(): Unit

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

    Attributes
    protected
    Definition Classes
    Algorithm
  4. 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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  6. var bestEnergy: Double

    Attributes
    protected
    Definition Classes
    UnweightedAnnealer
  7. var bestState: Map[Element[_], Any]

    Attributes
    protected
    Definition Classes
    UnweightedAnnealer
  8. 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
  9. def clone(): AnyRef

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

    Attributes
    protected
    Definition Classes
    UnweightedAnnealer
  11. val currentConstraintValues: Map[Element[_], Double]

    Attributes
    protected
    Definition Classes
    UnweightedAnnealer
  12. var currentEnergy: Double

    Attributes
    protected
    Definition Classes
    UnweightedAnnealer
  13. var debug: Boolean

    Set this flag to true to obtain debugging information

  14. def doInitialize(): Unit

    Attributes
    protected
  15. final def doSample(): Unit

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

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

    Definition Classes
    AnyRef → Any
  18. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  19. def getBestEnergy: Double

    Return the best energy computed by the annealer.

    Return the best energy computed by the annealer.

    Definition Classes
    UnweightedAnnealer
  20. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  21. def getCurrentEnergy: Double

    Return the current energy of the annealer.

    Return the current energy of the annealer.

    Definition Classes
    UnweightedAnnealer
  22. def getSampleCount: Int

    Number of samples taken.

    Number of samples taken.

    Definition Classes
    UnweightedAnnealer
  23. def getTemperature: Double

    The current temperature of the model.

  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 lastTransProb: Double

    The last computed transition probability.

  30. final def mhStep(annealer: Schedule, iter: Int): State

    Attributes
    protected
  31. def mostLikelyValue[T](target: Element[T]): T

    Returns the most likely value for the target element.

    Returns the most likely value for the target element.

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

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

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

    Definition Classes
    AnyRef
  35. def resetCounts(): Unit

    Attributes
    protected
    Definition Classes
    UnweightedAnnealerSampler
  36. 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
  37. final def sample(iter: Int): (Boolean, Double)

    Produce a single sample.

    Produce a single sample.

    Definition Classes
    MetropolisHastingsAnnealerUnweightedAnnealer
  38. var sampleCount: Int

    Attributes
    protected
    Definition Classes
    UnweightedAnnealer
  39. 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
  40. 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
  41. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  42. def test(numSamples: Int, predicates: Seq[Predicate[_]], elementsToTrack: Seq[Element[_]]): (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.

  43. def toString(): String

    Definition Classes
    AnyRef → Any
  44. val universe: Universe

    Definition Classes
    UnweightedAnnealerMPEAlgorithm
  45. def update(): Unit

    Attributes
    protected
    Definition Classes
    UnweightedAnnealerSampler
  46. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from UnweightedAnnealer

Inherited from Sampler

Inherited from MPEAlgorithm

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped