Memory and Capacity of Graph Embedding Methods. (arXiv:2208.08769v2 [stat.ML] UPDATED)

This paper analyzes the graph embedding method introduced in
\cite{Qiu_Recipe}, which is a bind-and-sum approach using spherical codes and
the tensor product to represent the edge set of a graph. We compare our
spherical/tensor method to similar methods, and in particular we examine the
competing scheme of Rademacher codes paired with the Hadamard product. We show
that the while the Hadamard product doesn't increase the dimension like the
tensor product, it suffers a proportional penalty in the number of edges …

arxiv capacity embedding graph memory