Colorado State University
Step toward constant time local search for optimizing pseudo boolean functions, A.
Degree: MS(M.S.), Computer Science, 2013, Colorado State University
Pseudo Boolean Functions (PBFs) are the objective functions for a wide class of hard optimization problems, such as MAX-SAT and MAX-CUT. Since these problems are NP-Hard, researchers and practitioners rely on incomplete solvers, such as Stochastic Local Search (SLS), for large problems. Best-Improvement Local Search (BILS) is a common form of SLS, which always takes the move yielding the highest improvement in the objective function. Generally, the more runtime SLS is given, the better solution can be obtained. This thesis aims at algorithmically accelerating SLS for PBFs using Walsh Analysis. The contributions of this thesis are threefold. First, a general approach for executing an approximate best-improvement move in constant time on average using Walsh analysis, "Walsh-LS", is described. Conventional BILS typically requires examining all n neighbors to decide which move to take, given the number of variables is n. With Walsh analysis, however, we can determine which neighbors need to be checked. As long as the objective function is epistatically bounded by a constant k (k is the number of variables per subfunctions), the number of neighbors that need to be checked is constant regardless of problem size. An impressive speedup of runtime (up to 449 times) is observed in our empirical studies. Second, in the context of Walsh-LS, we empirically study two key components of SLS from the perspectives of both efficiency and effectiveness: 1) Local optimum escape method: hard random or soft restarts; 2) Local search strategy: first-improvement or best-improvement. Lastly, on average we can perform approximate BILS using the mean over a Hamming region of arbitrary radius as a surrogate objective function. Even though the number of points is exponential in the radius of the Hamming region, BILS using the mean value of points in the Hamming region as a surrogate objective function can still take each move in time independent of n on average. According to our empirical studies, using the average over a Hamming region as a surrogate objective function can yield superior performance results on neutral landscapes like NKq-landscapes.
Advisors/Committee Members: Whitley, L. Darrell (advisor), Howe, Adele E. (advisor), Cheney, Margaret (committee member).
Subjects/Keywords: complexity per move; stochastic local search; pseudo Boolean optimization; NK-landscapes
to Zotero / EndNote / Reference
APA (6th Edition):
Chen, W. (2013). Step toward constant time local search for optimizing pseudo boolean functions, A. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/81007
Chicago Manual of Style (16th Edition):
Chen, Wenxiang. “Step toward constant time local search for optimizing pseudo boolean functions, A.” 2013. Masters Thesis, Colorado State University. Accessed March 09, 2021.
MLA Handbook (7th Edition):
Chen, Wenxiang. “Step toward constant time local search for optimizing pseudo boolean functions, A.” 2013. Web. 09 Mar 2021.
Chen W. Step toward constant time local search for optimizing pseudo boolean functions, A. [Internet] [Masters thesis]. Colorado State University; 2013. [cited 2021 Mar 09].
Available from: http://hdl.handle.net/10217/81007.
Council of Science Editors:
Chen W. Step toward constant time local search for optimizing pseudo boolean functions, A. [Masters Thesis]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/81007