Papers
Topics
Authors
Recent
Search
2000 character limit reached

How to Find a Point in the Convex Hull Privately

Published 30 Mar 2020 in cs.DS, cs.CG, cs.CR, and cs.LG | (2003.13192v1)

Abstract: We study the question of how to compute a point in the convex hull of an input set SS of nn points in Rd{\mathbb R}^d in a differentially private manner. This question, which is trivial non-privately, turns out to be quite deep when imposing differential privacy. In particular, it is known that the input points must reside on a fixed finite subset G⊆RdG\subseteq{\mathbb R}^d, and furthermore, the size of SS must grow with the size of GG. Previous works focused on understanding how nn needs to grow with ∣G∣|G|, and showed that n=O(d2.5⋅8log⁡∗∣G∣)n=O\left(d^{2.5}\cdot8^{\log^*|G|}\right) suffices (so nn does not have to grow significantly with ∣G∣|G|). However, the available constructions exhibit running time at least ∣G∣d2|G|^{d^2}, where typically ∣G∣=Xd|G|=X^d for some (large) discretization parameter XX, so the running time is in fact Ω(Xd3)\Omega(X^{d^3}). In this paper we give a differentially private algorithm that runs in O(nd)O(n^d) time, assuming that n=Ω(d4log⁡X)n=\Omega(d^4\log X). To get this result we study and exploit some structural properties of the Tukey levels (the regions D≥kD_{\ge k} consisting of points whose Tukey depth is at least kk, for k=0,1,...k=0,1,...). In particular, we derive lower bounds on their volumes for point sets SS in general position, and develop a rather subtle mechanism for handling point sets SS in degenerate position (where the deep Tukey regions have zero volume). A naive approach to the construction of the Tukey regions requires nO(d2)n^{O(d^2)} time. To reduce the cost to O(nd)O(n^d), we use an approximation scheme for estimating the volumes of the Tukey regions (within their affine spans in case of degeneracy), and for sampling a point from such a region, a scheme that is based on the volume estimation framework of Lov\'asz and Vempala (FOCS 2003) and of Cousins and Vempala (STOC 2015). Making this framework differentially private raises a set of technical challenges that we address.

Citations (12)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.