mlsanityData to 14 Oct 2026

Auto-Compressing Networks

arXiv 2506.09714 ↗First posted 11 Jun 2025cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Deep neural networks with short residual connections have demonstrated remarkable success across domains, but increasing depth often introduces computational redundancy without corresponding improvements in representation quality. We introduce Auto-Compressing Networks (ACNs), an architectural variant where additive long feedforward connections from each layer to the output replace traditional short residual connections. By analyzing the distinct dynamics induced by this modification, we reveal a unique property we coin as auto-compression, the ability of a network to organically compress information during training with gradient descent, through architectural design alone. Through auto-compression, information is dynamically "pushed" into early layers during training, enhancing their representational quality and revealing potential redundancy in deeper ones. We theoretically show that this property emerges from layer-wise training patterns present in ACNs, where layers are dynamically utilized during training based on task requirements. We also find that ACNs exhibit enhanced noise robustness compared to residual networks, superior performance in low-data settings, improved transfer learning capabilities, and mitigate catastrophic forgetting suggesting that they learn representations that generalize better despite using fewer parameters. Our results demonstrate up to 18% reduction in catastrophic forgetting and 30-80% architectural compression while maintaining accuracy across vision transformers, MLP-mixers, and BERT architectures. These findings establish ACNs as a practical approach to developing efficient neural architectures that automatically adapt their computational footprint to task complexity, while learning robust representations suitable for noisy real-world tasks and continual learning scenarios.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 53 of its 86 references that are in the map. First posted on arXiv 11 Jun 2025.

Builds on

53 of 86 references.

References · 53

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  4. 2020Language Models are Few-Shot Learnerscited by 32,419
  5. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  6. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  7. 2016Densely Connected Convolutional Networkscited by 6,720
  8. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  9. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  10. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
  11. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  12. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
38 more
  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  2. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  3. 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,446
  4. 2016Understanding intermediate layers using linear classifier probescited by 1,353
  5. 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
  6. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  7. 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,043
  8. 2016Deep Networks with Stochastic Depthcited by 979
  9. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
  10. 2019Three scenarios for continual learningcited by 614
  11. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
  12. 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
  13. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
  14. 2017Deep Layer Aggregationcited by 436
  15. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
  16. 2014Deeply-Supervised Netscited by 367
  17. 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 332
  18. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  19. 2020ReZero is All You Need: Fast Convergence at Large Depthcited by 264
  20. 2015Highway Networkscited by 260
  21. 2016Direct Feedback Alignment Provides Learning in Deep Neural Networkscited by 240
  22. 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
  23. 2016FractalNet: Ultra-Deep Neural Networks without Residualscited by 216
  24. 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 189
  25. 2017The Shattered Gradients Problem: If resnets are the answer, then what is the question?cited by 157
  26. 2024Hyper-Connectionscited by 84
  27. 2024Transformer Layers as Painterscited by 54
  28. 2024DenseFormer: Enhancing Information Flow in Transformers via Depth Weighted Averagingcited by 53
  29. 2025Do Language Models Use Their Depth Efficiently?cited by 50
  30. 2017DiracNets: Training Very Deep Neural Networks Without Skip-Connectionscited by 47
  31. 2024Tracing Representation Progression: Analyzing and Enhancing Layer-Wise Similaritycited by 36
  32. 2016Feedback Networkscited by 29
  33. 2018Exploiting Deep Representations for Neural Machine Translationcited by 23
  34. 2018Norm-Preservation: Why Residual Networks Can Become Extremely Deep?cited by 12
  35. 2024Residual Connections Harm Generative Representation Learningcited by 11
  36. 2022Depth-Wise Attention (DWAtt): A Layer Fusion Method for Data-Efficient Classificationcited by 10
  37. 2016Learning Identity Mappings with Residual Gatescited by 6
  38. 2020Interpolation between Residual and Non-Residual Networkscited by 6

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.