Convex Distillation: Efficient Compression of Deep Networks via Convex Optimization
Not on the map. Why?
Abstract (arXiv)
Deploying large and complex deep neural networks on resource-constrained edge devices poses significant challenges due to their computational demands and the complexities of non-convex optimization. Traditional compression methods such as distillation and pruning often retain non-convexity that complicates fine-tuning in real-time on such devices. Moreover, these methods often necessitate extensive end-to-end network fine-tuning after compression to preserve model performance, which is not only time-consuming but also requires fully annotated datasets, thus potentially negating the benefits of efficient network compression. In this paper, we introduce a novel distillation technique that efficiently compresses the model via convex optimization -- eliminating intermediate non-convex activation functions and using only intermediate activations from the original model. Our approach enables distillation in a label-free data setting and achieves performance comparable to the original model without requiring any post-compression fine-tuning. We demonstrate the effectiveness of our method for image classification models on multiple standard datasets, and further show that in the data limited regime, our method can outperform standard non-convex distillation approaches. Our method promises significant advantages for deploying high-efficiency, low-footprint models on edge devices, making it a practical choice for real-world applications. We show that convex neural networks, when provided with rich feature representations from a large pre-trained non-convex model, can achieve performance comparable to their non-convex counterparts, opening up avenues for future research at the intersection of convex optimization and deep learning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 40 of its 57 references that are in the map. First posted on arXiv 9 Oct 2024.
Builds on
40 of 57 references.
References · 40
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2021Convex optimizationcited by 2,515
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2019Searching for MobileNetV3cited by 1,994
- 2014FitNets: Hints for Thin Deep Netscited by 1,653
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2019Similarity-Preserving Knowledge Distillationcited by 516
- 2020The Pitfalls of Simplicity Bias in Neural Networkscited by 351
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
28 more
- 2021Distilling Knowledge via Knowledge Reviewcited by 288
- 2014The Loss Surfaces of Multilayer Networkscited by 280
- 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 268
- 2018Paraphrasing Complex Network: Network Compression via Factor Transfercited by 260
- 2018Knowledge Transfer via Distillation of Activation Boundaries Formed by Hidden Neuronscited by 238
- 2013Predicting Parameters in Deep Learningcited by 224
- 2014Compressing Deep Convolutional Networks using Vector Quantizationcited by 195
- 2020Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer Networkscited by 98
- 2018Benchmark Analysis of Representative Deep Neural Network Architecturescited by 77
- 2019AI Benchmark: All About Deep Learning on Smartphones in 2019cited by 77
- 2018Knowledge Transfer with Jacobian Matchingcited by 76
- 2020Natural Language Processing Advancements By Deep Learning: A Surveycited by 50
- 2019FastGRNN: A Fast, Accurate, Stable and Tiny Kilobyte Sized Gated Recurrent Neural Networkcited by 38
- 2019Survey on Deep Neural Networks in Speech and Vision Systemscited by 37
- 2020Vector-output ReLU Neural Network Problems are Copositive Programs: Convex Analysis of Two Layer Networks and Polynomial-time Algorithmscited by 34
- 2022Fast Convex Optimization for Two-Layer ReLU Networks: Equivalent Model Classes and Cone Decompositionscited by 31
- 2022Unraveling Attention via Convex Duality: Analysis and Interpretations of Vision Transformerscited by 30
- 2020Evolution of Image Segmentation using Deep Convolutional Neural Network: A Surveycited by 28
- 2020On the Convergence of Nesterov's Accelerated Gradient Method in Stochastic Settingscited by 27
- 2021Scaling Laws for Deep Learningcited by 26
- 2023Simplicity Bias in 1-Hidden Layer Neural Networkscited by 26
- 2022FitHuBERT: Going Thinner and Deeper for Knowledge Distillation of Speech Self-Supervised Learningcited by 25
- 2019Autonomous Navigation via Deep Reinforcement Learning for Resource Constraint Edge Nodes using Transfer Learningcited by 19
- 2021Hidden Convexity of Wasserstein GANs: Interpretable Generative Models with Closed-Form Solutionscited by 14
- 2022Convexifying Transformers: Improving optimization and understanding of transformer networkscited by 12
- 2024Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Timecited by 11
- 2019Deep Learning at the Edgecited by 9
- 2019On Universal Approximation by Neural Networks with Uniform Guarantees on Approximation of Infinite Dimensional Mapscited by 8
Built on by
Not cited yet.