On the Hardness of Probabilistic Inference Relaxations.
Supratik ChakrabortyKuldeep S. MeelMoshe Y. VardiPublished in: AAAI (2019)
Keyphrases
- probabilistic inference
- np hard
- graphical models
- lower bound
- influence diagrams
- conditional probabilities
- message passing
- bayesian networks
- phase transition
- computational complexity
- context specific independence
- weighted model counting
- approximate inference
- np complete
- efficient inference
- belief networks
- bayesian belief networks
- variable elimination
- belief propagation
- exact inference
- junction tree
- random instances
- probabilistic model
- special case
- feature selection
- prior information
- semi supervised
- optimal solution