OneTimeMetropolisHastingsAnnealer

Instance Constructors

new OneTimeMetropolisHastingsAnnealer(universe: Universe, myNumSamples: Int, scheme: 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

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

Attributes
protected
Definition Classes
Algorithm
final def asInstanceOf[T0]: T0

Definition Classes
Any
var bestEnergy: Double

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

Attributes
protected
Definition Classes
UnweightedAnnealer
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( ... )
def computeEnergy: Double

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

Attributes
protected
Definition Classes
UnweightedAnnealer
var currentEnergy: Double

Attributes
protected
Definition Classes
UnweightedAnnealer
var debug: Boolean

Set this flag to true to obtain debugging information.
Set this flag to true to obtain debugging information.

Definition Classes
MetropolisHastingsAnnealer
def doInitialize(): Unit

Attributes
protected
Definition Classes
MetropolisHastingsAnnealer
def doKill(): Unit

Attributes
protected
Definition Classes
OneTime → Algorithm
def doResume(): Unit

Attributes
protected
Definition Classes
OneTime → Algorithm
final def doSample(): Unit

Attributes
protected
Definition Classes
MetropolisHastingsAnnealer → UnweightedAnnealer → Sampler
def doStart(): Unit

Attributes
protected
Definition Classes
OneTime → Algorithm
def doStop(): Unit

Attributes
protected
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] )
def getBestEnergy: Double

Return the best energy computed by the annealer.
Return the best energy computed by the annealer.

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

Definition Classes
AnyRef → Any
def getCurrentEnergy: Double

Return the current energy of the annealer.
Return the current energy of the annealer.

Definition Classes
UnweightedAnnealer
def getSampleCount: Int

Number of samples taken.
Number of samples taken.

Definition Classes
UnweightedAnnealer
def getTemperature: Double

The current temperature of the model.
The current temperature of the model.

Definition Classes
MetropolisHastingsAnnealer
def hashCode(): Int

Definition Classes
AnyRef → Any
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
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
def lastTransProb: Double

The last computed transition probability.
The last computed transition probability.

Definition Classes
MetropolisHastingsAnnealer
final def mhStep(annealer: Schedule, iter: Int): State

Attributes
protected
Definition Classes
MetropolisHastingsAnnealer
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
UnweightedAnnealer → MPEAlgorithm
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val numSamples: Int

The number of samples to collect from the model.
The number of samples to collect from the model.

Definition Classes
OneTimeMetropolisHastingsAnnealer → OneTimeSampler
def resetCounts(): Unit

Attributes
protected
Definition Classes
UnweightedAnnealer → Sampler
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
OneTimeMetropolisHastingsAnnealer → OneTimeSampler → OneTime
final def sample(iter: Int): (Boolean, Double)

Produce a single sample.
Produce a single sample.

Definition Classes
MetropolisHastingsAnnealer → UnweightedAnnealer
var sampleCount: Int

Attributes
protected
Definition Classes
UnweightedAnnealer
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
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.

Definition Classes
MetropolisHastingsAnnealer
def toString(): String

Definition Classes
AnyRef → Any
val universe: Universe

Definition Classes
UnweightedAnnealer → MPEAlgorithm
def update(): Unit

Attributes
protected
Definition Classes
UnweightedAnnealer → Sampler
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( ... )

class OneTimeMetropolisHastingsAnnealer extends MetropolisHastingsAnnealer with OneTimeMPESampler

Instance Constructors

new OneTimeMetropolisHastingsAnnealer(universe: Universe, myNumSamples: Int, scheme: ProposalScheme, annealSchedule: Schedule, burnIn: Int, interval: Int, targets: Element[_]*)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

var active: Boolean

final def asInstanceOf[T0]: T0

var bestEnergy: Double

var bestState: Map[Element[_], Any]

def cleanUp(): Unit

def clone(): AnyRef

def computeEnergy: Double

val currentConstraintValues: Map[Element[_], Double]

var currentEnergy: Double

var debug: Boolean

def doInitialize(): Unit

def doKill(): Unit

def doResume(): Unit

final def doSample(): Unit

def doStart(): Unit

def doStop(): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def getBestEnergy: Double

final def getClass(): Class[_]

def getCurrentEnergy: Double

def getSampleCount: Int

def getTemperature: Double

def hashCode(): Int

def initialize(): Unit

def isActive: Boolean

final def isInstanceOf[T0]: Boolean

def kill(): Unit

def lastTransProb: Double

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

def mostLikelyValue[T](target: Element[T]): T

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val numSamples: Int

def resetCounts(): Unit

def resume(): Unit

def run(): Unit

final def sample(iter: Int): (Boolean, Double)

var sampleCount: Int

def start(): Unit

def stop(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def test(numSamples: Int, predicates: Seq[Predicate[_]], elementsToTrack: Seq[Element[_]]): (Map[Predicate[_], Double], Map[Element[_], Double])

def toString(): String

val universe: Universe

def update(): Unit

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from OneTimeMPESampler

Inherited from OneTimeMPE

Inherited from OneTimeSampler

Inherited from OneTime

Inherited from MetropolisHastingsAnnealer

Inherited from UnweightedAnnealer

Inherited from Sampler

Inherited from MPEAlgorithm

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped