Implements the alternating direction method algorithm described in "An Alternating Direction Method for Dual MAP LP Relaxation," Ofer Meshi and Amir Globerson, ECML, 2011.
More...
|
| drwnADLPInference (const drwnFactorGraph &graph) |
|
void | clear () |
| Clear internally cached data (e.g., computation graph)
|
|
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) |
|
|
static int | MAX_ITERATIONS = 1000 |
| maximum number of iterations
|
|
static double | EPSILON = 1e-6 |
| Used to define the treshold for stopping condition.
|
|
static double | PENALTY_PARAMETER = 1.0 |
| Used to define initial Rho.
|
|
Implements the alternating direction method algorithm described in "An Alternating Direction Method for Dual MAP LP Relaxation," Ofer Meshi and Amir Globerson, ECML, 2011.
The documentation for this class was generated from the following files: