Rana, S., Heckendorn, R. B., and Whitley, D. (1998). A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pages 392--397, Menlo Park, CA. AAAI Press.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....complete basis set that satisfy some common closure properties that are satis ed by most of the common basis that we often deal with. However, in the following discussion we choose to work with Walsh basis functions because of its existing connections to the eld of genetic algorithms [8, 9, 14, 16, 17, 18, 26, 45, 58, 61]. Walsh basis is functionally complete over the space of all boolean strings. In other words it can represent any function that can be de ned over the space of boolean strings. The following discussion o ers a brief overview of Walsh representation. Walsh functions [5, 76] are orthogonal ....

....Laplace, and other transformations, Walsh functions are often used to represent a problem solving task in a convenient form. Application of Walsh transformation (WT) in understanding Genetic Algorithms was rst noted by Bethke [7] Further investigation of this approach can be found elsewhere [14, 16, 17, 26, 50, 61, 74, 75]. Traditionally, the Walsh functions are used for representing real valued functions of binary variables. However, they can be easily extended to higher cardinality representation, as shown elsewhere [58] Although the main arguments of the following discussion can be extended for higher ....

S. Rana, R. B. Heckendorn, and D. Whitley. A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the AAAI-98, 1998. AAAI Press.

....cant and neglect its contribution. Fourier bases and their close relatives Walsh bases are frequently used to study the behavior of genetic algorithms. Walsh bases [4] were rst used by Bethke [6] for analyzing genetic algorithms. Further investigation of this approach can be found elsewhere [9, 11, 12, 14, 33, 34, 35, 43, 44]. 4.2 Function induction from data and Fourier basis Function induction from data plays an important role in adaptation, machine learning, and non enumerative black box optimization. In function induction, the goal is to learn a function f : X Y from the data set = f(x (1) y (1) x ....

S. Rana, R. B. Heckendorn, and D. Whitley. A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the AAAI-98, 1998. AAAI Press.

....thread of the new approach to ESA research is the recognition of the need to assess ESAs within the context of general theories of computation. There has been a growing body of work that looks at the relationship between ESAs and the theory of NP completeness (Duvivier, Preux, Talbi, 1996; Rana, Heckendorn, Whitley, 1998; Heckendorn, Rana, Whitley, 1999) a theory that puts serious boundaries on the performance of any algorithm let al..one an evolutionary algorithm (Garey Johnson, 1979) Chapter 1. Introduction 6 Furthermore, if ESAs are to be taken seriously as an engineering tool then they must compete with ....

....of P time complexity that could solve the NP hard problem, proving P = NP. As we know for sure that we can find the optimum of Mt.Fuji landscapes in P time (Das Whitley, 1991) therefore for P 6= NP to be true it cannot be possible to find in P time a Mt.Fuji representation of NP hard problems. Rana et al. 1998), Rana, Heckendorn, and Whitley (199) have looked at precisely this issue and proved that this argument holds true for non trivial MAXSAT problems. They show that in general such problems must be deceptive, i.e. not like a simple Mt.Fuji. A similar result is in (Hart Belew, 1991) Vose and ....

Rana, S., Heckendorn, R., & Whitley, D. (199?). A tractable walsh analysis of sat and its implications for genetic algorithms. In Don't Know. Rana, S., Heckendorn, R., & Whitley, D. (1998). A tractable walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the Fifth National Conference on Artificial Intelligence.

....complete basis set that satisfy some common closure properties that are satis ed by most of the common basis that we often deal with. However, in the following discussion we choose to work with Walsh basis functions because of its existing connections to the eld of genetic algorithms [8, 9, 14, 16, 17, 18, 26, 43, 54, 57]. Walsh basis is functionally complete over the space of all boolean strings and equivalent to other choices of basis functions in this space. The following discussion o ers a brief overview of Walsh representation. Walsh functions [5] are orthogonal functions that found applications in many ....

....Fourier, Laplace, and other transformations, Walsh functions are often used to represent the representation in a convenient form. Application of Walsh transformation (WT) in understanding Genetic Algorithms was rst noted by Bethke [7] Further investigation of this approach can be found elsewhere [14, 16, 17, 26, 48, 57]. Traditionally, the Walsh functions are used for representing real valued functions of binary variables. However, they can be easily extended to higher cardinality representation, as shown elsewhere [54] Although the main arguments of the following discussion can be extended for higher ....

S. Rana, R. B. Heckendron, and D. Whitley. A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the AAAI-98, 1998. AAAI Press.

....cant and neglect its contribution. Fourier bases and their close relatives Walsh bases are frequently used to study the behavior of genetic algorithms. Walsh bases [4] were rst used by Bethke [6] for analyzing genetic algorithms. Further investigation of this approach can be found elsewhere [9, 11, 12, 14, 33, 34, 35, 43, 44]. 4.2 Function induction from data and Fourier basis Function induction from data plays an important role in adaptation, machine learning, and nonenumerative black box optimization. In function induction, the goal is to learn a function f : X Y 7 Protein feature mRNA codon 1 100 1 ....

S. Rana, R. B. Heckendorn, and D. Whitley. A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the AAAI-98, 1998. AAAI Press.

....Laplace, and other transformations, Walsh functions are often used to represent the representation in a convenient form. Application of Walsh transformation (WT) in understanding Genetic Algorithms was first noted by Bethke [2] Further investigation of this approach can be found elsewhere [4, 5, 6, 13, 16]. Traditionally, the Walsh functions are used for representing real valued functions of binary variables. However, they can be easily extended to higher cardinality representation, as shown elsewhere [15] Although the main arguments of the following discussion can be extended for higher ....

S. Rana, R. B. Heckendron, and D. Whitley. A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the AAAI-98, 1998. AAAI Press.

No context found.

Rana, S., Heckendorn, R. B., and Whitley, D. (1998). A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pages 392--397, Menlo Park, CA. AAAI Press.

....relatively low order schemata. So even if hyperplane sampling is a robust form of heuristic search, the user destroys this potential by using small population sizes. What if we had perfect schema information What if we could compute schema information exactly in polynomial time Rana et al. [37] have shown that schema information up to any fixed order can be computed in polynomial time for some NP Complete problems. This includes MAXSAT problems and NK Landscapes. This is very surprising. One theoretical consequence of this is the following: 10 If P 6= NP then, in the general case, ....

....positive or negative results. In practice, random MAXSAT problems are characterized by highly inconsistent schema information so that there is really little or no information that can be exploited to guide the search [22] And in practice, genetic algorithms perform very poorly on MAXSAT problems [37]. On the other hand, genetic algorithms are known to work well in many other domains. Again, the notion of using schema information to guide search is at best a heuristic. There are many other criticisms of the schema theorem. Historically, too much has been claimed about schema and hyperplane ....

Soraya Rana, Robert Heckendorn, and Darrell Whitley. A tractable walsh analysis of sat and its implications for genetic algorithms. In aaai98, pages 392--397. MIT Press, 1998.

....f i : f(x) f i (x) where f; f 1 ; f 2 ; f C : B R. Each clause evaluation, f i , takes an L bit string as input but extracts and uses only K bits in the calculation, where K is the length of the clause. This constraint means that each clause contributes to only Walsh coefficients [8]. Since the Walsh transform can be performed by a simple linear transformation, the Walsh transform of a MAXSAT problem can be treated as a sum of the Walsh transforms of the individual clauses. W (f(x) W (f i (x) Consider a 3 bit single clause problem using f(x) x 2 x 1 x 0 . We ....

S. Rana, R. Heckendorn, and D. Whitley. A tractable walsh analysis of Sat and its implications for genetic algorithms. In Proc. Fifteenth National Conference on Artificial Intelligence, 1998.

....which allows the quantification of all possible bit interactions. Unfortunately, the Walsh transform typically requires exponential time to compute with respect to the number of bits in the domain. However, recent work has shown that both MAXSAT and NK landscapes have tractable Walsh analysis [Rana et al. 1998, Heckendorn and Whitley, 1997] In fact, all embedded landscapes offer a polynomial time Walsh transform if the maximum number of variable interactions is bounded[Heckendorn et al. 1998] We extend this work to show that Walsh analysis offers a polynomial time method for computing summary ....

....Walsh coefficients can be computed using Equation 3. When a clause is evaluated over all possible variable assignments, each clause will produce seven 1 s and a single 0. This property can be exploited to produce the Walsh coefficients for MAXSAT clauses directly from the clause description[Rana et al. 1998]. The Walsh coefficients for each clause are listed in Table 1 as W (f 1 ) W (f 2 ) and W (f 3 ) According to Table 1: Walsh Coefficients broken down by clause. x w i W (f1) W (f2) W (f3) W (f(x) 0000 w0 0:875 0:875 0:875 2:625 0001 w1 Gamma0:125 0 0:125 0 0010 w2 Gamma0:125 ....

[Article contains additional citation context not shown here]

Rana, S., Heckendorn, R., and Whitley, D. (1998). A tractable walsh analysis of SAT and its implications for genetic algorithms. In Proceedings of the Fifteenth National Conference on Artificial Intelligence.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC