MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Composable core-sets for determinant maximization problems via spectral spanners

Author(s)
Indyk, Piotr
Thumbnail
DownloadSubmitted version (370.4Kb)
Open Access Policy

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
We study a generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors V ⊆ ℝd, we say a set U ⊆ V is an α-spectral kspanner, for k ≤ d, if for all v ∈ V there is a probability distribution µv supported on U such that vv ≼k α· Eu∼µvuu, where for two matrices A,B ∈ ℝd×d we write A ≼k B iff the sum of the bottom d−k+1 eigenvalues of B−A is nonnegative. In particular, A ≼d B iff A ≼ B. We show that any set V has an Õ(k)-spectral spanner of size Õ(k) and this bound is almost optimal in the worst case. We use spectral spanners to study composable coresets for spectral problems. We show that for many objective functions one can use a spectral spanner, independent of the underlying function, as a core-set and obtain almost optimal composable core-sets. For example, for the k-determinant maximization problem, we obtain an Õ(k)k-composable core-set, and we show that this is almost optimal in the worst case. Our algorithm is a spectral analogue of the classical greedy algorithm for finding (combinatorial) spanners in graphs. We expect that our spanners find many other applications in distributed or parallel models of computation.
Date issued
2020-01
URI
https://hdl.handle.net/1721.1/129406
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher
Association for Computing Machinery
Citation
Indyk, Piotr et al. “Composable core-sets for determinant maximization problems via spectral spanners.” Paper in the Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, January 5 - 8, 2020, Association for Computing Machinery: 1675–1694 © 2019 The Author(s)
Version: Original manuscript

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.