An Empirical Approach For Probing the Definiteness of Kernels*^{1}
Abstract
Models like support vector machines or Gaussian process regression \addedoften require positive semidefinite kernels. \addedThese kernels may be based on distance functions. While definiteness is proven for common distances and kernels, a proof for a new kernel may require too much time and effort for users who simply aim at practical usage. Furthermore, designing definite distances or kernels may be equally intricate. Finally, models can be enabled to use indefinite kernels. This may deteriorate the accuracy or computational cost of the model. Hence, an efficient method to determine definiteness is required. We propose an empirical approach. We show that sampling as well as optimization with an evolutionary algorithm may be employed to determine definiteness. We provide a proofofconcept with 16 different distance measures for permutations. \addedOur approach allows to disprove definiteness if a respective counterexample is found. It can also provide an estimate of how likely it is to obtain indefinite kernel matrices. This provides a simple, efficient tool to decide whether additional effort should be spent on designing/selecting a more suitable kernel or algorithm.
Keywords:
Definiteness Kernel Distance Sampling Optimization Evolutionary Algorithm∎
1 Introduction
The definiteness of kernels and distances is an important issue in statistics and machine learning (Feller 1971; Vapnik 1998; Schölkopf 2001). One application that recently gained interest is the field of surrogate modelbased combinatorial optimization (Moraglio and Kattan 2011; Zaefferer et al. 2014b; BartzBeielstein and Zaefferer 2017). Continuous distance measures are replaced by distance measures that are adequate for the respective search space (e.g., permutation distances or string distances). Such a measure will have an effect on the definiteness of the employed kernel function. For arbitrary problems, practitioners may come up with any kind of suitable distance measure or kernel.
While it is easy to determine definiteness of matrices, determining the definiteness of a function is not as simple. Proving definiteness by theoretical means may be infeasible in practice (Murphy 2012, p. 482; Ong et al. 2004). It may be equally difficult to design a function to be definite. Finally, algorithms may be adapted to handle indefinite kernels. These adaptations usually have a detrimental impact on the computational effort or accuracy of the derived model. Hence, this study tries to answer the following two research questions:

Discovery: Is there an efficient, empirical approach to determine the definiteness of kernel functions based on arbitrary distance measures?

Measurability: If can be answered affirmatively, \addedcan we quantify to what extent a lack of definiteness is problematic?
tries to find an answer to the general question of whether or not a function is definite. \addedMeasurability () is important, as this may allow \addeddetermining the impact that indefiniteness has in practice. For instance, if a kernel rarely produces indefinite matrices, an optimization or learning process that explores only a small subset of the search space may not be negatively affected. Therefore, this article proposes two approaches.

Sampling: Random sampling is used to determine the proportion of solution sets with indefinite distance or kernel matrices for a given setting.

Optimization: Maximizing the largest eigenvalue related to a certain solution set with an Evolutionary Algorithm (EA), hence finding indefinite cases even when they are rare.
If \addedeither approach detects an indefinite matrix, the respective kernel function is demonstrated to be indefinite. On the other hand, if no indefinite matrix is detected, definiteness of the function is not proven. Still, this indeterminate result may indicate that indefiniteness is at least unlikely to occur. Hence, the function may be treated as unproblematic in practical use.
Section 2 provides the background of the methods presented in Section 3. The experimental setup for a proofofconcept, based on permutation distance measures, is described in Section 4. Results of the experiments are analyzed and discussed in Section 5. Finally, a summary of this work as well as an outlook on future research directions is given in Section 6.
2 Background: Distances, Kernels and Definiteness
2.1 Distance Measures
Distance measures compute the dissimilarity of two objects , where we do not assume anything about the nonempty set . Such objects can \addedbe, e.g., permutations, trees, strings, or vectors of real values. Thus, a distance measure expresses a scalar, numerical value that should become larger the more distinct the objects and are. For a set of objects, the distance matrix of dimension collects all pairwise distances with and . Intuitively, distances can be expected to satisfy certain conditions, e.g., they should be zero when comparing identical objects.
A more formal definition is implied by the term distance metric. A distance metric is symmetric , nonnegative preserves identity and satisfies the triangle inequality Distance measures that do not preserve identity are often called pseudometrics.
An important class of distance measures are edit distance measures. Edit distance measures can be defined to count the minimal number of edit operations required to transform one object into another. An edit distance measure may concern one specific edit operation (e.g., only swaps) or a set of different operations (e.g., Levenshtein distance with substitutions, deletions, insertions). Edit distances usually satisfy the metric axioms.
2.2 Kernels
In the following, a kernel (also: kernel function, similarity measure or correlation function) is defined as a real valued function with
(1) 
that will usually be symmetric and nonnegative (Murphy 2012, p. 479). Kernels can be based on distance measures, i.e., .
2.3 Definiteness of Matrices
One important property of kernels and distance measures is their definiteness. We refer to the literature for more indetail descriptions and proofs, which are the basis for the following paragraphs (Berg et al. 1984; Schölkopf 2001; Camastra and Vinciarelli 2008).
First, we introduce the concept of matrix definiteness. A symmetric, square matrix of dimension () is positive definite (PD) if and only if
for all . This is equivalent to all eigenvalues of the matrix being positive. Due to symmetry, the eigenvalues are . Respectively, a matrix is negative definite (ND) if all eigenvalues are negative. If eigenvalues are nonnegative (i.e., some are zero) or nonpositive, the matrix is respectively called Positive or Negative SemiDefinite (PSD, NSD). If mixed signs are present in the eigenvalues, the matrix may be called indefinite. Kernel (or correlation, covariance) matrices are examples of matrices that have to be PSD.
A broader class of matrices are Conditionally PSD or NSD (CPSD, CNSD). Here, the coefficients satisfy
(2) 
with . All PSD (NSD) matrices are CPSD (CNSD). To check conditional definiteness, let the matrix be
with , and . Then, is CNSD if and only if
(3) 
is NSD (Ikramov and Savel’eva 2000, Algorithm 1). Here, is the leading principal submatrix of , that is, the last column and row of are removed.
2.4 Definiteness of Kernel Functions
In a similar way to the definiteness of matrices, definiteness can also be determined for kernel functions. The upcoming description roughly follows the definitions and notations by Berg et al. (1984) and Schölkopf (2001). For the nonempty set , a symmetric kernel is called PSD if and only if
for all , and . A PSD kernel will always yield PSD kernel matrices.
An important special case are conditionally definite functions. Analogous to the matrix case, they observe the respective condition in equation (2). One example of a CNSD function is the Euclidean distance. The importance of CNSD functions is also due to the fact that the distance measure is CNSD if and only if the kernel is PSD (Schölkopf 2001, Proposition 2.28).
It is often stated that kernels must be PSD (Rasmussen and Williams 2006; Curriero 2006). Still, even an indefinite kernel function may yield a PSD kernel matrix. This depends on the specific data set used to train the model (Burges 1998); (Li and Jiang 2004, Theorem 2) as well as the parameters of the kernel function. Some frequently used kernels are known to be indefinite. Examples are the sigmoid kernel (Smola et al. 2000; CampsValls et al. 2004) or timewarp kernels for time series (Marteau and Gibet 2014).
To handle the issue of a kernel’s definiteness, different (not mutually exclusive) approaches can be found in the literature.

Designing: Functions can be designed to be definite (Haussler 1999; Gärtner et al. 2003; Marteau and Gibet 2014). Especially noteworthy are the so called convolution kernels (Haussler 1999), as they provide a method to construct PSD kernels for structured data. For a similar purpose, Gärtner et al. (2004) show how to design a syntax based PSD kernel for structured data. However, convolution kernels may be hard to design (Gärtner et al. 2004). Also, kernels and distance measures may be predetermined for a certain application.

Adapting: Algorithms or kernel functions may be adapted to \addedbe usable despite a lack of definiteness. This, however, may affect the computational effort or accuracy of the derived model. Some approaches alter matrices (or rather, their eigenspectrum), hence enforcing PSDness (Wu et al. 2005; Chen et al. 2009; Zaefferer and BartzBeielstein 2016). For the case of SVMs, Loosli et al. (2015) provide a nice comparison of various approaches of this type and propose an interesting new solution to the issue of indefinite kernels based on learning in Krein spaces. A recent survey is given by Schleif and Tino (2015).
Between these three approaches, there is a lack of straightforward empirical procedures, \addedwithout resorting to complex theoretical reasoning. How can the definiteness of a function be determined? And what impact does a lack of definiteness have on a model?
Hence, we propose the two related empirical approaches and introduced in Sec. 1 to fill the gap. An empirical approach may help to overcome the difficulty of theoretical considerations or designed kernels. Empirical results may also be a starting point for a more formal approach. Furthermore, it may give a quick answer on whether or not the algorithm will have to be adapted for nonPSD matrices (which, if applied by default, would require additional computational effort and may limit the accuracy of derived models).
3 Methods for Estimating Definiteness
We propose an experimental approach to determine and analyze definiteness (, ). As a test case, we determine the definiteness of a distancebased exponential kernel, . The kernel is definite if the underlying distance function is CNSD. For a given distance matrix, CNSDness is determined by the largest eigenvalue \added of , based on equation (3). is not CNSD if . We could also probe the kernel matrix , but in this case the kernel parameter would have to be dealt with.
Of course, we cannot simply check definiteness of a single matrix , since this would be only one possible outcome of the respective kernel or distance function. Hence, a large number of solution sets with respective distance matrices has to be generated to determine whether any \addedof the matrices are CNSD (research question : discovery) and to what extent this may affect a model (: measurability). For smaller, finite spaces a brute force approach may be viable. All potential matrices can be enumerated and checked for CNSDness. Since this quickly becomes computational infeasible, we propose to use sampling or optimization instead.
3.1 Estimating Definiteness with Random Sampling
To estimate the definiteness of a distance or kernel function we propose a simple random sampling approach (). This approach randomly generates sets . Each set has size , that is, it contains candidate samples .
For each set, the distance matrix is computed, containing distances between all candidates in the set. Based on this, is derived from equation (3). Then, the largest eigenvalue of is computed. This eigenvalue determines whether is NSD, and hence whether is CNSD and PSD. This is repeated for all sets. The number of times that the largest eigenvalue is positive () is retained as . Accordingly, the proportion of nonCNSD matrices is determined with
Obviously, all distance measures \addedthat yield are proven to be nonCNSD. Hence, an exponential kernel based on these measures is also proven to be indefinite. If , CNSDness is not proven or disproven.
In general, the proposed method can be categorized as a randomized algorithm of the complexity class RP (Motwani and Raghavan 1995, p. 21f.). That is, it stops after polynomially many steps, and if the output is “no” then the distance measure is nonCNSD with probability 1, and if the output is “yes” then the distance measure is CNSD with some probability strictly bounded from zero.
The parameter is an estimator of how likely a nonCNSD matrix is to occur, for the specified set size . To determine definiteness, the calculation of \addedof is not mandatory, but it may be useful to see how close to zero is, to distinguish between a pathological case and cases where the matrix is just barely nonCNSD. \addedWe will show in Section 5.3 that \addedof can be linked to model quality.
Note, that inaccuracies of the numerical algorithm used to compute the eigenvalues might lead to an erroneous sign of the largest eigenvalue. To deal with that, one could try to use exact or symbolic methods or else use a tolerance when checking \addedwhether the largest eigenvalue is larger than zero. In the latter case, a matrix is assumed to be nonNSD if , where is a small positive number.
3.2 Estimating Definiteness with Directed Search
If very few sets yield indefinite matrices, may fail to find indefinite matrices by pure chance. In such cases, it may be more efficient to replace random sampling with a directed search (). In detail, a set can itself be viewed as a candidate solution of an optimization problem. The largest eigenvalue of the transformed distance matrix is the objective to be maximized. By maximizing the largest eigenvalue, a positive may be found more quickly (and more reliably).
This optimization problem is strongly dependent on the kind of solution representation used. Evolutionary Algorithms (EAs) are a good choice to solve this problem, because they are applicable to a wide range of solution representations (e.g., real values, strings, permutations, graphs, and mixed \addedsearch spaces). EAs use principles derived from natural evolution for the purpose of optimization. That is, EAs are optimization algorithms based on a cyclic repetition of parent selection, recombination, mutation, and fitness selection (see e.g., Eiben and Smith (2003)). These operations can be adapted to a large variety of representations, mainly depending on suitable mutation and recombination operators. The EA in this study will operate as follows:

Individual: . A set with set size is considered as an individual. Set elements are samples in the actual search or input space, as used throughout Sec. 2.

Search space: . All possible sets of size , i.e., .

Population: . A population of size , containing with and .

Objective Function:
(4) where is the largest eigenvalue of the transformed distance matrix based on equation (3). The objective function is maximized.

Mutation: Alteration of an individual.
, with . For the submutation function, any edit operation that works for a sample can be chosen: .
For example, in case of permutations, one permutation is chosen and mutated with typical permutation editoperations (swap, interchange, reversal). The specific editoperation is called submutation operator, to distinguish between mutation of the individual set and the submutation of a single permutation . 
Recombination: Combining two sets. For recombination, two sets are randomly split and the parts of both sets are joined to form a new set of the same size.

Repair: Duplicate removal. Mutation and recombination may create duplicates ( with ). In practice, duplicates are not desirable and are irrelevant to the question of definiteness. Hence, duplicates are replaced by randomly generated, unique samples .

Stopping criterion: Indefiniteness proven or budget exhausted. The optimization can stop when some solution set is found which yields , where is a small positive number. Alternatively, the process stops if a budget of objective function evaluations is exhausted.
4 Experimental Validation
The proposed approaches can be useful in any case where definiteness of kernels is of interest. The experiments provide a proof of concept of the proposed approaches. Hence, we chose to pick a recent application as a motivation for our experiments: surrogatemodel based optimization in permutation spaces (Moraglio and Kattan 2011; Zaefferer et al. 2014a).
In many realworld optimization problems, objective function evaluations are expensive. Sequential modeling and optimization techniques are stateoftheart in these settings (BartzBeielstein and Zaefferer 2017). Typically, an initial model is built at the first stage of the process. The model will be subsequently refined by adding further data until the budget is exhausted. At each stage of this sequential process, available information from the model is used to determine promising new candidate solutions. This motivates the rather small data set sizes used throughout this study.
4.1 Test Case: Permutations
As a proofofconcept, we selected 16 distance measures
for permutations; see Table 1 for a complete list.
The implementation of these distance measures is taken from the Rpackage CEGO
Similarly to Schiavinotto and Stützle (2007) we define as the set of all permutations of the numbers . A permutation has exactly elements. We denote a single permutation with and where is a specific element of the permutation at position . For example, a permutation in this notation is . Explanations and formulas (where applicable) for the distance measures are given in appendix A.
name  complexity  metric  abbreviation 

Levenshtein  yes  Lev  
Swap  yes  Swa  
Interchange  yes  Int  
Insert  yes  Ins  
LC Substring  yes  LCStr  
R  yes  R  
Adjacency  pseudo  Adj  
Position  yes  Pos  
Position  no  Posq  
Hamming  yes  Ham  
Euclidean  yes  Euc  
Manhattan  yes  Man  
Chebyshev  yes  Che  
Lee  yes  Lee  
Cosine  no  Cos  
Lexicographic  yes  Lex 
4.2 Random Sampling
In a single experiment, sets of permutations are randomly generated. Each set contains permutations and each permutation has elements. For each set, the largest eigenvalue of is computed based on equation (3). To summarize all sets, the largest as well as the ratio are recorded. The tolerance value used to check whether the largest eigenvalue is positive is =1e10. This process is repeated 10 times, to achieve a reliable estimate of the recorded values.
Two batches of experiments are performed. In the first, all 16 distance measures are \addedexamined, with and . In the second batch, larger sizes are tested, but the permutations are restricted to and the distance \addedmeasures are only LCStr, Insert, Chebyshev, Levenshtein and Interchange.
4.3 Directed Search
To be comparable to the random sampling approach, the budget for each EA run is fitness function evaluations. A run will stop if the budget is exhausted or if . The population size of the EA is set to 100. The recombination rate is 0.5, the mutation rate is and truncation selection is used.
To identify bias introduced by the choice of \addedthe submutation operator (which may have a strong interaction with the respective distance measures), each EA run is performed repeatedly with three different submutation operators:

Swap mutation: Transposing two adjacent elements of the permutation.
with \added and .

Interchange mutation: Transposing two arbitrary elements of the permutation.
with and .

Reversal mutation: Reversing a substring of the permutation.
with .
All 16 distance measures are
tested, with
and . With ten repeats, and the three different
submutation operators, this results into EA runs, each with fitness function evaluations.
The employed EA implementation is part of the Rpackage CEGO.
4.4 Tests For Other Search Domains
To show that the proposed approach is not limited to the presented permutation distance example, we also briefly explore other search domains and their respective distances. \addedHowever, these are not analyzed in further detail. Instead, we provide a list of minimal examples in Appendix B: the smallest (w.r.t. dimension) indefinite distance matrix for each tested distance measure. The examples include distance measures for permutations, signed permutations, trees, and strings.
5 Observations and Discussion
5.1 Sampling Results
The proportions of sets with positive eigenvalues () are summarized in Fig. 1. The largest eigenvalue\addeds are depicted in Fig. 2. Only the five indefinite distance measures, which achieved positive eigenvalues are shown:
Longest Common Substring, Insert, Chebyshev, Levenshtein, Interchange.
No counterexamples are found for the remaining eleven measures. That does not prove that \addedthey are CNSD (although some are CNSD, e.g., Euclidean distance, Swap distance (Jiao and Vert 2015), Hamming distance (Hutter et al. 2011)), but indicates that it may be unproblematic to use them in practice. Some of the five nonCNSD distance measures were reported to work well in a surrogatemodel optimization framework, e.g., Levenshtein distance seemed to work well for modeling of scheduling problems (Zaefferer et al. 2014a). This is mainly due to the fact, that \addedeven a nonCNSD distance may yield PSD kernel matrix , depending on the specific data set and kernel parameters used. We do not suggest that nonCNSD distance measures should be avoided, \addedbut that their application should be handled with care.
Regarding \addedvalues of (Fig. 1), some trends can be observed. For \addedindefinite distance measures, increasing the \addedset size () will in general lead to larger values of . Obviously, a larger set is more likely to contain combinations of samples that yield negative eigenvalues. In addition, the lower bound for eigenvalues decreases with increasing matrix size (Constantine 1985).
In contrast to the set size, increasing the number of permutation elements () decreases the proportion of positive eigenvalues in all five cases. This can be attributed to a larger and hence more difficult search space. Overall, none of the distance measures shows exactly the same behavior. LCStr distance has the least problematic behavior. Only very few sets (of comparatively large size) yielded positive eigenvalues with LCStr distance. Interchange, Levenshtein and Insert distance all have relatively large for small set sizes . Chebyshev on the other hand, starts to have nonzero for relatively large . However, the number of permutation elements has only a weak influence in case of Chebyshev distance. Hence, curves for different are much closer to each other, compared to the other distance measures. Somewhat analogous to , the largest eigenvalues of plotted in Fig. 2 are generally increasing for larger , and decreasing with larger .
Our findings are confirmed by some results from literature. Cortes et al. (2004) have shown that an exponential kernel function based on the Levenshtein distances is indefinite for strings of more than one symbol. Our experiments show that this result can be easily rediscovered empirically, for the case of permutations. At the same time, these findings also confirm (and provide reasons for) problems observed with these kinds of kernel functions in a previous study (Zaefferer et al. 2014a).
As a consistency check, Table 2 compares the sampling results to a brute force approach for and . It shows that the sampling indeed approximates the number of nonCNSD matrices quite well. In this small set, the sampling identified all combinations of distance measure and that may yield nonCNSD matrices.
n  distance  true  estimate  

5  Insert  42,504  0.047  0.048 
6  Insert  134,596  0.221  0.219 
7  Insert  346,104  0.530  0.529 
8  Insert  735,471  0.827  0.825 
5  Interchange  42,504  0.106  0.105 
6  Interchange  134,596  0.465  0.463 
7  Interchange  346,104  0.833  0.834 
8  Interchange  735,471  0.978  0.978 
5  Levenshtein  42,504  0.087  0.087 
6  Levenshtein  134,596  0.293  0.293 
7  Levenshtein  346,104  0.591  0.589 
8  Levenshtein  735,471  0.847  0.846 
5  LCStr  42,504  0.002  0.002 
6  LCStr  134,596  0.007  0.007 
7  LCStr  346,104  0.026  0.026 
8  LCStr  735,471  0.093  0.092 
5.2 Optimization Results
The average number of fitness function evaluations (i.e., number of times \addedof is computed) required to find a matrix with positive is depicted in Fig. 3.
The optimization results show similar behavior with respect to and as the sampling approach. Increasing leads to an increased number of fitness function evaluations. That means, finding positive eigenvalues becomes more difficult with increasing values of . Increasing reduces the number of required fitness function evaluations. That is, finding positive eigenvalues becomes \addedeasier. In some cases, this effect disappears for large values of , e.g., for LCStr distance, where the average is more or less constant over , if is large enough.
Importantly, the comparison to the sampling results clearly shows that the EA has some success in optimizing the largest eigenvalue of the transformed distance matrix . In several cases, positive eigenvalues are found by the EA while sampling with the same budget failed to find any. \addedHence, it can be assumed that \addedthe fitness landscape based on \addedof is sufficiently smooth to allow for optimization. \addedThe eigenvalue seems to be a good indicator of how close a solution set is to yielding a\addedn indefinite kernel matrix.
Furthermore, the expected bias of the used submutation operator becomes visible. For Insert and LCStr distance, the EA with swap mutation works considerably better than the other two variants. Hence, comparisons of these values across different distance measures should \addedbe handled with caution. Clearly, other aspects of the optimization algorithm (e.g., selection criteria or recombination operators) might have similar effects. While this bias is troubling, results may still offer interesting insights. The eigenvalue optimization could be interpreted as a worstcase scenario that occurs if an iterative learning process strongly correlates with the eigenvalues of the employed distance matrix.
5.3 Verification: Impact on Model Quality
\addedEarlier, we discussed two values that may express the effect of the lack of definiteness in practice, i.e., and of . But what do these values imply?
The value can be seen as a probability of generating indefinite matrices. If we assume that a model is unable to deal with indefinite data, the fraction is an estimate of how likely a modeling failure is. For other cases, it is very hard to link it to a model performance measure such as accuracy without making too many assumptions. We still argue that provides useful information, especially when the kernel is designed and probed before sampling any data (e.g., when planning an experiment). We suggest to use to support an initial decision (e.g., whether to spend additional time on fixing or otherwise dealing with the indefinite kernel). One advantage is that it is rather easy to interpret.
In contrast, the parameter of is more difficult to interpret. But it has the advantage that it may be estimated for a single matrix as well as its average for a set of matrices. Hence, we want to determine whether the magnitude of this eigenvalue affects model performance. We expect an influence that depends on the choice of model. Consider, e.g., a Gaussian process regression model, as e.g., described by Forrester et al. (2008). The model may be able to mitigate the problematic eigenvalue by assigning larger values to the kernel . For very large and thus very large , this will lead to kernel matrices that approximate the unit matrix, which is positive definite. A model with a unit kernel matrix would be able to reproduce the training data, but would predict the process mean for most other data points. Hence, we examine Gaussian process regression models, since they provide a transparent and interpretable test case (but similar experiments could easily be made with support vector regression).
An experimental test has to consider the potential bias of the used data set. We need to be able to reasonably assume that differences in performance are actually due to the properties of employed distance or kernel (i.e., a kernel performs poorly because the corresponding of is high) rather than properties of the data set (i.e., a kernel performs poorly because it does not fit well to the ground truth of the data set). To that end, we suggest that observations in a test data set are derived from the same distances that are used in the model.
Hence, we randomly created data sets of size with permutations of dimension , similarly to the random sampling performed earlier. Then, we created training observations by evaluating the distance of each permutation in to a reference permutation , i.e., . A Gaussian process model was then trained with this data, largely following the descriptions in Forrester et al. (2008). The model was trained with the kernel , and the model parameters (e.g., ) were determined by maximum likelihood estimation, via the locally biased version of the DIviding RECTangles (DIRECT) algorithm (Gablonsky and Kelley 2001) with 1,000 likelihood evaluations. For each test, the distance chosen to produce the observations and the distance chosen in the kernel were identical.
The Root Mean Square Error (RMSE) of the model was evaluated on 1000 randomly chosen permutations. The resulting RMSE values for each training set , as well as the corresponding eigenvalue of are shown in Fig. 4. The graphic shows a trend that confirms our expectation. It seems that distances associated to larger tend to produce larger errors.
6 Summary and Outlook
The focus of this study was the definiteness of kernel and distance measures. Definiteness is a main requirement for modeling techniques like Gaussian processes or SVMs. Distancebased kernels with unknown definiteness may be promising choices for certain parameter spaces. Yet, their definiteness may be very hard to prove or enforce.
It was found, that empirical approaches (based on sampling or optimization) may help to assess definiteness of the respective function. In detail, two research questions were investigated:

Discovery: Is there an efficient, empirical approach to determine the definiteness of kernel functions based on arbitrary distance measures?

Measurability: If can be answered affirmatively, \addedcan we quantify to what extent a lack of definiteness is problematic?
Two empirical approaches were suggested towards that end. The first approach () samples from the space of solution sets, and determines \addedwhether a set is found which leads to an indefinite distance or kernel matrix. If indefinite matrices are rare, a directed search with an EA is more successful (). The EA maximizes the largest eigenvalue of a transformed distance matrix , respectively minimizes the smallest eigenvalue of a kernel matrix. Hence, the EA searches for sets \addedthat yield indefinite matrices.
As a proofofconcept, the approaches were applied to distance measures for permutations. It was shown that five problematic distance measures could be identified: Longest Common Substring (LCStr), Insert, Chebyshev, Levenshtein, and Interchange distance. Information known from literature (regarding indefiniteness of the respective kernel function) could be rediscovered by the empirical approaches.
The optimization approach was successful, as it was able to outperform the sampling approach in discovering sets with indefinite kernel matrices. Still, the results also indicated that the choice of variation operators in the optimization algorithm does introduce bias. Hence, the respective results do not allow a conclusion about the \addedimpact of \addeda lack of definiteness of the respective sets/matrices. Still, the success of the EA indicates that the fitness landscape posed by the largest eigenvalue is not excessively rugged and has an exploitable structure. This suggests that the largest eigenvalue is a good indicator of how far a certain solution set (and the respective distance or kernel matrix) is from becoming indefinite. \addedIn an additional set of experiments, we further verified that increasing the largest eigenvalue can in fact be linked to a decrease in model quality. This results into the following responses to the posed research questions:
 R1

Discovery: Sampling from the space of potential candidate solution sets allows identifying problems with definiteness, by identifying solution sets that lead to nonCNSD distance matrices (). Where such situations are rare (hence more likely to be missed by the sampling), an optimization approach may \addedbe more successful (). While neither approach nor are able to prove definiteness, both are able to disprove it. If no negative results are found it is reasonable to assume that using the respective distance/kernel function is feasible.
 R2

Measurability: The sampling approach () yields a proportion of potentially nonCNSD matrices, which in turn yields an estimate of how problematic a distance measure is. In a similar way, yet potentially biased by the choice of optimization algorithm, the number of evaluations required by the optimization approach gives a similar estimate. In addition, the success of the optimization approach () suggests that the respective largest eigenvalue is an indicator of how close certain sets (and respective distance or kernel matrices) are to becoming indefinite. \addedAdditional experiments showed how this eigenvalue could be linked to model performance.
For future research, it may be of interest to allow the EA to change the set size. Clearly, one issue would be that enlarging the sets may quickly lead to a trivial solution, since larger sets naturally lead to larger \addedof . Hence, there is a tradeoff between \addedthe largest eigenvalue and \addedthe set size. A multiobjective EA (e.g. NSGAII (Deb et al. 2002) or SMSEMOA (Beume et al. 2007)) may be used to handle this issue by simultaneously maximizing and minimizing the set size .
Finally, the herein described kernels and distances are not the full story. For other kernels, the relation between distance measure and kernel function may not be as straightforward. Parameters of the distance measure or the kernel function could complicate the situation. It may be necessary to adapt the proposed method to, e.g., include parameters in the sampling and optimization procedures.
Compliance with ethical standards
Conflicts of Interest The authors declare that they have no conflict of interest.
Appendix A: Distance Measures for Permutations
In the following, we describe the distance measures employed in the experiments.

The Levenshtein distance is an edit distance measure:
Here, is the minimal number of deletions, insertions, or substitutions required to transform one string (or here: permutation) into another string . The implementation is based on Wagner and Fischer (1974).

Swaps are transpositions of two adjacent elements. The Swap distance (also: Kendall’s Tau (Kendall and Gibbons 1990; Sevaux and Sörensen 2005) or Precedence distance (Schiavinotto and Stützle 2007)) counts the minimum number of swaps required to transform one permutation into another. For permutations, it is (Sevaux and Sörensen 2005):

An interchange operation is the transposition of two arbitrary elements. Respectively, the Interchange (also: Cayley) distance counts the minimum number of interchanges () required to transform one permutation into another (Schiavinotto and Stützle 2007):

The Insert distance is based on the longest common subsequence . The longest common subsequence is the largest number of elements that follow each other in both permutations, with interruptions. The corresponding distance is
We use the algorithm described by Hirschberg (1975). The name is due to its interpretation as an edit distance measure. The corresponding edit operation is a combination of insertion and deletion. A single element is moved from one position (delete) to a new position (insert). It is also called Ulam’s distance (Schiavinotto and Stützle 2007).

The Longest Common Substring distance is based on the largest number of elements that follow each other in both permutations, without interruption. Unlike the longest common subsequence all elements have to be adjacent.
If is the length of the longest common string, the distance is

The nonmetric Squared Position distance is Spearman’s rank correlation coefficient (Sevaux and Sörensen 2005). In contrast to the Position distance, the term is replaced by .

The Hamming distance or Exact Match distance simply counts the number of unequal elements in two permutations, i.e.,

The Euclidean distance is
.

The Chebyshev distance is
.

The nonmetric Cosine distance is based on the dot product of two permutations. It is derived from the cosine similarity (Singhal 2001) of two vectors:

The Lexicographic distance regards the lexicographic ordering of permutations. If the position of a permutation in the lexicographic ordering of all permutations with fixed is , then the Lexicographic distance metric is
Appendix B: Minimal Examples for Indefinite Sets
To showcase the usefulness of the proposed methods, this section lists small example data sets and the respective indefinite distance matrices. Besides the standard permutation distances we also tested:

Signed permutations, reversal distance: Permutations where each element has a sign are referred to as signed permutations. An application example for signed permutations is, e.g., weld path optimization (Voutchkov et al. 2005). The reversal distance counts the number of reversals required to transform one permutation into another. We used the noncyclic reversal distance provided in the GRAPPA library version 2.0 (Bader et al. 2004).

Labeled trees, tree edit distance: Trees in general are widely applied as solution representation, e.g., in Genetic Programming. In this study, we considered labeled trees. The tree edit distance counts the number node insertions, deletions or relabels. We used the efficient implementation in the APTED 0.1.1 library (Pawlik and Augsten 2015, 2016). The labeled trees will be denoted with the bracket notation: curly brackets indicate the tree structure, letters indicate labels (internal and terminal nodes).

Strings, Optimal String Alignment distance (OSA): The OSA is an nonmetric edit distance that counts insertions, deletions, substitutions and transpositions of characters. Each substring can be edited no more than once. It is also called the restricted DamerauLevenshtein distance (Boytsov 2011). We used the implementation in the stringdist R package (van der Loo 2014).

Strings, JaroWinkler distance: The Jaro Winkler distance is based on the number of matching characters in two strings as well as the number of transpositions required to bring all matches in the same order. We used the implementation in the stringdist R package (van der Loo 2014).
The respective results are listed in Table 3. All of the listed distance measures are shown to be nonCNSD.
Permutations, Insert, , , 0.090  

1  0  
2  0  
3  0  
4  0  
5  0  
Permutations, Interchange, , , 0.090  
1  0  
2  0  
3  0  
4  0  
5  0  
Permutations, Levenshtein, , , 0.135  
1  0  
2  0  
3  0  
4  0  
5  0  
Permutations, LCStr, , , 0.023  
1  0  
2  0  
3  0  
4  0  
5  0  
Permutations, Chebyshev, , , 0.034  
1  0  
2  0  
3  0  
4  0  
5  0  
Sign. Permutations, Reversal, , , 0.016  
1  0  
2  0  
3  0  
4  0  
5  0  
Labeled Trees, Edit dist., , 0.026  
1  0  
2  0  
3  0  
4  0  
5  0  
Strings, Optimal String Alignment, , 0.102  
1  abc  0  
2  acc  0  
3  cba  0  
4  caa  0  
5  bac  0  
Strings, JaroWinkler, , 0.046  
1  bbbb  0  
2  aaaa  0  
3  bbba  0  
4  aaab  0 
Footnotes
 thanks: *preprint submitted to Soft Computing journal, Springer
 email: Martin.Zaefferer@thkoeln.de
 email: Martin.Zaefferer@thkoeln.de
 email: Martin.Zaefferer@thkoeln.de
 journal: Soft Computing
 The package CEGO is available on CRAN at http://cran.rproject.org/package=CEGO.
References
 Bader, D. A., Moret, B. M., Warnow, T., Wyman, S. K., Yan, M., Tang, J., Siepel, A. C., & Caprara, A. (2004). Genome rearrangements analysis under parsimony and other phylogenetic algorithms (grappa) 2.0. Online: https://www.cs.unm.edu/ moret/GRAPPA/. accessed: 16.11.2016.
 BartzBeielstein, T. & Zaefferer, M. (2017). Modelbased methods for continuous and discrete global optimization. Applied Soft Computing, 55:154 – 167.
 Berg, C., Christensen, J. P. R., & Ressel, P. (1984). Harmonic Analysis on Semigroups, volume 100 of Graduate Texts in Mathematics. Springer New York.
 Beume, N., Naujoks, B., & Emmerich, M. (2007). SMSEMOA: Multiobjective selection based on dominated hypervolume. European Journal of Operational Research, 181(3):1653–1669.
 Boytsov, L. (2011). Indexing methods for approximate dictionary searching: Comparative analysis. J. Exp. Algorithmics, 16:1–91.
 Burges, C. J. (1998). A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121–167.
 Camastra, F. & Vinciarelli, A. (2008). Machine Learning for Audio, Image and Video Analysis: Theory and Applications. Advanced information and knowledge processing. Springer, London.
 Campos, V., Laguna, M., & Martí, R. (2005). Contextindependent scatter and tabu search for permutation problems. INFORMS Journal on Computing, 17(1):111–122.
 CampsValls, G., MartínGuerrero, J. D., RojoÁlvarez, J. L., & SoriaOlivas, E. (2004). Fuzzy sigmoid kernel for support vector classifiers. Neurocomputing, 62:501–506.
 Chen, Y., Gupta, M. R., & Recht, B. (2009). Learning kernels from indefinite similarities. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML ’09, (pp. 145–152), New York, NY, USA. ACM.
 Constantine, G. (1985). Lower bounds on the spectra of symmetric matrices with nonnegative entries. Linear Algebra and its Applications, 65:171–178.
 Cortes, C., Haffner, P., & Mohri, M. (2004). Rational kernels: Theory and algorithms. J. Mach. Learn. Res., 5:1035–1062.
 Curriero, F. (2006). On the use of noneuclidean distance measures in geostatistics. Mathematical Geology, 38(8):907–926.
 Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGAII. IEEE Transactions on Evolutionary Computation, 6(2):182–197.
 Deza, M. & Huang, T. (1998). Metrics on permutations, a survey. Journal of Combinatorics, Information and System Sciences, 23(14):173–185.
 Eiben, A. E. & Smith, J. E. (2003). Introduction to Evolutionary Computing. Springer Berlin Heidelberg.
 Feller, W. (1971). An Introduction to Probability Theory and Its Applications, Volume 2. JOHN WILEY & SONS INC.
 Forrester, A., Sobester, A., & Keane, A. (2008). Engineering Design via Surrogate Modelling. Wiley.
 Gablonsky, J. & Kelley, C. (2001). A locallybiased form of the direct algorithm. Journal of Global Optimization, 21(1):27–37.
 Gärtner, T., Lloyd, J., & Flach, P. (2003). Kernels for structured data. In Matwin, S. & Sammut, C., editors, Inductive Logic Programming, volume 2583 of Lecture Notes in Computer Science, pages 66–83. Springer Berlin Heidelberg.
 Gärtner, T., Lloyd, J., & Flach, P. (2004). Kernels and distances for structured data. Machine Learning, 57(3):205–232.
 Haussler, D. (1999). Convolution kernels on discrete structures. Technical Report UCSCCRL9910, Department of Computer Science, University of California at Santa Cruz.
 Hirschberg, D. S. (1975). A linear space algorithm for computing maximal common subsequences. Commun. ACM, 18(6):341–343.
 Hutter, F., Hoos, H. H., & LeytonBrown, K. (2011). Sequential modelbased optimization for general algorithm configuration. In Proc. of LION5, (pp. 507–523).
 Ikramov, K. & Savel’eva, N. (2000). Conditionally definite matrices. Journal of Mathematical Sciences, 98(1):1–50.
 Jiao, Y. & Vert, J.P. (2015). The Kendall and Mallows kernels for permutations. In Proceedings of the 32nd International Conference on Machine Learning (ICML15), (pp. 1935–1944).
 Kendall, M. & Gibbons, J. (1990). Rank Correlation Methods. Oxford University Press.
 Lee, C. (1958). Some properties of nonbinary errorcorrecting codes. IRE Transactions on Information Theory, 4(2):77–82.
 Li, H. & Jiang, T. (2004). A class of edit kernels for svms to predict translation initiation sites in eukaryotic mrnas. In Proceedings of the Eighth Annual International Conference on Resaerch in Computational Molecular Biology, RECOMB ’04, (pp. 262–271), New York, NY, USA. ACM.
 Loosli, G., Canu, S., & Ong, C. (2015). Learning SVM in Krein spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(6):1204–1216.
 Marteau, P.F. & Gibet, S. (2014). On recursive edit distance kernels with application to time series classification. IEEE Transactions on Neural Networks and Learning Systems, PP(99):1–1.
 Moraglio, A. & Kattan, A. (2011). Geometric generalisation of surrogate model based optimisation to combinatorial spaces. In Proceedings of the 11th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP’11, (pp. 142–154), Berlin, Heidelberg, Germany. Springer.
 Motwani, R. & Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press.
 Murphy, K. P. (2012). Machine Learning. MIT Press Ltd.
 Ong, C. S., Mary, X., Canu, S., & Smola, A. J. (2004). Learning with nonpositive kernels. In Proceedings of the Twentyfirst International Conference on Machine Learning, ICML ’04, (pp. 81–88), New York, NY, USA. ACM.
 Pawlik, M. & Augsten, N. (2015). Efficient computation of the tree edit distance. ACM Transactions on Database Systems, 40(1):1–40.
 Pawlik, M. & Augsten, N. (2016). Tree edit distance: Robust and memoryefficient. Information Systems, 56:157–173.
 Rasmussen, C. E. & Williams, C. K. I. (2006). Gaussian Processes for Machine Learning. The MIT Press.
 Reeves, C. R. (1999). Landscapes, operators and heuristic search. Annals of Operations Research, 86(0):473–490.
 Schiavinotto, T. & Stützle, T. (2007). A review of metrics on permutations for search landscape analysis. Computers & Operations Research, 34(10):3143–3153.
 Schleif, F.M. & Tino, P. (2015). Indefinite proximity learning: A review. Neural Computation, 27(10):2039–2096.
 Schölkopf, B. (2001). The kernel trick for distances. In Leen, T. K., Dietterich, T. G., & Tresp, V., editors, Advances in Neural Information Processing Systems 13, pages 301–307. MIT Press.
 Sevaux, M. & Sörensen, K. (2005). Permutation distance measures for memetic algorithms with population management. In Proceedings of 6th Metaheuristics International Conference (MIC’05), (pp. 832–838). University of Vienna.
 Singhal, A. (2001). Modern information retrieval: a brief overview. IEEE Bulletin on Data Engineering, 24(4):35–43.
 Smola, A. J., Ovári, Z. L., & Williamson, R. C. (2000). Regularization with dotproduct kernels. In Advances in Neural Information Processing Systems 13, Proceedings, (pp. 308–314). MIT Press.
 van der Loo, M. P. (2014). The stringdist package for approximate string matching. The R Journal, 6(1):111–122.
 Vapnik, V. N. (1998). Statistical Learning Theory, volume 1. Wiley New York.
 Voutchkov, I., Keane, A., Bhaskar, A., & Olsen, T. M. (2005). Weld sequence optimization: The use of surrogate models for solving sequential combinatorial problems. Computer Methods in Applied Mechanics and Engineering, 194(3033):3535–3551.
 Wagner, R. A. & Fischer, M. J. (1974). The stringtostring correction problem. J. ACM, 21(1):168–173.
 Wu, G., Chang, E. Y., & Zhang, Z. (2005). An analysis of transformation on nonpositive semidefinite similarity matrix for kernel machines. In Proceedings of the 22nd International Conference on Machine Learning.
 Zaefferer, M. & BartzBeielstein, T. (2016). Efficient global optimization with indefinite kernels. In Parallel Problem Solving from Nature–PPSN XIV, (pp. 69–79). Springer.
 Zaefferer, M., Stork, J., & BartzBeielstein, T. (2014a). Distance measures for permutations in combinatorial efficient global optimization. In BartzBeielstein, T., Branke, J., Filipič, B., & Smith, J., editors, Parallel Problem Solving from Nature–PPSN XIII, (pp. 373–383), Cham, Switzerland. Springer.
 Zaefferer, M., Stork, J., Friese, M., Fischbach, A., Naujoks, B., & BartzBeielstein, T. (2014b). Efficient global optimization for combinatorial problems. In Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, GECCO ’14, (pp. 871–878), New York, NY, USA. ACM.