activity
20122017
most citedOn Relaxing Determinism in Arithmetic Circuits

26 citations · 46 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI201726 cited

On Relaxing Determinism in Arithmetic Circuits

Arthur Choi, Adnan Darwiche

The past decade has seen a significant interest in learning tractable probabilistic representations. Arithmetic circuits (ACs) were among the first proposed tractable representatio…

cs.AI2015

Dual Decomposition from the Perspective of Relax, Compensate and then Recover

Arthur Choi, Adnan Darwiche

Relax, Compensate and then Recover (RCR) is a paradigm for approximate inference in probabilistic graphical models that has previously provided theoretical and practical insights o…

cs.AI2012

New Advances and Theoretical Insights into EDML

Khaled S. Refaat, Arthur Choi, Adnan Darwiche

EDML is a recently proposed algorithm for learning MAP parameters in Bayesian networks. In this paper, we present a number of new advances and insights on the EDML algorithm. First…

cs.AI2012

Lifted Relax, Compensate and then Recover: From Approximate to Exact Lifted Probabilistic Inference

Guy Van den Broeck, Arthur Choi, Adnan Darwiche

We propose an approach to lifted approximate inference for first-order probabilistic models, such as Markov logic networks. It is based on performing exact lifted inference in a si…

cs.AI201220 cited

On Bayesian Network Approximation by Edge Deletion

Arthur Choi, Hei Chan, Adnan Darwiche

We consider the problem of deleting edges from a Bayesian network for the purpose of simplifying models in probabilistic inference. In particular, we propose a new method for delet…