Revisiting Implicit Models: Sparsity Trade-offs Capability in Weight-tied Model for Vision Tasks
Not on the map. Why?
Abstract (arXiv)
Implicit models such as Deep Equilibrium Models (DEQs) have garnered significant attention in the community for their ability to train infinite layer models with elegant solution-finding procedures and constant memory footprint. However, despite several attempts, these methods are heavily constrained by model inefficiency and optimization instability. Furthermore, fair benchmarking across relevant methods for vision tasks is missing. In this work, we revisit the line of implicit models and trace them back to the original weight-tied models. Surprisingly, we observe that weight-tied models are more effective, stable, as well as efficient on vision tasks, compared to the DEQ variants. Through the lens of these simple-yet-clean weight-tied models, we further study the fundamental limits in the model capacity of such models and propose the use of distinct sparse masks to improve the model capacity. Finally, for practitioners, we offer design guidelines regarding the depth, width, and sparsity selection for weight-tied models, and demonstrate the generalizability of our insights to other learning paradigms.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 49 of its 63 references that are in the map. First posted on arXiv 16 Jul 2023.
Builds on
49 of 63 references.
References · 49
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2018Universal Transformerscited by 613
- 2019Deep Equilibrium Modelscited by 603
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
37 more
- 2015Variational Dropout and the Local Reparameterization Trickcited by 489
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
- 2021Escaping the Big Data Paradigm with Compact Transformerscited by 261
- 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 241
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
- 2019SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solvercited by 173
- 2021Training Graph Neural Networks with 1000 Layerscited by 169
- 2015Compressing Neural Networks with the Hashing Trickcited by 150
- 2020Multiscale Deep Equilibrium Modelscited by 149
- 2022Neural Prompt Searchcited by 133
- 2020Monotone operator equilibrium networkscited by 100
- 2017Soft Weight-Sharing for Neural Network Compressioncited by 99
- 2021Lessons on Parameter Sharing across Layers in Transformerscited by 85
- 2021On Training Implicit Modelscited by 73
- 2020Group Sparsity: The Hinge Between Filter Pruning and Decomposition for Network Compressioncited by 72
- 2021Stabilizing Equilibrium Models by Jacobian Regularizationcited by 71
- 2020Can weight sharing outperform random architecture search? An investigation with TuNAScited by 68
- 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
- 2018SparseMAP: Differentiable Sparse Structured Inferencecited by 62
- 2020Weight-Sharing Neural Architecture Search: A Battle to Shrink the Optimization Gapcited by 50
- 2019Survey of Dropout Methods for Deep Neural Networkscited by 44
- 2022Deep Equilibrium Approaches to Diffusion Modelscited by 42
- 2021Recent Advances on Neural Network Pruning at Initializationcited by 41
- 2019Learning Sparse Networks Using Targeted Dropoutcited by 40
- 2017Structured Bayesian Pruning via Log-Normal Multiplicative Noisecited by 39
- 2018Recurrent Stacking of Layers for Compact Neural Machine Translation Modelscited by 38
- 2019Sharing Attention Weights for Fast Transformercited by 34
- 2022Learning Best Combination for Efficient N:M Sparsitycited by 32
- 2020Deeper Insights into Weight Sharing in Neural Architecture Searchcited by 24
- 2023Dropout Reduces Underfittingcited by 21
- 2020Stable and expressive recurrent vision modelscited by 20
- 2023Why is the State of Neural Network Pruning so Confusing? On the Fairness, Comparison Setup, and Trainability in Network Pruningcited by 16
- 2018Unsupervised Neural Machine Translation with Weight Sharingcited by 15
- 2018A Unified Framework of DNN Weight Pruning and Weight Clustering/Quantization Using ADMMcited by 10
- 2021Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offsetcited by 9
- 2022Parameter-Efficient Masking Networkscited by 9
- 2022Deep equilibrium networks are sensitive to initialization statisticscited by 8
Built on by
Not cited yet.