64 citations · 285 across the 26 of their papers we have counts for
Showing 2012 · cs.LGShow all
3 papers · 2 filters
cs.LG2012★ 3 cited
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…
cs.LG2012
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…
cs.LG2012
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…