Q3c

Q3c

student (guest) 14 Jan 2017 09:29

when given a new data point x, what is the complexity of calculating K(x_i,x)?
since K(x_i,x) is not part of the matrix K and each kernel has its own specific calculation complexity.
can we assume that we already have the result and therefore it takes O(1)?

Re: Q3c

Regev Schweiger 15 Jan 2017 07:08

No. You can, for example, denote the complexity of calculating a kernel by O(m), and use that.

Guest (guest) 17 Jan 2017 09:55

Shouldn't it be O(d)? Where d is the dimension of the data points

Regev Schweiger 17 Jan 2017 11:15

Depends on the kernel. It usually is O(d).