Revisiting LARS for Large Batch Training Generalization of Neural Networks

Khoi Do;Minh-Duong Nguyen;Nguyen Tien Hoa;Long Tran-Thanh;Nguyen H. Tran;Quoc-Viet Pham
{"title":"Revisiting LARS for Large Batch Training Generalization of Neural Networks","authors":"Khoi Do;Minh-Duong Nguyen;Nguyen Tien Hoa;Long Tran-Thanh;Nguyen H. Tran;Quoc-Viet Pham","doi":"10.1109/TAI.2024.3523252","DOIUrl":null,"url":null,"abstract":"This article investigates large batch training techniques using layer-wise adaptive scaling ratio (LARS) across diverse settings. In particular, we first show that a state-of-the-art technique, called LARS with the warm-up, tends to be trapped in sharp minimizers early on due to redundant ratio scaling. Additionally, a fixed steep decline in the latter phase restricts deep neural networks from effectively navigating early-phase sharp minimizers. To address these issues, we propose time varying LARS (TVLARS), a novel algorithm that replaces warm-up with a configurable sigmoid-like function for robust training in the initial phase. TVLARS promotes gradient exploration early on, surpassing sharp optimizers and gradually transitioning to LARS for robustness in later stages. Extensive experiments demonstrate that TVLARS consistently outperforms LARS and LAMB in most cases, with up to 2% improvement in classification scenarios. In all self-supervised learning cases, TVLARS achieves up to 10% performance improvement. Our implementation is available at <uri>https://github.com/KhoiDOO/tvlars</uri>.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"6 5","pages":"1321-1333"},"PeriodicalIF":0.0000,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10817779","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10817779/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This article investigates large batch training techniques using layer-wise adaptive scaling ratio (LARS) across diverse settings. In particular, we first show that a state-of-the-art technique, called LARS with the warm-up, tends to be trapped in sharp minimizers early on due to redundant ratio scaling. Additionally, a fixed steep decline in the latter phase restricts deep neural networks from effectively navigating early-phase sharp minimizers. To address these issues, we propose time varying LARS (TVLARS), a novel algorithm that replaces warm-up with a configurable sigmoid-like function for robust training in the initial phase. TVLARS promotes gradient exploration early on, surpassing sharp optimizers and gradually transitioning to LARS for robustness in later stages. Extensive experiments demonstrate that TVLARS consistently outperforms LARS and LAMB in most cases, with up to 2% improvement in classification scenarios. In all self-supervised learning cases, TVLARS achieves up to 10% performance improvement. Our implementation is available at https://github.com/KhoiDOO/tvlars.
神经网络大规模训练泛化的LARS重述
本文研究了跨不同设置使用分层自适应缩放比(LARS)的大规模批量训练技术。特别是,我们首先展示了一种最先进的技术,称为带预热的LARS,由于冗余比例缩放,往往会在早期陷入尖锐的最小化。此外,后期固定的急剧下降限制了深度神经网络有效地导航早期的急剧最小化。为了解决这些问题,我们提出了时变LARS (TVLARS),这是一种新颖的算法,它用可配置的sigmoid样函数代替热身,用于初始阶段的鲁棒训练。TVLARS在早期促进了梯度探索,超越了尖锐的优化器,并在后期逐渐过渡到LARS的鲁棒性。大量的实验表明,在大多数情况下,TVLARS始终优于LARS和LAMB,在分类场景中提高了2%。在所有的自监督学习案例中,TVLARS的性能提升幅度高达10%。我们的实现可以在https://github.com/KhoiDOO/tvlars上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.70
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信