net.sf.phiweave.inference

SumDualDecompositionProblem

class SumDualDecompositionProblem extends ProjectableProblem

Inherited
  1. Hide All
  2. Show all
  1. ProjectableProblem
  2. AnyRef
  3. Any
Visibility
  1. Public
  2. All

Instance constructors

  1. new SumDualDecompositionProblem(globalFacPots: Array[Array[Double]], globalVarPots: Array[Array[Double]], treeFacPots: Array[Array[Array[Double]]], treeVarPots: Array[Array[Array[Double]]], problems: Array[SumProductBeliefPropagation], options: Options)

Value Members

  1. def !=(arg0: AnyRef): Boolean

  2. def !=(arg0: Any): Boolean

    o != arg0 is the same as !(o == (arg0)).

  3. def ##(): Int

  4. def $asInstanceOf[T0](): T0

  5. def $isInstanceOf[T0](): Boolean

  6. def ==(arg0: AnyRef): Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

  7. def ==(arg0: Any): Boolean

    o == arg0 is the same as o.equals(arg0).

  8. def asInstanceOf[T0]: T0

    This method is used to cast the receiver object to be of type T0.

  9. def clone(): AnyRef

    This method creates and returns a copy of the receiver object.

  10. def computeDimension(): Int

  11. var dim: Int

  12. def dimension: Int

  13. def eq(arg0: AnyRef): Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

  14. def equals(arg0: Any): Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

  15. val facMargs: Array[Array[Array[Double]]]

  16. def finalize(): Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

  17. def getClass(): java.lang.Class[_]

    Returns a representation that corresponds to the dynamic class of the receiver object.

  18. def getMarginalsAndValue(fmargs: Array[Array[Array[Double]]], vmargs: Array[Array[Array[Double]]]): Double

  19. def globalMarginals: (Array[Array[Double]], Array[Array[Double]])

  20. val groups: Array[Array[SumProductBeliefPropagation]]

  21. def guessWarmStart(gp: Array[Array[Double]], treesForNode: Array[Array[Int]], in: DenseVector, out: DenseVector, startIn: Int, startOut: Int): (Int, Int)

  22. def guessWarmStart(prevSol: DenseVector): DenseVector

  23. def hasConverged: Boolean

  24. def hashCode(): Int

    Returns a hash code value for the object.

  25. def isInstanceOf[T0]: Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

  26. def ne(arg0: AnyRef): Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

  27. def notify(): Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

  28. def notifyAll(): Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

  29. val numFacs: Int

  30. def numPots(pots: Array[Double]): Int

  31. val numTrees: Int

  32. val numVars: Int

  33. var overhead: Long

  34. def project(x: DenseVector): DenseVector

  35. def project(gp: Array[Array[Double]], treesForNode: Array[Array[Int]], x: DenseVector, startIndex: Int): Int

  36. val rho: Double

  37. def setGradient(fp: Array[Array[Array[Double]]], vp: Array[Array[Array[Double]]], x: DenseVector, scale: Double): Unit

  38. def setGradient(gp: Array[Array[Double]], tp: Array[Array[Array[Double]]], treesForNode: Array[Array[Int]], x: DenseVector, scale: Double, startIndex: Int): Int

  39. def setMarginals(denseMarg: DenseVector, globalMarg: Array[Array[Double]], treesForNode: Array[Array[Int]], startIndex: Int): Int

  40. def setPotentials(fp: Array[Array[Array[Double]]], vp: Array[Array[Array[Double]]], x: DenseVector): Unit

  41. def setPotentials(gp: Array[Array[Double]], tp: Array[Array[Array[Double]]], treesForNode: Array[Array[Int]], x: DenseVector, startIndex: Int): Int

  42. def synchronized[T0](arg0: T0): T0

  43. var time: Long

  44. def toString(): String

    Returns a string representation of the object.

  45. val treesForFac: Array[Array[Int]]

  46. def treesForIndex(treePots: Array[Array[Array[Double]]]): Array[Array[Int]]

  47. val treesForVar: Array[Array[Int]]

  48. def valueAndGradient(x: DenseVector, g: DenseVector): Double

  49. val varMargs: Array[Array[Array[Double]]]

  50. def wait(): Unit

  51. def wait(arg0: Long, arg1: Int): Unit

  52. def wait(arg0: Long): Unit

  53. val workers: Array[BeliefPropagationWorker]