Pith. sign in

DeepOBS: A Deep Learning Optimizer Benchmark Suite

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

cs.LG 1

years

2025 1

verdicts

REJECT 1

representative citing papers

Simple Optimizers for Convex Aligned Multi-Objective Optimization

cs.LG · 2025-09-06 · reject · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Simple Optimizers for Convex Aligned Multi-Objective Optimization cs.LG · 2025-09-06 · reject · none · ref 33 · internal anchor

    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.