user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: DeepOBS: A Deep Learning Optimizer Benchmark Suite

Paper content:
Because the choice and tuning of the optimizer affects the speed, and ultimately the performance of deep learning, there is significant past and recent research in this area.
Yet, perhaps surprisingly, there is no generally agreed-upon protocol for the quantitative and reproducible evaluation of optimization strategies for deep learning.
We suggest routines and benchmarks for stochastic optimization, with special focus on the unique aspects of deep learning, such as stochasticity, tunability and generalization.
As the primary contribution, we present DeepOBS, a Python package of deep learning optimization benchmarks.
The package addresses key challenges in the quantitative assessment of stochastic optimizers, and automates most steps of benchmarking.
The library includes a wide and extensible set of ready-to-use realistic optimization problems, such as training Residual Networks for image classification on ImageNet or character-level language prediction models, as well as popular classics like MNIST and CIFAR-10.
The package also provides realistic baseline results for the most popular optimizers on these test problems, ensuring a fair comparison to the competition when benchmarking new optimizers, and without having to run costly experiments.
It comes with output back-ends that directly produce LaTeX code for inclusion in academic publications.
It supports TensorFlow and is available open source.
As deep learning has become mainstream, research on aspects like architectures BID15 BID16 BID48 BID50 BID41 and hardware BID33 BID9 Jouppi, 2016) has exploded, and helped professionalize the field.
In comparison, the optimization routines used to train deep nets have arguable changed only little.
Comparably simple first-order methods like SGD BID38 , its momentum variants (MOMENTUM) BID34 BID31 and ADAM BID20 remain standards BID14 BID19 .
The low practical relevance of more advanced optimization methods is not for lack of research, though.
There is a host of papers proposing new ideas for acceleration of first-order methods BID13 BID49 BID54 BID12 BID3 BID24 BID37 , incorporation of second-order information BID27 BID28 BID5 BID8 , and automating optimization BID43 BID25 BID39 , to name just a few.
One problem is that these methods are algorithmically involved and difficult to reproduce by practitioners.
If they are not provided in packages for popular frameworks like TENSORFLOW, PYTORCH etc., they get little traction.
Another problem, which we hope to address here, is that new optimization routines are often not convincingly compared to simpler alternatives in research papers, so practitioners are left wondering which of the many new choices is the best (and which ones even really work in the first place).Designing
an empirical protocol for deep learning optimizers is not straightforward, and the corresponding experiments can be time-consuming. This is partly
due to the idiosyncrasies of the domain:• Generalization: While the optimization algorithm (should) only ever see the training-set, the practitioner cares about performance of the trained model on the test set. Worse, in some
important application domains, the optimizer's loss function is not the objective we ultimately care about. For instance in
image classification, the real interest may be in the percentage of correctly labeled images, the accuracy. Since this 0-1
loss is infeasible in practice BID26 , a surrogate loss function is used instead. So which score
should actually be presented in a comparison of optimizers? Train loss, because
that is what the optimizer actually works on; test loss, because an over-fitting optimizer is useless, or test accuracy, because that's what the human user cares about?• Stochasticity: Sub-sampling
(batching) the data-set to compute estimates of the loss function and its gradient introduces stochasticity. Thus, when an optimizer is run
only once on a given problem, its performance may be misleading due to random fluctuations. The same stochasticity also causes
many optimization algorithms to have one or several tuning parameters (learning rates, etc.). How should an optimizer with two free
parameter be compared in a fair way with one that has only one, or even no free parameters?• Realistic Settings, Fair Competition
: There is a widely-held belief that popular standards like MNIST and CIFAR-10 are too simplistic to serve as a realistic place-holder for a contemporary combination of large-scale data set and architecture. While this worry is not unfounded, researchers
, ourselves included, have sometimes found it hard to satisfy the demands of reviewers for ever new data sets and architectures. Finding and preparing such data sets and building
a reasonable architecture for them is time-consuming for researchers who want to focus on their novel algorithm. Even when this is done, one then has to not just
run one's own algorithm, but also various competing baselines, like SGD, MOMENTUM, ADAM, etc. This step does not just cost time, it also poses
a risk of bias, as the competition invariably receives less care than one's own method. Reviewers and readers can never be quite sure that
an author has not tried a bit too much to make their own method look good, either by choosing a convenient training problem, or by neglecting to tune the competition.To address these problems, we propose an extensible, open-source benchmark specifically for optimization methods on deep learning architectures. We make the following three contributions:• A protocol
for benchmarking stochastic optimizers. Section 2 discusses and recommends best practices for
the evaluation of deep learning optimizers. We define three key performance indicators: final performance
, speed, and tunability, and suggest means of measuring all three in practice. We provide evidence that it is necessary to show the results
of multiple runs in order to get a realistic assessment. Finally, we strongly recommend reporting both loss and accuracy
, for both training and test set, when demonstrating a new optimizer as there is no obvious way those four learning curves are connected in general.• DEEPOBS 1 , a deep learning optimizer benchmark suite. We have
distilled the above ideas into an open-source python package
, written in TENSORFLOW BID0 , which automates most of the steps presented in section 2. The package currently provides over twenty off-the-shelf test problems
across four application domains, including image classification and natural language processing, and this collection can be extended and adapted as the field makes progress. The test problems range in complexity from stochastic two dimensional
functions to contemporary deep neural networks capable of delivering near state-of-the-art results on data sets such as IMAGENET. The package is easy to install in python, using the pip toolchain. It
automatically downloads data sets, sets up models, and provides a
back-end to automatically produce L A T E X code that can directly be included in academic publications. This automation does not just save time, it also helps researchers to
create reproducible, comparable, and interpretable results.• Benchmark of popular optimizers From the collection of test problems
, two sets, of four simple ("small") and four more demanding ("large") problems, respectively, are selected as a core set of benchmarks. Researchers can design their algorithm in rapid iterations on the simpler
set, then test on the more demanding set. We argue that this protocol saves time, while also reducing the risk of over-fitting
in the algorithm design loop. The package also provides realistic baselines results for the most popular optimizers
on those test problems.In Section 4 we report on the performance of SGD, SGD with momentum (MOMENTUM) and ADAM on the small and large benchmarks (this also demonstrates the output of the benchmark). For each optimizer we perform an exhaustive but realistic hyperparameter search. The
best performing results are provided with DEEPOBS and can be used as a fair performance
metric for new optimizers without the need to compute these baselines again.We invite the authors of other algorithms to add their own method to the benchmark (via a git pull-request). We hope that the benchmark will offer a common platform, allowing researchers to publicise
their algorithms, giving practitioners a clear view on the state of the art, and helping the field to more rapidly make progress.
Deep learning continues to pose a challenging domain for optimization algorithms.
Aspects like stochasticity and generalization make it challenging to benchmark optimization algorithms against each other.
We have discussed best practices for experimental protocols, and presented the DEEPOBS package, which provide an open-source implementation of these standards.
We hope that DEEPOBS can help researchers working on optimization for deep learning to build better algorithms, by simultaneously making the empirical evaluation simpler, yet also more reproducible and fair.
By providing a common ground for methods to be compared on, we aim to speed up the development of deep-learning optimizers, and aid practitioners in their decision for an algorithm.

assistant: text: We provide a software package that drastically simplifies, automates, and improves the evaluation of deep learning optimizers.