Pith. sign in

REVIEW 1 cited by

DeepOBS: A Deep Learning Optimizer Benchmark Suite

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.05499 v1 pith:CIQ5EDMP submitted 2019-03-13 cs.LG stat.ML

classification cs.LGstat.ML
keywords deeplearningoptimizationoptimizerspackagebenchmarkingbenchmarksdeepobs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Simple Optimizers for Convex Aligned Multi-Objective Optimization

    cs.LG 2025-09 reject novelty 6.0 of 10

    Convex AMOO is analyzed under Lipschitz and smooth assumptions with a maximum-gap metric, giving simple gradient methods with rates independent of the number of objectives, plus a flawed equal-weights lower bound.

Pith tools