Improved Lower Bound for Differentially Private Facility Location (2403.04874v1)
Abstract: We consider the differentially private (DP) facility location problem in the so called super-set output setting proposed by Gupta et al. [SODA 2010]. The current best known expected approximation ratio for an $\epsilon$-DP algorithm is $O\left(\frac{\log n}{\sqrt{\epsilon}}\right)$ due to Cohen-Addad et al. [AISTATS 2022] where $n$ denote the size of the metric space, meanwhile the best known lower bound is $\Omega(1/\sqrt{\epsilon})$ [NeurIPS 2019]. In this short note, we give a lower bound of $\tilde{\Omega}\left(\min\left{\log n, \sqrt{\frac{\log n}{\epsilon}}\right}\right)$ on the expected approximation ratio of any $\epsilon$-DP algorithm, which is the first evidence that the approximation ratio has to grow with the size of the metric space.
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J. Comput., 39(6):2212–2231, 2010.
- Yair Bartal. On approximating arbitrary metrices by tree metrics. In STOC, pages 161–168, 1998.
- On facility location problem in the local differential privacy model. In AISTATS, pages 3914–3929, 2022.
- Improved combinatorial algorithms for the facility location and k-median problems. In FOCS, pages 378–388, 1999.
- Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput., 33(1):1–25, 2003.
- Calibrating noise to sensitivity in private data analysis. In TCC, volume 3876, pages 265–284, 2006.
- The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci., 9(3-4):211–407, 2014.
- Facility location problem in differential privacy model revisited. In NeurIPS, pages 8489–8498, 2019.
- Dynamic cage survey. The Electronic Journal of Combinatorics [electronic only], DS16:48 p., electronic only, 2008.
- Reguläre graphen gegebener taillenweite mit minimaler knotenzahl. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe, 12(251-257):22, 1963.
- A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci., 69(3):485–497, 2004.
- Greedy strikes back: Improved facility location algorithms. J. Algorithms, 31(1):228–248, 1999.
- Differentially private combinatorial optimization. In SODA, pages 1106–1125, 2010.
- Dorit S. Hochbaum. Heuristics for the fixed cost median problem. Math. Program., 22(1):148–162, 1982.
- On the geometry of differential privacy. In STOC, pages 705–714, 2010.
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM, 50(6):795–824, 2003.
- A new greedy approach for facility location problems. In STOC, pages 731–740, 2002.
- Primal-dual approximation algorithms for metric facility location and k-median problems. In FOCS, pages 2–13, 1999.
- Analysis of a local search heuristic for facility location problems. J. Algorithms, 37(1):146–188, 2000.
- Shi Li. A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf. Comput., 222:45–58, 2013.
- Approximation algorithms for metric facility location problems. SIAM J. Comput., 36(2):411–432, 2006.
- Approximation algorithms for facility location problems (extended abstract). In STOC, pages 265–274, 1997.