Simulated landscapes are widely used for evaluating search strategies, where the goal is to find the landscape location with maximum fitness value . Without loss of generality and for notational simplicity, we assume function maximization, rather than minimization, throughout this paper.
NK Landscapes  have been classic benchmarks for generating landscapes with epistatic interactions. They are described by two parameters: N specifies the number of binary features and specifies that the maximum degree of epistatic interactions among the features is . NK landscapes have been used in many applications (e.g., [4, 5, 6, 7, 8]) and widely studied in theory (e.g., [9, 10, 11, 12, 13]), as they can generate landscapes with tunable ruggedness by varying . However, NK landscapes have several limitations. Buzas and Dinitz  recently showed that the expected number of local peaks in NK landscapes rises in large discrete jumps as is increased, but actually decreases as a function of the number of interaction terms for a given (Fig. 1, red lines). Additionally, the problem of finding the location and value of the global optimum of unrestricted NK landscapes with is NP-complete  (although for restricted classes one can use dynamic programming  or approximation algorithms ). NK landscapes have only been defined for binary alphabets.
Walsh polynomials are a superset of NK landscapes that overcome some of the limitations of NK landscapes. For example, they allow more explicit control over which interaction terms are present. The problem of finding the global maximum value of a Walsh polynomial is also NP-complete, although a restricted subset of Walsh polynomials has a known global maximum . However, even in this case finding the global minimum is still NP-complete, preventing proper normalization by the range of fitnesses in the landscapes. As with NK landscapes, Walsh polynomials are only defined for binary alphabets.
In this paper, we introduce a different, more flexible subset of general interaction models that we dub NM landscapes. Like NK landscapes and Walsh polynomials, NM landscapes incorporate epistatic feature interactions. However, NM landscapes also (a) include epistasis in a natural and transparent manner, (b) have known value and location of the maximum fitness, (c) work with alphabets of any arity, including discrete and real-valued alphabets, (d) with additional constraints have known value and location of the minimum fitness, and (e) when coefficients are chosen properly, have relatively smoothly tunable ruggedness. In Section 2 we introduce the general class of parametric interaction models and Walsh polynomials, then in Section 3 we define NM landscapes and prove the properties (a), (b), (c) and (d) above. In Sections 4 and 5 we describe experiments and results that demonstrate property (e) above. In Section 6 we discuss the importance of these properties and point out several advantages of NM landscapes as benchmark problems for studying search in tunably rugged landscapes.
Ii Interaction Models and Walsh Polynomials
where is the length of the bit string , each bit , and each . The Walsh function corresponding to the th partition is defined as:
where denotes the binary representation of .
NK landscapes are a subset of Walsh polynomials. Walsh polynomials have a one-to-one correspondence with the more general class of general parametric interaction models, when such models are restricted to binary alphabets .
A fitness landscape can be defined for features using a general parametric interaction model of the form:
where is the number of terms, and each of coefficients . For , , where is a set of indices of the features in the th term, and the length is the order of the interaction. We adopt the convention that when , . If the parametric interaction model is defined on a binary alphabet, we adopt the convention that binary values are represented as (rather than , as in Walsh polynomials). However general parametric interaction models are also well defined for discrete valued features with higher arities as well as for real-valued alphabets and provide a more intuitive way of representing epistatic interactions among features.
A more readable notation for Eq. (3) is as follows:
where we only explicitly show up to third order interactions and represents higher order interactions up to some maximum order . Note that some parameters may be zero, so not all terms need be present.
For example, consider a model with loci and , , and . The interaction model for this example is:
where is the average value of all fitnesses in the landscape, and are the coefficients of the main effects of the binary features and , and is the coefficient of the second order epistatic interaction . The Walsh polynomial corresponding to Eq. (5) is:
A random point selected in the search space of a Walsh polynomial can be forced to be the global maximum by properly adjusting the sign of each of the non-zero Walsh coefficients, with the maximum fitness value equal to the sum of the absolute values of all Walsh coefficients . However, the location and the value of the global minimum remains unknown.
General parametric interaction models are the standard models used in statistics to study effects of multiple features on an outcome (e.g., ). They are easy to define and the interactions are transparent and easy to interpret (unlike in NK landscapes and Walsh polynomials). For example, the interaction terms present in Eq. (5) are clearly evident, whereas the Walsh functions in Eq. (6
) obscure this. To date, general parametric interaction models have received very little attention in the evolutionary computation literature, with notable exceptions[19, 20, 21].
In  the authors show that for every NK landscape with a given one can create an equivalent parametric interaction model, where the maximum order of interactions is . They show that the NK algorithm dictates that the interaction model contain all main effects and sub-interactions contained in higher order interactions. For example, if a non-zero interaction coefficient is present in an NK landscape, then there will generally be non-zero coefficients
(there is an infinitesimally small probability that one or more of these coefficients may be zero). For the classicNK model where is constant and , main effect coefficients have the largest expected magnitude, second order interactions have larger expected magnitude than third order interactions, and so on . Thus, NK landscapes are a very restricted subset of Walsh polynomials and the more general class of parametric interaction models.
Iii Nm Landscapes
The class of Walsh polynomials is a subset of the larger class of general interaction models. Here we introduce a different subset of general interaction models called NM landscapes, where is the number of features and all interactions in the model are of order .
Definition 1: NM models comprise the set of all general interaction models specified by Eq. (3), with the added constraints that (a) all coefficients are non-negative, (b) each feature value ranges from negative to positive values, and (c) the absolute value of the lower bound of the range the upper bound of the range of .
In this work, each is randomly created as follows:
is a random number drawn from a Gaussian distribution with
mean and standard deviation of, which results in fitnesses that are symmetric around (Fig. 2). As the value of increases, the means and standard deviations of the coefficients decrease, which results in a smaller range of fitness values and increasing clumping of fitness values (Fig. 2
). In contrast, when coefficients are drawn from a uniform distribution in the range
, the fitnesses are skewed left (3). NM landscapes offer several desirable properties, as described in the following.
Proposition 1: NM landscapes with a binary alphabet have a known global maximum.
By Definition 1, for all non-zero terms. Thus, the maximum possible value for each term () in an NM landscape with a binary alphabet is achieved when:
and the value of the global maximum is:
where are the coefficients of all the remaining higher order interactions. Note that the calculation of Eq. (11) has time complexity of , where is the number of terms in the model. ∎
Proposition 2: NM landscapes can be defined on discrete alphabets of any arity or on real-valued alphabets, and the value and location of a global maximum is independent of the discretization of the alphabet.
By Definition 1, all coefficients are non-negative, therefore the maximum of an NM landscape with any discrete or real-valued alphabet defined in the range where , occurs when and its value is:
where are the coefficients of all the remaining higher order interactions and the lengths are the orders of these interactions. Thus the magnitude of is a function of , but is independent of the arity of the alphabet. ∎
For alphabets where , represents the mean value of the landscape. We note that it is trivial to extend this proposition and proof to NM landscapes with heterogeneous alphabets (i.e., different ranges and/or arities for each feature variable), as long as the lower bound for each feature is negative, the upper bound is positive, and the absolute value of the lower bound is the upper bound. However, for notational simplicity we only demonstrate the proof for homogeneous alphabets. We refer to the above described general NM landscapes as Type I NM landscapes.
We conjecture that changing the arity of features in NM
landscapes does not change the number, locations, or values of the local peaks or global minima, because higher arity alphabets simply sample the same landscape at a higher resolution that interpolates between the local peaks. (Empirical data, not shown, supports this conjecture.)
Note that interaction models with all non-negative interaction coefficients , but no negative feature values, generate unimodal landscapes. However, since alphabets in NM landscapes are defined to include both negative and positive features, NM landscapes have multiple local optima whenever any interaction terms are included.
Proposition 3: NM landscapes that include all main effects have exactly one global maximum.
By proposition 1, a maximum fitness of an NM landscape is achieved at point . Let , where y x (i.e, there exists at least one such that ). Since each and (by Definition 1) then and the value of the interaction model at point y will be strictly less than the value at point x. Thus, x is the only global maximum. ∎
Proposition 4: NM landscapes that include only even order terms with alphabets in the range [-b, b] are symmetric and have exactly two global maxima at maximal distance apart in feature space.
Since , then for all NM landscapes with only even order terms, for each pair of points and . Thus, NM landscapes with only even order interactions and alphabets in range are symmetric and the two global maxima are at locations and , which are the maximum distance away from each other in the feature space. ∎
When the value of the global maximum of the landscape is known one can partially normalize fitnesses to the range using the following formula:
However, proper normalization of fitnesses to the interval [0,1] also requires prior knowledge of the global minimum of the landscape, as follows:
To this end, we define subsets of NM landscapes that have a known global minimum. While there are many ways to do this, below we present two such subsets.
Proposition 5: NM
landscapes that include only main effects with odd indices (e.g.,, etc.) and any terms with an odd number of odd indices (e.g., , , , etc.) and alphabets in the range have a global minimum located at point . For example, models of this form including up to order terms are given by:
At the point all terms with an odd number of odd indices will have a negative sign, as the product of an odd number of negative numbers is negative. Thus, this point is the global minimum of the landscape with value:
(where only terms up through second order are explicitly shown above). ∎
We refer to the NM landscapes defined in Proposition 5 as Type II NM landscapes. Note that Type II NM landscapes can easily be extended to alphabets in the range , where , although for notational simplicity we have limited the range to in the above proof.
Proposition 6: NM landscapes with only odd order terms and alphabets in the range , where , have a global minimum located at .
By Definition 1, for all non-zero terms, , and . Therefore the value of each term has to be . When all the features , . Therefore the point is a global minimum with value:
We refer to the NM landscapes defined in Proposition 6 as Type III NM landscapes. When the global maximum and minimum of Type III NM landscapes have the same absolute value, but opposite signs. Because NM landscapes allow only non-negative coefficients but require both positive and negative feature values, we are thus able to construct NM landscapes with known maximum and known minimum, enabling normalization of fitnesses to the range [0,1] by equation (14). In contrast, Walsh polynomials allow both positive and negative coefficients, but have only non-negative feature values. Thus, while it is possible to manipulate the signs of the Walsh coefficients to specify the location of the global maximum , the global minimum of a Walsh polynomial is still unknown, even if one restricts the order of the interactions as in Type II or Type III NM landscapes.
We illustrate how ruggedness changes on binary NM landscapes with coefficients drawn from the distribution in Eq. (9). Since we assess the ruggedness of these models using exhaustive search, we limit our experiments to .
In one set of experiments, we generated random Type I “master” NM models, including terms for all main effects and the possible interaction terms (e.g., for there are 1023 overall terms; 1013 interaction terms plus 10 main effects). We then systematically created subsets of each of these master models that include an increasing number of terms from the master model, as follows. We started with a base model that includes all main effects. Random second order terms were then added in groups of 10 (or less if there are not 10 left). After we had included all of the second order terms, we began adding randomly selected groups of 10 third order terms, and so on, until the single -order interaction term was included. We performed these incremental explorations of 100 master NM models for each of with , and with .
In another set of experiments we similarly created 100 master Type II NM landscapes according to Eq. (15), with and . We created increasing subsets from the master models, as described above for the Type I landscapes.
We computed two standard measures of landscape ruggedness [22, 23]: (a) we counted the number of local peaks (where a local peak is defined as any point whose fitness value is greater than that of all of its neighbors); (b) we computed the lag 1 autocorrelation of random walks through the landscapes.
Iv-B Distribution of fitnesses and local peaks
We generated representative NM landscapes with and for each of for both Type I and Type II NM landscapes. We visualize these landscapes by plotting the fitnesses of all points in the landscape as a function of their distances (in feature space) to the global optimum, indicating which are local optima.
Iv-C Basin of attraction of global optimum
We assessed the size of the basin of attraction of the global maximum of Type I and Type III NM landscapes and NK landscapes for different values of and . The fitness matrix of NK landscapes is generated from random uniform numbers in the range. We calculated the size of the global basin of attraction as a weighted sum of the points in the landscape that can reach the global maximum using only hill climbing. Each point was weighted based on the percentage of its immediate neighbors with higher fitnesses that were also in the basin of attraction of the global maximum.
Iv-D Searchability of the landscapes
We assessed how searchable NM
landscapes are using simple genetic algorithms (GAs). In all the experiments we used a GA with, , population size 256, uniform crossover rate 0.7, uniform mutation and the number of random seeds of 32 (these parameter values were selected to be the same as in ).
We studied search on Type I NM landscapes with and proportions of all possible second-order interactions. We studied the search on Type III NM landscapes with including all possible main effects and odd order interactions of order .
The number of local peaks in NM landscapes increases relatively smoothly as we increase the number of terms () in both Type I and Type II NM landscapes (i.e., the regions between the vertical lines on Fig. 4) and as we increase the maximum order of interactions (i.e., as we cross a vertical line on Fig. 4).
Note that the average number of local peaks for a given in both Type I and Type III landscapes is on the same order of magnitude as the expected number of local peaks in NK models with the same and (compare Figs. 4a and 4c to Fig. 1).
Similarly, the lag 1 autocorrelation of random walks through both Type I and Type III NM landscapes decreases relatively smoothly as the number of terms is increased in models with a given , as well as when the maximum order of interactions is increased (Figs. 4b and 4d), where lower autocorrelation corresponds to greater ruggedness. Notice that, especially for small , the increase in ruggedness (as measured by both the number of local peaks and the lag 1 autocorrelation) asymptotically slows as the number of terms increases (Fig. 4).
The larger the values in Eq. (9), the smaller the range of fitness values in the landscape (Fig. 2), resulting in larger standard deviations of both the number of local peaks in the landscape (shown in Fig. 5 for ) and the autocorrelation (not shown).
We show the fitnesses of all points in representative NM landscapes with and as a function of their distances in feature space to the global maximum for both the Type I (Fig.6) and Type II (Fig. 7) NM landscapes. The global maximum is indicated by the leftmost red in each panel and the remaining red ’s are sub-optimal local peaks. As we increase the maximum order of interactions , the fitness difference between the global maximum and other points in the landscape increases; this effect is amplified for Type II NM landscapes (Fig. 7) relative to Type I NM landscapes (Fig. 6).
In both Type I and Type II NM landscapes the distance in feature space between the global maximum and the nearest local peak generally decreases with increasing and the sizes of the basin of attraction for the global maximum decreases (Fig. 8). Our results show that NK and NM landscapes have similar sizes of the basin of attraction for the global maximum for small and large = (). However, the size of the basin of attraction for the global maximum of both Type I and Type II NM landscapes decreases with increasing rapidly for then levels out, while for NK landscapes the decrease is more gradual (see Fig. 8).
The difficulty of GA search on NM landscapes also increases with increasing and , by several measures of difficulty. When the maximum order of interactions and the proportion of all the possible second-order interactions increases from 0 to 1 in 0.1 increments, our results show that the mean of the best fitnesses found by the GA decreases, although above there is little if any further change in difficulty (Fig. 9). We speculate that this might correspond to the periodically asymptotic pattern in the ruggedness noted previously as the maximum number of terms approaches the maximum possible for a given (Fig. 4a-b). Results are shown for only the first 30 generations, after which no further improvement was observed. Histograms of the Hamming distances between the best solutions found by GA and the global maximum are shown for 32 runs of the GA, for different proportions of the possible second-order interactions (Fig. 10). For unimodal landscapes (), the GA found the global optimum in all 32 runs (Fig. 10). For more rugged landscapes the global optimum was also found in some runs, and surprisingly the proportion of times it was found increased from to . However, as the ruggedness increased, those runs in which the best individuals were suboptimal generally became stuck farther and farther from the global optimum (note how the distributions become increasingly spread out to the right, as you view the panels in Fig. 10 from top to bottom).
When fitnesses are not normalized, a higher maximum order of interactions results in higher raw fitnesses (Fig. 11a). This is due to the fact that summing more interaction terms result in higher ranges of fitness (Fig. 6 and Fig. 7). However, when fitnesses are properly normalized by Eq. 14 to the range [0,1], increasing the maximum order of interactions in the model decreases the values of the best individuals’ fitnesses found (Fig. 11b), reflecting the fact that GA search becomes more difficult at higher .
While the proportion of times that GA was able to find the global maximum out of 32 runs decreased as the maximum order of interactions increased (Fig. 12a), the means and standard deviations of the distances between the best solutions found by the GA and the global maximum increased (Fig. 12b). Normalizing by Eq. (13), rather than Eq. (14
) exaggerates both the apparent relative generational increase in fitnesses in the GA and the variance in fitnesses across different random landscapes with the sameand (Fig. 11). This illustrates how knowing the global minimum can help to accurately assess the mean and standard deviation of the relative increase in fitnesses and fairly compare search results on different NM landscapes.
In this work we introduce NM landscapes, which are parametric interaction models that (a) have non-negative coefficients and (b) are well-defined for feature alphabets of any arity (from binary to real-valued), as long as (c) the minimum value in the alphabet is negative with absolute value less than or equal to the positive maximum. This combination of constraints ensures that a global maximum is located at the point where all decision variables have their maximum value, with the optimal value equal to the sum of the model coefficients. By further restricting which combinations of interactions are present, various subsets of NM models also have known location and value of the global minimum (we illustrate two such subsets, which we refer to as Type II and Type III NM landscapes). By using an appropriate non-negative distribution for the coefficients, the resulting NM landscape models have relatively smoothly tunable ruggedness. Epistatic terms are transparently represented in NM landscapes, making it trivial to control or analyze exactly which terms and interactions are present. In the following, we discuss why these various aspects of NM landscapes are valuable, and how they offer advantages over NK landscapes and Walsh polynomials as epistatic benchmark problems.
Vi-a Value of finely tunable epistasis
Although NK landscapes have been widely used as benchmark problems with varying degrees of epistasis, there are many potential applications that require more fine control over which terms are present or absent.
For example, this study was originally motivated by some of our previous research in comparing search strategies for healthcare improvement [2, 24]. In the context of clinical fitness landscapes, it is not reasonable to assume that all features have only main effects (corresponding to in NK landscapes) as there are many known interactions between various practices and/or treatments in the real world (e.g., [25, 26]). However, it is also not reasonable to assume that every feature interacts with at least one other feature (corresponding to ). Rather, we sought to explore the performance of different clinical quality improvement strategies (including randomized controlled trials and team quality improvement collaboratives) in more realistic clinical fitness landscapes where all features had main effects but varying numbers of second-order interactions were also present.
Alternatively, in some application domains one may wish to model purely epistatic landscapes in which no main effects are present. For example, in complex diseases there may be little if any association between single genes and incidence of disease . Similarly, the electrical grid is explicitly ensured to be stable with respect to the loss of any one component, but interactions between two or more component outages can lead to large cascading failures . For these types of applications, we and others have been seeking algorithms that are capable of detecting purely epistatic interactions (e.g., [29, 30, 28]). To test these algorithms, one must be able to create benchmark landscapes where there are interaction terms but no main effects.
Classic NK landscapes cannot model landscapes between and , nor can they model landscapes with no main effects or where the strengths of the main effects are smaller than the strengths of interaction terms . In contrast, general interaction models (including NM landscapes) easily allow fine control over exactly which terms are present or absent and one can easily specify different magnitudes of coefficients for different terms. This is also possible using Walsh polynomials, although the notation is not as simple or transparent.
In the experiments shown here, we provide evidence that increasing the number and/or maximum order of interactions increases the ruggedness of NM landscapes with coefficients generated using Eq. (9) with , as measured by number of local peaks and the lag 1 autocorrelation of random walks through the landscapes (Fig. 4), and also increases the difficulty of these landscapes by several different measures of search difficulty, including size of the basin of attraction of the global optimum (Fig. 8), final normalized best fitnesses found with a GA (Figs. 9 and 11), distances from the global optimum of sub-optimal final best fitnesses found by a GA (Figs. 10 and 12a), and proportion of times a GA was able to find the global optimum (Fig. 12b).
Vi-B Value of fitness normalization
Since the range of possible fitness values varies so much between rugged landscapes (as illustrated in Figs. 6 and 7), it is important to normalize fitnesses to a consistent range if one desires to compare fitness values on different lanscapes (Fig 11), or to assess the variability of a search strategy on landscapes with a given and (Fig. 9). In [2, 24] we used logistic transforms of general parametric interaction models with unknown maxima to model search on clinical fitness lanscapes with varying numbers of second order interactions. While the logistic function successfully bounds the transformed fitnesses to the open interval , it also has the side effect of compressing high fitness values to the degree that there is very little difference between the fitnesses of the optimal peak and many suboptimal peaks. This may be a realistic assumption in health care (where there may be many possible combinations of clinical practices that yield good results), but for applications where such compression is not ideal it may be more appropriate to normalize fitnesses to values using Eq. (13), which requires knowing the global maximum, or even better to the closed interval using Eq. (14), which also requires knowing the global minimum. NM landscapes enable these types of normalization, as discussed in the following subsections.
Vi-C Value of knowing the global maximum
Knowing the best possible fitness offers obvious benefits, including: (a) one can terminate a search as soon as the known optimal value is found, potentially saving significant computation time; (b) one can compare methods by assessing the frequency with which the search strategies are able to find the global maximum; (c) one can tell if a stalled search has found the global optimum or is stuck on a local optimum; and (d) one can normalize fitnesses to be using equation (13). Knowing the location of the global maximum in feature space offers obvious additional benefits  including: (e) one can track the evolving distances of solutions to the global optimum as the search progresses, which could potentially inform ways to improve the search process; (f) one can compare the distances (in feature space) from the best final solution to the global optimum; (g) one can assess the difficulty of the fitness landscape by assessing the correlation of fitness values encountered on a random walk with the distances to the global optimum; and (h) one can empirically explore a landscape near the global optimum in order to asses the size and shape of its basin of attraction.
For arbitrary epistatic landscapes (including NK landscapes, general parametric interaction models, and Walsh polynomials) finding the global maximum is NP complete. However, there are restricted subsets of these for which the global maximum is known. For example, in Walsh polynomials one can select an arbitrary point and then adjust the signs of the coefficients to force this to be the global maximum . In NM landscapes both the location and value of the global maximum is trivially known.
Vi-D Value of knowing the global minimum
While fitnessess can be partially normalized to values with Eq. 13 (as in Fig. 9), this can still be misleading, since the range of fitness values has not been properly accounted for. It is thus preferable to normalize to values in the closed interval with Eq. (14), as in Fig. 11. For example, in Fig. 13 we illustrate how both increase in relative fitnesses over time and the variability of fitnesses on different landscapes with the same maximum order
are over-estimated when normalizing by Eq. (13), which only requires that the maximum possible fitness value be known, relative to when the data is normalized by Eq. (14), which requires that both the maximum and minimum possible fitness values be known.
Finding the global minimum is NP complete in NK landscapes and Walsh polynomials. However, in certain subsets of NM landscapes (e.g., Type II and Type III NM landscapes) the value and location of the global minimum is trivially known, enabling proper normalization of fitnesses.
Vi-E Value of arbitrary arity of the alphabet
Both NK landscapes and Walsh polynomials are defined for combinatorial problems with binary alphabets . There are also a variety of benchmark problems with tunable difficulty for real-valued alphabets (e.g., [32, 33]). However, in some applications it would be desirable to have one type of model with tunable ruggedness that could be applied to binary alphabets, integer alphabets, real-valued alphabets, or heterogeneous alphabets. For example, in real clinical fitness landscapes, decision variables can have a variety of arities ranging from binary (e.g., whether or not a certain practice is performed) to real-valued (e.g., the amount or duration of application of a particular treatment) .
NM landscapes are well-defined for alphabets of all arities (including mixed arities); changing the arity does not change the location or value of the global maximum or minimum.
Vi-F Value of transparency of interactions
Various researchers are working on developing algorithms to try to detect which interactions are present in fitness landscapes and use these inferred interactions to guide the search (e.g., the linkage tree genetic algorithm ). Being able to easily control exactly which feature interactions are present and also know the relative strengths of these interactions would facilitate the testing and validation of such approaches, as one could easily see whether the algorithm was properly estimating interaction terms.
NK landscapes offer little control over which interactions are to be included, and once generated it is non-obvious which interaction terms are present or what their coefficients values are (without significant effort ). Walsh polynomials present a framework where specific interaction terms can be included or excluded from the model, but the notation can be confusing and obfuscates which terms are present (e.g., see the example in Eq. (6)). In NM landscapes, the interaction terms and their coefficients are obvious, since this is how interaction models are defined (e.g., see the example in Eq. (5)).
We propose a new class of fitness landscapes with tunable degrees of epistasis, referred to as NM landscapes. All NM landscapes have a known global optimum, various subsets of NM landscapes have a known global minimum (thus permitting proper normalization of fitness values), the ruggedness and search difficulty of NM landscapes can be made to be relatively smoothly tunable, NM landscapes are well-defined on alphabets of any arity, and which epistatic interactions are included in a particular instantiation of an NM landscape is easily controlled or analyzed. In summary, NM landscapes are a simple but powerful class of models that offer several benefits over NK landscapes and Walsh polynomials as benchmark models with tunable epistasis.
This work was funded in part by the NIH Eunice Kennedy Shriver National Institute of Child Health & Human Development award 1R21HD068296.
-  S. A. Kauffman and E. D. Weinberger, “The NK model of rugged fitness landscapes and its application to maturation of the immune response,” Journal of theoretical biology, vol. 141, no. 2, pp. 211–245, 1989.
-  M. Eppstein, J. Horbar, J. Buzas, and S. Kauffman, “Searching the clinical fitness landscape,” PLoS ONE, vol. 7, no. 11, 2012.
-  S. Kauffman, The origins of order: Self organization and selection in evolution. Oxford University Press, 1993.
-  I. Giannoccaro, “Complex systems methodologies for behavioural research in operations management: NK fitness landscape,” in Behavioral Issues in Operations Management. Springer, 2013, pp. 23–47.
-  A. Moraglio and J. Togelius, “Geometric differential evolution,” in Proceedings of the 11th Annual conference on Genetic and evolutionary computation. ACM, 2009, pp. 1705–1712.
-  W. Rowe, M. Platt, D. C. Wedge, P. J. Day, D. B. Kell, and J. Knowles, “Analysis of a complete dna–protein affinity landscape,” Journal of The Royal Society Interface, vol. 7, no. 44, pp. 397–408, 2010.
-  N. Tomko, I. Harvey, and A. Philippides, “Unconstrain the population: The benefits of horizontal gene transfer in genetic algorithms,” in SmartData. Springer, 2013, pp. 117–127.
I. Arnaldo, I. Contreras, D. Millán-Ruiz, J. I. Hidalgo, and N. Krasnogor, “Matching island topologies to problem structure in parallel evolutionary algorithms,”Soft Computing, pp. 1–17, 2013.
-  M. Pelikan, “Analysis of estimation of distribution algorithms and genetic algorithms on NK landscapes,” in Proceedings of the 10th annual conference on Genetic and evolutionary computation. ACM, 2008, pp. 1033–1040.
-  A. H. Wright, R. K. Thompson, and J. Zhang, “The computational complexity of NK fitness functions,” IEEE Transactions on Evolutionary Computation, vol. 4, no. 4, pp. 373–379, 2000.
-  J. Buzas and J. Dinitz, “An analysis of NK landscapes: Interaction structure, statistical properties and expected number of local optima,” IEEE Transactions on Evolutionary Computation, in press, DOI10.1109/TEVC.2013.2286352, 2014.
-  W. Hordijk, “Correlation analysis of coupled fitness landscapes,” in Recent Advances in the Theory and Application of Fitness Landscapes. Springer, 2014, pp. 369–393.
-  R. T. Liaw and C. K. Ting, “Effect of model complexity for estimation of distribution algorithm in NK landscapes,” in 2013 IEEE Symposium on Foundations of Computational Intelligence (FOCI). IEEE, 2013, pp. 76–83.
Y. Gao and J. C. Culberson, “An analysis of phase transition in NK landscapes,”
Journal of Artificial Intelligence Research, vol. 17, no. 1, pp. 309–332, 2002.
-  R. Tanese, “Distributed genetic algorithms for function optimization,” Ph.D. dissertation, The University of Michigan, Ann Arbor, MI, 1989.
-  S. Forrest and M. Mitchell, “The performance of genetic algorithms on walsh polynomials: Some anomalous results and their explanation,” in Proceedings of the 4th International Cinference on Genetic Alogarithms. San Mateo, CA: Morgan Kaufmann, 1991, pp. 182–189.
-  L. Kallel, B. Naudts, and C. R. Reeves, “Properties of fitness functions and search landscapes,” in Theoretical aspects of evolutionary computing. Springer, 2001, pp. 175–206.
-  D. C. Montgomery, D. C. Montgomery, and D. C. Montgomery, Design and analysis of experiments. Wiley New York, 1984, vol. 7.
-  C. R. Reeves, “Experiments with tuneable fitness landscapes,” in Parallel Problem Solving from Nature PPSN VI. Springer, 2000, pp. 139–148.
-  C. R. Reeves and C. C. Wright, “Epistasis in genetic algorithms: An experimental design perspective,” in Proceedings of the 6th International Conference on Genetic Algorithms. Morgan Kaufmann Publishers Inc., 1995, pp. 217–224.
-  ——, “An experimental design perspective on genetic algorithms,” in Foundations of Genetic Algorithms 3, 1995.
-  E. Weinberger, “Correlated and uncorrelated fitness landscapes and how to tell the difference,” Biological cybernetics, vol. 63, no. 5, pp. 325–336, 1990.
-  V. K. Vassilev, T. C. Fogarty, and J. F. Miller, “Information characteristics and the structure of landscapes,” Evolutionary Computation, vol. 8, no. 1, pp. 31–60, 2000.
-  N. Manukyan, M. J. Eppstein, and J. D. Horbar, “Team learning for healthcare quality improvement,” IEEE Access, vol. 1, pp. 545–557, 2013.
-  K. Johnell and I. Klarin, “The relationship between number of drugs and potential drug-drug interactions in the elderly: A study of over 600000 elderly patients from the swedish prescribed drug register,” Drug Safety, vol. 30, no. 10, pp. 911–918, 2007.
-  A. Dechartres, I. Boutron, L. Trinquart et al., “Single-center trials show larger treatment effects than multicenter trials: Evidence from a meta-epidemiologic study,” Annals of internal medicine, vol. 155, no. 1, p. 39, 2011.
-  J. H. Moore, “The ubiquitous nature of epistasis in determining susceptibility to common human diseases,” Human heredity, vol. 56, no. 1-3, pp. 73–82, 2003.
-  M. Eppstein and P. Hines, “A random chemistry; algorithm for identifying collections of multiple contingencies that initiate cascading failure,” IEEE Transactions on Power Systems, vol. 27, no. 3, pp. 1698–1705, 2012.
-  M. J. Eppstein and P. Haake, “Very large scale relieff for genome-wide association analysis,” in IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 2008, pp. 112–119.
-  R. J. Urbanowicz and J. H. Moore, “The application of michigan-style learning classifiersystems to address genetic heterogeneity and epistasisin association studies,” in Proceedings of the 12th annual conference on Genetic and evolutionary computation. ACM, 2010, pp. 195–202.
-  T. Jones and S. Forrest, “Fitness distance correlation as a measure of problem difficulty for genetic algorithms.” in ICGA, vol. 95. Citeseer, 1995, pp. 184–192.
-  P. Caamaño, A. Prieto, J. A. Becerra, F. Bellas, and R. J. Duro, “Real-valued multimodal fitness landscape characterization for evolution,” in Neural Information Processing. Theory and Algorithms. Springer, 2010, pp. 567–574.
-  J. Rönkkönen, X. Li, V. Kyrki, and J. Lampinen, “A framework for generating tunable test functions for multimodal optimization,” Soft Computing, vol. 15, no. 9, pp. 1689–1706, 2011.
-  D. Thierens and P. A. Bosman, “Hierarchical problem solving with the linkage tree genetic algorithm,” in Proceeding of the fifteenth annual conference on Genetic and evolutionary computation conference. ACM, 2013, pp. 877–884.