LaCoOT: Layer Collapse through Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Although deep neural networks are well-known for their outstanding performance in tackling complex tasks, their hunger for computational resources remains a significant hurdle, posing energy-consumption issues and restricting their deployment on resource-constrained devices, preventing their widespread adoption. In this paper, we present an optimal transport-based method to reduce the depth of over-parametrized deep neural networks, alleviating their computational burden. More specifically, we propose a new regularization strategy based on the Max-Sliced Wasserstein distance to minimize the distance between the intermediate feature distributions in the neural network. We show that minimizing this distance enables the complete removal of intermediate layers in the network, achieving better performance/depth trade-off compared to existing techniques. We assess the effectiveness of our method on traditional image classification setups and extend it to generative image models. Our code is available at https://github.com/VGCQ/LaCoOT.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 66 of its 90 references that are in the map. First posted on arXiv 13 Jun 2024.
Builds on
66 of 90 references.
References · 66
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2023Segment Anythingcited by 8,158
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,539
- 2022Scalable Diffusion Models with Transformerscited by 5,931
- 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,848
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2013Describing Textures in the Wildcited by 2,110
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2013Fine-Grained Visual Classification of Aircraftcited by 1,701
38 more
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2018Computational Optimal Transportcited by 765
- 2023Scaling Vision Transformers to 22 Billion Parameterscited by 690
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2020What is the State of Neural Network Pruning?cited by 578
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2018How Does Batch Normalization Help Optimization?cited by 355
- 2021Sustainable AI: Environmental Implications, Challenges and Opportunitiescited by 242
- 2019Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptationcited by 235
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 226
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2018Sorting out Lipschitz function approximationcited by 211
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2015Learning with a Wasserstein Losscited by 194
- 2017Central Moment Discrepancy (CMD) for Domain-Invariant Representation Learningcited by 192
- 2018Neural Architecture Search with Bayesian Optimisation and Optimal Transportcited by 192
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 124
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2019Max-Sliced Wasserstein Distance and its use for GANscited by 118
- 2019Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networkscited by 86
- 2020Statistical and Topological Properties of Sliced Probability Divergencescited by 83
- 2016Why Deep Neural Networks for Function Approximation?cited by 82
- 2019Sliced Gromov-Wassersteincited by 66
- 2023On the Foundations of Shortcut Learningcited by 64
- 2020Wasserstein Contrastive Representation Distillationcited by 63
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2019Sliced Wasserstein Generative Modelscited by 61
- 2020Discrimination-aware Network Pruning for Deep Model Compressioncited by 50
- 2021Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projectionscited by 33
- 2021Pay attention to your loss: understanding misconceptions about 1-Lipschitz neural networkscited by 30
- 2020Optimal Transport Kernels for Sequential and Parallel Neural Architecture Searchcited by 29
- 2021In the light of feature distributions: moment matching for Neural Style Transfercited by 26
- 2021Scaling Laws for Deep Learningcited by 25
50 most cited of 66 All 66 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.