$\epsilon$-Kernel Coresets for Stochastic Points
Lingxiao Huang, Jian Li, Jeff M. Phillips, Haitao Wang

TL;DR
This paper introduces methods for constructing small, efficient coresets that approximate the geometric width of uncertain point sets in probabilistic models, enabling scalable analysis of noisy data.
Contribution
It develops the first $ ext{epsilon}$-kernel coresets for uncertain points in both existential and locational models, with algorithms and bounds for their construction.
Findings
Existence of $O(1/ extepsilon^{(d-1)/2})$ deterministic coresets.
Efficient algorithms for coreset construction.
Applications to uncertain function extent and shape fitting.
Abstract
With the dramatic growth in the number of application domains that generate probabilistic, noisy and uncertain data, there has been an increasing interest in designing algorithms for geometric or combinatorial optimization problems over such data. In this paper, we initiate the study of constructing -kernel coresets for uncertain points. We consider uncertainty in the existential model where each point's location is fixed but only occurs with a certain probability, and the locational model where each point has a probability distribution describing its location. An -kernel coreset approximates the width of a point set in any direction. We consider approximating the expected width (an \expkernel), as well as the probability distribution on the width (an \probkernel) for any direction. We show that there exists a set of deterministic points…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Remote Sensing and LiDAR Applications · Point processes and geometric inequalities
