Tensor network complexity of multilinear maps

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference contributionScientificvertaisarvioitu

2 Sitaatiot (Scopus)
41 Lataukset (Pure)


We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. These capture any algorithm based on low border rank tensor decompositions, such as O(nω+ϵ) time matrix multiplication, and in addition many other algorithms such as O(nlog n) time discrete Fourier transform and O(2n) time for computing the permanent of a matrix. However tensor networks sometimes yield faster algorithms than those that follow from low-rank decompositions. For instance the fastest known O(n(ω+ϵ)t) time algorithms for counting 3t-cliques can be implemented with tensor networks, even though the underlying tensor has border rank n3t for all t ≥ 2. For counting homomorphisms of a general pattern graph P into a host graph on n vertices we obtain an upper bound of O(n(ω+ϵ) bw(P)/2) where bw(P) is the branchwidth of P. This essentially matches the bound for counting cliques, and yields small improvements over previous algorithms for many choices of P. While powerful, the model still has limitations, and we are able to show a number of unconditional lower bounds for various multilinear maps, including: (a) an Ω(nbw(P)) time lower bound for counting homomorphisms from P to an n-vertex graph, matching the upper bound if ω = 2. In particular for P a v-clique this yields an Ω(nd2v/3e) time lower bound for counting v-cliques, and for P a k-uniform v-hyperclique we obtain an Ω(nv) time lower bound for k ≥ 3, ruling out tensor networks as an approach to obtaining non-trivial algorithms for hyperclique counting and the Max-3-CSP problem. (b) an Ω(20.918n) time lower bound for the permanent of an n × n matrix.

Otsikko10th Innovations in Theoretical Computer Science, ITCS 2019
ToimittajatAvrim Blum
KustantajaSchloss Dagstuhl-Leibniz-Zentrum für Informatik
ISBN (elektroninen)9783959770958
DOI - pysyväislinkit
TilaJulkaistu - 1 tammik. 2019
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisuussa
TapahtumaInnovations in Theoretical Computer Science Conference - San Diego, Yhdysvallat
Kesto: 10 tammik. 201912 tammik. 2019
Konferenssinumero: 10


NimiLeibniz International Proceedings in Informatics, LIPIcs
KustantajaSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISSN (painettu)1868-8969


ConferenceInnovations in Theoretical Computer Science Conference
KaupunkiSan Diego


Sukella tutkimusaiheisiin 'Tensor network complexity of multilinear maps'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä