Approximate Knowledge Compilation by Online Collapsed Importance Sampling

31 May 2018

Papers citing "Approximate Knowledge Compilation by Online Collapsed Importance Sampling"

10 / 10 papers shown

Title
On the Hardness of Probabilistic Neurosymbolic Learning Jaron Maene Vincent Derkinderen Luc de Raedt 86 4 0 06 Jun 2024
Approximate inference of marginals using the IBIA framework Shivani Bathla V. Vasudevan 71 0 0 01 Jun 2023
Fast Converging Anytime Model Counting Yong Lai Kuldeep S. Meel R. Yap 42 1 0 19 Dec 2022
First-Order Context-Specific Likelihood Weighting in Hybrid Probabilistic Logic Programs Nitesh Kumar Ondrej Kuzelka Luc de Raedt 21 3 0 26 Jan 2022
Handling Epistemic and Aleatory Uncertainties in Probabilistic Circuits Federico Cerutti Lance M. Kaplan Angelika Kimmig Murat Sensoy TPM 38 14 0 22 Feb 2021
Tractable Computation of Expected Kernels Wenzhe Li Zhe Zeng Antonio Vergari Guy Van den Broeck TPM 52 1 0 21 Feb 2021
Context-Specific Likelihood Weighting Nitesh Kumar Ondrej Kuzelka 51 1 0 24 Jan 2021
Towards Efficient Discrete Integration via Adaptive Quantile Queries Fan Ding Hanjing Wang Ashish Sabharwal Yexiang Xue 56 4 0 13 Oct 2019
Smoothing Structured Decomposable Circuits Andy Shih Guy Van den Broeck P. Beame Antoine Amarilli TPM 28 26 0 01 Jun 2019
Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting Ralph Abboud .Ismail .Ilkan Ceylan Thomas Lukasiewicz 69 29 0 04 Apr 2019