paper-with-me

Papers

Using a one dimensional parabolic model of the full-batch loss to estimate learning rates during training

2021-08-31 · Maximus Mutschler, Kevin Laube, Andreas Zell

A fundamental challenge in Deep Learning is to find optimal step sizes for stochastic gradient descent automatically. In traditional optimization, line searches are a commonly used method to determine step sizes. One problem in Deep Learning is that finding appropriate step sizes on the full-batch loss is unfeasibly expensive. Therefore, classical line search approaches, designed for losses without inherent noise, are usually not applicable. Recent empirical findings suggest, inter alia, that the full-batch loss behaves locally parabolically in the direction of noisy update step directions. Furthermore, the trend of the optimal update step size changes slowly. By exploiting these and more findings, this work introduces a line-search method that approximates the full-batch loss with a parabola estimated over several mini-batches. Learning rates are derived from such parabolas during training. In the experiments conducted, our approach is on par with SGD with Momentum tuned with a piece-wise constant learning rate schedule and often outperforms other line search approaches for Deep Learning across models, datasets, and batch sizes on validation and test accuracy. In addition, our approach is the first line search approach for Deep Learning that samples a larger batch size over multiple inferences to still work in low-batch scenarios.

📄 PDF Abstract BibTeX arXiv:2108.13880

Code (1)

cogsys-tuebingen/labpal 공식 구현 pytorch

Tasks

Deep Learning

Methods 이 논문이 사용한 방법론

SGD with Momentum 설명 없음
SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

Parabolic Approximation Line Search for DNNs

2019-03-28 · NeurIPS 2020 12 · Maximus Mutschler, Andreas Zell

A major challenge in current optimization research for deep learning is to automatically find optimal step sizes for each update step. The optimal step size is closely related to the shape of the loss in the update step …

Empirically explaining SGD from a line search perspective

2021-03-31 · Maximus Mutschler, Andreas Zell

Optimization in Deep Learning is mainly guided by vague intuitions and strong assumptions, with a limited understanding how and why these work in practice. To shed more light on this, our work provides some deeper unders…

Application of maximal monotone operator method for solving Hamilton-Jacobi-Bellman equation arising from optimal portfolio selection problem

2021-04-13 · Daniel Sevcovic, Cyril Izuchukwu Udeani

In this paper, we investigate a fully nonlinear evolutionary Hamilton-Jacobi-Bellman (HJB) parabolic equation utilizing the monotone operator technique. We consider the HJB equation arising from portfolio optimization se…

Portfolio Optimization

Moving-Horizon Estimators for Hyperbolic and Parabolic PDEs in 1-D

2024-01-04 · Luke Bhan, Yuanyuan Shi, Iasson Karafyllis, Miroslav Krstic 외

Observers for PDEs are themselves PDEs. Therefore, producing real time estimates with such observers is computationally burdensome. For both finite-dimensional and ODE systems, moving-horizon estimators (MHE) are operato…

Physics-Informed Neural Network Method for Parabolic Differential Equations with Sharply Perturbed Initial Conditions

2022-08-18 · Yifei Zong, Qizhi He, Alexandre M. Tartakovsky

In this paper, we develop a physics-informed neural network (PINN) model for parabolic problems with a sharply perturbed initial condition. As an example of a parabolic problem, we consider the advection-dispersion equat…