# ALF: Autoencoder-based Low-rank Filter-sharing for Efficient Convolutional Neural Networks

arXiv: https://arxiv.org/abs/2007.13384 · HTML: https://mlsanity.com/paper/2007.13384/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Jul 2020.

## Built on by (most cited first, 2 of 2)

- [L2PF -- Learning to Prune Faster](https://mlsanity.com/paper/2101.02663/) (2021)
- [Communication Optimization in Large Scale Federated Learning using Autoencoder Compressed Weight Updates](https://mlsanity.com/paper/2108.05670/) (2021)

## Abstract (arXiv)

Closing the gap between the hardware requirements of state-of-the-art convolutional neural networks and the limited resources constraining embedded applications is the next big challenge in deep learning research. The computational complexity and memory footprint of such neural networks are typically daunting for deployment in resource constrained environments. Model compression techniques, such as pruning, are emphasized among other optimization methods for solving this problem. Most existing techniques require domain expertise or result in irregular sparse representations, which increase the burden of deploying deep learning applications on embedded hardware accelerators. In this paper, we propose the autoencoder-based low-rank filter-sharing technique technique (ALF). When applied to various networks, ALF is compared to state-of-the-art pruning methods, demonstrating its efficient compression capabilities on theoretical metrics as well as on an accurate, deterministic hardware-model. In our experiments, ALF showed a reduction of 70% in network parameters, 61% in operations and 41% in execution time, with minimal loss in accuracy.