Now showing items 1-2 of 2

    • Computing Upper and Lower Bounds on Likelihoods in Intractable Networks 

      Jaakkola, Tommi S.; Jordan, Michael I. (1996-03-01)
      We present techniques for computing upper and lower bounds on the likelihoods of partial instantiations of variables in sigmoid and noisy-OR networks. The bounds determine confidence intervals for the desired likelihoods ...
    • Fast Learning by Bounding Likelihoods in Sigmoid Type Belief Networks 

      Jaakkola, Tommi S.; Saul, Lawrence K.; Jordan, Michael I. (1996-02-09)
      Sigmoid type belief networks, a class of probabilistic neural networks, provide a natural framework for compactly representing probabilistic information in a variety of unsupervised and supervised learning problems. ...