3k citations · 24.2k across the 299 of their papers we have counts for
4 papers · 2 filters
Computing Upper and Lower Bounds on Likelihoods in Intractable Networks
Tommi S. Jaakkola, Michael I. Jordan
We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of…
Loopy Belief Propagation for Approximate Inference: An Empirical Study
Kevin Murphy, Yair Weiss, Michael I. Jordan
Recently, researchers have demonstrated that loopy belief propagation - the use of Pearls polytree algorithm IN a Bayesian network WITH loops OF error- correcting codes.The most dr…
PEGASUS: A Policy Search Method for Large MDPs and POMDPs
Andrew Y. Ng, Michael I. Jordan
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mod…
Efficient Stepwise Selection in Decomposable Models
Amol Deshpande, Minos Garofalakis, Michael I. Jordan
In this paper, we present an efficient way of performing stepwise selection in the class of decomposable models. The main contribution of the paper is a simple characterization of…