Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration With Provable Guarantees (2309.08883v2)

Published 16 Sep 2023 in cs.AI, cs.CC, and cs.LO

Abstract: Satisfiability Modulo Counting (SMC) encompasses problems that require both symbolic decision-making and statistical reasoning. Its general formulation captures many real-world problems at the intersection of symbolic and statistical Artificial Intelligence. SMC searches for policy interventions to control probabilistic outcomes. Solving SMC is challenging because of its highly intractable nature($\text{NP}{\text{PP}}$-complete), incorporating statistical inference and symbolic reasoning. Previous research on SMC solving lacks provable guarantees and/or suffers from sub-optimal empirical performance, especially when combinatorial constraints are present. We propose XOR-SMC, a polynomial algorithm with access to NP-oracles, to solve highly intractable SMC problems with constant approximation guarantees. XOR-SMC transforms the highly intractable SMC into satisfiability problems, by replacing the model counting in SMC with SAT formulae subject to randomized XOR constraints. Experiments on solving important SMC problems in AI for social good demonstrate that XOR-SMC finds solutions close to the true optimum, outperforming several baselines which struggle to find good approximations for the intractable model counting in SMC.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (86)
  1. 2023. AAAI-23 Constraint Programming and Machine Learning Bridge Program.
  2. 2023. Neuro-symbolic AI for Agent and Multi-Agent Systems (NeSyMAS) Workshop at AAMAS-23.
  3. Probabilistic Model Counting with Short XORs. In SAT, volume 10491, 3–19. Springer.
  4. Reducing greenhouse gas emissions of Amazon hydropower with strategic dam planning. Nature Communications, 10.
  5. Optimising shelter location and evacuation routing operations: The critical issues. Eur. J. Oper. Res., 279(2): 279–295.
  6. Lost Relatives of the Gumbel Trick. In ICML, volume 70, 371–379. PMLR.
  7. cvc5: A Versatile and Industrial-Strength SMT Solver. In TACAS, volume 13243, 415–442. Springer.
  8. Satisfiability Modulo Theories, chapter 26, 825–885.
  9. Satisfiability Modulo Theories. In Handbook of Satisfiability, volume 336, 1267–1329. IOS Press.
  10. Shelter Location and Evacuation Route Assignment Under Uncertainty: A Benders Decomposition Approach. Transp. Sci., 52(2): 416–436.
  11. Structured Prediction Energy Networks. In ICML, volume 48, 983–992.
  12. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications.
  13. Programming Z3. In SETSS, volume 11430, 148–201. Springer.
  14. Survey propagation: an algorithm for satisfiability. Random Struct. Algorithms, 27: 201–226.
  15. Distribution-Aware Sampling and Weighted Model Counting for SAT. In AAAI, 1722–1730.
  16. A Scalable and Nearly Uniform Generator of SAT Witnesses. In CAV, volume 8044, 608–623. Springer.
  17. On probabilistic inference by weighted model counting. Artificial Intelligence, 172(6-7): 772–799.
  18. Approximating the Sum Operation for Marginal-MAP Inference. In AAAI, 1882–1887.
  19. Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams. In ECSQARU, volume 7958, 121–132. Springer.
  20. Solving Marginal MAP Exactly by Probabilistic Circuit Transformations. In AISTATS, volume 151, 10196–10208. PMLR.
  21. Computing the optimal strategy to commit to. In EC, 82–90. ACM.
  22. Wildlife corridors as a connected subgraph problem. Journal of Environmental Economics and Management, 63(1).
  23. A Knowledge Compilation Map. J. Artif. Int. Res.
  24. Efficient E-Matching for SMT Solvers. In CADE, volume 4603 of Lecture Notes in Computer Science, 183–198. Springer.
  25. Z3: An Efficient SMT Solver. In TACAS, volume 4963, 337–340. Springer.
  26. Solving Connected Subgraph Problems in Wildlife Conservation. In CPAIOR, 102–116.
  27. Efficient sampling of SAT solutions for testing. In ICSE, 549–559. ACM.
  28. Computational complexity of stochastic programming problems. Math. Program., 106(3): 423–432.
  29. Embed and Project: Discrete Sampling with Universal Hashing. In NIPS, 2085–2093.
  30. Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization. In ICML, volume 28, 334–342.
  31. When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing. In IJCAI.
  32. Deductive optimization of relational data storage. Proc. ACM Program. Lang., 4(OOPSLA): 170:1–170:30.
  33. Mini-bucket elimination with moment matching. In NIPS Workshop DISCML.
  34. Satisfiability modulo counting: a new approach for analyzing privacy properties. In CSL-LICS, 42:1–42:10. ACM.
  35. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Trans. Pattern Anal. Mach. Intell., 6(6): 721–741.
  36. SampleSearch: A Scheme that Searches for Consistent Samples. In AISTATS, volume 2, 147–154.
  37. Importance sampling-based estimation over AND/OR search spaces for graphical models. Artif. Intell., 184-185: 38–77.
  38. Model Counting: A New Strategy for Obtaining Good Bounds. In AAAI, 54–61.
  39. Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. In NIPS, 481–488. MIT Press.
  40. On the Partition Function and Random Maximum A-Posteriori Perturbations. In ICML.
  41. Norm-Product Belief Propagation: Primal-Dual Message-Passing for Approximate Inference. IEEE Trans. Inf. Theory, 56(12): 6294–6316.
  42. Shortest-path network interdiction. Networks: An International Journal, 40(2): 97–111.
  43. Categorical Reparameterization with Gumbel-Softmax. In ICLR (Poster).
  44. The Markov chain Monte Carlo method: an approach to approximate counting and integration, 482–520. Boston, MA, USA.
  45. Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci., 43: 169–188.
  46. Message-Passing for Approximate MAP Inference with Latent Variables. In NIPS, 1197–1205.
  47. Solving constrained Horn clauses modulo algebraic data types and recursive functions. Proc. ACM Program. Lang., 6: 1–29.
  48. Influential nodes in a diffusion model for social networks. In Automata, languages and programming, 1127–1138. Springer.
  49. Probabilistic Sentential Decision Diagrams. In KR.
  50. Policy optimization by marginal-map probabilistic inference in generative models. In AAMAS, 1611–1612. IFAAMAS/ACM.
  51. The Sample Average Approximation Method for Stochastic Discrete Optimization. SIAM J. Optim., 12(2): 479–502.
  52. Integrating tree decompositions into decision heuristics of propositional model counters (short paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
  53. Adaptive Hashing for Model Counting. In UAI, volume 115, 271–280. AUAI Press.
  54. From Exact to Anytime Solutions for Marginal MAP. In AAAI, 3255–3262.
  55. Belief Propagation for Structured Decision Making. In UAI, 523–532. AUAI Press.
  56. Variational algorithms for marginal MAP. Journal of Machine Learning Research, 14.
  57. Madras, N. 2002. Lectures on Monte Carlo Methods. American Mathematical Society.
  58. A new look at survey propagation and its generalizations. J. ACM, 54(4): 17.
  59. AND/OR Search for Marginal MAP. In UAI.
  60. Anytime Marginal MAP Inference. In ICML.
  61. Maximum A Posteriori Inference in Sum-Product Networks. In AAAI, 1923–1930.
  62. IBM Neuro-Symbolic AI Workshop 2023 – Unifying Statistical and Symbolic AI.
  63. Gaussian sampling by local perturbations. In NIPS, 1858–1866.
  64. Perturb-and-MAP random fields: Using discrete optimization to learn and sample from energy models. In ICCV, 193–200.
  65. Complexity Results and Approximation Strategies for MAP Explanations. J. Artif. Int. Res.
  66. Decomposition Bounds for Marginal MAP. In NIPS, 3267–3275.
  67. Handbook of Constraint Programming, volume 2. Elsevier.
  68. Shapiro, A. 2003. Monte Carlo sampling methods. Handbooks in operations research and management science, 10: 353–425.
  69. Maximizing the Spread of Cascades Using Network Design. In UAI, 517–526.
  70. Tightening LP Relaxations for MAP using Message Passing. In UAI, 503–510.
  71. Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling. In CAV, volume 12224 of Lecture Notes in Computer Science, 463–484. Springer.
  72. Approximation Algorithms for 2-Stage Stochastic Optimization Problems. In FSTTCS, volume 4337, 5–19. Springer.
  73. NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci., 47(3): 85–93.
  74. The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study. Comput. Optim. Appl., 24(2-3): 289–333.
  75. Tree-reweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching. In AISTATS. Society for Artificial Intelligence and Statistics.
  76. Graphical Models, Exponential Families, and Variational Inference. Found. Trends Mach. Learn., 1(1-2): 1–305.
  77. Approximate inference in Boltzmann machines. Artif. Intell., 143(1): 19–50.
  78. Restoring Habitat Corridors in Fragmented Landscapes using Optimization and Percolation Models. Environmental Modeling and Assessment, 10(3): 239–250.
  79. Robust Optimization for Tree-Structured Stochastic Network Design. In AAAI, 4545–4551.
  80. Stochastic Network Design in Bidirected Trees. In NIPS, 882–890.
  81. Fast Combinatorial Algorithm for Optimizing the Spread of Cascades. In IJCAI, 2655–2661.
  82. Scheduling Conservation Designs for Maximum Flexibility via Network Cascade Optimization. J. Artif. Intell. Res., 52: 331–360.
  83. Basing Decisions on Sentences in Decision Diagrams. In AAAI, 842–849.
  84. Solving Marginal MAP Problems with NP Oracles and Parity Constraints. In NIPS, 1127–1135.
  85. Generalized Belief Propagation. In NIPS, 689–695. MIT Press.
  86. Robust supply chain network design: an optimization model with real world application. Annals of Operations Research, 257: 15–44.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now