ABSTRACT
We give improved pseudorandom generators (PRGs) for Lipschitz functions of low-degree polynomials over the hypercube. These are functions of the form ψ(P(x)), where P:{1,-1}n -> R is a low-degree polynomial and ψ:R -> R is a function with small Lipschitz constant. PRGs for smooth functions of low-degree polynomials have received a lot of attention recently and play an important role in constructing PRGs for the natural class of polynomial threshold functions [12,13,24,16,15]. In spite of the recent progress, no nontrivial PRGs were known for fooling Lipschitz functions of degree O(log n) polynomials even for constant error rate. In this work, we give the first such generator obtaining a seed-length of (log n)~O(l2/ε2) for fooling degree l polynomials with error ε. Previous generators had an exponential dependence on the degree l. We use our PRG to get better integrality gap instances for sparsest cut, a fundamental problem in graph theory with many applications in graph optimization. We give an instance of uniform sparsest cut for which a powerful semi-definite relaxation (SDP) first introduced by Goemans and Linial and studied in the seminal work of Arora, Rao and Vazirani [3] has an integrality gap of exp(Ω((log log n)1/2)). Understanding the performance of the Goemans-Linial SDP for uniform sparsest cut is an important open problem in approximation algorithms and metric embeddings. Our work gives a near-exponential improvement over previous lower bounds which achieved a gap of Ω(log log n) [11,21]. Our gap instance builds on the recent short code gadgets of Barak et al. [5].
- N. Alon and J.H. Spencer. The Probabilistic Method. John Wiley & Sons, 2000.Google Scholar
Cross Ref
- Sanjeev Arora, James Lee, and Assaf Naor. Euclidean distortion and the sparsest cut. In STOC, pages 553--562, 2005. Google Scholar
Digital Library
- Sanjeev Arora, Satish Rao, and Umesh V. Vazirani. Expander flows, geometric embeddings and graph partitioning. J. ACM, 56(2), 2009. Google Scholar
Digital Library
- James Aspnes, Richard Beigel, Merrick L. Furst, and Steven Rudich. The expressive power of voting polynomials. Combinatorica, 14(2):135--148, 1994.Google Scholar
Cross Ref
- Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, and David Steurer. Making the long code shorter, with applications to the unique games conjecture. In FOCS, 2012. Google Scholar
Digital Library
- Richard Beigel. The polynomial method in circuit complexity. In Proc. of $8$th Annual Structure in Complexity Theory Conference, pages 82--95, 1993.Google Scholar
Cross Ref
- Larry Carter and Mark N. Wegman. Universal classes of hash functions. In STOC, pages 106--112, 1977. Google Scholar
Digital Library
- Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. Computational Complexity, 15(2):94--114, 2006. Google Scholar
Digital Library
- Jeff Cheeger, Bruce Kleiner, and Assaf Naor. A (log n)Ω(1) integrality gap for the sparsest cut SDP. In FOCS, pages 555--564, 2009. Google Scholar
Digital Library
- Eden Chlamtac and Madhur Tulsiani. Handbook on Semidefinite, Conic and Polynomial Optimization, chapter Convex Relaxations and Integrality Gaps. Springer, 2011.Google Scholar
- Nikhil R. Devanur, Subhash Khot, Rishi Saket, and Nisheeth K. Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. In STOC, pages 537--546, 2006. Google Scholar
Digital Library
- Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, and Emanuele Viola. Bounded independence fools halfspaces. In FOCS, pages 171--180, 2009. Google Scholar
Digital Library
- Ilias Diakonikolas, Daniel M. Kane, and Jelani Nelson. Bounded independence fools degree-2 threshold functions. In FOCS, pages 11--20, 2010. Google Scholar
Digital Library
- Michel X. Goemans. Semidefinite programming in combinatorial optimization. Math. Program., 79:143--161, 1997. Google Scholar
Digital Library
- Daniel M. Kane. k-independent Gaussians fool polynomial threshold functions. In IEEE Conference on Computational Complexity, pages 252--261, 2011. Google Scholar
Digital Library
- Daniel M. Kane. A small PRG for polynomial threshold functions of Gaussians. In FOCS, pages 257--266, 2011. Google Scholar
Digital Library
- Daniel M. Kane. A structure theorem for poorly anticoncentrated gaussian chaoses and applications to the study of polynomial threshold functions. In FOCS, pages 91--100, 2012. Google Scholar
Digital Library
- Subhash Khot and Rishi Saket. SDP integrality gaps with local l_1-embeddability. In FOCS, pages 565--574, 2009. Google Scholar
Digital Library
- Subhash Khot and Nisheeth K. Vishnoi. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l_1. In FOCS, pages 53--62, 2005. Google Scholar
Digital Library
- Adam R. Klivans and Rocco A. Servedio. Learning DNF in time 2O(n1/3). J. Comp. Sys. Sc., 68(2):303--318, 2004. Google Scholar
Digital Library
- Robert Krauthgamer and Yuval Rabani. Improved lower bounds for embeddings into $\ell_1$. SIAM J. Comput., 38(6):2487--2498, 2009. Google Scholar
Digital Library
- Nathan Linial. Finite metric spaces: combinatorics, geometry and algorithms. In Proceedings of the eighteenth annual symposium on Computational geometry, SCG '02, pages 63--63, 2002. Google Scholar
Digital Library
- Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215--245, 1995.Google Scholar
Digital Library
- Raghu Meka and David Zuckerman. Pseudorandom generators for polynomial threshold functions. In STOC, pages 427--436, 2010. Google Scholar
Digital Library
- Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences invariance and optimality. In FOCS, pages 21--30, 2005. Google Scholar
Digital Library
- Yuval Rabani and Amir Shpilka. Explicit construction of a small epsilon-net for linear threshold functions. SIAM J. Comput., 39(8):3501--3520, 2010. Google Scholar
Digital Library
- Yuri Rabinovich. On average distortion of embedding metrics into the line and into l1. In STOC, pages 456--462, 2003. Google Scholar
Digital Library
- Prasad Raghavendra and David Steurer. Integrality gaps for strong SDP relaxations of unique games. In FOCS, pages 575--585, 2009. Google Scholar
Digital Library
- Farhad Shahrokhi and David W. Matula. The maximum concurrent flow problem. J. ACM, 37(2):318--334, 1990. Google Scholar
Digital Library
- David B. Shmoys. Approximation algorithms for np-hard problems. chapter Cut problems and their application to divide-and-conquer, pages 192--235. PWS Publishing Co., Boston, MA, USA, 1997. Google Scholar
Digital Library
Index Terms
A PRG for lipschitz functions of polynomials with applications to sparsest cut
Recommendations
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingWe give a 2-approximation algorithm for the non-uniform Sparsest Cut problem that runs in time nO(k), where k is the treewidth of the graph. This improves on the previous 22k-approximation in time poly(n) 2O(k) due to Chlamtac et al. [18].
To complement ...
Pseudorandom generators for polynomial threshold functions
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computingWe study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/εO(d) fooling degree d PTFs with error at most ε. Previously, no nontrivial ...
Pseudorandom Generators for Polynomial Threshold Functions
† Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010)We study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed length $\log n/\epsilon^{O(d)}$ fooling degree $d$ PTFs with error at most $\epsilon$. Previously, no ...





Comments