The solution space structure of planted constraint satisfaction problems with growing domains

Abstract

Planting a solution into the random RB model, which is a prototype of random constraint satisfaction problem (CSP) with growing domains, can generate very hard satisfiable CSP benchmarks. We study the solution space structure of the planted RB model. With constraint density growing, we find that this model goes through four phase transitions. In the replica symmetric phase, what we call the independent phase transition occurs, after which the planted cluster (cluster containing the planted solution) is separated from the giant cluster. Then the solutions except that in the planted cluster go through the same clustering phase transition and the same satisfiability phase transition as the random RB model. The planted cluster goes through the isolated phase transition, after which the planted cluster contains only one solution. This phase diagram provides strong evidence that this model can generate very hard satisfiable CSP benchmarks. For over constraint instances (where the constraint density is very large), we find that the configuration space has only a single energy valley, which makes the instances tractable. Experiments using Belief Propagation confirm the locations of the clustering, satisfiability (by configurations outside the planted cluster), and isolated phase transition points.

References in corpus (17)

• Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
• The random K-satisfiability problem: from an analytic solution to an efficient algorithm
• Statistical physics of inference: Thresholds and algorithms
• Clustering of solutions in the random satisfiability problem
• Learning by message-passing in networks of discrete synapses
• Survey Propagation as local equilibrium equations
• Hiding Quiet Solutions in Random Constraint Satisfaction Problems
• Clusters of solutions and replica symmetry breaking in random k-satisfiability
• Hiding solutions in random satisfiability problems: A statistical mechanics approach
• On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms
• Survey-propagation decimation through distributed local computations
• The backtracking survey propagation algorithm for solving random K-SAT problems
• Quiet Planting in the Locked Constraint Satisfaction Problems
• A Spectral Approach to Analyzing Belief Propagation for 3-Coloring
• How we are leading a 3-XORSAT challenge: from the energy landscape to the algorithm and its efficient implementation on GPUs
• Solution space structure of random constraint satisfaction problems with growing domains
• Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks