arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.17705math.PRmath.STstat.TH
收藏

布朗运动与柯西过程的在线最小值搜索:多种方法

Online minimum search for Brownian motion and the Cauchy process: Multiple approaches

Shannon Starr, Erik Wu

AI总结:

本文研究布朗运动与柯西过程的在线最小值搜索问题,定量证明二分法优于黄金搜索法,并提出使用调和测度的新思路。

摘要:

利用反射原理,布朗运动或柯西过程的最小值分布是众所周知的。本文考虑逐样本寻找最小值的问题,我们称之为在线最小值搜索。我们考虑了黄金搜索方法的可能性,但定量地表明二分法更高效。在二分法中有一个分层参数,它调节每次子搜索进行的深度,这在一定程度上类似于深度优先搜索在节点上生成拓扑排序的方式。最后,我们考虑了使用调和测度的可能性,这是一个迄今为止尚未被探索的新颖想法。

英文摘要:

The distribution for the minimum of Brownian motion or the Cauchy process is well-known using the reflection principle. Here we consider the problem of finding the sample-by-sample minimum, which we call the online minimum search. We consider the possibility of the golden search method, but we show quantitatively that the bisection method is more efficient. In the bisection method there is a hierarchical parameter, which tunes the depth to which each sub-search is conducted, somewhat similarly to how a depth-first search works to generate a topological ordering on nodes. Finally, we consider the possibility of using harmonic measure, which is a novel idea that has so far been unexplored.

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

↑