Adaptive Lightweight Regularization Tool for Complex Analytics

Zhaojing Luo, Shaofeng Cai, Jinyang Gao, Meihui Zhang, K. Ngiam, Gang Chen, Wang-Chien Lee
{"title":"Adaptive Lightweight Regularization Tool for Complex Analytics","authors":"Zhaojing Luo, Shaofeng Cai, Jinyang Gao, Meihui Zhang, K. Ngiam, Gang Chen, Wang-Chien Lee","doi":"10.1109/ICDE.2018.00051","DOIUrl":null,"url":null,"abstract":"Deep Learning and Machine Learning models have recently been shown to be effective in many real world applications. While these models achieve increasingly better predictive performance, their structures have also become much more complex. A common and difficult problem for complex models is overfitting. Regularization is used to penalize the complexity of the model in order to avoid overfitting. However, in most learning frameworks, regularization function is usually set as some hyper parameters, and therefore the best setting is difficult to find. In this paper, we propose an adaptive regularization method, as part of a large end-to-end healthcare data analytics software stack, which effectively addresses the above difficulty. First, we propose a general adaptive regularization method based on Gaussian Mixture (GM) to learn the best regularization function according to the observed parameters. Second, we develop an effective update algorithm which integrates Expectation Maximization (EM) with Stochastic Gradient Descent (SGD). Third, we design a lazy update algorithm to reduce the computational cost by 4x. The overall regularization framework is fast, adaptive and easy-to-use. We validate the effectiveness of our regularization method through an extensive experimental study over 13 standard benchmark datasets and three kinds of deep learning/machine learning models. The results illustrate that our proposed adaptive regularization method achieves significant improvement over state-of-the-art regularization methods.","PeriodicalId":247940,"journal":{"name":"2018 IEEE 34th International Conference on Data Engineering (ICDE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 34th International Conference on Data Engineering (ICDE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.2018.00051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

Deep Learning and Machine Learning models have recently been shown to be effective in many real world applications. While these models achieve increasingly better predictive performance, their structures have also become much more complex. A common and difficult problem for complex models is overfitting. Regularization is used to penalize the complexity of the model in order to avoid overfitting. However, in most learning frameworks, regularization function is usually set as some hyper parameters, and therefore the best setting is difficult to find. In this paper, we propose an adaptive regularization method, as part of a large end-to-end healthcare data analytics software stack, which effectively addresses the above difficulty. First, we propose a general adaptive regularization method based on Gaussian Mixture (GM) to learn the best regularization function according to the observed parameters. Second, we develop an effective update algorithm which integrates Expectation Maximization (EM) with Stochastic Gradient Descent (SGD). Third, we design a lazy update algorithm to reduce the computational cost by 4x. The overall regularization framework is fast, adaptive and easy-to-use. We validate the effectiveness of our regularization method through an extensive experimental study over 13 standard benchmark datasets and three kinds of deep learning/machine learning models. The results illustrate that our proposed adaptive regularization method achieves significant improvement over state-of-the-art regularization methods.
复杂分析的自适应轻量级正则化工具
深度学习和机器学习模型最近在许多现实世界的应用中被证明是有效的。虽然这些模型的预测性能越来越好,但它们的结构也变得更加复杂。复杂模型的一个常见而困难的问题是过拟合。正则化用于惩罚模型的复杂性,以避免过拟合。然而,在大多数学习框架中,正则化函数通常被设置为一些超参数,因此很难找到最佳设置。在本文中,我们提出了一种自适应正则化方法,作为大型端到端医疗数据分析软件堆栈的一部分,该方法有效地解决了上述困难。首先,提出一种基于高斯混合(GM)的通用自适应正则化方法,根据观测参数学习最佳正则化函数;其次,我们开发了一种有效的更新算法,该算法将期望最大化(EM)与随机梯度下降(SGD)相结合。第三,我们设计了一种延迟更新算法,将计算成本降低了4倍。整个正则化框架快速、自适应且易于使用。我们通过对13个标准基准数据集和三种深度学习/机器学习模型的广泛实验研究验证了正则化方法的有效性。结果表明,我们提出的自适应正则化方法比最先进的正则化方法有了显著的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信
小红书