具有准时和昂贵重启的随机搜索的效率
Efficiency of a Stochastic Search with Punctual and Costly Restarts
摘要:
一个随机过程的平均完成时间可能是有限的,并通过明智地选择重新启动协议,这可能是随机的或确定性的最小化。在这里,我们研究分析任意随机搜索的任意重新启动协议,每个特征的分布的等待时间。通过直接枚举的路径,我们构建的联合分布的完成时间和重新启动的数量,在一种形式服从分析评估或正交,从而我们优化搜索时间和潜在的昂贵的重新启动事件。分析准时,即几乎确定性的,重新启动的效果,我们证明了最佳的完成时间总是与重新启动分布的方差成比例地增加;比例常数仅取决于搜索过程。我们继续建立简单的界限上的最佳重新启动时间。我们的研究结果是相关的分析和合理设计的有效和最佳的重新启动协议。
英文摘要:
The mean completion time of a stochastic process may be rendered finite and minimised by a judiciously chosen restart protocol, which may either be stochastic or deterministic. Here we study analytically an arbitrary stochastic search subject to an arbitrary restart protocol, each characterised by a distribution of waiting times. By a direct enumeration of paths we construct the joint distribution of completion time and restart number, in a form amenable to analytical evaluation or quadrature; thereby we optimise the search over both time and potentially costly restart events. Analysing the effect of a punctual, i.e. almost deterministic, restart, we demonstrate that the optimal completion time always increases proportionately with the variance of the restart distribution; the constant of proportionality depends only on the search process. We go on to establish simple bounds on the optimal restart time. Our results are relevant to the analysis and rational design of efficient and optimal restart protocols.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。