English

Celo: Training Versatile Learned Optimizers on a Compute Diet

Machine Learning 2025-06-23 v2

Abstract

Learned optimization has emerged as a promising alternative to hand-crafted optimizers, with the potential to discover stronger learned update rules that enable faster, hyperparameter-free training of neural networks. A critical element for practically useful learned optimizers, that can be used off-the-shelf after meta-training, is strong meta-generalization: the ability to apply the optimizers to new tasks. Recent state-of-the-art work in learned optimizers, VeLO (Metz et al., 2022), requires a large number of highly diverse meta-training tasks along with massive computational resources, 4000 TPU months, to achieve meta-generalization. This makes further improvements to such learned optimizers impractical. In this work, we identify several key elements in learned optimizer architectures and meta-training procedures that can lead to strong meta-generalization. We also propose evaluation metrics to reliably assess quantitative performance of an optimizer at scale on a set of evaluation tasks. Our proposed approach, Celo, makes a significant leap in improving the meta-generalization performance of learned optimizers and also outperforms tuned state-of-the-art optimizers on a diverse set of out-of-distribution tasks, despite being meta-trained for just 24 GPU hours.

Keywords

Cite

@article{arxiv.2501.12670,
  title  = {Celo: Training Versatile Learned Optimizers on a Compute Diet},
  author = {Abhinav Moudgil and Boris Knyazev and Guillaume Lajoie and Eugene Belilovsky},
  journal= {arXiv preprint arXiv:2501.12670},
  year   = {2025}
}
R2 v1 2026-06-28T21:13:13.689Z