Research map / Probabilistic and scientific modeling / Variational and generative sampling
Exact and Approximate Weighted Model Integration with Probability Density Functions Using Knowledge Compilation
Pedro Zuidberg Dos Martires, Anton Dries, Luc De Raedt
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add knowledge compilation in front of symbolic inference (Symbo vs PSI-Solver alone) | exact hybrid probabilistic inference · 10 PSI benchmarks | solve time: Symbo faster on 9/10 benchmarks (7/10 including KC time) | Improved |
| Symbo vs PSI on ClickGraph (no intermediate integration) | exact hybrid inference · ClickGraph | solve time: timed out after 15s vs PSI 10500 | Hurt |
| compile once and evaluate circuit as tensor computation graph on GPU (Sampo) vs DC and BLOG sampling | approximate hybrid inference · urn and hybrid rule benchmarks | run time and standard deviation | Improved |
| treat Boolean variables as circuit weights instead of sampling them (Sampo) | approximate inference · queries with binary random variables | STD / MSE | Improved |
| Sampo on conditioning with rare events in continuous domains | approximate inference · rare continuous evidence | estimate reliability | No clear effect |
| Symbo vs WMI-PA and WMI-XADD on bivariate polynomial weights | exact WMI · synthetic WMI problems, 2D polynomials | instances solved within time limit | Improved |
| Symbo vs WMI-PA and WMI-XADD on trivariate polynomial weights | exact WMI · synthetic WMI problems, 3D polynomials | solving speed | Hurt |
Closest papers by meaning
- Variance Computation for Weighted Model Counting with Knowledge Compilation Approach (AAAI 2026 · similarity 0.87)
- Probabilistic Inference with Algebraic Constraints: Theoretical Limits and Practical Approximations (NeurIPS 2020 · similarity 0.86)
- Scaling up Hybrid Probabilistic Inference with Logical and Arithmetic Constraints via Message Passing (ICML 2020 · similarity 0.85)
- Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting (AAAI 2020 · similarity 0.85)
- On the Hardness of Probabilistic Neurosymbolic Learning (ICML 2024 · similarity 0.83)
- An Approximate Skolem Function Counter (AAAI 2024 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
