Table of Contents
Fetching ...

Near-Optimal Dimension Reduction for Facility Location

Lingxiao Huang, Shaofeng H. -C. Jiang, Robert Krauthgamer, Di Yue

TL;DR

The main result is that target dimension m=Õ(є−2 ddim) suffices to (1+є)-approximate the optimal value of UFL on inputs whose doubling dimension is bounded by ddim.

Abstract

Oblivious dimension reduction, à la the Johnson-Lindenstrauss (JL) Lemma, is a fundamental approach for processing high-dimensional data. We study this approach for Uniform Facility Location (UFL) on a Euclidean input $X\subset\mathbb{R}^d$, where facilities can lie in the ambient space (not restricted to $X$). Our main result is that target dimension $m=\tilde{O}(ε^{-2}\mathrm{ddim})$ suffices to $(1+ε)$-approximate the optimal value of UFL on inputs whose doubling dimension is bounded by $\mathrm{ddim}$. It significantly improves over previous results, that could only achieve $O(1)$-approximation [Narayanan, Silwal, Indyk, and Zamir, ICML 2021] or dimension $m=O(ε^{-2}\log n)$ for $n=|X|$, which follows from [Makarychev, Makarychev, and Razenshteyn, STOC 2019]. Our oblivious dimension reduction has immediate implications to streaming and offline algorithms, by employing known algorithms for low dimension. In dynamic geometric streams, it implies a $(1+ε)$-approximation algorithm that uses $O(ε^{-1}\log n)^{\tilde{O}(\mathrm{ddim}/ε^{2})}$ bits of space, which is the first streaming algorithm for UFL to utilize the doubling dimension. In the offline setting, it implies a $(1+ε)$-approximation algorithm, which we further refine to run in time $( (1/ε)^{\tilde{O}(\mathrm{ddim})} d + 2^{(1/ε)^{\tilde{O}(\mathrm{ddim})}}) \cdot \tilde{O}(n) $. Prior work has a similar running time but requires some restriction on the facilities [Cohen-Addad, Feldmann and Saulpic, JACM 2021]. Our main technical contribution is a fast procedure to decompose an input $X$ into several $k$-median instances for small $k$. This decomposition is inspired by, but has several significant differences from [Czumaj, Lammersen, Monemizadeh and Sohler, SODA 2013], and is key to both our dimension reduction and our PTAS.

Near-Optimal Dimension Reduction for Facility Location

TL;DR

The main result is that target dimension m=Õ(є−2 ddim) suffices to (1+є)-approximate the optimal value of UFL on inputs whose doubling dimension is bounded by ddim.

Abstract

Oblivious dimension reduction, à la the Johnson-Lindenstrauss (JL) Lemma, is a fundamental approach for processing high-dimensional data. We study this approach for Uniform Facility Location (UFL) on a Euclidean input , where facilities can lie in the ambient space (not restricted to ). Our main result is that target dimension suffices to -approximate the optimal value of UFL on inputs whose doubling dimension is bounded by . It significantly improves over previous results, that could only achieve -approximation [Narayanan, Silwal, Indyk, and Zamir, ICML 2021] or dimension for , which follows from [Makarychev, Makarychev, and Razenshteyn, STOC 2019]. Our oblivious dimension reduction has immediate implications to streaming and offline algorithms, by employing known algorithms for low dimension. In dynamic geometric streams, it implies a -approximation algorithm that uses bits of space, which is the first streaming algorithm for UFL to utilize the doubling dimension. In the offline setting, it implies a -approximation algorithm, which we further refine to run in time . Prior work has a similar running time but requires some restriction on the facilities [Cohen-Addad, Feldmann and Saulpic, JACM 2021]. Our main technical contribution is a fast procedure to decompose an input into several -median instances for small . This decomposition is inspired by, but has several significant differences from [Czumaj, Lammersen, Monemizadeh and Sohler, SODA 2013], and is key to both our dimension reduction and our PTAS.

Paper Structure

This paper contains 53 sections, 49 theorems, 130 equations, 5 algorithms.

Key Result

Theorem 1.1

Let $0 < \varepsilon, \delta < 1$, let $\mathrm{ddim},d \geq 1$, and consider a random linear map $\pi$ with suitable target dimension $m = O(\varepsilon^{-2} \mathrm{ddim} \cdot \log(\delta^{-1}\varepsilon^{-1} \mathrm{ddim}) )$. Then for every finite $X \subset \mathbb{R}^d$ with doubling dimensio

Theorems & Definitions (90)

  • Remark
  • Theorem 1.1
  • Corollary 1.2
  • Theorem 1.3
  • Definition 2.1: Doubling dimension GuptaKL03
  • Definition 2.2: Packing, covering and nets
  • Proposition 2.3: Packing property GuptaKL03
  • Proposition 2.4: Properties of random linear maps
  • proof
  • Lemma 3.0: Bounded local UFL values
  • ...and 80 more