错误交易信息复杂性II:大错误和外部信息复杂性的情况
Trading information complexity for error II: the case of a large error and external information complexity
摘要:
本文研究了两个问题。(1)对于一个小的$ε$,计算一个误差最多为$1/2-ε$的布尔值函数需要多少外部或内部信息成本?证明了$ε^2$阶的信息成本是必要的,$ε$阶的信息成本是充分的. (2)计算一个误差小的函数$ε>0$,与不允许误差的情况相比,可以节省多少外部信息成本?结果表明,该方法至少可以节省$ε$,最多可以节省$h(\sqrtε)$.除$O(h(\sqrtε))$上界外,其它三个上界都是紧的.对于分布$μ$是均匀分布的$(0,0)$和$(1,1)$,它表明,$IC^{ext}_μ(XOR, ε)=1-2ε$,其中XOR是两位异或功能。这个等式似乎是在允许误差的情况下精确信息复杂性的第一个例子。
英文摘要:
Two problems are studied in this paper. (1) How much external or internal information cost is required to compute a Boolean-valued function with an error at most $1/2-ε$ for a small $ε$? It is shown that information cost of order $ε^2$ is necessary and of order $ε$ is sufficient. (2) How much external information cost can be saved to compute a function with a small error $ε>0$ comparing to the case when no error is allowed? It is shown that information cost of order at least $ε$ and at most $h(\sqrtε)$ can be saved. Except the $O(h(\sqrtε))$ upper bound, the other three bounds are tight. For distribution $μ$ that is equally distributed on $(0,0)$ and $(1,1)$, it is shown that $IC^{ext}_μ(XOR, ε)=1-2ε$ where XOR is the two-bit xor function. This equality seems to be the first example of exact information complexity when an error is allowed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。