Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training
S. Gratton, A. Kopanicakova, Ph. L. Toint

TL;DR
This paper introduces a class of multi-level optimization algorithms that do not require objective function evaluations, aiming to reduce noise sensitivity and computational costs, with applications to neural network training.
Contribution
It proposes a novel multi-level, objective-function-free optimization framework, including the AdaGrad method, for more noise-robust and efficient neural network training.
Findings
Algorithms are less sensitive to noise.
Reduced computational complexity demonstrated.
Effective in deep neural network training.
Abstract
A class of multi-level algorithms for unconstrained nonlinear optimization is presented which does not require the evaluation of the objective function. The class contains the momentum-less AdaGrad method as a particular (single-level) instance. The choice of avoiding the evaluation of the objective function is intended to make the algorithms of the class less sensitive to noise, while the multi-level feature aims at reducing their computational cost. The evaluation complexity of these algorithms is analyzed and their behaviour in the presence of noise is then illustrated in the context of training deep neural networks for supervised learning applications.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Neural Networks and Reservoir Computing · Optical Systems and Laser Technology
MethodsAdaGrad
