Investigation of influence of objective function valley ratio on the determination error of its minimum coordinates

A. V. Smirnov
{"title":"Investigation of influence of objective function valley ratio on the determination error of its minimum coordinates","authors":"A. V. Smirnov","doi":"10.32362/2500-316x-2023-11-6-57-67","DOIUrl":null,"url":null,"abstract":"Objectives. A valley is a region of an objective function landscape in which the function varies along one direction more slowly than along other directions. In order to determine the error of the objective function minimum location in such regions, it is necessary to analyze relations of valley parameters.Methods. A special test function was used in numerical experiments to model valleys with variables across wide ranges of parameters. The position and other valley parameters were defined randomly. Valley dimensionality and ratio were estimated from eigenvalues of the approximated Hessian of objective function in the termination point of minimum search. The error was defined as the Euclidian distance between the known minimum position and the minimum search termination point. Linear regression analysis and approximation with an artificial neural network model were used for statistical processing of experimental data.Results. A linear relation of logarithm of valley ratio to logarithm of minimum position error was obtained. Here, the determination coefficient R2 was ~0.88. By additionally taking into account the Euclidian norm of the objective function gradient in the termination point, R2 can be augmented to ~0.95. However, by using the artificial neural network model, an approximation R2 ~ 0.97 was achieved.Conclusions. The obtained relations may be used for estimating the expected error of extremum coordinates in optimization problems. The described method can be extended to functions having a valley dimensionality of more than one and to other types of hard-to-optimize algorithms regions of objective function landscapes.","PeriodicalId":282368,"journal":{"name":"Russian Technological Journal","volume":"35 5","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Russian Technological Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32362/2500-316x-2023-11-6-57-67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Objectives. A valley is a region of an objective function landscape in which the function varies along one direction more slowly than along other directions. In order to determine the error of the objective function minimum location in such regions, it is necessary to analyze relations of valley parameters.Methods. A special test function was used in numerical experiments to model valleys with variables across wide ranges of parameters. The position and other valley parameters were defined randomly. Valley dimensionality and ratio were estimated from eigenvalues of the approximated Hessian of objective function in the termination point of minimum search. The error was defined as the Euclidian distance between the known minimum position and the minimum search termination point. Linear regression analysis and approximation with an artificial neural network model were used for statistical processing of experimental data.Results. A linear relation of logarithm of valley ratio to logarithm of minimum position error was obtained. Here, the determination coefficient R2 was ~0.88. By additionally taking into account the Euclidian norm of the objective function gradient in the termination point, R2 can be augmented to ~0.95. However, by using the artificial neural network model, an approximation R2 ~ 0.97 was achieved.Conclusions. The obtained relations may be used for estimating the expected error of extremum coordinates in optimization problems. The described method can be extended to functions having a valley dimensionality of more than one and to other types of hard-to-optimize algorithms regions of objective function landscapes.
目标函数谷比对其最小坐标确定误差影响的研究
目标。谷是目标函数景观的一个区域,在该区域中,函数沿一个方向的变化比沿其他方向的变化要慢。为了确定目标函数最小值在这类区域的位置误差,有必要分析谷参数的关系。在数值实验中使用了一个特殊的测试函数,以模拟参数变化范围较大的山谷。位置和其他山谷参数是随机定义的。在最小搜索的终点,根据目标函数近似 Hessian 的特征值估算山谷的维度和比率。误差定义为已知最小位置与最小搜索终止点之间的欧几里得距离。实验数据的统计处理采用了线性回归分析和人工神经网络近似模型。谷比对数与最小位置误差对数呈线性关系。确定系数 R2 为 0.88。如果再考虑到终止点目标函数梯度的欧几里得法,R2 可以提高到 ~0.95。然而,通过使用人工神经网络模型,R2 的近似值达到了 ~0.97。所获得的关系可用于估计优化问题中极值坐标的预期误差。所述方法可扩展至谷维超过一的函数以及目标函数景观的其他类型难优化算法区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信