Streamlining variational inference for constraint satisfaction problems

DOI10.1088/1742-5468/ab371fzbMath1459.62009arXiv1811.09813OpenAlexW3102454627MaRDI QIDQ5854105

Aditya Grover, Tudor Achim, Stefano Ermon

Publication date: 16 March 2021

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.09813

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• The asymptotic \(k\)-SAT threshold
• Efficient path planning algorithms in reach-avoid problems
• Markov logic networks
• Proof of the Satisfiability Conjecture for Large k
• Ontology Matching
• A new look at survey propagation and its generalizations
• Graphical Models, Exponential Families, and Variational Inference
• Models for Random Constraint Satisfaction Problems
• The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
• Multiplayer Reach-Avoid Games via Pairwise Outcomes
• Survey propagation: An algorithm for satisfiability
• The Satisfiability Threshold fork-XORSAT
• Random 2-XORSAT at the Satisfiability Threshold
• Principles and Practice of Constraint Programming – CP 2004
• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP

This page was built for publication: Streamlining variational inference for constraint satisfaction problems