Triangular Dropout: Variable Network Width without Retraining
Not on the map. Why?
Abstract (arXiv)
One of the most fundamental design choices in neural networks is layer width: it affects the capacity of what a network can learn and determines the complexity of the solution. This latter property is often exploited when introducing information bottlenecks, forcing a network to learn compressed representations. However, such an architecture decision is typically immutable once training begins; switching to a more compressed architecture requires retraining. In this paper we present a new layer design, called Triangular Dropout, which does not have this limitation. After training, the layer can be arbitrarily reduced in width to exchange performance for narrowness. We demonstrate the construction and potential use cases of such a mechanism in three areas. Firstly, we describe the formulation of Triangular Dropout in autoencoders, creating models with selectable compression after training. Secondly, we add Triangular Dropout to VGG19 on ImageNet, creating a powerful network which, without retraining, can be significantly reduced in parameters. Lastly, we explore the application of Triangular Dropout to reinforcement learning (RL) policies on selected control problems.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 23 of its 40 references that are in the map. First posted on arXiv 2 May 2022.
Builds on
23 of 40 references.
References · 23
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2016OpenAI Gymcited by 1,684
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,054
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Dynamic Routing Between Capsulescited by 689
11 more
- 2020What is the State of Neural Network Pruning?cited by 578
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2021Dynamic Neural Networks: A Surveycited by 405
- 2017Lossy Image Compression with Compressive Autoencoderscited by 289
- 2018An Empirical Model of Large-Batch Trainingcited by 268
- 2015Conditional Computation in Neural Networks for faster modelscited by 166
- 2015Structured Pruning of Deep Convolutional Neural Networkscited by 148
- 2017Skip RNN: Learning to Skip State Updates in Recurrent Neural Networkscited by 49
- 2016Pruning Convolutional Neural Networks for Resource Efficient Inferencecited by 47
- 2020PCAAE: Principal Component Analysis Autoencoder for organising the latent space of generative networkscited by 16
- 2016Variable Computation in Recurrent Neural Networkscited by 10
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 0; 2026: 1.
3 papers.