Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity

by   Sally Dong, et al.
University of Washington

We show that any bounded integral function f : A × B ↦{0,1, …, Δ} with rank r has deterministic communication complexity Δ^O(Δ)·√(r)·log^2 r, where the rank of f is defined to be the rank of the A × B matrix whose entries are the function values. As a corollary, we show that any n-dimensional polytope that admits a slack matrix with entries from {0,1,…,Δ} has extension complexity at most exp(Δ^O(Δ)·√(n)·log^2 n).


page 1

page 2

page 3

page 4


Ladder Matrix Recovery from Permutations

We give unique recovery guarantees for matrices of bounded rank that hav...

Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank

We prove a characterization of the structural conditions on matrices of ...

Fast Attention Requires Bounded Entries

In modern machine learning, inner product attention computation is a fun...

Bulk Johnson-Lindenstrauss Lemmas

For a set X of N points in ℝ^D, the Johnson-Lindenstrauss lemma provides...

Adaptive Estimation of Noise Variance and Matrix Estimation via USVT Algorithm

Consider the problem of denoising a large m× n matrix. This problem has ...

Tensor rank bounds and explicit QTT representations for the inverses of circulant matrices

In this paper, we are concerned with the inversion of circulant matrices...

Please sign up or login with your details

Forgot password? Click here to reset