The approximate rank of a matrix and its algorithmic applications: approximate rank

We study the ε-rank of a real matrix A, defined for any ε > 0 as the minimum rank over matrices that approximate every entry of A to within an additive ε. This parameter is connected to other notions of approximate rank and is motivated by problems from various topics including communication complexity, combinatorial optimization, game theory, computational geometry and learning theory. Here we give bounds on the ε-rank and use them for algorithmic applications. Our main algorithmic results are (a) polynomial-time additive approximation schemes for Nash equilibria for 2-player games when the payoff matrices are positive semidefinite or have logarithmic rank and (b) an additive PTAS for the densest subgraph problem for similar classes of weighted graphs. We use combinatorial, geometric and spectral techniques; our main new tool is an algorithm for efficiently covering a convex body with translates of another convex body.

[1]  Alexander A. Sherstov,et al.  The Sign-rank of Ac , 2008 .

[2]  Ronald de Wolf,et al.  Communication complexity lower bounds by polynomials , 1999, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[3]  Alexander A. Sherstov.  Halfspace Matrices , 2007, Computational Complexity Conference.

[4]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[5]  J. Spencer.  Six standard deviations suffice , 1985 .

[6]  Jürgen Forster.  A linear lower bound on the unbounded error probabilistic communication complexity , 2002, J. Comput. Syst. Sci..

[7]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[8]  C. A. Rogers.  A Note on Coverings and Packings , 1950 .

[9]  H. Warren.  Lower bounds for approximation by nonlinear manifolds , 1968 .

[10]  Alexander A. Razborov,et al.  The Sign-Rank of AC0 , 2010, SIAM J. Comput..

[11]  Thorsten Theobald,et al.  Games of fixed rank: a hierarchy of bimatrix games , 2005, SODA '07.

[12]  Alan M. Frieze,et al.  Quick Approximation to Matrices and Applications , 1999, Comb..

[13]  Santosh S. Vempala,et al.  Tensor decomposition and approximation schemes for constraint satisfaction problems , 2005, STOC '05.

[14]  Hans Ulrich Simon,et al.  Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces , 2001, COLT/EuroCOLT.

[15]  Vojtech Rödl,et al.  Geometrical realization of set systems and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[16]  Daniel Goldstein,et al.  On the equidistribution of Hecke points , 2003 .

[17]  Noga Alon,et al.  The Cover Number of a Matrix and its Algorithmic Applications , 2014, APPROX-RANDOM.

[18]  Zoltán Füredi,et al.  Approximation of the sphere by polytopes having few vertices , 1988 .

[19]  Venkatesan Guruswami,et al.  The complexity of the covering radius problem , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[20]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[21]  Adrian Vetta,et al.  Nash equilibria in random games , 2007 .

[22]  Daniel Dadush,et al.  Near-optimal deterministic algorithms for volume computation via M-ellipsoids , 2012, Proceedings of the National Academy of Sciences.

[23]  Santosh S. Vempala,et al.  Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..

[24]  Noga Alon,et al.  Scale-sensitive dimensions, uniform convergence, and learnability , 1997, JACM.

[25]  Shai Ben-David,et al.  Limitations of Learning Via Embeddings in Euclidean Half Spaces , 2003, J. Mach. Learn. Res..

[26]  Troy Lee,et al.  An Approximation Algorithm for Approximation Rank , 2008, 2009 24th Annual IEEE Conference on Computational Complexity.

[27]  Nikolai K. Vereshchagin,et al.  On Computation and Communication with Small Bias , 2007, Computational Complexity Conference.

[28]  Noga Alon,et al.  Perturbed Identity Matrices Have High Rank: Proof and Applications , 2009, Combinatorics, Probability and Computing.

[29]  Aranyak Mehta,et al.  Playing large games using simple strategies , 2003, EC '03.

[30]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[31]  Santosh S. Vempala,et al.  The Random Projection Method , 2005, DIMACS Series in Discrete Mathematics and Theoretical Computer Science.

[32]  David W. Lewis,et al.  Matrix theory , 1991 .

[33]  C. A. Rogers.  Lattice Coverings of Space with Convex Bodies , 1958 .

[34]  Aditya Bhaskara,et al.  Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.

[35]  Carl Ludwig Siegel,et al.  A Mean Value Theorem in Geometry of Numbers , 1945 .

[36]  C. A. Rogers.  Lattice Coverings of Space: The Minkowski–Hlawka Theorem , 1958 .

[37]  Andris Ambainis,et al.  Quantum search of spatial regions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[38]  Noga Alon,et al.  Random sampling and approximation of MAX-CSPs , 2003, J. Comput. Syst. Sci..

[39]  Nathan Linial,et al.  Complexity measures of sign matrices , 2007, Comb..

[40]  David Applegate,et al.  Sampling and integration of near log-concave functions , 1991, STOC '91.

[41]  Avi Wigderson,et al.  Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes , 2010, STOC '11.

[42]  Santosh S. Vempala,et al.  Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[43]  G. Pisier.  The volume of convex bodies and Banach space geometry , 1989 .

[44]  Leslie G. Valiant,et al.  Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.

[45]  Matthias Krause,et al.  Geometric arguments yield better bounds for threshold circuits and distributed computing , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[46]  Santosh S. Vempala,et al.  An algorithmic theory of learning: Robust concepts and random projection , 1999, Machine Learning.

[47]  C. A. Rogers.  Lattice coverings of space , 1959 .

[48]  Roy Mathias,et al.  The Hadamard Operator Norm of a Circulant and Applications , 1997 .

[49]  A. Razborov.  Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.

[50]  Noga Alon,et al.  Additive approximation for edge-deletion problems , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[51]  Nathan Linial,et al.  Lower bounds in communication complexity based on factorization norms , 2007, STOC '07.