mlsanityData to 7 Oct 2026

Simulated Annealing in Early Layers Leads to Better Generalization

arXiv 2304.04858 ↗First posted 10 Apr 2023cs.LG cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Recently, a number of iterative learning methods have been introduced to improve generalization. These typically rely on training for longer periods of time in exchange for improved generalization. LLF (later-layer-forgetting) is a state-of-the-art method in this category. It strengthens learning in early layers by periodically re-initializing the last few layers of the network. Our principal innovation in this work is to use Simulated annealing in EArly Layers (SEAL) of the network in place of re-initialization of later layers. Essentially, later layers go through the normal gradient descent process, while the early layers go through short stints of gradient ascent followed by gradient descent. Extensive experiments on the popular Tiny-ImageNet dataset benchmark and a series of transfer learning and few-shot learning tasks show that we outperform LLF by a significant margin. We further show that, compared to normal training, LLF features, although improving on the target task, degrade the transfer learning performance across all datasets we explored. In comparison, our method outperforms LLF across the same target datasets by a large margin. We also show that the prediction depth of our method is significantly lower than that of LLF and normal training, indicating on average better prediction performance.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 28 of its 47 references that are in the map. First posted on arXiv 10 Apr 2023.

Builds on

28 of 47 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
  3. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  4. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  5. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  7. 2016Matching Networks for One Shot Learningcited by 2,246
  8. 2013Fine-Grained Visual Classification of Aircraftcited by 1,701
  9. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
  10. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  11. 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,139
  12. 2019When Does Label Smoothing Help?cited by 985
16 more
  1. 2019Skin Lesion Analysis Toward Melanoma Detection 2018: A Challenge Hosted by the International Skin Imaging Collaboration (ISIC)cited by 657
  2. 2018Born Again Neural Networkscited by 539
  3. 2022How Do Vision Transformers Work?cited by 305
  4. 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
  5. 2017How to Escape Saddle Points Efficientlycited by 284
  6. 2016Using Deep Learning for Image-Based Plant Disease Detectioncited by 216
  7. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
  8. 2020Self-Distillation Amplifies Regularization in Hilbert Spacecited by 171
  9. 2021Deep Learning Through the Lens of Example Difficultycited by 139
  10. 2020What makes instance discrimination good for transfer learning?cited by 111
  11. 2020Self-training for Few-shot Transfer Across Extreme Task Differencescited by 75
  12. 2018Knowledge Distillation in Generations: More Tolerant Teachers Educate Better Studentscited by 50
  13. 2022Fortuitous Forgetting in Connectionist Networkscited by 39
  14. 2022Revisiting Self-Distillationcited by 23
  15. 2021Knowledge Evolution in Neural Networkscited by 18
  16. 2021SA-GD: Improved Gradient Descent Learning Strategy with Simulated Annealingcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 3; 2026: 1.

6 papers.