Testing tensor products

04/29/2019
by   Irit Dinur, et al.
0

A function f:[n]^d→F_2 is a direct sum if it is of the form f((a_1,...,a_d)) = f_1(a_1)+... + f_d (a_d), for some d functions f_1,...,f_d:[n]→F_2. We present a 4-query test which distinguishes between direct sums and functions that are far from them. The test relies on the BLR linearity test and on the direct product test constructed by Dinur and Steurer. We also present a different test, which queries the function (d+1) times, but is easier to analyze. In multiplicative ± 1 notation, the above reads as follows. A d-dimensional tensor with ± 1 entries is called a tensor product if it is a tensor product of d vectors with ± 1 entries. In other words, it is a tensor product if it is of rank 1. The presented tests check whether a given tensor is close to a tensor product.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2019

Towards a General Direct Product Testing Theorem

The Direct Product encoding of a string a∈{0,1}^n on an underlying domai...
research
07/02/2015

Simple, Fast Semantic Parsing with a Tensor Kernel

We describe a simple approach to semantic parsing based on a tensor prod...
research
09/11/2019

Faster Johnson-Lindenstrauss Transforms via Kronecker Products

The Kronecker product is an important matrix operation with a wide range...
research
05/17/2023

Tensor Products and Hyperdimensional Computing

Following up on a previous analysis of graph embeddings, we generalize a...
research
08/18/2023

Characterizing Direct Product Testing via Coboundary Expansion

A d-dimensional simplicial complex X is said to support a direct product...
research
08/18/2022

Memory and Capacity of Graph Embedding Methods

This paper analyzes the graph embedding method introduced in <cit.>, whi...

Please sign up or login with your details

Forgot password? Click here to reset