DeepAI AI Chat
Log In Sign Up

Lower Bounds for Matrix Factorization

by   Mrinal Kumar, et al.

We study the problem of constructing explicit families of matrices which cannot be expressed as a product of a few sparse matrices. In addition to being a natural mathematical question on its own, this problem appears in various incarnations in computer science; the most significant being in the context of lower bounds for algebraic circuits which compute linear transformations, matrix rigidity and data structure lower bounds. We first show, for every constant d, a deterministic construction in subexponential time of a family {M_n} of n × n matrices which cannot be expressed as a product M_n = A_1 ... A_d where the total sparsity of A_1,...,A_d is less than n^1+1/(2d). In other words, any depth-d linear circuit computing the linear transformation M_n· x has size at least n^1+Ω(1/d). This improves upon the prior best lower bounds for this problem, which are barely super-linear, and were obtained by a long line of research based on the study of super-concentrators (albeit at the cost of a blow up in the time required to construct these matrices). We then outline an approach for proving improved lower bounds through a certain derandomization problem, and use this approach to prove asymptotically optimal quadratic lower bounds for natural special cases, which generalize many of the common matrix decompositions.


page 1

page 2

page 3

page 4


Static Data Structure Lower Bounds Imply Rigidity

We show that static data structure lower bounds in the group (linear) mo...

Circuit Depth Reductions

The best known circuit lower bounds against unrestricted circuits remain...

Lower Bounds for Special Cases of Syntactic Multilinear ABPs

Algebraic Branching Programs(ABPs) are standard models for computing pol...

Kronecker Products, Low-Depth Circuits, and Matrix Rigidity

For a matrix M and a positive integer r, the rank r rigidity of M is the...

Algorithms and Lower Bounds for the Worker-Task Assignment Problem

We study the problem of assigning workers to tasks where each task has d...

Consistency of circuit lower bounds with bounded theories

Proving that there are problems in P^NP that require boolean circuits of...

Smaller Low-Depth Circuits for Kronecker Powers

We give new, smaller constructions of constant-depth linear circuits for...