Answers.Body: <p>A kernel function <span class="math-container">$f : \mathcal{X} \times \mathcal{X} \rightarrow \mathbb{R}$</span> is a valid support vector kernel if it is a Mercer kernel. Mercer's condition essentially ensures that the Gram matrix of the kernel is positive semi-definite. Interestingly, this ensures that the SVM objective is convex.</p>
  <p>The Euclidean distance function does not satisfy Mercer's condition since it's Gram matrix is not necessary positive semi-definite. Thus, it is not a valid kernel.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2020-06-19T07:36:12.400Z
Answers.LastActivityDate: 2020-06-19T07:36:12.400Z
Answers.UserDisplayName: dtorpey
Body: <p>For a kernel function, we have two conditions one is that it should be symmetric which is easy to understand intuitively because dot products are symmetric as well and our kernel should also follow this. The other condition is given below</p>
  <p>There exists a map <span class="math-container">$φ:R^d→H$</span> called kernel feature map into some high dimensional feature space H such that <span class="math-container">$∀x,x'$</span> in <span class="math-container">$R^d:k(x,x') = &lt;φ(x),φ(x')&gt;$</span></p>
  <p>I understand that this means that there should exist a feature map that will project the data from low dimension to any high dimension <span class="math-container">$D$</span> and kernel function will take the dot product in that space.</p>
  <p>For example, the Euclidean distance is given as</p>
  <p><span class="math-container">$d(x,y)=∑_i(x_i−y_i)^2=&lt;x,x&gt;+&lt;y,y&gt;−2&lt;x,y&gt;$</span></p>
  <p>If I look this in terms of second condition how do we know that doesn't exist any feature map for euclidean distance? What exactly are we looking in feature maps mathematically?</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2020-08-20T00:59:51.140Z
Comments.Text: Cross-posted: https://cs.stackexchange.com/q/127366/755, https://stats.stackexchange.com/q/472829/2921, https://ai.stackexchange.com/q/21994/1794.  Please [do not post the same question on multiple sites](https://meta.stackexchange.com/q/64068).
Comments.UserDisplayName: D.W.
Tags: <machine-learning><math><support-vector-machine><mapping-space>
Title: How to understand mapping function of kernel?
UserDisplayName: christopher
ThreadText: # How to understand mapping function of kernel?
  
  (Asked by: username_0 on 2020-06-18)
  
  For a kernel function, we have two conditions one is that it should be symmetric which is easy to understand intuitively because dot products are symmetric as well and our kernel should also follow this. The other condition is given below
  
  There exists a map $φ:R^d→H$ called kernel feature map into some high dimensional feature space H such that $∀x,x'$ in $R^d:k(x,x') = <φ(x),φ(x')>$
  
  I understand that this means that there should exist a feature map that will project the data from low dimension to any high dimension $D$ and kernel function will take the dot product in that space.
  
  For example, the Euclidean distance is given as
  
  $d(x,y)=∑\_i(x\_i−y\_i)^2=+−2$
  
  If I look this in terms of second condition how do we know that doesn't exist any feature map for euclidean distance? What exactly are we looking in feature maps mathematically?
  
  **Tags:** machine-learning, math, support-vector-machine, mapping-space
  > **Comments:**
  > **username_1**: Cross-posted: https://cs.stackexchange.com/q/127366/755, https://stats.stackexchange.com/q/472829/2921, https://ai.stackexchange.com/q/21994/1794.  Please [do not post the same question on multiple sites](https://meta.stackexchange.com/q/64068).  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_2 on 2020-06-19. Score: 1 | Accepted answer
  
  A kernel function $f : \mathcal{X} \times \mathcal{X} \rightarrow \mathbb{R}$ is a valid support vector kernel if it is a Mercer kernel. Mercer's condition essentially ensures that the Gram matrix of the kernel is positive semi-definite. Interestingly, this ensures that the SVM objective is convex.
  
  The Euclidean distance function does not satisfy Mercer's condition since it's Gram matrix is not necessary positive semi-definite. Thus, it is not a valid kernel.
  
  
  ---
  
  