English

Subsampling in Smoothed Range Spaces

Computational Geometry 2015-11-02 v1 Machine Learning

Abstract

We consider smoothed versions of geometric range spaces, so an element of the ground set (e.g. a point) can be contained in a range with a non-binary value in [0,1][0,1]. Similar notions have been considered for kernels; we extend them to more general types of ranges. We then consider approximations of these range spaces through ε\varepsilon -nets and ε\varepsilon -samples (aka ε\varepsilon-approximations). We characterize when size bounds for ε\varepsilon -samples on kernels can be extended to these more general smoothed range spaces. We also describe new generalizations for ε\varepsilon -nets to these range spaces and show when results from binary range spaces can carry over to these smoothed ones.

Keywords

Cite

@article{arxiv.1510.09123,
  title  = {Subsampling in Smoothed Range Spaces},
  author = {Jeff M. Phillips and Yan Zheng},
  journal= {arXiv preprint arXiv:1510.09123},
  year   = {2015}
}

Comments

This is the full version of the paper which appeared in ALT 2015. 16 pages, 3 figures. In Algorithmic Learning Theory, pp. 224-238. Springer International Publishing, 2015

R2 v1 2026-06-22T11:33:13.303Z