64 citations · 285 across the 26 of their papers we have counts for
4 papers · 1 filter
Bethe Bounds and Approximating the Global Optimum
Adrian Weller, Tony Jebara
Inference in general Markov random fields (MRFs) is NP-hard, though identifying the maximum a posteriori (MAP) configuration of pairwise MRFs with submodular cost functions is effi…
Dynamical Systems Trees
Andrew Howard, Tony S. Jebara
We propose dynamical systems trees (DSTs) as a flexible class of models for describing multiple processes that interact via a hierarchy of aggregating parent chains. DSTs extend Ka…
Bayesian Out-Trees
Tony S. Jebara
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown pa…
MAP Estimation, Message Passing, and Perfect Graphs
Tony S. Jebara
Efficiently finding the maximum a posteriori (MAP) configuration of a graphical model is an important problem which is often implemented using message passing algorithms. The optim…