Two-Valued Symmetric Circulant Matrices: Applications in Deep Learning
Not on the map. Why?
Abstract (arXiv)
Despite the success of deep neural networks in vision, medical diagnosis, and IoT scenarios, their deployment on resource-limited platforms poses serious challenges due to their high storage requirements, computational complexity, and large footprint. In particular, fully connected layers require a large number of weights, making it difficult for edge devices to accommodate them. To overcome these challenges associated with limited platforms, this paper proposes the Two-Valued Symmetric Circulant Matrix (TVSCM), a very sparse architecture that employs just two weights per layer to keep it circulant and symmetric. The extreme form of structured sparse architecture provides negligible storage costs compared to traditional full-weight storage. Instead of hardware and additional stages of other traditional sparse learning techniques, such as low-rank approximation and pruning approaches, this architecture provides an extreme form of sparsity, achieving very minimal storage requirements. The simulation study demonstrates more than 80× reduction in model parameters, reducing parameters from 623,290 to 7,852 on MNIST and from 24,709 to 942 on the MIT-BIH arrhythmia dataset, while maintaining comparable accuracy from 97.6% to 93.5% on MNIST and from 97.6% to 93.1% on MIT-BIH. Due to its minimal architectural requirements and very low power consumption, this architecture would be ideal for edge computing platforms, tiny-ML platforms, IoMT systems, and battery-powered systems.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 62 references that are in the map. First posted on arXiv 15 May 2026.
Builds on
18 of 62 references.
References · 18
- 2018Rethinking the Value of Network Pruningcited by 595
- 2020What is the State of Neural Network Pruning?cited by 578
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2017CirCNN: Accelerating and Compressing Deep Neural Networks Using Block-CirculantWeight Matricescited by 53
- 2015Structured Transforms for Small-Footprint Deep Learningcited by 41
- 2021A Deep Learning approach to Reduced Order Modelling of Parameter Dependent Partial Differential Equationscited by 28
- 2022Domain Generalization by Learning and Removing Domain-specific Featurescited by 28
- 2018Trained Rank Pruning for Efficient Deep Neural Networkscited by 23
- 2022Domain-Specific Risk Minimization for Out-of-Distribution Generalizationcited by 15
- 2020PERMDNN: Efficient Compressed DNN Architecture with Permuted Diagonal Matricescited by 12
- 2021BlockGNN: Towards Efficient GNN Acceleration Using Block-Circulant Weight Matricescited by 11
- 2019CircConv: A Structured Convolution with Low Complexitycited by 8
6 more
- 2021Edge Intelligence for Empowering IoT-based Healthcare Systemscited by 8
- 2024Structured Unrestricted-Rank Matrices for Parameter Efficient Fine-tuningcited by 5
- 2019Understanding and Training Deep Diagonal Circulant Neural Networkscited by 4
- 2024Structure-Preserving Network Compression Via Low-Rank Induced Training Through Linear Layers Compositioncited by 3
- 2025Block Circulant Adapter for Large Language Modelscited by 3
- 2018Classification of Informative Frames in Colonoscopy Videos Using Convolutional Neural Networks with Binarized Weightscited by 1
Built on by
Not cited yet.