|
| drwnAsyncMaxProdInference (const drwnFactorGraph &graph) |
|
| drwnMessagePassingMAPInference (const drwnFactorGraph &graph) |
|
void | clear () |
| Clear internally cached data (e.g., computation graph)
|
|
std::pair< double, double > | inference (drwnFullAssignment &mapAssignment) |
| Run inference (or resume for iterative algorithms). Algorithms may initialize from mapAssignment if not empty. Returns an upper and lower bound (if available) of the minimum energy. The upper bound is the same as the energy of the best solution found (i.e., same as graph.getEnergy(mapAssignment) ).
|
|
| drwnMAPInference (const drwnFactorGraph &graph) |
|
| drwnMAPInference (const drwnMAPInference &inf) |
|
Implements asynchronous max-product (min-sum) inference.
- Note
- Since the factor graph is expected to be in energy form (i.e., negative log-probability), this algorithm is equivalent to min-sum.