用预计算的超参列表,让NAdamW训练神经网络更快更省力。
Training neural networks faster with minimal tuning using pre-computed lists of hyperparameters for NAdamW
- 用大量真实任务数据生成可复用的超参组合列表。
- 在仅5次尝试下表现优于手动调参和贝叶斯优化工具。
- 适合资源有限但想快速获得好结果的研究者或工程师。
若要使用主流优化算法训练神经网络,往往面临如何设置各类优化与正则化超参数的困境。当计算资源充足时,可通过多种方法寻找优质超参配置;但资源受限时,只能依赖质量不明的默认值,或进行极简的手动调参。此前Metz等(2020)提出使用从大规模超参搜索中得到的有序超参设置列表,但尚未有能在典型深度学习任务上通用且高效的方案。本文基于AlgoPerf: Training Algorithms基准中的真实训练任务,构建了NAdamW的超参列表,包含权重衰减、标签平滑和丢弃法等基本正则化策略的设置。其最佳配置在未参与构建的测试任务上表现良好,仅需五次试验即可实现即插即用的高效调优,显著优于标准学习率/权重衰减扫描和现成贝叶斯优化工具。
原文摘要 · Abstract (English)
If we want to train a neural network using any of the most popular optimization algorithms, we are immediately faced with a dilemma: how to set the various optimization and regularization hyperparameters? When computational resources are abundant, there are a variety of methods for finding good hyperparameter settings, but when resources are limited the only realistic choices are using standard default values of uncertain quality and provenance, or tuning only a couple of the most important hyperparameters via extremely limited handdesigned sweeps. Extending the idea of default settings to a modest tuning budget, Metz et al. (2020) proposed using ordered lists of well-performing hyperparameter settings, derived from a broad hyperparameter search on a large library of training workloads. However, to date, no practical and performant hyperparameter lists that generalize to representative deep learning workloads have been demonstrated. In this paper, we present hyperparameter lists for NAdamW derived from extensive experiments on the realistic workloads in the AlgoPerf: Training Algorithms benchmark. Our hyperparameter lists also include values for basic regularization techniques (i.e. weight decay, label smoothing, and dropout). In particular, our best NAdamW hyperparameter list performs well on AlgoPerf held-out workloads not used to construct it, and represents a compelling turn-key approach to tuning when restricted to five or fewer trials. It also outperforms basic learning rate/weight decay sweeps and an off-the-shelf Bayesian optimization tool when restricted to the same budget.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。