On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model

@inproceedings{Li2014OnTC,
  title={On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model},
  author={Yi Li and Xiaoming Sun and Chenguang Wang and David P. Woodruff},
  booktitle={DISC},
  year={2014}
}
We study the communication complexity of linear algebraic problems over finite fields in the multi-player message passing model, proving a number of tight lower bounds. We give a general framework for reducing these multi-player problems to their two-player counterparts, showing that the randomized s-player communication complexity of these problems is at least s times the randomized two-player communication complexity. Provided the problem has a certain amount of algebraic symmetry, we can… 

Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy

TLDR
This paper proves lower bounds on randomized multiparty communication complexity, both in the blackboard model and in the message-passing model, and introduces a new technique for proving such bounds, called symmetrization, which is natural, intuitive, and often easy to use.

Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds

TLDR
This work shows that any deterministic algorithm solving the generalized matrix rank estimation problem must communicate Ω(n2) bits, which is order equivalent to transmitting the whole matrix, and proposes a randomized algorithm that communicates only e O(n) bits.

The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model

TLDR
The space between the unicast and broadcast congested clique models is very rich and interesting, and it is shown that the round complexity of the pairwise set-disjointness function \(\textsc {pwdisj}\) is completely sensitive to the range r.

On the Multiparty Communication Complexity of Testing Triangle-Freeness

TLDR
Evidence that the problem is hard on testing triangle-freeness is given by showing that finding an edge that participates in a triangle is hard, even when promised that the graph is far from triangle-free.

A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness

  • M. BravermanR. Oshman
  • Computer Science
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
TLDR
The trade-off between the number of interaction rounds the authors allow the players, and the total number of bits they must send to solve set disjointness is studied, and it is shown that if R rounds of interaction are allowed, the communication cost is Ω(nk^{1/R}/R^4), which is nearly tight.

The Range of Topological Effects on Communication

TLDR
It is shown that for a large class of natural functions like Set-Disjointness the communication cost is essentially n times the cost of the optimal Steiner tree connecting the terminals, and for natural composed functions like Element-Distinctness ED and XOR the naive protocols suggested by their definition is optimal for general networks.

Tight Bounds for the Subspace Sketch Problem with Applications

  • Yi Li
  • Computer Science, Mathematics
  • 2019
TLDR
The results are optimal up to logarithmic factors, and show in particular that one cannot compress A to O(d) “directions” v1, vO(d), such that for any x, ‖Ax‖1 can be well-approximated from 〈v1, x〉, . . . , 〉vO (d), x》.

Communication-Efficient Distributed Covariance Sketch, with Application to Distributed PCA

TLDR
This paper proves an almost tight deterministic communication lower bound, then provides a new randomized algorithm with communication cost smaller than the deterministic lower bound and gives an improved distributed PCA algorithm for sparse input matrices, which uses the distributed sketching algorithm as a key building block.

1 0 Ju l 2 01 9 Tight Bounds for the Subspace Sketch Problem with Applications

  • Yi Li
  • Computer Science, Mathematics
  • 2019
TLDR
The results are optimal up to logarithmic factors, and show in particular that one cannot compress A to O(d) “directions” v1, x, vO(d), such that for any x, ‖Ax‖1 can be well-approximated from 〈v1,x〉, . . . , 〉vO( d), x〉.

Space lower bounds for linear prediction in the streaming model

TLDR
It is shown that fundamental learning tasks, such as finding an approximate linear separator or linear regression, require memory at least \emph{quadratic} in the dimension, in a natural streaming setting, and that such problems cannot be solved by scalable memory-efficient streaming algorithms.

References

SHOWING 1-10 OF 38 REFERENCES

Randomized Communication Complexity for Linear Algebra Problems over Finite Fields

TLDR
It is proved that the randomized/quantum communication complexity of the singularity problem over F_p is Omega(n^2 log p), which implies the same space lower bound for randomized streaming algorithms, even for a constant number of passes.

A Tight Bound for Set Disjointness in the Message-Passing Model

TLDR
A tight lower bound of Ω(n · k) is proved for the set disjointness problem in the message passing model by developing information complexity tools for the message-passing model and proving an information complexity lower bound for set disJointness.

Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy

TLDR
This paper proves lower bounds on randomized multiparty communication complexity, both in the blackboard model and in the message-passing model, and introduces a new technique for proving such bounds, called symmetrization, which is natural, intuitive, and often easy to use.

On data structures and asymmetric communication complexity

TLDR
This paper considers two-party communication complexity, the ``asymmetric case'', when the input sizes of the two players differ significantly, and derives two generally applicable methods of proving lower bounds and obtain several applications.

On the communication complexity of distributed algebraic computation

TLDR
An almost optimal bound is derived for the case of one-way communication when the functions function 1,....

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications

TLDR
The following compression lemma is proved: given a protocol for a function f, one can construct a zero-communication protocol that has non-abort probability at least 2-O(I) and that computes f correctly with high probability conditioned on not aborting.

The Partition Bound for Classical Communication Complexity and Query Complexity

  • Rahul JainH. Klauck
  • Computer Science, Mathematics
    2010 IEEE 25th Annual Conference on Computational Complexity
  • 2010
TLDR
New lower bounds for randomized communication complexity and query complexity which are expressed as the optimum value of linear programs are described, which are described as the partition bounds.

Numerical linear algebra in the streaming model

TLDR
Near-optimal space bounds are given in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and approximation of matrix rank; results for turnstile updates are proved.

The pattern matrix method for lower bounds on quantum communication

TLDR
An entirely different proof of Razborov's result is given, using the original, one-dimensional discrepancy method, which refutes the commonly held intuition that the original discrepancy method fails for functions such as DISJOINTNESS and establishes a large new class of total Boolean functions whose quantum communication complexity is at best polynomially smaller than their classical complexity.

The Relationship between Inner Product and Counting Cycles

TLDR
It is shown that the quantum/nondeterministic communication complexity of Cycle-Counting is roughly Ω((n - b)/(b - a)) when a ≡ b (mod 2) and this implies that the lower bounds for Cycle-counting and related problems still hold for quantum protocols.