Tensor network complexity of multilinear maps
Loading...
Access rights
openAccess
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Authors
Date
2019-01-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
1-21
Series
10th Innovations in Theoretical Computer Science, ITCS 2019, Leibniz International Proceedings in Informatics, LIPIcs, Volume 124
Abstract
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.Description
| openaire: EC/H2020/338077/EU//TAPEASE | openaire: EC/H2020/748354/EU//NonnegativeRank
Keywords
Arithmetic complexity, Lower bound, Multilinear map, Tensor network
Other note
Citation
Austrin, P, Kaski, P & Kubjas, K 2019, Tensor network complexity of multilinear maps . in A Blum (ed.), 10th Innovations in Theoretical Computer Science, ITCS 2019 ., 7, Leibniz International Proceedings in Informatics, LIPIcs, vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 1-21, Innovations in Theoretical Computer Science Conference, San Diego, California, United States, 10/01/2019 . https://doi.org/10.4230/LIPIcs.ITCS.2019.7