arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.04532eess.SYcs.SY
收藏

刻画极值搜索中的学习动态

Characterizing the learning dynamics in extremum seeking

Institute for Systems Theory and Automatic Control, University of Stuttgart(斯图加特大学系统与自动控制研究所)

Stefan Wildhagen, Simon Michalowsky, Jan Feiling, Christian Ebenbauer

AI总结:

本文通过针尖变化分析,揭示极值搜索中恢复的梯度实际上是目标函数的平均梯度,并提出学习动态的递推关系,指出极值搜索优化的函数可能不同于原始函数,从而为具有局部极值的全局优化提供新视角。

摘要:

我们考虑基于扰动的极值搜索,通过测量恢复未知目标函数的近似梯度。利用经典针尖变化分析,我们能够明确量化标量情况下的恢复梯度。我们揭示,即使对于非常一般的极值搜索系统,它也对应于目标函数的平均梯度。由此,我们创建了一个递推关系,表示沿恢复梯度的学习动态。这些结果导致极值搜索实际上优化不同于原始函数的函数的解释。从这一见解,函数具有局部极值的全局优化出现新的视角:由于梯度在一定时间段内被平均,局部极值可能在学习动态中被平滑。此外,还给出了标量结果的多维扩展。

英文摘要:

We consider perturbation-based extremum seeking, which recovers an approximate gradient of an analytically unknown objective function through measurements. Using classical needle variation analysis, we are able to explicitly quantify the recovered gradient in the scalar case. We reveal that it corresponds to an averaged gradient of the objective function, even for very general extremum seeking systems. From this, we create a recursion which represents the learning dynamics along the recovered gradient. These results give rise to the interpretation that extremum seeking actually optimizes a function other than the original one. From this insight, a new perspective on global optimization of functions with local extrema emerges: because the gradient is averaged over a certain time period, local extrema might be evened out in the learning dynamics. Moreover, a multidimensional extension of the scalar results is given.

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

↑