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

关于随机过程定量收敛性:交叉、涨落与鞅

On quantitative convergence for stochastic processes: Crossings, fluctuations and martingales

Morenikeji Neri, Thomas Powell

AI总结:

本文提出一个基于涨落与交叉信息的通用框架,用于提取随机过程局部稳定性的定量一致界,并将其推广到几乎上鞅等复杂过程,从而为随机优化提供新的定量收敛工具。

摘要:

我们建立了一个通用框架,用于根据涨落或交叉信息提取随机过程局部稳定性的高度一致界。该框架涵盖一大类鞅:作为主要抽象结果的推论,我们得到了 $L_1$-下鞅与上鞅的 Doob 收敛定理的定量版本,但更重要的是,我们证明了该框架可以自然地扩展到更复杂的随机过程,例如几乎上鞅,从而为随机优化中的未来应用铺平道路。我们方法的基础是运用来自逻辑的思想,特别是对概率命题的量词结构进行细致分析,并引入若干抽象概念,以定量方式表示随机收敛。在这个意义上,我们的工作属于“证明挖掘”计划,并且我们的定量结果确实为该现象提供了新的例证——这一现象最近由第一作者与 Pischke 精确阐明,即概率论中的许多证明在证明论意义上是驯服的,并且能够提取出既具有低复杂度又独立于底层概率空间的定量数据。

英文摘要:

We develop a general framework for extracting highly uniform bounds on local stability for stochastic processes in terms of information on fluctuations or crossings. This includes a large class of martingales: As a corollary of our main abstract result, we obtain a quantitative version of Doob's convergence theorem for $L_1$-sub- and supermartingales, but more importantly, demonstrate that our framework readily extends to more complex stochastic processes such as almost-supermartingales, thus paving the way for future applications in stochastic optimization. Fundamental to our approach is the use of ideas from logic, particularly a careful analysis of the quantifier structure of probabilistic statements and the introduction of a number of abstract notions that represent stochastic convergence in a quantitative manner. In this sense, our work falls under the 'proof mining' program, and indeed, our quantitative results provide new examples of the phenomenon, recently made precise by the first author and Pischke, that many proofs in probability theory are proof-theoretically tame, and amenable to the extraction of quantitative data that is both of low complexity and independent of the underlying probability space.

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

↑