Reinforcement learning to choose optimizers

arXiv:2609.01811 · cs.NE, cs.LG, math.OC · Submitted 2026-09-01 · Read on arXiv

cs.NE, cs.LG, math.OC

Submitted: 2026-09-01

Updated: 2026-09-01

Comments: 20 pages, 14 figures

Code: https://github.com/bessagroup/rl2co

License: http://creativecommons.org/licenses/by/4.0/

The gist: No single optimization method is uniformly best for all problems, and the most suitable optimizer choice can change during a run.

Terminology

Abstract

No single optimization method is uniformly best for all problems, and the most suitable optimizer choice can change during a run. Existing approaches that change optimizer during execution typically predetermine part of the strategy: the portfolio is restricted to one algorithm class, the switch occurs once at a fixed time, or the frequency of decisions is treated as a hyperparameter rather than a learned one. We introduce "Reinforcement Learning to Choose Optimizers", which formulates the optimization algorithm choice as a sequential decision-making problem. At each decision, a recurrent policy reads the current run state and decides both which optimizer should be used next and for how long. The portfolio includes both gradient-based and derivative-free optimizers, and each switch passes on the current best solution and a representative step size. A context proxy conditions a gating network over expert heads, and training employs a decoupled actor-critic whose return is expressed in the same empirical runtime distribution metric used at evaluation. Training tasks and portfolio are designed jointly so that no optimizer dominates. On unseen problems, the learned policy outperforms every portfolio optimizer at all but the smallest budgets, and it remains robust under distribution shift.

Sources

Related papers