OneTimeMetropolisHastingsAnnealer

Instance Constructors

new OneTimeMetropolisHastingsAnnealer(universe: Universe, myNumSamples: Int, scheme: ProposalScheme, annealSchedule: Schedule, burnIn: Int, interval: Int)

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

Type Members

type LastUpdate[T] = (T, Int)

Attributes
protected
Definition Classes
BaseUnweightedSampler
type Sample = Map[Element[_], Any]

A sample is a map from elements to their values.
A sample is a map from elements to their values.

Definition Classes
BaseUnweightedSampler
type TimesSeen[T] = Map[T, Int]

Attributes
protected
Definition Classes
BaseUnweightedSampler

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
def accept(state: State): Unit

Attributes
protected
Definition Classes
MetropolisHastings
def acceptRejectRatio: Double

Get the acceptance ratio for the sampler.
Get the acceptance ratio for the sampler.

Definition Classes
MetropolisHastings
var accepts: Int

Attributes
protected
Definition Classes
MetropolisHastings
var active: Boolean

Attributes
protected
Definition Classes
Algorithm
var allLastUpdates: Map[Element[_], LastUpdate[_]]

Attributes
protected
Definition Classes
BaseUnweightedSampler
var allTimesSeen: Map[Element[_], TimesSeen[_]]

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

Definition Classes
Any
var bestEnergy: Double

Attributes
protected
Definition Classes
MetropolisHastingsAnnealer
var chainCache: Cache

Attributes
protected
Definition Classes
MetropolisHastings
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 computeScores(): Double

Attributes
protected
Definition Classes
MetropolisHastings
var currentEnergy: Double

Attributes
protected
Definition Classes
MetropolisHastingsAnnealer
var debug: Boolean

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

Definition Classes
MetropolisHastings
def decideToAccept(newState: State): Boolean

Attributes
protected
Definition Classes
MetropolisHastingsAnnealer → MetropolisHastings
var dissatisfied: Set[Element[_]]

Attributes
protected
Definition Classes
MetropolisHastings
def doInitialize(): Unit

Definition Classes
MetropolisHastingsAnnealer → MetropolisHastings
def doKill(): Unit

Attributes
protected[com.cra.figaro.algorithm]
Definition Classes
OneTime → Algorithm
def doMostLikelyValue[T](target: Element[T]): T

Attributes
protected
Definition Classes
OneTimeMPE → MPEAlgorithm
def doResume(): Unit

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

Attributes
protected
Definition Classes
MetropolisHastings → BaseUnweightedSampler → Sampler
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] )
def getBestEnergy: Double

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

Definition Classes
MetropolisHastingsAnnealer
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
MetropolisHastingsAnnealer
def getDissatisfied: Set[Element[_]]

Attributes
protected
Definition Classes
MetropolisHastings
def getSampleCount: Int

Number of samples taken
Number of samples taken

Definition Classes
BaseUnweightedSampler
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 initConstrainedValues(): Unit

Attributes
protected
Definition Classes
MetropolisHastings
def initUpdates(): Unit

Attributes
protected
Definition Classes
MetropolisHastingsAnnealer → BaseUnweightedSampler
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
def mhStep(): State

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

Definition Classes
AnyRef
def newLastUpdate[T](target: Element[T]): LastUpdate[T]

Attributes
protected
Definition Classes
BaseUnweightedSampler
def newTimesSeen[T](target: Element[T]): TimesSeen[T]

Attributes
protected
Definition Classes
BaseUnweightedSampler
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 proposeAndUpdate(): State

Attributes
protected
Definition Classes
MetropolisHastings
lazy val queryTargets: List[Element[_]]

Definition Classes
BaseUnweightedSampler
var rejects: Int

Attributes
protected
Definition Classes
MetropolisHastings
def resetCounts(): Unit

Attributes
protected
Definition Classes
BaseUnweightedSampler → 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
def runScheme(): State

Attributes
protected
Definition Classes
MetropolisHastings
def sample(): (Boolean, Sample)

Produce a single sample.
Produce a single sample.

Definition Classes
MetropolisHastingsAnnealer → MetropolisHastings → BaseUnweightedSampler
var sampleCount: Int

Attributes
protected
Definition Classes
BaseUnweightedSampler
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[_]]): (Double, 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
MetropolisHastings
def toString(): String

Definition Classes
AnyRef → Any
def undo(state: State): Unit

Attributes
protected
Definition Classes
MetropolisHastings
val universe: Universe

Definition Classes
BaseUnweightedSampler
def update(): Unit

Attributes
protected
Definition Classes
BaseUnweightedSampler → Sampler
def updateTimesSeenForTarget[T](elem: Element[T], newValue: T): Unit

Attributes
protected
Definition Classes
MetropolisHastingsAnnealer → BaseUnweightedSampler
def updateTimesSeenWithValue[T](value: T, timesSeen: TimesSeen[T], seen: Int): Unit

Attributes
protected
Definition Classes
BaseUnweightedSampler
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( ... )

Related Doc: package sampling

class OneTimeMetropolisHastingsAnnealer extends MetropolisHastingsAnnealer with OneTimeMPESampler

Instance Constructors

new OneTimeMetropolisHastingsAnnealer(universe: Universe, myNumSamples: Int, scheme: ProposalScheme, annealSchedule: Schedule, burnIn: Int, interval: Int)

Type Members

type LastUpdate[T] = (T, Int)

type Sample = Map[Element[_], Any]

type TimesSeen[T] = Map[T, Int]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def accept(state: State): Unit

def acceptRejectRatio: Double

var accepts: Int

var active: Boolean

var allLastUpdates: Map[Element[_], LastUpdate[_]]

var allTimesSeen: Map[Element[_], TimesSeen[_]]

final def asInstanceOf[T0]: T0

var bestEnergy: Double

var chainCache: Cache

def cleanUp(): Unit

def clone(): AnyRef

def computeScores(): Double

var currentEnergy: Double

var debug: Boolean

def decideToAccept(newState: State): Boolean

var dissatisfied: Set[Element[_]]

def doInitialize(): Unit

def doKill(): Unit

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

def doResume(): Unit

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 getDissatisfied: Set[Element[_]]

def getSampleCount: Int

def getTemperature: Double

def hashCode(): Int

def initConstrainedValues(): Unit

def initUpdates(): Unit

def initialize(): Unit

def isActive: Boolean

final def isInstanceOf[T0]: Boolean

def kill(): Unit

def lastTransProb: Double

def mhStep(): State

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

final def ne(arg0: AnyRef): Boolean

def newLastUpdate[T](target: Element[T]): LastUpdate[T]

def newTimesSeen[T](target: Element[T]): TimesSeen[T]

final def notify(): Unit

final def notifyAll(): Unit

val numSamples: Int

def proposeAndUpdate(): State

lazy val queryTargets: List[Element[_]]

var rejects: Int

def resetCounts(): Unit

def resume(): Unit

def run(): Unit

def runScheme(): State

def sample(): (Boolean, Sample)

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[_]]): (Double, Map[Predicate[_], Double], Map[Element[_], Double])

def toString(): String

def undo(state: State): Unit

val universe: Universe

def update(): Unit

def updateTimesSeenForTarget[T](elem: Element[T], newValue: T): Unit

def updateTimesSeenWithValue[T](value: T, timesSeen: TimesSeen[T], seen: Int): Unit