无冒险决策树
Hazard-free Decision Trees
AI总结:
本文将决策树扩展为允许查询输出未知的三元无冒险决策树模型,证明其深度、规模与灵敏度等参数的多项式等价关系及灵敏度定理,并与布尔决策树建立最优分离。
摘要:
决策树是计算布尔函数 $f : \{0, 1\}^n \mapsto \{0, 1\}$ 的最基本计算模型之一。众所周知,在 CREW-PRAM 模型中,决策树的深度和规模分别与计算函数所需的时间和处理器数量密切相关。对于给定的 $f$,一个基本目标是使计算它的决策树的深度和/或规模最小化。本文我们将决策树模型扩展到无冒险计算领域。我们允许每个查询产生三种结果:零、一或未知。输出也可以是:零、一或未知,但约束条件是仅当我们无法从输入位确定答案时才应输出“未知”。这种设定自然地产生了计算函数的三元决策树,我们称之为无冒险决策树。我们证明了无冒险决策树深度和规模的各种下界与上界,并将它们与对应的布尔决策树进行比较。我们证明了最优分离,并将无冒险决策树参数与众所周知的布尔函数参数联系起来。我们证明了无冒险函数的灵敏度、块灵敏度和证书复杂度的类似物彼此之间以及与无冒险决策树深度之间都是多项式等价的,即我们在无冒险模型中证明了灵敏度定理。随后我们证明无冒险灵敏度满足一个有趣的结构性质,该性质已知在布尔世界中成立。具有小无冒险灵敏度的无冒险函数完全由它们在 $\{0, u, 1\}^n$ 中任意小半径汉明球上的取值所决定。
英文摘要:
Decision trees are one of the most fundamental computational models for computing Boolean functions $f : \{0, 1\}^n \mapsto \{0, 1\}$. It is well-known that the depth and size of decision trees are closely related to time and number of processors respectively for computing functions in the CREW-PRAM model. For a given $f$, a fundamental goal is to minimize the depth and/or the size of the decision tree computing it. In this paper, we extend the decision tree model to the world of hazard-free computation. We allow each query to produce three results: zero, one, or unknown. The output could also be: zero, one, or unknown, with the constraint that we should output "unknown" only when we cannot determine the answer from the input bits. This setting naturally gives rise to ternary decision trees computing functions, which we call hazard-free decision trees. We prove various lower and upper bounds on the depth and size of hazard-free decision trees and compare them to their Boolean counterparts. We prove optimal separations and relate hazard-free decision tree parameters to well-known Boolean function parameters. We show that the analogues of sensitivity, block sensitivity, and certificate complexity for hazard-free functions are all polynomially equivalent to each other and to hazard-free decision tree depth. i.e., we prove the sensitivity theorem in the hazard-free model. We then prove that hazard-free sensitivity satisfies an interesting structural property that is known to hold in the Boolean world. Hazard-free functions with small hazard-free sensitivity are completely determined by their values in any Hamming ball of small radius in $\{0, u, 1\}^n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。