Common Information and Unique Disjointness

  title={Common Information and Unique Disjointness},
  author={G{\'a}bor Braun and Sebastian Pokutta},
We provide an information-theoretic framework for establishing strong lower bounds on the nonnegative rank of matrices by means of common information, a notion previously introduced in Wyner (IEEE Trans Inf Theory 21(2):163–179, 1975). The framework is a generalization of the one in Braverman and Moitra (Proceedings of the forty-fifth annual ACM symposium on theory of computing, pp 161–170, 2013) for the shifted uniqe disjointness (UDISJ) matrix to arbitrary nonnegative matrices. Common… 

Information-theoretic approximations of the nonnegative rank

A systematic study of common information extending the dual characterization of Witsenhausen, which characterizes the minimal nonnegative rank under tensoring and small perturbations of a matrix and provides new insights into its information-theoretic structure.

Complexity of Set-Disjointness for All Probabilities

A complete characterization of the private-coin communication complexity of set-disjointness for all functions α and β, and a near-complete characterization for public-coin protocols.

Exponential lower bounds on fixed-size psd rank and semidefinite extension complexity

The study of SDP lifts over Cartesian product of fixed-size positive semidefinite cones is motivated mainly from practical considerations where it is well known that such SDPs can be solved more efficiently than general SSPs.

Communication Complexity of Set-Disjointness for All Probabilities

A complete characterization of the private-coin communication complexity of set-disjointness for all functions alpha and beta, and a near-complete characterization for public-coin protocols.

Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank

A class of atomic rank functions defined on a convex cone which generalize several notions of “positive” ranks such as nonnegative rank or cp-rank, and it is proved that the lower bound is always greater than or equal to the hyperplane separation bound.

Generalized probabilistic theories and conic extensions of polytopes

This work relates the communication complexity of generalizations of quantum theory to questions of mainstream interest in the area of combinatorial optimization with recent exponential lower bounds on the linear extension complexity of polytopes.

On the Communication Complexity of Secure Computation

The first explicit example of a function that incurs a higher communication cost than the input length in the secure computation model of Feige, Kilian and Naor (1994), who had shown that such functions exist are obtained.

Extended Formulation Lower Bounds via Hypergraph Coloring?

An exponential lower bound on the size of approximate mixed product formulations for the metric capacitated facility location problem, a problem which seems to be intractable for linear programming as far as constant-gap compact formulations are concerned is shown.

Inapproximability of Combinatorial Problems via Small LPs and SDPs

This work defines a consistent reduction mechanism that degrades approximation factors in a controlled fashion and which, at the same time, is compatible with approximate linear and semidefinite programming formulations.

An Almost Optimal Algorithm for Computing Nonnegative

Here, we give an algorithm for deciding if the nonnegative rank of a matrix M of dimension m × n is at most r which runs in time (nm)O(r2). This is the first exact algorithm that runs in time singly



Information Lower Bounds via Self-Reducibility

We use self-reduction methods to prove strong information lower bounds on two of the most studied functions in the communication complexity literature: Gap Hamming Distance (GHD) and Inner Product

Computing a nonnegative matrix factorization -- provably

This work gives an algorithm that runs in time polynomial in n, m and r under the separablity condition identified by Donoho and Stodden in 2003, and is the firstPolynomial-time algorithm that provably works under a non-trivial condition on the input matrix.

An information complexity approach to extended formulations

An optimal and unconditional lower bound against linear programs for clique that matches Hastad's celebrated hardness result is proved and an information theoretic framework is developed to approach these questions and is used to prove the main result.

Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States

The fundamental problem of generating bipartite classical distributions or quantum states is investigated and a number of intriguing connections to fundamental measures in optimization, convex geometry, and information theory are established.

From information to exact communication

The rate of convergence results imply that an asymptotically optimal protocol for set disjointness will have to use ω(1) rounds of communication, since every r-round protocol will be sub-optimal by at least Ω(n/r<sup>2</sup>) bits of communication.

Values and Bounds for the Common Information of Two Discrete Random Variables

Recently, Wyner has defined a new measure of dependence of two discrete random variables, the common information, with important operational significance. The principal result of this paper is a

The matching polytope does not admit fully-polynomial size relaxation schemes

It turns out that the high extension complexity for the matchingpolytope stem from the same source of hardness as for the correlation polytope: a direct sum structure.

Sparse and unique nonnegative matrix factorization through data preprocessing

A completely new way to obtaining more well-posed NMF problems whose solutions are sparser is introduced, based on the preprocessing of the nonnegative input data matrix, and relies on the theory of M-matrices and the geometric interpretation of NMF.

Approximation Limits of Linear Programs (Beyond Hierarchies)

A quantitative improvement of Razborov's rectangle corruption lemma for the high error regime gives strong lower bounds on the nonnegative rank of certain perturbations of the unique disjoint ness matrix that proves that quadratic approximations for CLIQUE require linear programs of exponential size.