For Kernel Range Spaces a Constant Number of Queries Are Sufficient
share
We introduce the notion of an ε-cover for a kernel range space. A kernel range space concerns a set of points X ⊂ℝ^d and the space of all queries by a fixed kernel (e.g., a Gaussian kernel K(p,·) = exp(-p-·^2)). For a point set X of size n, a query returns a vector of values R_p ∈ℝ^n, where the ith coordinate (R_p)_i = K(p,x_i) for x_i ∈ X. An ε-cover is a subset of points Q ⊂ℝ^d so for any p ∈ℝ^d that 1/nR_p - R_q_1≤ε for some q ∈ Q. This is a smooth analog of Haussler's notion of ε-covers for combinatorial range spaces (e.g., defined by subsets of points within a ball query) where the resulting vectors R_p are in {0,1}^n instead of [0,1]^n. The kernel versions of these range spaces show up in data analysis tasks where the coordinates may be uncertain or imprecise, and hence one wishes to add some flexibility in the notion of inside and outside of a query range. Our main result is that, unlike combinatorial range spaces, the size of kernel ε-covers is independent of the input size n and dimension d. We obtain a bound of (1/ε)^Õ(1/ε^2), where Õ(f(1/ε)) hides log factors in (1/ε) that can depend on the kernel. This implies that by relaxing the notion of boundaries in range queries, eventually the curse of dimensionality disappears, and may help explain the success of machine learning in very high-dimensions. We also complement this result with a lower bound of almost (1/ε)^Ω(1/ε), showing the exponential dependence on 1/ε is necessary.
READ FULL TEXT