Matrix Multiplication and Number On the Forehead Communication

02/22/2023
by   Josh Alman, et al.
0

Three-player Number On the Forehead communication may be thought of as a three-player Number In the Hand promise model, in which each player is given the inputs that are supposedly on the other two players' heads, and promised that they are consistent with the inputs of of the other players. The set of all allowed inputs under this promise may be thought of as an order-3 tensor. We surprisingly observe that this tensor is exactly the matrix multiplication tensor, which is widely studied in the design of fast matrix multiplication algorithms. Using this connection, we prove a number of results about both Number On the Forehead communication and matrix multiplication, each by using known results or techniques about the other. For example, we show how the Laser method, a key technique used to design the best matrix multiplication algorithms, can also be used to design communication protocols for a variety of problems. We also show how known lower bounds for Number On the Forehead communication can be used to bound properties of the matrix multiplication tensor such as its zeroing out subrank. Finally, we substantially generalize known methods based on slice-rank for studying communication, and show how they directly relate to the matrix multiplication exponent ω.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2017

A rank 18 Waring decomposition of sM_〈 3〉 with 432 symmetries

The recent discovery that the exponent of matrix multiplication is deter...
research
10/18/2022

Faster Matrix Multiplication via Asymmetric Hashing

Fast matrix multiplication is one of the most fundamental problems in al...
research
10/19/2018

Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication

We study the known techniques for designing Matrix Multiplication algori...
research
09/22/2016

Scaling betweenness centrality using communication-efficient sparse matrix multiplication

Betweenness centrality (BC) is a crucial graph problem that measures the...
research
03/23/2023

Scalability of 3D-DFT by block tensor-matrix multiplication on the JUWELS Cluster

The 3D Discrete Fourier Transform (DFT) is a technique used to solve pro...
research
12/24/2019

An algorithm to evaluate the spectral expansion

Assume that X is a connected (q+1)-regular undirected graph of finite or...
research
06/17/2022

Maximum Class Separation as Inductive Bias in One Matrix

Maximizing the separation between classes constitutes a well-known induc...

Please sign up or login with your details

Forgot password? Click here to reset