mlsanityData to 14 Oct 2026

Study of Training Dynamics for Memory-Constrained Fine-Tuning

arXiv 2510.19675 ↗First posted 22 Oct 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Memory-efficient training of deep neural networks has become increasingly important as models grow larger while deployment environments impose strict resource constraints. We propose TraDy, a novel transfer learning scheme leveraging two key insights: layer importance for updates is architecture-dependent and determinable a priori, while dynamic stochastic channel selection provides superior gradient approximation compared to static approaches. We introduce a dynamic channel selection approach that stochastically resamples channels between epochs within preselected layers. Extensive experiments demonstrate TraDy achieves state-of-the-art performance across various downstream tasks and architectures while maintaining strict memory constraints, achieving up to 99% activation sparsity, 95% weight derivative sparsity, and 97% reduction in FLOPs for weight derivative computation.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 33 of its 59 references that are in the map. First posted on arXiv 22 Oct 2025.

Builds on

33 of 59 references.

References · 33

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  5. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
  6. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
  7. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
  8. 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
  9. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  10. 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 673
  11. 2020Image Segmentation Using Deep Learning: A Surveycited by 660
  12. 2020MCUNet: Tiny Deep Learning on IoT Devicescited by 273
21 more
  1. 2022The Forward-Forward Algorithm: Some Preliminary Investigationscited by 266
  2. 2022Surgical Fine-Tuning Improves Adaptation to Distribution Shiftscited by 205
  3. 2022Compute Trends Across Three Eras of Machine Learningcited by 163
  4. 2022On-Device Training Under 256KB Memorycited by 160
  5. 2018Transforming Question Answering Datasets Into Natural Language Inference Datasetscited by 99
  6. 2019Are All Layers Created Equal?cited by 94
  7. 2019On the Heavy-Tailed Theory of Stochastic Gradient Descent for Deep Neural Networkscited by 43
  8. 2023Gradient-based Parameter Selection for Efficient Fine-Tuningcited by 40
  9. 2023TinyTrain: Resource-Aware Task-Adaptive Sparse Training of DNNs at the Data-Scarce Edgecited by 18
  10. 2023Less is More: Selective Layer Finetuning with SubTuningcited by 14
  11. 2022To update or not to update? Neurons at equilibrium in deep modelscited by 13
  12. 2023Efficient On-device Training via Gradient Filteringcited by 13
  13. 2023On-Device Unsupervised Image Segmentationcited by 10
  14. 2022Accelerating DNN Training with Structured Data Gradient Pruningcited by 8
  15. 2023Towards On-device Learning on the Edge: Ways to Select Neurons to Update under a Budget Constraintcited by 6
  16. 2024Activation Map Compression through Tensor Decomposition for Deep Learningcited by 6
  17. 2025PaCA: Partial Connection Adaptation for Efficient Fine-Tuningcited by 6
  18. 2023Implicit Compressibility of Overparametrized Neural Networks Trained with Heavy-Tailed SGDcited by 5
  19. 2025Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learningcited by 5
  20. 2023SCoTTi: Save Computation at Training Time with an adaptive frameworkcited by 3
  21. 2024Fine-tuning with Very Large Dropoutcited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.