OptiRoulette Optimizer: A New Stochastic Meta-Optimizer for up to 5.3x Faster Convergence
Not on the map. Why?
Abstract (arXiv)
This paper presents OptiRoulette, a stochastic meta-optimizer that selects update rules during training instead of fixing a single optimizer. The method combines warmup optimizer locking, random sampling from an active optimizer pool, compatibility-aware learning-rate scaling during optimizer transitions, and failure-aware pool replacement. OptiRoulette is implemented as a drop-in, "torch.optim.Optimizer-compatible" component and packaged for pip installation. We report completed 10-seed results on five image-classification suites: CIFAR-100, CIFAR-100-C, SVHN, Tiny ImageNet, and Caltech-256. Against a single-optimizer AdamW baseline, OptiRoulette improves mean test accuracy from 0.6734 to 0.7656 on CIFAR-100 (+9.22 percentage points), 0.2904 to 0.3355 on CIFAR-100-C (+4.52), 0.9667 to 0.9756 on SVHN (+0.89), 0.5669 to 0.6642 on Tiny ImageNet (+9.73), and 0.5946 to 0.6920 on Caltech-256 (+9.74). Its main advantage is convergence reliability at higher targets: it reaches CIFAR-100/CIFAR-100-C 0.75, SVHN 0.96, Tiny ImageNet 0.65, and Caltech-256 0.62 validation accuracy in 10/10 runs, while the AdamW baseline reaches none of these targets within budget. On shared targets, OptiRoulette also reduces time-to-target (e.g., Caltech-256 at 0.59: 25.7 vs 77.0 epochs). Paired-seed deltas are positive on all datasets; CIFAR-100-C test ROC-AUC is the only metric not statistically significant in the current 10-seed study.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 23 references that are in the map. First posted on arXiv 20 Feb 2026.
Builds on
12 of 23 references.
References · 12
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2016Wide Residual Networkscited by 3,057
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2016Learning to learn by gradient descent by gradient descentcited by 616
- 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 333
- 2013Maxout Networkscited by 186
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 181
- 2017Improving Generalization Performance by Switching from Adam to SGDcited by 121
- 2017Borrowing Treasures from the Wealthy: Deep Transfer Learning through Selective Joint Fine-tuningcited by 48
- 2021UPANets: Learning from the Universal Pixel Attention Networkscited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Temperon: Full-Time SAM Quality at a Third Less Wall-Clock31 Jul 2026