Arithmetic Circuits, Structured Matrices and (not so) Deep Learning
Not on the map. Why?
Abstract (arXiv)
This survey presents a necessarily incomplete (and biased) overview of results at the intersection of arithmetic circuit complexity, structured matrices and deep learning. Recently there has been some research activity in replacing unstructured weight matrices in neural networks by structured ones (with the aim of reducing the size of the corresponding deep learning models). Most of this work has been experimental and in this survey, we formalize the research question and show how a recent work that combines arithmetic circuit complexity, structured matrices and deep learning essentially answers this question. This survey is targeted at complexity theorists who might enjoy reading about how tools developed in arithmetic circuit complexity helped design (to the best of our knowledge) a new family of structured matrices, which in turn seem well-suited for applications in deep learning. However, we hope that folks primarily interested in deep learning would also appreciate the connections to complexity theory.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 45 references that are in the map. First posted on arXiv 24 Jun 2022.
Builds on
13 of 45 references.
References · 13
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019Green AIcited by 620
- 2015Recent Advances in Convolutional Neural Networkscited by 360
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2019Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizationscited by 73
- 2016Tunable Efficient Unitary Neural Networks (EUNN) and their application to RNNscited by 62
- 2015Structured Transforms for Small-Footprint Deep Learningcited by 41
- 2020Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Mapscited by 36
- 2018Quadrature-based features for kernel approximationcited by 25
- 2018Learning Compressed Transforms with Low Displacement Rankcited by 19
- 2017Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rankcited by 11
- 2014Fast Approximation of Rotations and Hessians matricescited by 8
1 more
Built on by
Citing papers per year: 2024: 1.
1 paper.