text: 410,60,1161460501991182336,9674682,Kohei Hayashi,"Happy to share our new paper w/ Yamaguchi, Sugawara & Maeda. We show a lot of light-weight CNN modules are graphically representable as tensor networks. Architecture search in the graphs finds dense Pareto solutions for the accuracy/efficiency tradeoff. <LINK> <LINK>",https://arxiv.org/abs/1908.04471,"Tensor decomposition methods are widely used for model compression and fast inference in convolutional neural networks (CNNs). Although many decompositions are conceivable, only CP decomposition and a few others have been applied in practice, and no extensive comparisons have been made between available methods. Previous studies have not determined how many decompositions are available, nor which of them is optimal. In this study, we first characterize a decomposition class specific to CNNs by adopting a flexible graphical notation. The class includes such well-known CNN modules as depthwise separable convolution layers and bottleneck layers, but also previously unknown modules with nonlinear activations. We also experimentally compare the tradeoff between prediction accuracy and time/space complexity for modules found by enumerating all possible decompositions, or by using a neural architecture search. We find some nonlinear decompositions outperform existing ones. ","Einconv: Exploring Unexplored Tensor Network Decompositions for