#include <approximateInference.h>

Inheritance diagram for gum::ApproximateInference< GUM_SCALAR >:

Collaboration diagram for gum::ApproximateInference< GUM_SCALAR >:

Public Attributes
Signaler3< Size, double, double >	onProgress
	Progression, error and time. More...

Signaler1< std::string >	onStop
	Criteria messageApproximationScheme. More...

Public Member Functions
	ApproximateInference (const IBayesNet< GUM_SCALAR > *bn)

Potential< GUM_SCALAR >	evidenceImpact (NodeId target, const NodeSet &evs)
	Create a gum::Potential for P(target\|evs) (for all instanciation of target and evs) More...

Potential< GUM_SCALAR >	evidenceImpact (const std::string &target, const std::vector< std::string > &evs)
	Create a gum::Potential for P(target\|evs) (for all instanciation of target and evs) More...

Probability computations
virtual const Potential< GUM_SCALAR > &	posterior (NodeId node)
	Computes and returns the posterior of a node. More...

virtual const Potential< GUM_SCALAR > &	posterior (const std::string &nodeName)
	Computes and returns the posterior of a node. More...

Targets
virtual void	eraseAllTargets ()
	Clear all previously defined targets. More...

virtual void	addAllTargets () final
	adds all nodes as targets More...

virtual void	addTarget (NodeId target) final
	Add a marginal target to the list of targets. More...

virtual void	addTarget (const std::string &nodeName) final
	Add a marginal target to the list of targets. More...

virtual void	eraseTarget (NodeId target) final
	removes an existing (marginal) target More...

virtual void	eraseTarget (const std::string &nodeName) final
	removes an existing (marginal) target More...

virtual bool	isTarget (NodeId node) const final
	return true if variable is a (marginal) target More...

virtual bool	isTarget (const std::string &nodeName) const final
	return true if variable is a (marginal) target More...

virtual const Size	nbrTargets () const noexcept final
	returns the number of marginal targets More...

virtual const NodeSet &	targets () const noexcept final
	returns the list of marginal targets More...

Information Theory related functions
virtual GUM_SCALAR	H (NodeId X) final
	Entropy Compute Shanon's entropy of a node given the observation. More...

virtual GUM_SCALAR	H (const std::string &nodeName) final
	Entropy Compute Shanon's entropy of a node given the observation. More...

Accessors / Modifiers
virtual void	setBN (const IBayesNet< GUM_SCALAR > *bn)
	assigns a new BN to the inference engine More...

virtual const IBayesNet< GUM_SCALAR > &	BN () const final
	Returns a constant reference over the IBayesNet referenced by this class. More...

virtual const NodeProperty< Size > &	domainSizes () const final
	get the domain sizes of the random variables of the BN More...

virtual bool	isInferenceReady () const noexcept final
	returns whether the inference object is in a ready state More...

virtual bool	isInferenceOutdatedBNStructure () const noexcept final
	returns whether the inference object is in a OutdatedBNStructure state More...

virtual bool	isInferenceOutdatedBNPotentials () const noexcept final
	returns whether the inference object is in a OutdatedBNPotential state More...

virtual bool	isInferenceDone () const noexcept final
	returns whether the inference object is in a InferenceDone state More...

virtual bool	isDone () const noexcept final
	returns whether the inference object is in a done state More...

virtual void	prepareInference () final
	prepare the internal inference structures for the next inference More...

virtual void	makeInference () final
	perform the heavy computations needed to compute the targets' posteriors More...

virtual void	clear ()
	clears all the data structures allocated for the last inference More...

virtual StateOfInference	state () const noexcept final
	returns the state of the inference engine More...

Evidence
virtual void	addEvidence (NodeId id, const Idx val) final
	adds a new hard evidence on node id More...

virtual void	addEvidence (const std::string &nodeName, const Idx val) final
	adds a new hard evidence on node named nodeName More...

virtual void	addEvidence (NodeId id, const std::string &label) final
	adds a new hard evidence on node id More...

virtual void	addEvidence (const std::string &nodeName, const std::string &label) final
	adds a new hard evidence on node named nodeName More...

virtual void	addEvidence (NodeId id, const std::vector< GUM_SCALAR > &vals) final
	adds a new evidence on node id (might be soft or hard) More...

virtual void	addEvidence (const std::string &nodeName, const std::vector< GUM_SCALAR > &vals) final
	adds a new evidence on node named nodeName (might be soft or hard) More...

virtual void	addEvidence (const Potential< GUM_SCALAR > &pot) final
	adds a new evidence on node id (might be soft or hard) More...

virtual void	addEvidence (Potential< GUM_SCALAR > &&pot) final
	adds a new evidence on node id (might be soft or hard) More...

virtual void	addSetOfEvidence (const Set< const Potential< GUM_SCALAR > * > &potset) final
	adds a new set of evidence More...

virtual void	addListOfEvidence (const List< const Potential< GUM_SCALAR > * > &potlist) final
	adds a new list of evidence More...

virtual void	chgEvidence (NodeId id, const Idx val) final
	change the value of an already existing hard evidence More...

virtual void	chgEvidence (const std::string &nodeName, const Idx val) final
	change the value of an already existing hard evidence More...

virtual void	chgEvidence (NodeId id, const std::string &label) final
	change the value of an already existing hard evidence More...

virtual void	chgEvidence (const std::string &nodeName, const std::string &label) final
	change the value of an already existing hard evidence More...

virtual void	chgEvidence (NodeId id, const std::vector< GUM_SCALAR > &vals) final
	change the value of an already existing evidence (might be soft or hard) More...

virtual void	chgEvidence (const std::string &nodeName, const std::vector< GUM_SCALAR > &vals) final
	change the value of an already existing evidence (might be soft or hard) More...

virtual void	chgEvidence (const Potential< GUM_SCALAR > &pot) final
	change the value of an already existing evidence (might be soft or hard) More...

virtual void	eraseAllEvidence () final
	removes all the evidence entered into the network More...

virtual void	eraseEvidence (NodeId id) final
	removed the evidence, if any, corresponding to node id More...

virtual void	eraseEvidence (const std::string &nodeName) final
	removed the evidence, if any, corresponding to node of name nodeName More...

virtual bool	hasEvidence () const final
	indicates whether some node(s) have received evidence More...

virtual bool	hasEvidence (NodeId id) const final
	indicates whether node id has received an evidence More...

virtual bool	hasEvidence (const std::string &nodeName) const final
	indicates whether node id has received an evidence More...

virtual bool	hasHardEvidence (NodeId id) const final
	indicates whether node id has received a hard evidence More...

virtual bool	hasHardEvidence (const std::string &nodeName) const final
	indicates whether node id has received a hard evidence More...

virtual bool	hasSoftEvidence (NodeId id) const final
	indicates whether node id has received a soft evidence More...

virtual bool	hasSoftEvidence (const std::string &nodeName) const final
	indicates whether node id has received a soft evidence More...

virtual Size	nbrEvidence () const final
	returns the number of evidence entered into the Bayesian network More...

virtual Size	nbrHardEvidence () const final
	returns the number of hard evidence entered into the Bayesian network More...

virtual Size	nbrSoftEvidence () const final
	returns the number of soft evidence entered into the Bayesian network More...

const NodeProperty< const Potential< GUM_SCALAR > *> &	evidence () const
	returns the set of evidence More...

const NodeSet &	softEvidenceNodes () const
	returns the set of nodes with soft evidence More...

const NodeSet &	hardEvidenceNodes () const
	returns the set of nodes with hard evidence More...

const NodeProperty< Idx > &	hardEvidence () const
	indicate for each node with hard evidence which value it took More...

Getters and setters
void	setEpsilon (double eps)
	Given that we approximate f(t), stopping criterion on \|f(t+1)-f(t)\|. More...

double	epsilon () const
	Returns the value of epsilon. More...

void	disableEpsilon ()
	Disable stopping criterion on epsilon. More...

void	enableEpsilon ()
	Enable stopping criterion on epsilon. More...

bool	isEnabledEpsilon () const
	Returns true if stopping criterion on epsilon is enabled, false otherwise. More...

void	setMinEpsilonRate (double rate)
	Given that we approximate f(t), stopping criterion on d/dt(\|f(t+1)-f(t)\|). More...

double	minEpsilonRate () const
	Returns the value of the minimal epsilon rate. More...

void	disableMinEpsilonRate ()
	Disable stopping criterion on epsilon rate. More...

void	enableMinEpsilonRate ()
	Enable stopping criterion on epsilon rate. More...

bool	isEnabledMinEpsilonRate () const
	Returns true if stopping criterion on epsilon rate is enabled, false otherwise. More...

void	setMaxIter (Size max)
	Stopping criterion on number of iterations. More...

Size	maxIter () const
	Returns the criterion on number of iterations. More...

void	disableMaxIter ()
	Disable stopping criterion on max iterations. More...

void	enableMaxIter ()
	Enable stopping criterion on max iterations. More...

bool	isEnabledMaxIter () const
	Returns true if stopping criterion on max iterations is enabled, false otherwise. More...

void	setMaxTime (double timeout)
	Stopping criterion on timeout. More...

double	maxTime () const
	Returns the timeout (in seconds). More...

double	currentTime () const
	Returns the current running time in second. More...

void	disableMaxTime ()
	Disable stopping criterion on timeout. More...

void	enableMaxTime ()
	Enable stopping criterion on timeout. More...

bool	isEnabledMaxTime () const
	Returns true if stopping criterion on timeout is enabled, false otherwise. More...

void	setPeriodSize (Size p)
	How many samples between two stopping is enable. More...

Size	periodSize () const
	Returns the period size. More...

void	setVerbosity (bool v)
	Set the verbosity on (true) or off (false). More...

bool	verbosity () const
	Returns true if verbosity is enabled. More...

ApproximationSchemeSTATE	stateApproximationScheme () const
	Returns the approximation scheme state. More...

Size	nbrIterations () const
	Returns the number of iterations. More...

const std::vector< double > &	history () const
	Returns the scheme history. More...

void	initApproximationScheme ()
	Initialise the scheme. More...

bool	startOfPeriod ()
	Returns true if we are at the beginning of a period (compute error is mandatory). More...

void	updateApproximationScheme (unsigned int incr=1)
	Update the scheme w.r.t the new error and increment steps. More...

Size	remainingBurnIn ()
	Returns the remaining burn in. More...

void	stopApproximationScheme ()
	Stop the approximation scheme. More...

bool	continueApproximationScheme (double error)
	Update the scheme w.r.t the new error. More...

Getters and setters
std::string	messageApproximationScheme () const
	Returns the approximation scheme message. More...

Public Types
enum	StateOfInference { StateOfInference::OutdatedBNStructure, StateOfInference::OutdatedBNPotentials, StateOfInference::ReadyForInference, StateOfInference::Done }
	current state of the inference More...

enum	ApproximationSchemeSTATE : char { ApproximationSchemeSTATE::Undefined, ApproximationSchemeSTATE::Continue, ApproximationSchemeSTATE::Epsilon, ApproximationSchemeSTATE::Rate, ApproximationSchemeSTATE::Limit, ApproximationSchemeSTATE::TimeLimit, ApproximationSchemeSTATE::Stopped }
	The different state of an approximation scheme. More...

Protected Attributes
double	_current_epsilon
	Current epsilon. More...

double	_last_epsilon
	Last epsilon value. More...

double	_current_rate
	Current rate. More...

Size	_current_step
	The current step. More...

Timer	_timer
	The timer. More...

ApproximationSchemeSTATE	_current_state
	The current state. More...

std::vector< double >	_history
	The scheme history, used only if verbosity == true. More...

double	_eps
	Threshold for convergence. More...

bool	_enabled_eps
	If true, the threshold convergence is enabled. More...

double	_min_rate_eps
	Threshold for the epsilon rate. More...

bool	_enabled_min_rate_eps
	If true, the minimal threshold for epsilon rate is enabled. More...

double	_max_time
	The timeout. More...

bool	_enabled_max_time
	If true, the timeout is enabled. More...

Size	_max_iter
	The maximum iterations. More...

bool	_enabled_max_iter
	If true, the maximum iterations stopping criterion is enabled. More...

Size	_burn_in
	Number of iterations before checking stopping criteria. More...

Size	_period_size
	Checking criteria frequency. More...

bool	_verbosity
	If true, verbosity is enabled. More...

Protected Member Functions
virtual void	_onMarginalTargetAdded (const NodeId id)=0
	fired after a new marginal target is inserted More...

virtual void	_onMarginalTargetErased (const NodeId id)=0
	fired before a marginal target is removed More...

virtual void	_onAllMarginalTargetsAdded ()=0
	fired after all the nodes of the BN are added as marginal targets More...

virtual void	_onAllMarginalTargetsErased ()=0
	fired before a all marginal targets are removed More...

virtual void	_onBayesNetChanged (const IBayesNet< GUM_SCALAR > *bn)
	fired after a new Bayes net has been assigned to the engine More...

virtual const Potential< GUM_SCALAR > &	_posterior (NodeId id)=0
	asks derived classes for the posterior of a given variable More...

void	_setTargetedMode ()

bool	_isTargetedMode () const

virtual void	_onStateChanged ()=0
	fired when the stage is changed More...

virtual void	_onEvidenceAdded (const NodeId id, bool isHardEvidence)=0
	fired after a new evidence is inserted More...

virtual void	_onEvidenceErased (const NodeId id, bool isHardEvidence)=0
	fired before an evidence is removed More...

virtual void	_onAllEvidenceErased (bool contains_hard_evidence)=0
	fired before all the evidence are erased More...

virtual void	_onEvidenceChanged (const NodeId id, bool hasChangedSoftHard)=0
	fired after an evidence is changed, in particular when its status (soft/hard) changes More...

virtual void	_updateOutdatedBNStructure ()=0
	prepares inference when the latter is in OutdatedBNStructure state More...

virtual void	_updateOutdatedBNPotentials ()=0
	prepares inference when the latter is in OutdatedBNPotentials state More...

virtual void	_makeInference ()=0
	called when the inference has to be performed effectively More...

void	_setOutdatedBNStructureState ()
	put the inference into an outdated BN structure state More...

void	_setOutdatedBNPotentialsState ()
	puts the inference into an OutdatedBNPotentials state if it is not already in an OutdatedBNStructure state More...

Detailed Description

template<typename GUM_SCALAR>
class gum::ApproximateInference< GUM_SCALAR >

Definition at line 40 of file approximateInference.h.

Member Enumeration Documentation

◆ ApproximationSchemeSTATE

enum gum::IApproximationSchemeConfiguration::ApproximationSchemeSTATE : char

stronginherited

The different state of an approximation scheme.

Enumerator
Undefined
Continue
Epsilon
Rate
Limit
TimeLimit
Stopped

Definition at line 65 of file IApproximationSchemeConfiguration.h.

                                         : char {
       Undefined,
       Continue,
       Epsilon,
       Rate,
       Limit,
       TimeLimit,
       Stopped
     };

◆ StateOfInference

template<typename GUM_SCALAR >

enum gum::BayesNetInference::StateOfInference

stronginherited

current state of the inference

BayesNetInference can be in one of 4 different states:

OutdatedBNStructure: in this state, the inference is fully unprepared to be applied because some events changed the "logical" structure of the BN: for instance a node received a hard evidence, which implies that its outgoing arcs can be removed from the BN, hence involving a structural change in the BN. As a consequence, the (incremental) inference (probably) needs a significant amount of preparation to be ready for the next inference. In a Lazy propagation, for instance, this step amounts to compute a new join tree, hence a new structure in which inference will be applied. Note that classes that inherit from BayesNetInference may be smarter than BayesNetInference and may, in some situations, find out that their data structures are still ok for inference and, therefore, only resort to perform the actions related to the OutdatedBNPotentials state. As an example, consider a LazyPropagation inference in Bayes Net A->B->C->D->E in which C has received hard evidence e_C and E is the only target. In this case, A and B are not needed for inference, the only potentials that matter are P(D|e_C) and P(E|D). So the smallest join tree needed for inference contains only one clique DE. Now, adding new evidence e_A on A has no impact on E given hard evidence e_C. In this case, LazyPropagation can be smart and not update its join tree.
OutdatedBNPotentials: in this state, the structure of the BN remains unchanged, only some potentials stored in it have changed. Therefore, the inference probably just needs to invalidate some already computed potentials to be ready. Only a light amount of preparation is needed to be able to perform inference.
Ready4Inference: in this state, all the data structures are ready for inference. There just remains to perform the inference computations.
Done: the heavy computations of inference have been done. There might still remain a few light computations to perform to get the posterior potentials we need. Typically, in Lazy Propagation, all the messages in the join tree have been computed but, to get the potentials, we still need to perform the combinations of the potentials in the cliques with the messages sent to the cliques. In some inference algorithms, this step may even be empty.

Enumerator
OutdatedBNStructure
OutdatedBNPotentials
ReadyForInference
Done

Definition at line 183 of file BayesNetInference.h.

                                 {
       OutdatedBNStructure,
       OutdatedBNPotentials,
       ReadyForInference,
       Done
     };

Constructor & Destructor Documentation

◆ ApproximateInference()

template<typename GUM_SCALAR >

gum::ApproximateInference< GUM_SCALAR >::ApproximateInference ( const IBayesNet< GUM_SCALAR > * bn )

inlineexplicit

Definition at line 44 of file approximateInference.h.

44 :

45 MarginalTargetedInference< GUM_SCALAR >(bn){};

gum::BayesNetInference::MarginalTargetedInference< GUM_SCALAR >

friend MarginalTargetedInference< GUM_SCALAR >

allow JointInference to access the single targets and inference states

Definition: BayesNetInference.h:619

Member Function Documentation

◆ _isTargetedMode()

template<typename GUM_SCALAR >

INLINE bool gum::MarginalTargetedInference< GUM_SCALAR >::_isTargetedMode ( ) const

protectedinherited

Definition at line 338 of file marginalTargetedInference_tpl.h.

References gum::MarginalTargetedInference< GUM_SCALAR >::__targeted_mode.

                                                                              {
     return __targeted_mode;
   }

◆ _makeInference()

template<typename GUM_SCALAR >

virtual void gum::BayesNetInference< GUM_SCALAR >::_makeInference ( )

protectedpure virtualinherited

called when the inference has to be performed effectively

Once the inference is done, _fillPosterior can be called.

Implemented in gum::LazyPropagation< GUM_SCALAR >, gum::SamplingInference< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::BayesNetInference< GUM_SCALAR >::makeInference().

Here is the caller graph for this function:

◆ _onAllEvidenceErased()

template<typename GUM_SCALAR >

virtual void gum::BayesNetInference< GUM_SCALAR >::_onAllEvidenceErased ( bool contains_hard_evidence )

protectedpure virtualinherited

fired before all the evidence are erased

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::BayesNetInference< GUM_SCALAR >::eraseAllEvidence().

Here is the caller graph for this function:

◆ _onAllMarginalTargetsAdded()

template<typename GUM_SCALAR>

virtual void gum::MarginalTargetedInference< GUM_SCALAR >::_onAllMarginalTargetsAdded ( )

protectedpure virtualinherited

fired after all the nodes of the BN are added as marginal targets

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::__setAllMarginalTargets().

Here is the caller graph for this function:

◆ _onAllMarginalTargetsErased()

template<typename GUM_SCALAR>

virtual void gum::MarginalTargetedInference< GUM_SCALAR >::_onAllMarginalTargetsErased ( )

protectedpure virtualinherited

fired before a all marginal targets are removed

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::eraseAllTargets().

Here is the caller graph for this function:

◆ _onBayesNetChanged()

template<typename GUM_SCALAR >

void gum::MarginalTargetedInference< GUM_SCALAR >::_onBayesNetChanged ( const IBayesNet< GUM_SCALAR > * bn )

protectedvirtualinherited

fired after a new Bayes net has been assigned to the engine

Implements gum::BayesNetInference< GUM_SCALAR >.

Reimplemented in gum::JointTargetedInference< GUM_SCALAR >, gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Definition at line 62 of file marginalTargetedInference_tpl.h.

References gum::MarginalTargetedInference< GUM_SCALAR >::__setAllMarginalTargets(), and gum::MarginalTargetedInference< GUM_SCALAR >::__targeted_mode.

Referenced by gum::JointTargetedInference< GUM_SCALAR >::_onBayesNetChanged().

                                         {
     __targeted_mode = true;
     __setAllMarginalTargets();
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ _onEvidenceAdded()

template<typename GUM_SCALAR >

virtual void gum::BayesNetInference< GUM_SCALAR >::_onEvidenceAdded	(	const NodeId	id,
		bool	isHardEvidence
	)

protectedpure virtualinherited

fired after a new evidence is inserted

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::BayesNetInference< GUM_SCALAR >::addEvidence().

Here is the caller graph for this function:

◆ _onEvidenceChanged()

template<typename GUM_SCALAR >

virtual void gum::BayesNetInference< GUM_SCALAR >::_onEvidenceChanged	(	const NodeId	id,
		bool	hasChangedSoftHard
	)

protectedpure virtualinherited

fired after an evidence is changed, in particular when its status (soft/hard) changes

Parameters

nodeId	the node of the changed evidence
hasChangedSoftHard	true if the evidence has changed from Soft to Hard or from Hard to Soft

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::BayesNetInference< GUM_SCALAR >::chgEvidence().

Here is the caller graph for this function:

◆ _onEvidenceErased()

template<typename GUM_SCALAR >

virtual void gum::BayesNetInference< GUM_SCALAR >::_onEvidenceErased	(	const NodeId	id,
		bool	isHardEvidence
	)

protectedpure virtualinherited

fired before an evidence is removed

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::BayesNetInference< GUM_SCALAR >::eraseEvidence().

Here is the caller graph for this function:

◆ _onMarginalTargetAdded()

template<typename GUM_SCALAR>

virtual void gum::MarginalTargetedInference< GUM_SCALAR >::_onMarginalTargetAdded ( const NodeId id )

protectedpure virtualinherited

fired after a new marginal target is inserted

Parameters

id	The target variable's id.

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::addAllTargets(), and gum::MarginalTargetedInference< GUM_SCALAR >::addTarget().

Here is the caller graph for this function:

◆ _onMarginalTargetErased()

template<typename GUM_SCALAR>

virtual void gum::MarginalTargetedInference< GUM_SCALAR >::_onMarginalTargetErased ( const NodeId id )

protectedpure virtualinherited

fired before a marginal target is removed

Parameters

id	The target variable's id.

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::eraseTarget().

Here is the caller graph for this function:

◆ _onStateChanged()

template<typename GUM_SCALAR >

virtual void gum::BayesNetInference< GUM_SCALAR >::_onStateChanged ( )

protectedpure virtualinherited

fired when the stage is changed

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::BayesNetInference< GUM_SCALAR >::__setState().

Here is the caller graph for this function:

◆ _posterior()

template<typename GUM_SCALAR>

virtual const Potential< GUM_SCALAR >& gum::MarginalTargetedInference< GUM_SCALAR >::_posterior ( NodeId id )

protectedpure virtualinherited

asks derived classes for the posterior of a given variable

Parameters

id	The variable's id.

Implemented in gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, gum::SamplingInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::posterior().

Here is the caller graph for this function:

◆ _setOutdatedBNPotentialsState()

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::_setOutdatedBNPotentialsState ( )

protectedinherited

puts the inference into an OutdatedBNPotentials state if it is not already in an OutdatedBNStructure state

OutdatedBNPotentials: in this state, the structure of the BN remains unchanged, only some potentials stored in it have changed. Therefore, the inference probably just needs to invalidate some already computed potentials to be ready. Only a light amount of preparation is needed to be able to perform inference.

Definition at line 685 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__setState(), and gum::BayesNetInference< GUM_SCALAR >::OutdatedBNPotentials.

                                                                              {
     __setState(StateOfInference::OutdatedBNPotentials);
   }

Here is the call graph for this function:

◆ _setOutdatedBNStructureState()

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::_setOutdatedBNStructureState ( )

protectedinherited

put the inference into an outdated BN structure state

OutdatedBNStructure: in this state, the inference is fully unprepared to be applied because some events changed the "logical" structure of the BN: for instance a node received a hard evidence, which implies that its outgoing arcs can be removed from the BN, hence involving a structural change in the BN. As a consequence, the (incremental) inference (probably) needs a significant amount of preparation to be ready for the next inference. In a Lazy propagation, for instance, this step amounts to compute a new join tree, hence a new structure in which inference will be applied. Note that classes that inherit from BayesNetInference may be smarter than BayesNetInference and may, in some situations, find out that their data structures are still ok for inference and, therefore, only resort to perform the actions related to the OutdatedBNPotentials state. As an example, consider a LazyPropagation inference in Bayes Net A->B->C->D->E in which C has received hard evidence e_C and E is the only target. In this case, A and B are not needed for inference, the only potentials that matter are P(D|e_C) and P(E|D). So the smallest join tree needed for inference contains only one clique DE. Now, adding new evidence e_A on A has no impact on E given hard evidence e_C. In this case, LazyPropagation can be smart and not update its join tree.

Definition at line 677 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__setState(), and gum::BayesNetInference< GUM_SCALAR >::OutdatedBNStructure.

                                                                             {
     __setState(StateOfInference::OutdatedBNStructure);
   }

Here is the call graph for this function:

◆ _setTargetedMode()

template<typename GUM_SCALAR >

INLINE void gum::MarginalTargetedInference< GUM_SCALAR >::_setTargetedMode ( )

protectedinherited

Definition at line 342 of file marginalTargetedInference_tpl.h.

References gum::MarginalTargetedInference< GUM_SCALAR >::__targeted_mode, gum::MarginalTargetedInference< GUM_SCALAR >::__targets, and gum::Set< Key, Alloc >::clear().

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::addAllTargets(), gum::JointTargetedInference< GUM_SCALAR >::addJointTarget(), gum::MarginalTargetedInference< GUM_SCALAR >::addTarget(), and gum::MarginalTargetedInference< GUM_SCALAR >::eraseAllTargets().

                                                                         {
     if (!__targeted_mode) {
       __targets.clear();
       __targeted_mode = true;
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ _updateOutdatedBNPotentials()

template<typename GUM_SCALAR >

virtual void gum::BayesNetInference< GUM_SCALAR >::_updateOutdatedBNPotentials ( )

protectedpure virtualinherited

prepares inference when the latter is in OutdatedBNPotentials state

Note that the values of evidence are not necessarily known and can be changed between _updateOutdatedBNPotentials and _makeInference.

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::BayesNetInference< GUM_SCALAR >::prepareInference().

Here is the caller graph for this function:

◆ _updateOutdatedBNStructure()

template<typename GUM_SCALAR >

virtual void gum::BayesNetInference< GUM_SCALAR >::_updateOutdatedBNStructure ( )

protectedpure virtualinherited

prepares inference when the latter is in OutdatedBNStructure state

Note that the values of evidence are not necessarily known and can be changed between _updateOutdatedBNStructure and _makeInference.

Implemented in gum::SamplingInference< GUM_SCALAR >, gum::LazyPropagation< GUM_SCALAR >, gum::VariableElimination< GUM_SCALAR >, gum::ShaferShenoyInference< GUM_SCALAR >, and gum::LoopyBeliefPropagation< GUM_SCALAR >.

Referenced by gum::BayesNetInference< GUM_SCALAR >::prepareInference().

Here is the caller graph for this function:

◆ addAllTargets()

template<typename GUM_SCALAR >

void gum::MarginalTargetedInference< GUM_SCALAR >::addAllTargets ( )

finalvirtualinherited

adds all nodes as targets

Definition at line 136 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::BayesNetInference< GUM_SCALAR >::__setState(), gum::MarginalTargetedInference< GUM_SCALAR >::__targets, gum::MarginalTargetedInference< GUM_SCALAR >::_onMarginalTargetAdded(), gum::MarginalTargetedInference< GUM_SCALAR >::_setTargetedMode(), gum::Set< Key, Alloc >::contains(), GUM_ERROR, and gum::Set< Key, Alloc >::insert().

                                                               {
     // check if the node belongs to the Bayesian network
     if (this->__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
 
     _setTargetedMode();   // does nothing if already in targeted mode
     for (const auto target : this->__bn->dag()) {
       if (!__targets.contains(target)) {
         __targets.insert(target);
         _onMarginalTargetAdded(target);
         this->__setState(
            BayesNetInference< GUM_SCALAR >::StateOfInference::OutdatedBNStructure);
       }
     }
   }

Here is the call graph for this function:

◆ addEvidence() [1/8]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::addEvidence	(	NodeId	id,
		const Idx	val
	)

finalvirtualinherited

adds a new hard evidence on node id

Exceptions

UndefinedElement	if id does not belong to the Bayesian network
InvalidArgument	if val is not a value for id
InvalidArgument	if id already has an evidence

Definition at line 247 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__createHardEvidence().

Referenced by gum::LoopySamplingInference< GUM_SCALAR, APPROX >::_makeInference(), gum::BayesNetInference< GUM_SCALAR >::addEvidence(), gum::BayesNetInference< GUM_SCALAR >::addListOfEvidence(), gum::BayesNetInference< GUM_SCALAR >::addSetOfEvidence(), gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact(), and gum::JointTargetedInference< GUM_SCALAR >::evidenceJointImpact().

                                                                           {
     addEvidence(__createHardEvidence(id, val));
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ addEvidence() [2/8]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::addEvidence	(	const std::string &	nodeName,
		const Idx	val
	)

finalvirtualinherited

adds a new hard evidence on node named nodeName

Exceptions

UndefinedElement	if nodeName does not belong to the Bayesian network
InvalidArgument	if val is not a value for id
InvalidArgument	if nodeName already has an evidence

Definition at line 255 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::addEvidence(), and gum::BayesNetInference< GUM_SCALAR >::BN().

                                                                           {
     addEvidence(this->BN().idFromName(nodeName), val);
   }

Here is the call graph for this function:

◆ addEvidence() [3/8]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::addEvidence	(	NodeId	id,
		const std::string &	label
	)

finalvirtualinherited

adds a new hard evidence on node id

Exceptions

UndefinedElement	if id does not belong to the Bayesian network
InvalidArgument	if val is not a value for id
InvalidArgument	if id already has an evidence

Definition at line 263 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::addEvidence(), and gum::BayesNetInference< GUM_SCALAR >::BN().

                                                                           {
     addEvidence(id, this->BN().variable(id)[label]);
   }

Here is the call graph for this function:

◆ addEvidence() [4/8]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::addEvidence	(	const std::string &	nodeName,
		const std::string &	label
	)

finalvirtualinherited

adds a new hard evidence on node named nodeName

Exceptions

UndefinedElement	if nodeName does not belong to the Bayesian network
InvalidArgument	if val is not a value for id
InvalidArgument	if nodeName already has an evidence

Definition at line 271 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::addEvidence(), and gum::BayesNetInference< GUM_SCALAR >::BN().

                                                                           {
     NodeId id = this->BN().idFromName(nodeName);
     addEvidence(id, this->BN().variable(id)[label]);
   }

Here is the call graph for this function:

◆ addEvidence() [5/8]

template<typename GUM_SCALAR >

void gum::BayesNetInference< GUM_SCALAR >::addEvidence	(	NodeId	id,
		const std::vector< GUM_SCALAR > &	vals
	)

finalvirtualinherited

adds a new evidence on node id (might be soft or hard)

Exceptions

UndefinedElement	if id does not belong to the Bayesian network
InvalidArgument	if id already has an evidence
FatalError	if vals=[0,0,...,0]
InvalidArgument	if the size of vals is different from the domain size of node id

Definition at line 279 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::MultiDimDecorator< GUM_SCALAR >::add(), gum::BayesNetInference< GUM_SCALAR >::addEvidence(), and GUM_ERROR.

                                                      {
     // checks that the evidence is meaningful
     if (__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     if (!__bn->dag().exists(id)) {
       GUM_ERROR(UndefinedElement, id << " is not a NodeId in the bn");
     }
 
     if (__bn->variable(id).domainSize() != vals.size()) {
       GUM_ERROR(InvalidArgument,
                 "node " << __bn->variable(id)
                         << " and its evidence vector have different sizes.");
     }
 
     Potential< GUM_SCALAR > pot;
     pot.add(__bn->variable(id));
     pot.fillWith(vals);
     addEvidence(std::move(pot));
   }

Here is the call graph for this function:

◆ addEvidence() [6/8]

template<typename GUM_SCALAR >

void gum::BayesNetInference< GUM_SCALAR >::addEvidence	(	const std::string &	nodeName,
		const std::vector< GUM_SCALAR > &	vals
	)

finalvirtualinherited

adds a new evidence on node named nodeName (might be soft or hard)

Exceptions

UndefinedElement	if id does not belong to the Bayesian network
InvalidArgument	if nodeName already has an evidence
FatalError	if vals=[0,0,...,0]
InvalidArgument	if the size of vals is different from the domain size of node nodeName

Definition at line 305 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::addEvidence(), and gum::BayesNetInference< GUM_SCALAR >::BN().

                                                                      {
     addEvidence(this->BN().idFromName(nodeName), vals);
   }

Here is the call graph for this function:

◆ addEvidence() [7/8]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::addEvidence ( const Potential< GUM_SCALAR > & pot )

finalvirtualinherited

adds a new evidence on node id (might be soft or hard)

Exceptions

UndefinedElement	if the potential is defined over several nodes
UndefinedElement	if the node on which the potential is defined does not belong to the Bayesian network
InvalidArgument	if the node of the potential already has an evidence
FatalError	if pot=[0,0,...,0]

Definition at line 354 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::addEvidence().

                                          {
     Potential< GUM_SCALAR > new_pot(pot);
     addEvidence(std::move(new_pot));
   }

Here is the call graph for this function:

◆ addEvidence() [8/8]

template<typename GUM_SCALAR >

void gum::BayesNetInference< GUM_SCALAR >::addEvidence ( Potential< GUM_SCALAR > && pot )

finalvirtualinherited

adds a new evidence on node id (might be soft or hard)

Exceptions

UndefinedElement	if the potential is defined over several nodes
UndefinedElement	if the node on which the potential is defined does not belong to the Bayesian network
InvalidArgument	if the node of the potential already has an evidence
FatalError	if pot=[0,0,...,0]

Definition at line 313 of file BayesNetInference_tpl.h.

                                                                                {
     // check if the potential corresponds to an evidence
     if (pot.nbrDim() != 1) {
       GUM_ERROR(InvalidArgument, pot << " is not mono-dimensional.");
     }
     if (__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     NodeId id = __bn->nodeId(pot.variable(0));
 
     if (hasEvidence(id)) {
       GUM_ERROR(InvalidArgument,
                 " node " << id
                          << " already has an evidence. Please use chgEvidence().");
     }
 
     // check whether we have a hard evidence (and also check whether the
     // potential only contains 0 (in this case, this will automatically raise
     // an exception) )
     Idx  val;
     bool is_hard_evidence = __isHardEvidence(pot, val);
 
     // insert the evidence
     __evidence.insert(
        id,
        new Potential< GUM_SCALAR >(std::forward< Potential< GUM_SCALAR > >(pot)));
     if (is_hard_evidence) {   // pot is deterministic
       __hard_evidence.insert(id, val);
       __hard_evidence_nodes.insert(id);
     } else {
       __soft_evidence_nodes.insert(id);
     }
     __setState(StateOfInference::OutdatedBNStructure);
     _onEvidenceAdded(id, is_hard_evidence);
   }

Here is the call graph for this function:

◆ addListOfEvidence()

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::addListOfEvidence ( const List< const Potential< GUM_SCALAR > * > & potlist )

finalvirtualinherited

adds a new list of evidence

Exceptions

UndefinedElement	if some potential is defined over several nodes
UndefinedElement	if the node on which some potential is defined does not belong to the Bayesian network
InvalidArgument	if the node of some potential already has an evidence
FatalError	if pot=[0,0,...,0]

Definition at line 363 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::addEvidence().

                                                             {
     for (const auto pot : potlist)
       addEvidence(*pot);
   }

Here is the call graph for this function:

◆ addSetOfEvidence()

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::addSetOfEvidence ( const Set< const Potential< GUM_SCALAR > * > & potset )

finalvirtualinherited

adds a new set of evidence

Exceptions

UndefinedElement	if some potential is defined over several nodes
UndefinedElement	if the node on which some potential is defined does not belong to the Bayesian network
InvalidArgument	if the node of some potential already has an evidence
FatalError	if pot=[0,0,...,0]

Definition at line 372 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::addEvidence().

                                                           {
     for (const auto pot : potset)
       addEvidence(*pot);
   }

Here is the call graph for this function:

◆ addTarget() [1/2]

template<typename GUM_SCALAR >

void gum::MarginalTargetedInference< GUM_SCALAR >::addTarget ( NodeId target )

finalvirtualinherited

Add a marginal target to the list of targets.

Exceptions

UndefinedElement if target is not a NodeId in the Bayes net

Definition at line 112 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::BayesNetInference< GUM_SCALAR >::__setState(), gum::MarginalTargetedInference< GUM_SCALAR >::__targets, gum::MarginalTargetedInference< GUM_SCALAR >::_onMarginalTargetAdded(), gum::MarginalTargetedInference< GUM_SCALAR >::_setTargetedMode(), gum::Set< Key, Alloc >::contains(), GUM_ERROR, and gum::Set< Key, Alloc >::insert().

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::addTarget(), and gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact().

                                                                        {
     // check if the node belongs to the Bayesian network
     if (this->__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     if (!this->__bn->dag().exists(target)) {
       GUM_ERROR(UndefinedElement, target << " is not a NodeId in the bn");
     }
 
     _setTargetedMode();   // does nothing if already in targeted mode
     // add the new target
     if (!__targets.contains(target)) {
       __targets.insert(target);
       _onMarginalTargetAdded(target);
       this->__setState(
          BayesNetInference< GUM_SCALAR >::StateOfInference::OutdatedBNStructure);
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ addTarget() [2/2]

template<typename GUM_SCALAR >

void gum::MarginalTargetedInference< GUM_SCALAR >::addTarget ( const std::string & nodeName )

finalvirtualinherited

Add a marginal target to the list of targets.

Exceptions

UndefinedElement if target is not a NodeId in the Bayes net

Definition at line 158 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::MarginalTargetedInference< GUM_SCALAR >::addTarget(), and GUM_ERROR.

                                 {
     // check if the node belongs to the Bayesian network
     if (this->__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     addTarget(this->__bn->idFromName(nodeName));
   }

Here is the call graph for this function:

◆ BN()

template<typename GUM_SCALAR >

INLINE const IBayesNet< GUM_SCALAR > & gum::BayesNetInference< GUM_SCALAR >::BN ( ) const

finalvirtualinherited

Returns a constant reference over the IBayesNet referenced by this class.

Exceptions

UndefinedElement is raised if no Bayes net has been assigned to the inference.

Definition at line 121 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, and GUM_ERROR.

                                                          {
     if (__bn == nullptr)
       GUM_ERROR(UndefinedElement,
                 "No Bayes net has been assigned to "
                 "the inference algorithm.");
     return *__bn;
   }

Here is the caller graph for this function:

◆ chgEvidence() [1/7]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::chgEvidence	(	NodeId	id,
		const Idx	val
	)

finalvirtualinherited

change the value of an already existing hard evidence

Exceptions

UndefinedElement	if id does not belong to the Bayesian network
InvalidArgument	if val is not a value for id
InvalidArgument	if id does not already have an evidence

Definition at line 432 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__createHardEvidence().

Referenced by gum::BayesNetInference< GUM_SCALAR >::chgEvidence(), gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact(), and gum::JointTargetedInference< GUM_SCALAR >::evidenceJointImpact().

                                                                           {
     chgEvidence(__createHardEvidence(id, val));
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ chgEvidence() [2/7]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::chgEvidence	(	const std::string &	nodeName,
		const Idx	val
	)

finalvirtualinherited

change the value of an already existing hard evidence

Exceptions

UndefinedElement	if nodeName does not belong to the Bayesian network
InvalidArgument	if val is not a value for id
InvalidArgument	if id does not already have an evidence

Definition at line 440 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::BayesNetInference< GUM_SCALAR >::chgEvidence().

                                                                           {
     chgEvidence(this->BN().idFromName(nodeName), val);
   }

Here is the call graph for this function:

◆ chgEvidence() [3/7]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::chgEvidence	(	NodeId	id,
		const std::string &	label
	)

finalvirtualinherited

change the value of an already existing hard evidence

Exceptions

UndefinedElement	if id does not belong to the Bayesian network
InvalidArgument	if val is not a value for id
InvalidArgument	if id does not already have an evidence

Definition at line 448 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::BayesNetInference< GUM_SCALAR >::chgEvidence().

                                                                           {
     chgEvidence(id, this->BN().variable(id)[label]);
   }

Here is the call graph for this function:

◆ chgEvidence() [4/7]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::chgEvidence	(	const std::string &	nodeName,
		const std::string &	label
	)

finalvirtualinherited

change the value of an already existing hard evidence

Exceptions

UndefinedElement	if nodeName does not belong to the Bayesian network
InvalidArgument	if val is not a value for id
InvalidArgument	if id does not already have an evidence

Definition at line 456 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::BayesNetInference< GUM_SCALAR >::chgEvidence().

                                                                           {
     NodeId id = this->BN().idFromName(nodeName);
     chgEvidence(id, this->BN().variable(id)[label]);
   }

Here is the call graph for this function:

◆ chgEvidence() [5/7]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::chgEvidence	(	NodeId	id,
		const std::vector< GUM_SCALAR > &	vals
	)

finalvirtualinherited

change the value of an already existing evidence (might be soft or hard)

Exceptions

UndefinedElement	if id does not belong to the Bayesian network
InvalidArgument	if the node does not already have an evidence
FatalError	if vals=[0,0,...,0]
InvalidArgument	if the size of vals is different from the domain size of node id

Definition at line 464 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::MultiDimDecorator< GUM_SCALAR >::add(), gum::BayesNetInference< GUM_SCALAR >::chgEvidence(), and GUM_ERROR.

                                                      {
     // check whether this corresponds to an evidence
     if (__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     if (!__bn->dag().exists(id)) {
       GUM_ERROR(UndefinedElement, id << " is not a NodeId in the bn");
     }
 
     if (__bn->variable(id).domainSize() != vals.size()) {
       GUM_ERROR(InvalidArgument,
                 "node " << __bn->variable(id)
                         << " and its evidence have different sizes.");
     }
 
     // create the potential corresponding to vals
     Potential< GUM_SCALAR > pot;
     pot.add(__bn->variable(id));
     pot.fillWith(vals);
     chgEvidence(pot);
   }

Here is the call graph for this function:

◆ chgEvidence() [6/7]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::chgEvidence	(	const std::string &	nodeName,
		const std::vector< GUM_SCALAR > &	vals
	)

finalvirtualinherited

change the value of an already existing evidence (might be soft or hard)

Exceptions

UndefinedElement	if nodeName does not belong to the Bayesian network
InvalidArgument	if the node does not already have an evidence
FatalError	if vals=[0,0,...,0]
InvalidArgument	if the size of vals is different from the domain size of node id

Definition at line 491 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::BayesNetInference< GUM_SCALAR >::chgEvidence().

                                                                      {
     chgEvidence(this->BN().idFromName(nodeName), vals);
   }

Here is the call graph for this function:

◆ chgEvidence() [7/7]

template<typename GUM_SCALAR >

void gum::BayesNetInference< GUM_SCALAR >::chgEvidence ( const Potential< GUM_SCALAR > & pot )

finalvirtualinherited

change the value of an already existing evidence (might be soft or hard)

Exceptions

UndefinedElement	if the potential is defined over several nodes
UndefinedElement	if the node on which the potential is defined does not belong to the Bayesian network
InvalidArgument	if the node of the potential does not already have an evidence
FatalError	if pot=[0,0,...,0]

Definition at line 499 of file BayesNetInference_tpl.h.

                                          {
     // check if the potential corresponds to an evidence
     if (pot.nbrDim() != 1) {
       GUM_ERROR(InvalidArgument, pot << " is not a mono-dimensional potential.");
     }
     if (__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     NodeId id = __bn->nodeId(pot.variable(0));
 
     if (!hasEvidence(id)) {
       GUM_ERROR(InvalidArgument,
                 id << " has no evidence. Please use addEvidence().");
     }
 
     // check whether we have a hard evidence (and also check whether the
     // potential only contains 0 (in this case, this will automatically raise
     // an exception) )
     Idx  val;
     bool is_hard_evidence = __isHardEvidence(pot, val);
 
     // modify the evidence already stored
     const Potential< GUM_SCALAR >* localPot = __evidence[id];
     Instantiation                  I(pot);
     for (I.setFirst(); !I.end(); I.inc()) {
       localPot->set(I, pot[I]);
     }
 
     // the inference state will be different
     // whether evidence change from Hard to Soft or not.
     bool hasChangedSoftHard = false;
 
     if (is_hard_evidence) {
       if (!hasHardEvidence(id)) {
         hasChangedSoftHard = true;
         __hard_evidence.insert(id, val);
         __hard_evidence_nodes.insert(id);
         __soft_evidence_nodes.erase(id);
       } else {
         __hard_evidence[id] = val;
       }
     } else {
       if (hasHardEvidence(id)) {   // evidence was hard
         __hard_evidence.erase(id);
         __hard_evidence_nodes.erase(id);
         __soft_evidence_nodes.insert(id);
         hasChangedSoftHard = true;
       }
     }
 
     if (hasChangedSoftHard) {
       __setState(StateOfInference::OutdatedBNStructure);
     } else {
       if (!isInferenceOutdatedBNStructure()) {
         __setState(StateOfInference::OutdatedBNPotentials);
       }
     }
 
     _onEvidenceChanged(id, hasChangedSoftHard);
   }

Here is the call graph for this function:

◆ clear()

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::clear ( )

virtualinherited

clears all the data structures allocated for the last inference

Definition at line 153 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__setState(), gum::BayesNetInference< GUM_SCALAR >::eraseAllEvidence(), and gum::BayesNetInference< GUM_SCALAR >::OutdatedBNStructure.

Referenced by gum::BayesNetInference< GUM_SCALAR >::setBN().

                                                      {
     eraseAllEvidence();
     __setState(StateOfInference::OutdatedBNStructure);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ continueApproximationScheme()

INLINE bool gum::ApproximationScheme::continueApproximationScheme ( double error )

inherited

Update the scheme w.r.t the new error.

Test the stopping criterion that are enabled.

Parameters

error The new error value.

Returns: false if state become != ApproximationSchemeSTATE::Continue

Exceptions

OperationNotAllowed Raised if state != ApproximationSchemeSTATE::Continue.

Definition at line 227 of file approximationScheme_inl.h.

Referenced by gum::GibbsBNdistance< GUM_SCALAR >::_computeKL(), gum::SamplingInference< GUM_SCALAR >::_loopApproxInference(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), gum::learning::GreedyHillClimbing::learnStructure(), gum::learning::LocalSearchWithTabuList::learnStructure(), and gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::makeInference().

                                                                            {
     // For coherence, we fix the time used in the method
 
     double timer_step = _timer.step();
 
     if (_enabled_max_time) {
       if (timer_step > _max_time) {
         _stopScheme(ApproximationSchemeSTATE::TimeLimit);
         return false;
       }
     }
 
     if (!startOfPeriod()) { return true; }
 
     if (_current_state != ApproximationSchemeSTATE::Continue) {
       GUM_ERROR(OperationNotAllowed,
                 "state of the approximation scheme is not correct : "
                    + messageApproximationScheme());
     }
 
     if (verbosity()) { _history.push_back(error); }
 
     if (_enabled_max_iter) {
       if (_current_step > _max_iter) {
         _stopScheme(ApproximationSchemeSTATE::Limit);
         return false;
       }
     }
 
     _last_epsilon = _current_epsilon;
     _current_epsilon = error;   // eps rate isEnabled needs it so affectation was
     // moved from eps isEnabled below
 
     if (_enabled_eps) {
       if (_current_epsilon <= _eps) {
         _stopScheme(ApproximationSchemeSTATE::Epsilon);
         return false;
       }
     }
 
     if (_last_epsilon >= 0.) {
       if (_current_epsilon > .0) {
         // ! _current_epsilon can be 0. AND epsilon
         // isEnabled can be disabled !
         _current_rate =
            std::fabs((_current_epsilon - _last_epsilon) / _current_epsilon);
       }
       // limit with current eps ---> 0 is | 1 - ( last_eps / 0 ) | --->
       // infinity the else means a return false if we isEnabled the rate below,
       // as we would have returned false if epsilon isEnabled was enabled
       else {
         _current_rate = _min_rate_eps;
       }
 
       if (_enabled_min_rate_eps) {
         if (_current_rate <= _min_rate_eps) {
           _stopScheme(ApproximationSchemeSTATE::Rate);
           return false;
         }
       }
     }
 
     if (stateApproximationScheme() == ApproximationSchemeSTATE::Continue) {
       if (onProgress.hasListener()) {
         GUM_EMIT3(onProgress, _current_step, _current_epsilon, timer_step);
       }
 
       return true;
     } else {
       return false;
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ currentTime()

INLINE double gum::ApproximationScheme::currentTime ( ) const

virtualinherited

Returns the current running time in second.

Returns: Returns the current running time in second.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 128 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_timer, and gum::Timer::step().

Referenced by gum::learning::genericBNLearner::currentTime().

128 { return _timer.step(); }

gum::Timer::step

double step() const

Returns the delta time between now and the last reset() call (or the constructor).

Definition: timer_inl.h:42

gum::ApproximationScheme::_timer

Timer _timer

The timer.

Definition: approximationScheme.h:381

Here is the call graph for this function:

Here is the caller graph for this function:

◆ disableEpsilon()

INLINE void gum::ApproximationScheme::disableEpsilon ( )

virtualinherited

Disable stopping criterion on epsilon.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 54 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_eps.

Referenced by gum::learning::genericBNLearner::disableEpsilon().

54 { _enabled_eps = false; }

gum::ApproximationScheme::_enabled_eps

bool _enabled_eps

If true, the threshold convergence is enabled.

Definition: approximationScheme.h:393

Here is the caller graph for this function:

◆ disableMaxIter()

INLINE void gum::ApproximationScheme::disableMaxIter ( )

virtualinherited

Disable stopping criterion on max iterations.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 105 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_max_iter.

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__mcInitApproximationScheme(), gum::learning::genericBNLearner::disableMaxIter(), and gum::learning::GreedyHillClimbing::GreedyHillClimbing().

105 { _enabled_max_iter = false; }

gum::ApproximationScheme::_enabled_max_iter

bool _enabled_max_iter

If true, the maximum iterations stopping criterion is enabled.

Definition: approximationScheme.h:411

Here is the caller graph for this function:

◆ disableMaxTime()

INLINE void gum::ApproximationScheme::disableMaxTime ( )

virtualinherited

Disable stopping criterion on timeout.

Returns: Disable stopping criterion on timeout.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 131 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_max_time.

Referenced by gum::learning::genericBNLearner::disableMaxTime(), and gum::learning::GreedyHillClimbing::GreedyHillClimbing().

131 { _enabled_max_time = false; }

gum::ApproximationScheme::_enabled_max_time

bool _enabled_max_time

If true, the timeout is enabled.

Definition: approximationScheme.h:405

Here is the caller graph for this function:

◆ disableMinEpsilonRate()

INLINE void gum::ApproximationScheme::disableMinEpsilonRate ( )

virtualinherited

Disable stopping criterion on epsilon rate.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 79 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_min_rate_eps.

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__mcInitApproximationScheme(), gum::GibbsBNdistance< GUM_SCALAR >::_computeKL(), gum::learning::genericBNLearner::disableMinEpsilonRate(), and gum::learning::GreedyHillClimbing::GreedyHillClimbing().

                                                          {
     _enabled_min_rate_eps = false;
   }

Here is the caller graph for this function:

◆ domainSizes()

template<typename GUM_SCALAR >

INLINE const NodeProperty< Size > & gum::BayesNetInference< GUM_SCALAR >::domainSizes ( ) const

finalvirtualinherited

get the domain sizes of the random variables of the BN

Definition at line 174 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__domain_sizes.

                                                                   {
     return __domain_sizes;
   }

◆ enableEpsilon()

INLINE void gum::ApproximationScheme::enableEpsilon ( )

virtualinherited

Enable stopping criterion on epsilon.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 57 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_eps.

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__mcInitApproximationScheme(), and gum::learning::genericBNLearner::enableEpsilon().

57 { _enabled_eps = true; }

gum::ApproximationScheme::_enabled_eps

bool _enabled_eps

If true, the threshold convergence is enabled.

Definition: approximationScheme.h:393

Here is the caller graph for this function:

◆ enableMaxIter()

INLINE void gum::ApproximationScheme::enableMaxIter ( )

virtualinherited

Enable stopping criterion on max iterations.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 108 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_max_iter.

Referenced by gum::learning::genericBNLearner::enableMaxIter().

108 { _enabled_max_iter = true; }

gum::ApproximationScheme::_enabled_max_iter

bool _enabled_max_iter

If true, the maximum iterations stopping criterion is enabled.

Definition: approximationScheme.h:411

Here is the caller graph for this function:

◆ enableMaxTime()

INLINE void gum::ApproximationScheme::enableMaxTime ( )

virtualinherited

Enable stopping criterion on timeout.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 134 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_max_time.

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::CNMonteCarloSampling(), and gum::learning::genericBNLearner::enableMaxTime().

134 { _enabled_max_time = true; }

gum::ApproximationScheme::_enabled_max_time

bool _enabled_max_time

If true, the timeout is enabled.

Definition: approximationScheme.h:405

Here is the caller graph for this function:

◆ enableMinEpsilonRate()

INLINE void gum::ApproximationScheme::enableMinEpsilonRate ( )

virtualinherited

Enable stopping criterion on epsilon rate.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 84 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_min_rate_eps.

Referenced by gum::GibbsBNdistance< GUM_SCALAR >::_computeKL(), and gum::learning::genericBNLearner::enableMinEpsilonRate().

                                                         {
     _enabled_min_rate_eps = true;
   }

Here is the caller graph for this function:

◆ epsilon()

INLINE double gum::ApproximationScheme::epsilon ( ) const

virtualinherited

Returns the value of epsilon.

Returns: Returns the value of epsilon.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 51 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_eps.

Referenced by gum::ImportanceSampling< GUM_SCALAR >::_onContextualize(), and gum::learning::genericBNLearner::epsilon().

51 { return _eps; }

gum::ApproximationScheme::_eps

double _eps

Threshold for convergence.

Definition: approximationScheme.h:390

Here is the caller graph for this function:

◆ eraseAllEvidence()

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::eraseAllEvidence ( )

finalvirtualinherited

removes all the evidence entered into the network

Definition at line 595 of file BayesNetInference_tpl.h.

Referenced by gum::BayesNetInference< GUM_SCALAR >::clear(), gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact(), gum::JointTargetedInference< GUM_SCALAR >::evidenceJointImpact(), and gum::JointTargetedInference< GUM_SCALAR >::jointMutualInformation().

                                                                 {
     bool has_hard_evidence = !__hard_evidence.empty();
     this->_onAllEvidenceErased(has_hard_evidence);
 
     for (const auto& pair : __evidence) {
       if (pair.second != nullptr) { delete (pair.second); }
     }
 
     __evidence.clear();
     __hard_evidence.clear();
     __hard_evidence_nodes.clear();
     __soft_evidence_nodes.clear();
 
     if (has_hard_evidence) {
       __setState(StateOfInference::OutdatedBNStructure);
     } else {
       if (!isInferenceOutdatedBNStructure()) {
         __setState(StateOfInference::OutdatedBNPotentials);
       }
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ eraseAllTargets()

template<typename GUM_SCALAR >

INLINE void gum::MarginalTargetedInference< GUM_SCALAR >::eraseAllTargets ( )

virtualinherited

Clear all previously defined targets.

Reimplemented in gum::JointTargetedInference< GUM_SCALAR >.

Definition at line 99 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__setState(), gum::MarginalTargetedInference< GUM_SCALAR >::__targets, gum::MarginalTargetedInference< GUM_SCALAR >::_onAllMarginalTargetsErased(), gum::MarginalTargetedInference< GUM_SCALAR >::_setTargetedMode(), and gum::Set< Key, Alloc >::clear().

Referenced by gum::JointTargetedInference< GUM_SCALAR >::eraseAllMarginalTargets(), and gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact().

                                                                        {
     _onAllMarginalTargetsErased();
 
     __targets.clear();
     _setTargetedMode();   // does nothing if already in targeted mode
 
     this->__setState(
        BayesNetInference< GUM_SCALAR >::StateOfInference::OutdatedBNStructure);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ eraseEvidence() [1/2]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::eraseEvidence ( NodeId id )

finalvirtualinherited

removed the evidence, if any, corresponding to node id

Definition at line 566 of file BayesNetInference_tpl.h.

Referenced by gum::BayesNetInference< GUM_SCALAR >::eraseEvidence().

                                                                       {
     if (hasEvidence(id)) {
       if (hasHardEvidence(id)) {
         _onEvidenceErased(id, true);
         __hard_evidence.erase(id);
         __hard_evidence_nodes.erase(id);
         __setState(StateOfInference::OutdatedBNStructure);
       } else {
         _onEvidenceErased(id, false);
         __soft_evidence_nodes.erase(id);
         if (!isInferenceOutdatedBNStructure()) {
           __setState(StateOfInference::OutdatedBNPotentials);
         }
       }
 
       delete (__evidence[id]);
       __evidence.erase(id);
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ eraseEvidence() [2/2]

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::eraseEvidence ( const std::string & nodeName )

finalvirtualinherited

removed the evidence, if any, corresponding to node of name nodeName

Definition at line 588 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::BayesNetInference< GUM_SCALAR >::eraseEvidence().

                                                                              {
     eraseEvidence(this->BN().idFromName(nodeName));
   }

Here is the call graph for this function:

◆ eraseTarget() [1/2]

template<typename GUM_SCALAR >

void gum::MarginalTargetedInference< GUM_SCALAR >::eraseTarget ( NodeId target )

finalvirtualinherited

removes an existing (marginal) target

Warning: If the target does not already exist, the method does nothing. In particular, it does not raise any exception.

Definition at line 172 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::BayesNetInference< GUM_SCALAR >::__setState(), gum::MarginalTargetedInference< GUM_SCALAR >::__targeted_mode, gum::MarginalTargetedInference< GUM_SCALAR >::__targets, gum::MarginalTargetedInference< GUM_SCALAR >::_onMarginalTargetErased(), gum::Set< Key, Alloc >::contains(), gum::Set< Key, Alloc >::erase(), and GUM_ERROR.

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::eraseTarget().

                                                                          {
     // check if the node belongs to the Bayesian network
     if (this->__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     if (!this->__bn->dag().exists(target)) {
       GUM_ERROR(UndefinedElement, target << " is not a NodeId in the bn");
     }
 
 
     if (__targets.contains(target)) {
       __targeted_mode = true;   // we do not use _setTargetedMode because we do not
                                 // want to clear the targets
       _onMarginalTargetErased(target);
       __targets.erase(target);
       this->__setState(
          BayesNetInference< GUM_SCALAR >::StateOfInference::OutdatedBNStructure);
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ eraseTarget() [2/2]

template<typename GUM_SCALAR >

void gum::MarginalTargetedInference< GUM_SCALAR >::eraseTarget ( const std::string & nodeName )

finalvirtualinherited

removes an existing (marginal) target

Warning: If the target does not already exist, the method does nothing. In particular, it does not raise any exception.

Definition at line 197 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::MarginalTargetedInference< GUM_SCALAR >::eraseTarget(), and GUM_ERROR.

                                 {
     // check if the node belongs to the Bayesian network
     if (this->__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     eraseTarget(this->__bn->idFromName(nodeName));
   }

Here is the call graph for this function:

◆ evidence()

template<typename GUM_SCALAR >

INLINE const NodeProperty< const Potential< GUM_SCALAR > *> & gum::BayesNetInference< GUM_SCALAR >::evidence ( ) const

inherited

returns the set of evidence

Definition at line 650 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__evidence.

Referenced by gum::ImportanceSampling< GUM_SCALAR >::_onContextualize(), and gum::MarginalTargetedInference< GUM_SCALAR >::posterior().

                                                                {
     return __evidence;
   }

Here is the caller graph for this function:

◆ evidenceImpact() [1/2]

template<typename GUM_SCALAR >

Potential< GUM_SCALAR > gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact	(	NodeId	target,
		const NodeSet &	evs
	)

inherited

Create a gum::Potential for P(target|evs) (for all instanciation of target and evs)

Warning: If some evs are d-separated, they are not included in the Potential

Parameters

bn	the BayesNet
target	the nodeId of the targetted variable
evs	the vector of nodeId of the observed variables

Returns: a Potential

Definition at line 285 of file marginalTargetedInference_tpl.h.

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact().

                                                                                  {
     const auto& vtarget = this->BN().variable(target);
 
     if (evs.contains(target)) {
       GUM_ERROR(InvalidArgument,
                 "Target <" << vtarget.name() << "> (" << target
                            << ") can not be in evs (" << evs << ").");
     }
     auto condset = this->BN().minimalCondSet(target, evs);
 
     Potential< GUM_SCALAR > res;
     this->eraseAllTargets();
     this->eraseAllEvidence();
     res.add(this->BN().variable(target));
     this->addTarget(target);
     for (const auto& n : condset) {
       res.add(this->BN().variable(n));
       this->addEvidence(n, 0);
     }
 
     Instantiation inst(res);
     for (inst.setFirst(); !inst.end(); inst.incNotVar(vtarget)) {
       // inferring
       for (const auto& n : condset)
         this->chgEvidence(n, inst.val(this->BN().variable(n)));
       this->makeInference();
       // populate res
       for (inst.setFirstVar(vtarget); !inst.end(); inst.incVar(vtarget)) {
         res.set(inst, this->posterior(target)[inst]);
       }
       inst.setFirstVar(vtarget);   // remove inst.end() flag
     }
 
     return res;
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ evidenceImpact() [2/2]

template<typename GUM_SCALAR >

Potential< GUM_SCALAR > gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact	(	const std::string &	target,
		const std::vector< std::string > &	evs
	)

inherited

Create a gum::Potential for P(target|evs) (for all instanciation of target and evs)

Warning: If some evs are d-separated, they are not included in the Potential

Parameters

target	the nodeId of the target variable
evs	the nodeId of the observed variable

Returns: a Potential

Definition at line 324 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact(), and gum::Set< Key, Alloc >::insert().

                                                                  {
     const auto& bn = this->BN();
 
     gum::NodeSet evsId;
     for (const auto& evname : evs) {
       evsId.insert(bn.idFromName(evname));
     }
 
     return evidenceImpact(bn.idFromName(target), evsId);
   }

Here is the call graph for this function:

◆ H() [1/2]

template<typename GUM_SCALAR >

INLINE GUM_SCALAR gum::MarginalTargetedInference< GUM_SCALAR >::H ( NodeId X )

finalvirtualinherited

Entropy Compute Shanon's entropy of a node given the observation.

See also: http://en.wikipedia.org/wiki/Information_entropy

Definition at line 269 of file marginalTargetedInference_tpl.h.

References gum::MarginalTargetedInference< GUM_SCALAR >::posterior().

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::H(), and gum::JointTargetedInference< GUM_SCALAR >::VI().

                                                                        {
     return posterior(X).entropy();
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ H() [2/2]

template<typename GUM_SCALAR >

INLINE GUM_SCALAR gum::MarginalTargetedInference< GUM_SCALAR >::H ( const std::string & nodeName )

finalvirtualinherited

Entropy Compute Shanon's entropy of a node given the observation.

See also: http://en.wikipedia.org/wiki/Information_entropy

Definition at line 278 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::MarginalTargetedInference< GUM_SCALAR >::H().

                                                                              {
     return H(this->BN().idFromName(nodeName));
   }

Here is the call graph for this function:

◆ hardEvidence()

template<typename GUM_SCALAR >

INLINE const NodeProperty< Idx > & gum::BayesNetInference< GUM_SCALAR >::hardEvidence ( ) const

inherited

indicate for each node with hard evidence which value it took

Definition at line 642 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__hard_evidence.

Referenced by gum::WeightedSampling< GUM_SCALAR >::_draw(), gum::MonteCarloSampling< GUM_SCALAR >::_draw(), gum::ImportanceSampling< GUM_SCALAR >::_draw(), and gum::SamplingInference< GUM_SCALAR >::contextualize().

                                                                    {
     return __hard_evidence;
   }

Here is the caller graph for this function:

◆ hardEvidenceNodes()

template<typename GUM_SCALAR >

INLINE const NodeSet & gum::BayesNetInference< GUM_SCALAR >::hardEvidenceNodes ( ) const

inherited

returns the set of nodes with hard evidence

the set of nodes that received hard evidence

Definition at line 666 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__hard_evidence_nodes.

Referenced by gum::WeightedSampling< GUM_SCALAR >::_draw(), gum::MonteCarloSampling< GUM_SCALAR >::_draw(), gum::ImportanceSampling< GUM_SCALAR >::_draw(), gum::ImportanceSampling< GUM_SCALAR >::_onContextualize(), gum::SamplingInference< GUM_SCALAR >::_setEstimatorFromBN(), gum::SamplingInference< GUM_SCALAR >::_setEstimatorFromLBP(), gum::SamplingInference< GUM_SCALAR >::contextualize(), and gum::MarginalTargetedInference< GUM_SCALAR >::posterior().

                                                                         {
     return __hard_evidence_nodes;
   }

Here is the caller graph for this function:

◆ hasEvidence() [1/3]

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::hasEvidence ( ) const

finalvirtualinherited

indicates whether some node(s) have received evidence

Definition at line 381 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__evidence.

Referenced by gum::BayesNetInference< GUM_SCALAR >::addEvidence(), gum::BayesNetInference< GUM_SCALAR >::chgEvidence(), gum::BayesNetInference< GUM_SCALAR >::eraseEvidence(), and gum::BayesNetInference< GUM_SCALAR >::hasEvidence().

                                                                  {
     return !__evidence.empty();
   }

Here is the caller graph for this function:

◆ hasEvidence() [2/3]

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::hasEvidence ( NodeId id ) const

finalvirtualinherited

indicates whether node id has received an evidence

Definition at line 388 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__evidence.

                                                                           {
     return __evidence.exists(id);
   }

◆ hasEvidence() [3/3]

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::hasEvidence ( const std::string & nodeName ) const

finalvirtualinherited

indicates whether node id has received an evidence

Definition at line 409 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::BayesNetInference< GUM_SCALAR >::hasEvidence().

                                       {
     return hasEvidence(this->BN().idFromName(nodeName));
   }

Here is the call graph for this function:

◆ hasHardEvidence() [1/2]

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::hasHardEvidence ( NodeId id ) const

finalvirtualinherited

indicates whether node id has received a hard evidence

Definition at line 395 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__hard_evidence_nodes, and gum::Set< Key, Alloc >::exists().

Referenced by gum::ImportanceSampling< GUM_SCALAR >::_draw(), gum::BayesNetInference< GUM_SCALAR >::chgEvidence(), gum::BayesNetInference< GUM_SCALAR >::eraseEvidence(), and gum::BayesNetInference< GUM_SCALAR >::hasHardEvidence().

                                                                               {
     return __hard_evidence_nodes.exists(id);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ hasHardEvidence() [2/2]

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::hasHardEvidence ( const std::string & nodeName ) const

finalvirtualinherited

indicates whether node id has received a hard evidence

Definition at line 417 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::BayesNetInference< GUM_SCALAR >::hasHardEvidence().

                                       {
     return hasHardEvidence(this->BN().idFromName(nodeName));
   }

Here is the call graph for this function:

◆ hasSoftEvidence() [1/2]

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::hasSoftEvidence ( NodeId id ) const

finalvirtualinherited

indicates whether node id has received a soft evidence

Definition at line 402 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__soft_evidence_nodes, and gum::Set< Key, Alloc >::exists().

Referenced by gum::BayesNetInference< GUM_SCALAR >::hasSoftEvidence().

                                                                               {
     return __soft_evidence_nodes.exists(id);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ hasSoftEvidence() [2/2]

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::hasSoftEvidence ( const std::string & nodeName ) const

finalvirtualinherited

indicates whether node id has received a soft evidence

Definition at line 425 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::BayesNetInference< GUM_SCALAR >::hasSoftEvidence().

                                       {
     return hasSoftEvidence(this->BN().idFromName(nodeName));
   }

Here is the call graph for this function:

◆ history()

INLINE const std::vector< double > & gum::ApproximationScheme::history ( ) const

virtualinherited

Returns the scheme history.

Returns: Returns the scheme history.

Exceptions

OperationNotAllowed Raised if the scheme did not performed or if verbosity is set to false.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 173 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_history, GUM_ERROR, gum::ApproximationScheme::stateApproximationScheme(), gum::IApproximationSchemeConfiguration::Undefined, and gum::ApproximationScheme::verbosity().

Referenced by gum::learning::genericBNLearner::history().

                                                                        {
     if (stateApproximationScheme() == ApproximationSchemeSTATE::Undefined) {
       GUM_ERROR(OperationNotAllowed,
                 "state of the approximation scheme is udefined");
     }
 
     if (verbosity() == false) {
       GUM_ERROR(OperationNotAllowed, "No history when verbosity=false");
     }
 
     return _history;
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ initApproximationScheme()

INLINE void gum::ApproximationScheme::initApproximationScheme ( )

inherited

Initialise the scheme.

Definition at line 187 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_current_epsilon, gum::ApproximationScheme::_current_rate, gum::ApproximationScheme::_current_state, gum::ApproximationScheme::_current_step, gum::ApproximationScheme::_history, gum::ApproximationScheme::_timer, gum::IApproximationSchemeConfiguration::Continue, and gum::Timer::reset().

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__mcInitApproximationScheme(), gum::GibbsBNdistance< GUM_SCALAR >::_computeKL(), gum::SamplingInference< GUM_SCALAR >::_loopApproxInference(), gum::SamplingInference< GUM_SCALAR >::_onStateChanged(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), gum::learning::GreedyHillClimbing::learnStructure(), and gum::learning::LocalSearchWithTabuList::learnStructure().

                                                            {
     _current_state = ApproximationSchemeSTATE::Continue;
     _current_step = 0;
     _current_epsilon = _current_rate = -1.0;
     _history.clear();
     _timer.reset();
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ isDone()

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::isDone ( ) const

finalvirtualnoexceptinherited

returns whether the inference object is in a done state

The inference object is in a done state when the posteriors can be retrieved without performing a new inference, i.e., all the heavy computations have already been performed. Typically, in a junction tree algorithm, this corresponds to a situation in which all the messages needed in the JT have been computed and sent.

Definition at line 96 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__state, and gum::BayesNetInference< GUM_SCALAR >::Done.

Referenced by gum::JointTargetedInference< GUM_SCALAR >::jointPosterior(), gum::BayesNetInference< GUM_SCALAR >::makeInference(), gum::MarginalTargetedInference< GUM_SCALAR >::posterior(), and gum::BayesNetInference< GUM_SCALAR >::prepareInference().

                                                                      {
     return (__state == StateOfInference::Done);
   }

Here is the caller graph for this function:

◆ isEnabledEpsilon()

INLINE bool gum::ApproximationScheme::isEnabledEpsilon ( ) const

virtualinherited

Returns true if stopping criterion on epsilon is enabled, false otherwise.

Returns: Returns true if stopping criterion on epsilon is enabled, false otherwise.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 61 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_eps.

Referenced by gum::learning::genericBNLearner::isEnabledEpsilon().

                                                           {
     return _enabled_eps;
   }

Here is the caller graph for this function:

◆ isEnabledMaxIter()

INLINE bool gum::ApproximationScheme::isEnabledMaxIter ( ) const

virtualinherited

Returns true if stopping criterion on max iterations is enabled, false otherwise.

Returns: Returns true if stopping criterion on max iterations is enabled, false otherwise.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 112 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_max_iter.

Referenced by gum::learning::genericBNLearner::isEnabledMaxIter().

                                                           {
     return _enabled_max_iter;
   }

Here is the caller graph for this function:

◆ isEnabledMaxTime()

INLINE bool gum::ApproximationScheme::isEnabledMaxTime ( ) const

virtualinherited

Returns true if stopping criterion on timeout is enabled, false otherwise.

Returns: Returns true if stopping criterion on timeout is enabled, false otherwise.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 138 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_max_time.

Referenced by gum::learning::genericBNLearner::isEnabledMaxTime().

                                                           {
     return _enabled_max_time;
   }

Here is the caller graph for this function:

◆ isEnabledMinEpsilonRate()

INLINE bool gum::ApproximationScheme::isEnabledMinEpsilonRate ( ) const

virtualinherited

Returns true if stopping criterion on epsilon rate is enabled, false otherwise.

Returns: Returns true if stopping criterion on epsilon rate is enabled, false otherwise.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 90 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_min_rate_eps.

Referenced by gum::GibbsBNdistance< GUM_SCALAR >::_computeKL(), and gum::learning::genericBNLearner::isEnabledMinEpsilonRate().

                                                                  {
     return _enabled_min_rate_eps;
   }

Here is the caller graph for this function:

◆ isInferenceDone()

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::isInferenceDone ( ) const

finalvirtualnoexceptinherited

returns whether the inference object is in a InferenceDone state

Definition at line 89 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__state, and gum::BayesNetInference< GUM_SCALAR >::Done.

                                                                               {
     return (__state == StateOfInference::Done);
   }

◆ isInferenceOutdatedBNPotentials()

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::isInferenceOutdatedBNPotentials ( ) const

finalvirtualnoexceptinherited

returns whether the inference object is in a OutdatedBNPotential state

Definition at line 83 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__state, and gum::BayesNetInference< GUM_SCALAR >::OutdatedBNPotentials.

               {
     return (__state == StateOfInference::OutdatedBNPotentials);
   }

◆ isInferenceOutdatedBNStructure()

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::isInferenceOutdatedBNStructure ( ) const

finalvirtualnoexceptinherited

returns whether the inference object is in a OutdatedBNStructure state

Definition at line 76 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__state, and gum::BayesNetInference< GUM_SCALAR >::OutdatedBNStructure.

Referenced by gum::BayesNetInference< GUM_SCALAR >::chgEvidence(), gum::BayesNetInference< GUM_SCALAR >::eraseAllEvidence(), and gum::BayesNetInference< GUM_SCALAR >::eraseEvidence().

               {
     return (__state == StateOfInference::OutdatedBNStructure);
   }

Here is the caller graph for this function:

◆ isInferenceReady()

template<typename GUM_SCALAR >

INLINE bool gum::BayesNetInference< GUM_SCALAR >::isInferenceReady ( ) const

finalvirtualnoexceptinherited

returns whether the inference object is in a ready state

Definition at line 70 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__state, and gum::BayesNetInference< GUM_SCALAR >::ReadyForInference.

Referenced by gum::SamplingInference< GUM_SCALAR >::_onStateChanged(), gum::BayesNetInference< GUM_SCALAR >::makeInference(), and gum::BayesNetInference< GUM_SCALAR >::prepareInference().

                                                                                {
     return (__state == StateOfInference::ReadyForInference);
   }

Here is the caller graph for this function:

◆ isTarget() [1/2]

template<typename GUM_SCALAR >

INLINE bool gum::MarginalTargetedInference< GUM_SCALAR >::isTarget ( NodeId node ) const

finalvirtualinherited

return true if variable is a (marginal) target

Definition at line 76 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::MarginalTargetedInference< GUM_SCALAR >::__targets, gum::Set< Key, Alloc >::contains(), and GUM_ERROR.

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::isTarget(), gum::MarginalTargetedInference< GUM_SCALAR >::posterior(), and gum::JointTargetedInference< GUM_SCALAR >::posterior().

                                                                         {
     // check that the variable belongs to the bn
     if (this->__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
     if (!this->__bn->dag().exists(node)) {
       GUM_ERROR(UndefinedElement, node << " is not a NodeId in the bn");
     }
 
     return __targets.contains(node);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ isTarget() [2/2]

template<typename GUM_SCALAR >

INLINE bool gum::MarginalTargetedInference< GUM_SCALAR >::isTarget ( const std::string & nodeName ) const

finalvirtualinherited

return true if variable is a (marginal) target

Definition at line 91 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, and gum::MarginalTargetedInference< GUM_SCALAR >::isTarget().

                                       {
     return isTarget(this->__bn->idFromName(nodeName));
   }

Here is the call graph for this function:

◆ makeInference()

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::makeInference ( )

finalvirtualinherited

perform the heavy computations needed to compute the targets' posteriors

In a Junction tree propagation scheme, for instance, the heavy computations are those of the messages sent in the JT. This is precisely what makeInference should compute. Later, the computations of the posteriors can be done "lightly" by multiplying and projecting those messages.

Definition at line 711 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__setState(), gum::BayesNetInference< GUM_SCALAR >::_makeInference(), gum::BayesNetInference< GUM_SCALAR >::Done, gum::BayesNetInference< GUM_SCALAR >::isDone(), gum::BayesNetInference< GUM_SCALAR >::isInferenceReady(), and gum::BayesNetInference< GUM_SCALAR >::prepareInference().

Referenced by gum::LoopySamplingInference< GUM_SCALAR, APPROX >::_makeInference(), gum::MCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::disturbBN(), gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact(), gum::JointTargetedInference< GUM_SCALAR >::evidenceJointImpact(), gum::JointTargetedInference< GUM_SCALAR >::jointMutualInformation(), gum::JointTargetedInference< GUM_SCALAR >::jointPosterior(), and gum::MarginalTargetedInference< GUM_SCALAR >::posterior().

                                                              {
     if (isDone()) { return; }
 
     if (!isInferenceReady()) { prepareInference(); }
 
     _makeInference();
 
     __setState(StateOfInference::Done);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ maxIter()

INLINE Size gum::ApproximationScheme::maxIter ( ) const

virtualinherited

Returns the criterion on number of iterations.

Returns: Returns the criterion on number of iterations.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 102 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_max_iter.

Referenced by gum::learning::genericBNLearner::maxIter().

102 { return _max_iter; }

gum::ApproximationScheme::_max_iter

Size _max_iter

The maximum iterations.

Definition: approximationScheme.h:408

Here is the caller graph for this function:

◆ maxTime()

INLINE double gum::ApproximationScheme::maxTime ( ) const

virtualinherited

Returns the timeout (in seconds).

Returns: Returns the timeout (in seconds).

Implements gum::IApproximationSchemeConfiguration.

Definition at line 125 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_max_time.

Referenced by gum::learning::genericBNLearner::maxTime().

125 { return _max_time; }

gum::ApproximationScheme::_max_time

double _max_time

The timeout.

Definition: approximationScheme.h:402

Here is the caller graph for this function:

◆ messageApproximationScheme()

INLINE std::string gum::IApproximationSchemeConfiguration::messageApproximationScheme ( ) const

inherited

Returns the approximation scheme message.

Returns: Returns the approximation scheme message.

Definition at line 40 of file IApproximationSchemeConfiguration_inl.h.

Referenced by gum::ApproximationScheme::_stopScheme(), gum::ApproximationScheme::continueApproximationScheme(), and gum::credal::InferenceEngine< GUM_SCALAR >::getApproximationSchemeMsg().

                                                                          {
     std::stringstream s;
 
     switch (stateApproximationScheme()) {
       case ApproximationSchemeSTATE::Continue: s << "in progress"; break;
 
       case ApproximationSchemeSTATE::Epsilon:
         s << "stopped with epsilon=" << epsilon();
         break;
 
       case ApproximationSchemeSTATE::Rate:
         s << "stopped with rate=" << minEpsilonRate();
         break;
 
       case ApproximationSchemeSTATE::Limit:
         s << "stopped with max iteration=" << maxIter();
         break;
 
       case ApproximationSchemeSTATE::TimeLimit:
         s << "stopped with timeout=" << maxTime();
         break;
 
       case ApproximationSchemeSTATE::Stopped: s << "stopped on request"; break;
 
       case ApproximationSchemeSTATE::Undefined: s << "undefined state"; break;
     };
 
     return s.str();
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ minEpsilonRate()

INLINE double gum::ApproximationScheme::minEpsilonRate ( ) const

virtualinherited

Returns the value of the minimal epsilon rate.

Returns: Returns the value of the minimal epsilon rate.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 74 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_min_rate_eps.

Referenced by gum::learning::genericBNLearner::minEpsilonRate().

                                                           {
     return _min_rate_eps;
   }

Here is the caller graph for this function:

◆ nbrEvidence()

template<typename GUM_SCALAR >

INLINE Size gum::BayesNetInference< GUM_SCALAR >::nbrEvidence ( ) const

finalvirtualinherited

returns the number of evidence entered into the Bayesian network

Definition at line 620 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__evidence.

                                                                  {
     return __evidence.size();
   }

◆ nbrHardEvidence()

template<typename GUM_SCALAR >

INLINE Size gum::BayesNetInference< GUM_SCALAR >::nbrHardEvidence ( ) const

finalvirtualinherited

returns the number of hard evidence entered into the Bayesian network

Definition at line 627 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__hard_evidence_nodes, and gum::Set< Key, Alloc >::size().

                                                                      {
     return __hard_evidence_nodes.size();
   }

Here is the call graph for this function:

◆ nbrIterations()

INLINE Size gum::ApproximationScheme::nbrIterations ( ) const

virtualinherited

Returns the number of iterations.

Returns: Returns the number of iterations.

Exceptions

OperationNotAllowed Raised if the scheme did not perform.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 163 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_current_step, GUM_ERROR, gum::ApproximationScheme::stateApproximationScheme(), and gum::IApproximationSchemeConfiguration::Undefined.

Referenced by gum::GibbsBNdistance< GUM_SCALAR >::_computeKL(), and gum::learning::genericBNLearner::nbrIterations().

                                                        {
     if (stateApproximationScheme() == ApproximationSchemeSTATE::Undefined) {
       GUM_ERROR(OperationNotAllowed,
                 "state of the approximation scheme is undefined");
     }
 
     return _current_step;
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ nbrSoftEvidence()

template<typename GUM_SCALAR >

INLINE Size gum::BayesNetInference< GUM_SCALAR >::nbrSoftEvidence ( ) const

finalvirtualinherited

returns the number of soft evidence entered into the Bayesian network

Definition at line 634 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__soft_evidence_nodes, and gum::Set< Key, Alloc >::size().

                                                                      {
     return __soft_evidence_nodes.size();
   }

Here is the call graph for this function:

◆ nbrTargets()

template<typename GUM_SCALAR >

INLINE const Size gum::MarginalTargetedInference< GUM_SCALAR >::nbrTargets ( ) const

finalvirtualnoexceptinherited

returns the number of marginal targets

Definition at line 218 of file marginalTargetedInference_tpl.h.

References gum::MarginalTargetedInference< GUM_SCALAR >::__targets, and gum::Set< Key, Alloc >::size().

               {
     return __targets.size();
   }

Here is the call graph for this function:

◆ periodSize()

INLINE Size gum::ApproximationScheme::periodSize ( ) const

virtualinherited

Returns the period size.

Returns: Returns the period size.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 149 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_period_size.

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::makeInference(), and gum::learning::genericBNLearner::periodSize().

149 { return _period_size; }

gum::ApproximationScheme::_period_size

Size _period_size

Checking criteria frequency.

Definition: approximationScheme.h:417

Here is the caller graph for this function:

◆ posterior() [1/2]

template<typename GUM_SCALAR >

const Potential< GUM_SCALAR > & gum::MarginalTargetedInference< GUM_SCALAR >::posterior ( NodeId node )

virtualinherited

Computes and returns the posterior of a node.

Returns: a const ref to the posterior probability of the node.

Parameters

node	the node for which we need a posterior probability

Warning: for efficiency reasons, the potential is stored into the inference engine and is returned by reference. In order to ensure that the potential may still exist even if the Inference object is destroyed, the user has to copy it explicitly.; prepareInference and makeInference may be applied if needed by the posterior method.

Exceptions

UndefinedElement if node is not in the set of targets

Reimplemented in gum::JointTargetedInference< GUM_SCALAR >.

Definition at line 242 of file marginalTargetedInference_tpl.h.

References gum::MarginalTargetedInference< GUM_SCALAR >::_posterior(), gum::BayesNetInference< GUM_SCALAR >::evidence(), GUM_ERROR, gum::BayesNetInference< GUM_SCALAR >::hardEvidenceNodes(), gum::BayesNetInference< GUM_SCALAR >::isDone(), gum::MarginalTargetedInference< GUM_SCALAR >::isTarget(), and gum::BayesNetInference< GUM_SCALAR >::makeInference().

Referenced by gum::MarginalTargetedInference< GUM_SCALAR >::evidenceImpact(), gum::MarginalTargetedInference< GUM_SCALAR >::H(), gum::JointTargetedInference< GUM_SCALAR >::posterior(), gum::MarginalTargetedInference< GUM_SCALAR >::posterior(), and gum::Estimator< GUM_SCALAR >::setFromLBP().

                                                                    {
     if (this->hardEvidenceNodes().contains(node)) {
       return *(this->evidence()[node]);
     }
 
     if (!isTarget(node)) {
       // throws UndefinedElement if var is not a target
       GUM_ERROR(UndefinedElement, node << " is not a target node");
     }
 
     if (!this->isDone()) { this->makeInference(); }
 
     return _posterior(node);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ posterior() [2/2]

template<typename GUM_SCALAR >

const Potential< GUM_SCALAR > & gum::MarginalTargetedInference< GUM_SCALAR >::posterior ( const std::string & nodeName )

virtualinherited

Computes and returns the posterior of a node.

Returns: a const ref to the posterior probability of the node.

Parameters

nodeName the anme of the node for which we need a posterior probability

Warning: for efficiency reasons, the potential is stored into the inference engine and is returned by reference. In order to ensure that the potential may still exist even if the Inference object is destroyed, the user has to copy it explicitly.; prepareInference and makeInference may be applied if needed by the posterior method.

Exceptions

UndefinedElement if node is not in the set of targets

Reimplemented in gum::JointTargetedInference< GUM_SCALAR >.

Definition at line 260 of file marginalTargetedInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::BN(), and gum::MarginalTargetedInference< GUM_SCALAR >::posterior().

                                    {
     return posterior(this->BN().idFromName(nodeName));
   }

Here is the call graph for this function:

◆ prepareInference()

template<typename GUM_SCALAR >

INLINE void gum::BayesNetInference< GUM_SCALAR >::prepareInference ( )

finalvirtualinherited

prepare the internal inference structures for the next inference

Definition at line 692 of file BayesNetInference_tpl.h.

Referenced by gum::BayesNetInference< GUM_SCALAR >::makeInference(), and gum::SamplingInference< GUM_SCALAR >::samplingBN().

                                                                 {
     if (isInferenceReady() || isDone()) { return; }
 
     if (__bn == nullptr)
       GUM_ERROR(NullElement,
                 "No Bayes net has been assigned to the "
                 "inference algorithm");
 
     if (__state == StateOfInference::OutdatedBNStructure)
       _updateOutdatedBNStructure();
     else
       _updateOutdatedBNPotentials();
 
     __setState(StateOfInference::ReadyForInference);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ remainingBurnIn()

INLINE Size gum::ApproximationScheme::remainingBurnIn ( )

inherited

Returns the remaining burn in.

Returns: Returns the remaining burn in.

Definition at line 210 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_burn_in, and gum::ApproximationScheme::_current_step.

                                                    {
     if (_burn_in > _current_step) {
       return _burn_in - _current_step;
     } else {
       return 0;
     }
   }

◆ setBN()

template<typename GUM_SCALAR >

void gum::BayesNetInference< GUM_SCALAR >::setBN ( const IBayesNet< GUM_SCALAR > * bn )

virtualinherited

assigns a new BN to the inference engine

Assigns a new BN to the BayesNetInference engine and sends messages to the descendants of BayesNetInference to inform them that the BN has changed.

Warning: By default, all the nodes of the Bayes net are targets.; note that, by aGrUM's rule, the bn is not copied into the inference engine but only referenced.

Definition at line 132 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__bn, gum::BayesNetInference< GUM_SCALAR >::__computeDomainSizes(), gum::BayesNetInference< GUM_SCALAR >::__setState(), gum::BayesNetInference< GUM_SCALAR >::_onBayesNetChanged(), gum::BayesNetInference< GUM_SCALAR >::clear(), and gum::BayesNetInference< GUM_SCALAR >::OutdatedBNStructure.

                                                                                {
     clear();
     __bn = bn;
     __computeDomainSizes();
     _onBayesNetChanged(bn);
     __setState(StateOfInference::OutdatedBNStructure);
   }

Here is the call graph for this function:

◆ setEpsilon()

INLINE void gum::ApproximationScheme::setEpsilon ( double eps )

virtualinherited

Given that we approximate f(t), stopping criterion on |f(t+1)-f(t)|.

If the criterion was disabled it will be enabled.

Parameters

eps	The new epsilon value.

Exceptions

OutOfLowerBound Raised if eps < 0.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 43 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_eps, gum::ApproximationScheme::_eps, and GUM_ERROR.

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::__mcInitApproximationScheme(), gum::GibbsBNdistance< GUM_SCALAR >::GibbsBNdistance(), gum::GibbsSampling< GUM_SCALAR >::GibbsSampling(), gum::learning::GreedyHillClimbing::GreedyHillClimbing(), gum::SamplingInference< GUM_SCALAR >::SamplingInference(), and gum::learning::genericBNLearner::setEpsilon().

                                                         {
     if (eps < 0.) { GUM_ERROR(OutOfLowerBound, "eps should be >=0"); }
 
     _eps = eps;
     _enabled_eps = true;
   }

Here is the caller graph for this function:

◆ setMaxIter()

INLINE void gum::ApproximationScheme::setMaxIter ( Size max )

virtualinherited

Stopping criterion on number of iterations.

If the criterion was disabled it will be enabled.

Parameters

max	The maximum number of iterations.

Exceptions

OutOfLowerBound Raised if max <= 1.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 95 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_max_iter, gum::ApproximationScheme::_max_iter, and GUM_ERROR.

Referenced by gum::GibbsBNdistance< GUM_SCALAR >::GibbsBNdistance(), gum::SamplingInference< GUM_SCALAR >::SamplingInference(), and gum::learning::genericBNLearner::setMaxIter().

                                                       {
     if (max < 1) { GUM_ERROR(OutOfLowerBound, "max should be >=1"); }
     _max_iter = max;
     _enabled_max_iter = true;
   }

Here is the caller graph for this function:

◆ setMaxTime()

INLINE void gum::ApproximationScheme::setMaxTime ( double timeout )

virtualinherited

Stopping criterion on timeout.

If the criterion was disabled it will be enabled.

Parameters

timeout The timeout value in seconds.

Exceptions

OutOfLowerBound Raised if timeout <= 0.0.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 118 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_max_time, gum::ApproximationScheme::_max_time, and GUM_ERROR.

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::CNMonteCarloSampling(), gum::GibbsBNdistance< GUM_SCALAR >::GibbsBNdistance(), gum::SamplingInference< GUM_SCALAR >::SamplingInference(), and gum::learning::genericBNLearner::setMaxTime().

                                                             {
     if (timeout <= 0.) { GUM_ERROR(OutOfLowerBound, "timeout should be >0."); }
     _max_time = timeout;
     _enabled_max_time = true;
   }

Here is the caller graph for this function:

◆ setMinEpsilonRate()

INLINE void gum::ApproximationScheme::setMinEpsilonRate ( double rate )

virtualinherited

Given that we approximate f(t), stopping criterion on d/dt(|f(t+1)-f(t)|).

If the criterion was disabled it will be enabled

Parameters

rate	The minimal epsilon rate.

Exceptions

OutOfLowerBound if rate<0

Implements gum::IApproximationSchemeConfiguration.

Definition at line 66 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_enabled_min_rate_eps, gum::ApproximationScheme::_min_rate_eps, and GUM_ERROR.

Referenced by gum::GibbsBNdistance< GUM_SCALAR >::GibbsBNdistance(), gum::GibbsSampling< GUM_SCALAR >::GibbsSampling(), gum::SamplingInference< GUM_SCALAR >::SamplingInference(), and gum::learning::genericBNLearner::setMinEpsilonRate().

                                                                 {
     if (rate < 0) { GUM_ERROR(OutOfLowerBound, "rate should be >=0"); }
 
     _min_rate_eps = rate;
     _enabled_min_rate_eps = true;
   }

Here is the caller graph for this function:

◆ setPeriodSize()

INLINE void gum::ApproximationScheme::setPeriodSize ( Size p )

virtualinherited

How many samples between two stopping is enable.

Parameters

p	The new period value.

Exceptions

OutOfLowerBound Raised if p < 1.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 143 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_period_size, and GUM_ERROR.

Referenced by gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::CNMonteCarloSampling(), gum::GibbsBNdistance< GUM_SCALAR >::GibbsBNdistance(), gum::SamplingInference< GUM_SCALAR >::SamplingInference(), and gum::learning::genericBNLearner::setPeriodSize().

                                                        {
     if (p < 1) { GUM_ERROR(OutOfLowerBound, "p should be >=1"); }
 
     _period_size = p;
   }

Here is the caller graph for this function:

◆ setVerbosity()

INLINE void gum::ApproximationScheme::setVerbosity ( bool v )

virtualinherited

Set the verbosity on (true) or off (false).

Parameters

v	If true, then verbosity is turned on.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 152 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_verbosity.

Referenced by gum::GibbsBNdistance< GUM_SCALAR >::GibbsBNdistance(), gum::SamplingInference< GUM_SCALAR >::SamplingInference(), and gum::learning::genericBNLearner::setVerbosity().

152 { _verbosity = v; }

gum::ApproximationScheme::_verbosity

bool _verbosity

If true, verbosity is enabled.

Definition: approximationScheme.h:420

Here is the caller graph for this function:

◆ softEvidenceNodes()

template<typename GUM_SCALAR >

INLINE const NodeSet & gum::BayesNetInference< GUM_SCALAR >::softEvidenceNodes ( ) const

inherited

returns the set of nodes with soft evidence

the set of nodes that received soft evidence

Definition at line 658 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__soft_evidence_nodes.

Referenced by gum::SamplingInference< GUM_SCALAR >::contextualize().

                                                                         {
     return __soft_evidence_nodes;
   }

Here is the caller graph for this function:

◆ startOfPeriod()

INLINE bool gum::ApproximationScheme::startOfPeriod ( )

inherited

Returns true if we are at the beginning of a period (compute error is mandatory).

Returns: Returns true if we are at the beginning of a period (compute error is mandatory).

Definition at line 197 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_burn_in, gum::ApproximationScheme::_current_step, and gum::ApproximationScheme::_period_size.

Referenced by gum::ApproximationScheme::continueApproximationScheme().

                                                  {
     if (_current_step < _burn_in) { return false; }
 
     if (_period_size == 1) { return true; }
 
     return ((_current_step - _burn_in) % _period_size == 0);
   }

Here is the caller graph for this function:

◆ state()

template<typename GUM_SCALAR >

INLINE BayesNetInference< GUM_SCALAR >::StateOfInference gum::BayesNetInference< GUM_SCALAR >::state ( ) const

finalvirtualnoexceptinherited

returns the state of the inference engine

Definition at line 104 of file BayesNetInference_tpl.h.

References gum::BayesNetInference< GUM_SCALAR >::__state.

Referenced by gum::BayesNetInference< GUM_SCALAR >::__setState().

                                                            {
     return __state;
   }

Here is the caller graph for this function:

◆ stateApproximationScheme()

INLINE IApproximationSchemeConfiguration::ApproximationSchemeSTATE gum::ApproximationScheme::stateApproximationScheme ( ) const

virtualinherited

Returns the approximation scheme state.

Returns: Returns the approximation scheme state.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 158 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_current_state.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::history(), gum::ApproximationScheme::nbrIterations(), and gum::learning::genericBNLearner::stateApproximationScheme().

                                                              {
     return _current_state;
   }

Here is the caller graph for this function:

◆ stopApproximationScheme()

INLINE void gum::ApproximationScheme::stopApproximationScheme ( )

inherited

Stop the approximation scheme.

Definition at line 219 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_current_state, gum::ApproximationScheme::_stopScheme(), gum::IApproximationSchemeConfiguration::Continue, and gum::IApproximationSchemeConfiguration::Stopped.

Referenced by gum::learning::DAG2BNLearner< ALLOC >::createBN(), gum::learning::GreedyHillClimbing::learnStructure(), and gum::learning::LocalSearchWithTabuList::learnStructure().

                                                            {
     if (_current_state == ApproximationSchemeSTATE::Continue) {
       _stopScheme(ApproximationSchemeSTATE::Stopped);
     }
   }

Here is the call graph for this function:

Here is the caller graph for this function:

◆ targets()

template<typename GUM_SCALAR >

INLINE const NodeSet & gum::MarginalTargetedInference< GUM_SCALAR >::targets ( ) const

finalvirtualnoexceptinherited

returns the list of marginal targets

Definition at line 211 of file marginalTargetedInference_tpl.h.

References gum::MarginalTargetedInference< GUM_SCALAR >::__targets.

Referenced by gum::SamplingInference< GUM_SCALAR >::contextualize().

               {
     return __targets;
   }

Here is the caller graph for this function:

◆ updateApproximationScheme()

INLINE void gum::ApproximationScheme::updateApproximationScheme ( unsigned int incr = 1 )

inherited

Update the scheme w.r.t the new error and increment steps.

Parameters

incr	The new increment steps.

Definition at line 206 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_current_step.

Referenced by gum::GibbsBNdistance< GUM_SCALAR >::_computeKL(), gum::SamplingInference< GUM_SCALAR >::_loopApproxInference(), gum::learning::DAG2BNLearner< ALLOC >::createBN(), gum::learning::GreedyHillClimbing::learnStructure(), gum::learning::LocalSearchWithTabuList::learnStructure(), and gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::makeInference().

                                                                               {
     _current_step += incr;
   }

Here is the caller graph for this function:

◆ verbosity()

INLINE bool gum::ApproximationScheme::verbosity ( ) const

virtualinherited

Returns true if verbosity is enabled.

Returns: Returns true if verbosity is enabled.

Implements gum::IApproximationSchemeConfiguration.

Definition at line 154 of file approximationScheme_inl.h.

References gum::ApproximationScheme::_verbosity.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::history(), and gum::learning::genericBNLearner::verbosity().

154 { return _verbosity; }

gum::ApproximationScheme::_verbosity

bool _verbosity

If true, verbosity is enabled.

Definition: approximationScheme.h:420

Here is the caller graph for this function:

Member Data Documentation

◆ _burn_in

Size gum::ApproximationScheme::_burn_in

protectedinherited

Number of iterations before checking stopping criteria.

Definition at line 414 of file approximationScheme.h.

Referenced by gum::GibbsSampling< GUM_SCALAR >::burnIn(), gum::GibbsBNdistance< GUM_SCALAR >::burnIn(), gum::ApproximationScheme::remainingBurnIn(), gum::GibbsSampling< GUM_SCALAR >::setBurnIn(), gum::GibbsBNdistance< GUM_SCALAR >::setBurnIn(), and gum::ApproximationScheme::startOfPeriod().

◆ _current_epsilon

double gum::ApproximationScheme::_current_epsilon

protectedinherited

Current epsilon.

Definition at line 369 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), and gum::ApproximationScheme::initApproximationScheme().

◆ _current_rate

double gum::ApproximationScheme::_current_rate

protectedinherited

Current rate.

Definition at line 375 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), and gum::ApproximationScheme::initApproximationScheme().

◆ _current_state

ApproximationSchemeSTATE gum::ApproximationScheme::_current_state

protectedinherited

The current state.

Definition at line 384 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::_stopScheme(), gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::initApproximationScheme(), gum::ApproximationScheme::stateApproximationScheme(), and gum::ApproximationScheme::stopApproximationScheme().

◆ _current_step

Size gum::ApproximationScheme::_current_step

protectedinherited

The current step.

Definition at line 378 of file approximationScheme.h.

Referenced by gum::learning::Miic::_initiation(), gum::learning::Miic::_iteration(), gum::learning::Miic::_orientation_3off2(), gum::learning::Miic::_orientation_latents(), gum::learning::Miic::_orientation_miic(), gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::initApproximationScheme(), gum::learning::Miic::learnMixedStructure(), gum::ApproximationScheme::nbrIterations(), gum::ApproximationScheme::remainingBurnIn(), gum::ApproximationScheme::startOfPeriod(), and gum::ApproximationScheme::updateApproximationScheme().

◆ _enabled_eps

bool gum::ApproximationScheme::_enabled_eps

protectedinherited

If true, the threshold convergence is enabled.

Definition at line 393 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::disableEpsilon(), gum::ApproximationScheme::enableEpsilon(), gum::ApproximationScheme::isEnabledEpsilon(), and gum::ApproximationScheme::setEpsilon().

◆ _enabled_max_iter

bool gum::ApproximationScheme::_enabled_max_iter

protectedinherited

If true, the maximum iterations stopping criterion is enabled.

Definition at line 411 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::disableMaxIter(), gum::ApproximationScheme::enableMaxIter(), gum::ApproximationScheme::isEnabledMaxIter(), and gum::ApproximationScheme::setMaxIter().

◆ _enabled_max_time

bool gum::ApproximationScheme::_enabled_max_time

protectedinherited

If true, the timeout is enabled.

Definition at line 405 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::disableMaxTime(), gum::ApproximationScheme::enableMaxTime(), gum::ApproximationScheme::isEnabledMaxTime(), and gum::ApproximationScheme::setMaxTime().

◆ _enabled_min_rate_eps

bool gum::ApproximationScheme::_enabled_min_rate_eps

protectedinherited

If true, the minimal threshold for epsilon rate is enabled.

Definition at line 399 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::disableMinEpsilonRate(), gum::ApproximationScheme::enableMinEpsilonRate(), gum::ApproximationScheme::isEnabledMinEpsilonRate(), and gum::ApproximationScheme::setMinEpsilonRate().

◆ _eps

double gum::ApproximationScheme::_eps

protectedinherited

Threshold for convergence.

Definition at line 390 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::epsilon(), and gum::ApproximationScheme::setEpsilon().

◆ _history

std::vector< double > gum::ApproximationScheme::_history

protectedinherited

The scheme history, used only if verbosity == true.

Definition at line 387 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::history(), and gum::ApproximationScheme::initApproximationScheme().

◆ _last_epsilon

double gum::ApproximationScheme::_last_epsilon

protectedinherited

Last epsilon value.

Definition at line 372 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme().

◆ _max_iter

Size gum::ApproximationScheme::_max_iter

protectedinherited

The maximum iterations.

Definition at line 408 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::maxIter(), and gum::ApproximationScheme::setMaxIter().

◆ _max_time

double gum::ApproximationScheme::_max_time

protectedinherited

The timeout.

Definition at line 402 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::maxTime(), and gum::ApproximationScheme::setMaxTime().

◆ _min_rate_eps

double gum::ApproximationScheme::_min_rate_eps

protectedinherited

Threshold for the epsilon rate.

Definition at line 396 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::minEpsilonRate(), and gum::ApproximationScheme::setMinEpsilonRate().

◆ _period_size

Size gum::ApproximationScheme::_period_size

protectedinherited

Checking criteria frequency.

Definition at line 417 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::periodSize(), gum::ApproximationScheme::setPeriodSize(), and gum::ApproximationScheme::startOfPeriod().

◆ _timer

Timer gum::ApproximationScheme::_timer

protectedinherited

The timer.

Definition at line 381 of file approximationScheme.h.

Referenced by gum::learning::Miic::_initiation(), gum::learning::Miic::_iteration(), gum::learning::Miic::_orientation_3off2(), gum::learning::Miic::_orientation_latents(), gum::learning::Miic::_orientation_miic(), gum::ApproximationScheme::_stopScheme(), gum::ApproximationScheme::continueApproximationScheme(), gum::ApproximationScheme::currentTime(), gum::ApproximationScheme::initApproximationScheme(), and gum::learning::Miic::learnMixedStructure().

◆ _verbosity

bool gum::ApproximationScheme::_verbosity

protectedinherited

If true, verbosity is enabled.

Definition at line 420 of file approximationScheme.h.

Referenced by gum::ApproximationScheme::setVerbosity(), and gum::ApproximationScheme::verbosity().

◆ onProgress

Signaler3< Size, double, double > gum::IApproximationSchemeConfiguration::onProgress

inherited

Progression, error and time.

Definition at line 59 of file IApproximationSchemeConfiguration.h.

Referenced by gum::learning::Miic::_initiation(), gum::learning::Miic::_iteration(), gum::learning::Miic::_orientation_3off2(), gum::learning::Miic::_orientation_latents(), gum::learning::Miic::_orientation_miic(), gum::ApproximationScheme::continueApproximationScheme(), and gum::learning::genericBNLearner::distributeProgress().

◆ onStop

Signaler1< std::string > gum::IApproximationSchemeConfiguration::onStop

inherited

Criteria messageApproximationScheme.

Definition at line 62 of file IApproximationSchemeConfiguration.h.

Referenced by gum::ApproximationScheme::_stopScheme(), and gum::learning::genericBNLearner::distributeStop().

The documentation for this class was generated from the following file:

agrum/BN/inference/tools/approximateInference.h

Public Attributes

Public Member Functions

Public Types

Protected Attributes

Protected Member Functions

Detailed Description

template<typename GUM_SCALAR> class gum::ApproximateInference< GUM_SCALAR >

Member Enumeration Documentation

◆ ApproximationSchemeSTATE

◆ StateOfInference

Constructor & Destructor Documentation

◆ ApproximateInference()

Member Function Documentation

◆ _isTargetedMode()

◆ _makeInference()

◆ _onAllEvidenceErased()

◆ _onAllMarginalTargetsAdded()

◆ _onAllMarginalTargetsErased()

◆ _onBayesNetChanged()

◆ _onEvidenceAdded()

◆ _onEvidenceChanged()

◆ _onEvidenceErased()

◆ _onMarginalTargetAdded()

◆ _onMarginalTargetErased()

◆ _onStateChanged()

◆ _posterior()

◆ _setOutdatedBNPotentialsState()

◆ _setOutdatedBNStructureState()

◆ _setTargetedMode()

◆ _updateOutdatedBNPotentials()

◆ _updateOutdatedBNStructure()

◆ addAllTargets()

◆ addEvidence() [1/8]

◆ addEvidence() [2/8]

◆ addEvidence() [3/8]

◆ addEvidence() [4/8]

◆ addEvidence() [5/8]

◆ addEvidence() [6/8]

◆ addEvidence() [7/8]

◆ addEvidence() [8/8]

◆ addListOfEvidence()

◆ addSetOfEvidence()

◆ addTarget() [1/2]

◆ addTarget() [2/2]

◆ BN()

◆ chgEvidence() [1/7]

◆ chgEvidence() [2/7]

◆ chgEvidence() [3/7]

◆ chgEvidence() [4/7]

◆ chgEvidence() [5/7]

◆ chgEvidence() [6/7]

◆ chgEvidence() [7/7]

◆ clear()

◆ continueApproximationScheme()

◆ currentTime()

◆ disableEpsilon()

◆ disableMaxIter()

◆ disableMaxTime()

◆ disableMinEpsilonRate()

◆ domainSizes()

◆ enableEpsilon()

◆ enableMaxIter()

◆ enableMaxTime()

◆ enableMinEpsilonRate()

◆ epsilon()

◆ eraseAllEvidence()

◆ eraseAllTargets()

◆ eraseEvidence() [1/2]

◆ eraseEvidence() [2/2]

◆ eraseTarget() [1/2]

◆ eraseTarget() [2/2]

◆ evidence()

◆ evidenceImpact() [1/2]

◆ evidenceImpact() [2/2]

◆ H() [1/2]

◆ H() [2/2]

◆ hardEvidence()

◆ hardEvidenceNodes()

◆ hasEvidence() [1/3]

◆ hasEvidence() [2/3]

template<typename GUM_SCALAR>
class gum::ApproximateInference< GUM_SCALAR >