Faster Convergence for Transformer Fine-tuning with Line Search Methods

Philip Kenneweg, Leonardo Galli, Tristan Kenneweg, Barbara Hammer
3/27/2024
cs.LGcs.AI

No official code found. Best implementation: TheMody/Faster-Convergence-for-Transformer-Fine-tuning-with-Line-Search-Methods (8 stars, last commit 2024-07-01).

Abstract

Recent works have shown that line search methods greatly increase performance of traditional stochastic gradient descent methods on a variety of datasets and architectures [1], [2]. In this work we succeed in extending line search methods to the novel and highly popular Transformer architecture and dataset domains in natural language processing. More specifically, we combine the Armijo line search with the Adam optimizer and extend it by subdividing the networks architecture into sensible units and perform the line search separately on these local units. Our optimization method outperforms the traditional Adam optimizer and achieves significant performance improvements for small data sets or small training budgets, while performing equal or better for other tested cases. Our work is publicly available as a python package, which provides a hyperparameter-free pytorch optimizer that is compatible with arbitrary network architectures.

View on arXivView PDF

Code Implementations(1)

The Repository to the Paper Faster Convergence for Transformer Fine-tuning with Line Search Methods

80PythonApr 11, 20232 years ago

Similar Papers

Cite this paper

@article{kenneweg2024faster,
  title  = {Faster Convergence for Transformer Fine-tuning with Line Search Methods},
  author = {Philip Kenneweg and Leonardo Galli and Tristan Kenneweg and Barbara Hammer},
  year   = {2024},
  eprint = {2403.18506},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.18506v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.18506.svg)](https://codeofpaper.com/paper/2403.18506)

Discussion