用极低算力训练出能通用大模型的自学习优化器
Celo2: Towards Learned Optimization Free Lunch
- 设计简化版归一化优化器结构,配合数据增强提升泛化能力
- 仅用4.5小时GPU算力即实现百亿参数模型的稳定训练
- 适合想低成本尝试可学习优化器的研究者与工程团队
可学习优化器是替代Adam等人工设计更新规则的强大工具,但因难以在训练分布外泛化且元训练成本高,实际应用受限。例如,此前工作VeLO耗时约4000个TPU月(近GPT-3级别算力)训练通用优化器,却仅能处理6亿参数以下任务。本文提出一个意外发现:通过设计简洁的归一化优化器架构并引入元训练增强,仅需4.5小时GPU算力即可训练出高性能通用可学习更新规则。该优化器可在百亿规模预训练任务(如GPT-3 XL 1.3B)上稳定运行,较其元训练分布大六数量级;同时在多种分布外任务中表现优异,并兼容现代优化技术(如正交化、输入/输出与隐藏层使用不同更新规则、解耦权重衰减)。本工作为可学习优化算法的实际应用铺平道路,开启更丰富元训练与数据策划方案的探索空间。
原文摘要 · Abstract (English)
Learned optimizers are powerful alternatives to hand-designed update rules like Adam, yet they have seen limited practical adoption since they often fail to meta-generalize beyond their training distribution and incur high meta-training cost. For instance, prior work, VeLO, scaled meta-training to 4,000 TPU months ($\sim$10$\times$ GPT-3 compute) to meta-train a general-purpose optimizer but it failed to generalize beyond 600M parameters tasks. In this work, we present a surprising finding: by crafting a simple normalized optimizer architecture and augmenting meta-training, it becomes feasible to meta-train a performant general-purpose learned update rule on a tiny fraction of VeLO compute, 4.5 GPU hours to be precise. Our learned update rule scales stably to a billion-scale pretraining task (GPT-3 XL 1.3B) which is six orders of magnitude larger than its meta-training distribution. Furthermore, it shows strong performance across diverse out-of-distribution tasks and is compatible with modern optimization harness that includes orthogonalization, distinct update rules for input-output and hidden weights, and decoupled weight decay. In all, this work paves the way for practically applicable learnable optimization algorithms, unlocking exploration of richer meta-training and data curation recipes to further improve performance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。