Approximation Complexity of Maximum A Posteriori Inference in
Sum-Product Networks

v1v2v3v4v5 (latest)

Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks

17 March 2017

Diarmaid Conaty

Denis Deratani Mauá

Cassio P. de Campos

ArXiv (abs)PDF HTML

Papers citing "Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks"

7 / 7 papers shown

Title
Tractable Boolean and Arithmetic Circuits Adnan Darwiche TPM 81 13 0 07 Feb 2022
Solving Marginal MAP Exactly by Probabilistic Circuit Transformations YooJung Choi Tal Friedman Guy Van den Broeck TPM 72 12 0 08 Nov 2021
Tractable Inference in Credal Sentential Decision Diagrams Lilith Mattei Alessandro Antonucci Denis Deratani Mauá Alessandro Facchini Julissa Giuliana Villanueva Llerena TPM 14 10 0 19 Aug 2020
On Relaxing Determinism in Arithmetic Circuits Arthur Choi Adnan Darwiche 70 57 0 22 Aug 2017
Sum-Product Graphical Models Mattia Desana Christoph Schnörr TPM 60 6 0 21 Aug 2017
Maximum A Posteriori Inference in Sum-Product Networks Jun-Feng Mei Yong Jiang Kewei Tu TPM 76 23 0 16 Aug 2017
Visualizing and Understanding Sum-Product Networks Antonio Vergari Nicola Di Mauro F. Esposito FAtt AAML TPM 115 45 0 29 Aug 2016