paper-with-me

홈 › Papers

A Closer Look at Deep Learning Heuristics: Learning rate restarts, Warmup and Distillation

2018-10-29 · ICLR 2019 5 · Akhilesh Gotmare, Nitish Shirish Keskar, Caiming Xiong, Richard Socher

The convergence rate and final performance of common deep learning models have significantly benefited from heuristics such as learning rate schedules, knowledge distillation, skip connections, and normalization layers. In the absence of theoretical underpinnings, controlled experiments aimed at explaining these strategies can aid our understanding of deep learning landscapes and the training dynamics. Existing approaches for empirical analysis rely on tools of linear interpolation and visualizations with dimensionality reduction, each with their limitations. Instead, we revisit such analysis of heuristics through the lens of recently proposed methods for loss surface and representation analysis, viz., mode connectivity and canonical correlation analysis (CCA), and hypothesize reasons for the success of the heuristics. In particular, we explore knowledge distillation and learning rate heuristics of (cosine) restarts and warmup using mode connectivity and CCA. Our empirical analysis suggests that: (a) the reasons often quoted for the success of cosine annealing are not evidenced in practice; (b) that the effect of learning rate warmup is to prevent the deeper layers from creating training instability; and (c) that the latent knowledge shared by the teacher is primarily disbursed to the deeper layers.

📄 PDF Abstract BibTeX arXiv:1810.13243

Code (0)

등록된 구현이 없습니다.

Tasks

Dimensionality ReductionKnowledge Distillation

Methods 이 논문이 사용한 방법론

Knowledge Distillation A very simple way to improve the performance of almost any machine learning algorithm is to train many different models on the same data and then to average their predictions.…
Cosine Annealing Cosine Annealing is a type of learning rate schedule that has the effect of starting with a large learning rate that is relatively rapidly decreased to a minimum value before…

Similar Papers 제목 키워드 기반

Advancing Lazy-Grounding ASP Solving Techniques -- Restarts, Phase Saving, Heuristics, and More

2020-08-08 · Antonius Weinzierl, Richard Taupe, Gerhard Friedrich

Answer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI. The traditional ground-and-solve approach, however, requires ASP pr…

Large Batch Training Does Not Need Warmup

2020-02-04 · Zhouyuan Huo, Bin Gu, Heng Huang

Training deep neural networks using a large batch size has shown promising results and benefits many real-world applications. However, the optimizer converges slowly at early epochs and there is a gap between large-batch…

Towards Ultra Rapid Restarts

2014-02-18 · Shai Haim, Marijn Heule

We observe a trend regarding restart strategies used in SAT solvers. A few years ago, most state-of-the-art solvers restarted on average after a few thousands of backtracks. Currently, restarting after a dozen backtracks…

Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems

2014-01-18 · Gilles Pesant, Claude-Guy Quimper, Alessandro Zanarini

Designing a search heuristic for constraint programming that is reliable across problem domains has been an important research topic in recent years. This paper concentrates on one family of candidates: counting-based se…

Scheduling

A Loss Curvature Perspective on Training Instability in Deep Learning

2021-10-08 · Justin Gilmer, Behrooz Ghorbani, Ankush Garg, Sneha Kudugunta 외

In this work, we study the evolution of the loss Hessian across many classification tasks in order to understand the effect the curvature of the loss has on the training dynamics. Whereas prior work has focused on how di…

Deep LearningNavigate