arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.13697math.NAcs.NA
收藏

向量值逼近的随机复杂度

Randomized Complexity of Vector-Valued Approximation

Stefan Heinrich

AI总结:

本文研究向量值逼近的随机复杂度,证明非自适应与自适应随机最小误差的差距可达n^{1/2}量级,解决了该领域关于最大可能偏差的开放问题。

摘要:

我们研究向量值逼近的随机第n最小误差(以及由此产生的复杂度)。在作者最近的一篇论文[随机参数积分的复杂度与自适应性的作用 I. 有限维情形(预印本)]中,信息基复杂度的一个长期未解问题得到了解决:是否存在常数c>0,使得对于所有线性问题P,随机非自适应与自适应的第n最小误差最多相差因子c?即,对于所有线性P和n∈N,是否成立 e_n^{ran-non}(P) ≤ c e_n^{ran}(P)?对向量值均值计算的分析表明答案是否定的。更确切地说,该问题存在一些实例,其中非自适应与自适应随机最小误差之间的差距(至多相差对数因子)可达n^{1/8}量级。这引发了关于最大可能偏差的问题。在本文中,我们证明对于向量值逼近的某些实例,该差距为n^{1/2}(同样,至多相差对数因子)。

英文摘要:

We study the randomized $n$-th minimal errors (and hence the complexity) of vector valued approximation. In a recent paper by the author [Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case (preprint)] a long-standing problem of Information-Based Complexity was solved: Is there a constant $c>0$ such that for all linear problems $\mathcal{P}$ the randomized non-adaptive and adaptive $n$-th minimal errors can deviate at most by a factor of $c$? That is, does the following hold for all linear $\mathcal{P}$ and $n\in {\mathbb N}$ \begin{equation*} e_n^{\rm ran-non} (\mathcal{P})\le ce_n^{\rm ran} (\mathcal{P}) \, {\bf ?} \end{equation*} The analysis of vector-valued mean computation showed that the answer is negative. More precisely, there are instances of this problem where the gap between non-adaptive and adaptive randomized minimal errors can be (up to log factors) of the order $n^{1/8}$. This raises the question about the maximal possible deviation. In this paper we show that for certain instances of vector valued approximation the gap is $n^{1/2}$ (again, up to log factors).

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

↑