Directed Plateau Search for MAX-k-SAT

Local search algorithms for MAX-k-SAT must often explore large regions of mutually connected equal moves, or plateaus, typically by taking random walks through the region. In this paper, we develop a surrogate plateau "gradient" function using a Walsh transform of the objective function. This function gives the mean value of the objective function over localized volumes of the search space.  This information can be used to direct search through plateaus more quickly. The focus of this paper is on demonstrating that formal analysis of search space structure can direct existing algorithms in a more principled manner than random walks.  We show that embedding the gradient computation into a hill-climbing local search for MAX-k-SAT improves its convergence profile.

[1]  Luca Maria Gambardella,et al.  Maximum satisfiability: How good are tabu search and plateau moves in the worst-case? , 2005, Eur. J. Oper. Res..

[2]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[3]  Bart Selman,et al.  Noise Strategies for Improving Local Search , 1994, AAAI.

[4]  Henry Kautz,et al.  Domain-independant extensions to GSAT : Solving large structured variables , 1993, International Joint Conference on Artificial Intelligence.

[5]  Bart Selman,et al.  Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems , 1993, IJCAI.

[6]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[7]  Steven E. Hampson,et al.  Large plateaus and plateau search in Boolean Satisfiability problems: When to give up searching and start again , 1993, Cliques, Coloring, and Satisfiability.

[8]  Albert Oliveras,et al.  MiniMaxSAT: An Efficient Weighted Max-SAT solver , 2008, J. Artif. Intell. Res..

[9]  Andrew M. Sutton,et al.  Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time , 2012, Theor. Comput. Sci..

[10]  L. Darrell Whitley,et al.  A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.

[11]  Jeremy Frank,et al.  When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..

[12]  Chu Min Li,et al.  Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.

[13]  Kevin R.G. Smyth Understanding stochastic local search algorithms : an empirical analysis of the relationship between search space structure and algorithm behaviour , 2004 .

[14]  Harry Zhang,et al.  Combining Adaptive Noise and Look-Ahead in Local Search for SAT , 2007, SAT.

[15]  Toby Walsh,et al.  An Empirical Analysis of Search in GSAT , 1993, J. Artif. Intell. Res..

[16]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

[17]  Dennis Kibler Plateaus and Plateau Search in Boolean Satis ability Problems: When to Give Up Searching and Start Again , 1993 .

[18]  Holger H. Hoos,et al.  On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.