A Comparison of the Finite Difference and Simultaneous Perturbation Gradient Estimation Methods with Noisy Function Evaluations

Adam Blakney, Jingyi Zhu
{"title":"A Comparison of the Finite Difference and Simultaneous Perturbation Gradient Estimation Methods with Noisy Function Evaluations","authors":"Adam Blakney, Jingyi Zhu","doi":"10.1109/CISS.2019.8693046","DOIUrl":null,"url":null,"abstract":"Gradient information is useful in many applications such as optimization and sensitivity analysis, but is often inaccessible, providing a need for gradient estimation methods. This paper presents a comparison between the finite difference (FD) and simultaneous perturbation (SP) methods for gradient estimation. In practical experiments, function evaluations correspond to incurred costs, so the number of function evaluations used to form an estimate must be taken into account. Our theoretical results, supported by our numerical experiments, show that under certain circumstances the SP estimate has a smaller mean squared error (MSE) given a fixed number of function evaluations, and that the benefit gained from the SP method becomes more pronounced as the observation environment becomes noisier. We also discuss the performance of both methods in the noise-free case. We summarize guidelines for practitioners to determine which method is preferred, depending on the dimension of the function, noise magnitude, underlying gradient magnitude, and number of function evaluations available.","PeriodicalId":123696,"journal":{"name":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","volume":"527 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2019.8693046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Gradient information is useful in many applications such as optimization and sensitivity analysis, but is often inaccessible, providing a need for gradient estimation methods. This paper presents a comparison between the finite difference (FD) and simultaneous perturbation (SP) methods for gradient estimation. In practical experiments, function evaluations correspond to incurred costs, so the number of function evaluations used to form an estimate must be taken into account. Our theoretical results, supported by our numerical experiments, show that under certain circumstances the SP estimate has a smaller mean squared error (MSE) given a fixed number of function evaluations, and that the benefit gained from the SP method becomes more pronounced as the observation environment becomes noisier. We also discuss the performance of both methods in the noise-free case. We summarize guidelines for practitioners to determine which method is preferred, depending on the dimension of the function, noise magnitude, underlying gradient magnitude, and number of function evaluations available.
带噪声函数估计的有限差分和同步扰动梯度估计方法的比较
梯度信息在优化和灵敏度分析等许多应用中都很有用,但往往难以获取,这就需要梯度估计方法。本文比较了梯度估计的有限差分法(FD)和同时摄动法(SP)。在实际实验中,功能评估对应的是已发生的成本,因此必须考虑用于形成估算的功能评估的次数。我们的理论结果得到了数值实验的支持,表明在特定情况下,给定固定数量的函数评估,SP估计具有较小的均方误差(MSE),并且随着观测环境变得更加嘈杂,SP方法获得的好处变得更加明显。我们还讨论了两种方法在无噪声情况下的性能。我们总结了指导方针,以确定哪种方法是首选的,这取决于函数的维度,噪声大小,潜在的梯度大小,以及可用的函数评估的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信