arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.11210cs.LG
收藏

基于谱半径正则化的非凸优化

Non-Convex Optimization with Spectral Radius Regularization

Engineering Sciences and Applied Mathematics, Northwestern University(西北大学工程科学与应用数学系);Industrial Engineering and Management Sciences, Northwestern University(西北大学工业工程与管理科学系);Preventive Medicine (Health and Biomedical Informatics), Northwestern University(西北大学预防医学(健康与生物医学信息学))

Adam Sandler, Diego Klabjan, Yuan Luo

AI总结:

本文提出通过谱半径正则化降低损失函数 Hessian 的谱半径以寻找平坦极小值,推导了几乎必然收敛的高效优化算法,并在医疗健康等多个领域验证了模型优于基线的泛化性能。

摘要:

我们开发了在训练深度神经网络时寻找平坦极小值的正则化方法。这些平坦极小值比尖锐极小值具有更好的泛化能力,使模型在真实世界测试数据(其分布可能与训练数据不同)上优于基线模型。具体而言,我们提出一种正则化优化方法,用于降低损失函数 Hessian 矩阵的谱半径。我们还推导了高效优化神经网络模型的算法,并证明这些算法几乎必然收敛。此外,我们证明了我们的算法在不同领域的应用中有效,包括医疗健康领域。为了表明我们的模型具有良好的泛化能力,我们引入了多种测试泛化性的方法,并发现我们的模型在这些测试上优于可比的基线模型。

英文摘要:

We develop regularization methods to find flat minima while training deep neural networks. These minima generalize better than sharp minima, yielding models outperforming baselines on real-world test data (which may be distributed differently than the training data). Specifically, we propose a method of regularized optimization to reduce the spectral radius of the Hessian of the loss function. We also derive algorithms to efficiently optimize neural network models and prove that these algorithms almost surely converge. Furthermore, we demonstrate that our algorithm works effectively on applications in different domains, including healthcare. To show that our models generalize well, we introduced various methods for testing generalizability and found that our models outperform comparable baseline models on these tests.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑