Research map / Probabilistic and scientific modeling / Variational and generative sampling
Scaling up Hybrid Probabilistic Inference with Logical and Arithmetic Constraints via Message Passing
Zhe Zeng, Paolo Morettin, Fanqi Yan, Antonio Vergari, Guy Van Den Broeck
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 |
|---|---|---|---|
| Use MP-WMI instead of WMI-PA | WMI inference · STAR | maximum variables solved within one hour: 20 -> 60 | Improved |
| Use MP-WMI instead of F-XSDD(BR) | WMI inference · STAR | maximum variables solved within one hour: 20 -> 60 | Improved |
| Use MP-WMI instead of WMI-PA | WMI inference · SNOW | maximum variables solved within one hour: 20 -> 90 | Improved |
| Use MP-WMI instead of F-XSDD(BR) | WMI inference · SNOW | maximum variables solved within one hour: 20 -> 90 | Improved |
| Use MP-WMI instead of WMI-PA | WMI inference · PATH | maximum variables solved within one hour: 20 -> 90 | Improved |
| Use MP-WMI instead of F-XSDD(BR) | WMI inference · PATH | maximum variables solved within one hour: 20 -> 90 | Improved |
| Precompute and reuse messages across queries | MP-WMI · STAR, SNOW, and PATH; 100 univariate or bivariate queries | cumulative runtime: up to two order of magnitudes | Improved |
| Use MP-WMI rather than SMI for a single query | Tree-structured MI inference · STAR, SNOW, and PATH | runtime | Improved |
Closest papers by meaning
- Probabilistic Inference with Algebraic Constraints: Theoretical Limits and Practical Approximations (NeurIPS 2020 · similarity 0.96)
- Learning Weighted Model Integration Distributions (AAAI 2020 · similarity 0.87)
- On the Hardness of Approximating Distributions with Tractable Probabilistic Models (NeurIPS 2025 · similarity 0.84)
- On the Hardness of Probabilistic Neurosymbolic Learning (ICML 2024 · similarity 0.83)
- Learning to Condition: A Neural Heuristic for Scalable MPE Inference (NeurIPS 2025 · similarity 0.82)
- DISC: Dynamic Decomposition Improves LLM Inference Scaling (NeurIPS 2025 · similarity 0.82)
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.
