arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.12877cs.CC
收藏

关于(简单)决策树排序

On (Simple) Decision Tree Rank

Yogesh Dahiya, Meena Mahajan

摘要:

在布尔函数的决策树计算模型中,深度对应于查询复杂度,大小对应于存储空间。深度度量是研究最充分的一个,并且已知与函数的几个非计算复杂性度量(诸如证书复杂性)多项式相关。规模的措施也进行了研究,但在较小程度上。另一个很少受到关注的决策树度量是决策树的最小秩,它首先由Eschericht和Haussler在1989年提出。这个度量与大小的对数密切相关,但与深度不是多项式相关,因此它可以揭示有关函数复杂性的其他信息。它的特点是由Pudlák和Impagliazzo在树状分辨率证明的背景下首次提出的证明延迟游戏的价值。在本文中,我们进一步研究这一措施。我们得到的秩和傅立叶稀疏性的深度上界。我们得到的上限和下限的排名(变种)证书的复杂性。我们还得到了上界和下界的深度的外部功能和内部功能的组成功能的秩。这使我们能够容易地恢复已知的渐近下限的大小的对数迭代与或和迭代3位多数。我们精确地计算了几个自然函数的秩,并用它们来证明我们得到的所有界都是紧的。我们还表明,在简单的决策树模型中的秩可以用来约束查询的复杂性,或深度,在更一般的合取决策树模型。最后,我们改进了Tribes函数的大小下界,并得出结论:在Escherichfeucht和Haussler得到的决策树的大小-秩关系中,Tribes函数的上界是渐近紧的.

英文摘要:

In the decision tree computation model for Boolean functions, the depth corresponds to query complexity, and size corresponds to storage space. The depth measure is the most well-studied one, and is known to be polynomially related to several non-computational complexity measures of functions such as certificate complexity. The size measure is also studied, but to a lesser extent. Another decision tree measure that has received very little attention is the minimal rank of the decision tree, first introduced by Ehrenfeucht and Haussler in 1989. This measure is closely related to the logarithm of the size, but is not polynomially related to depth, and hence it can reveal additional information about the complexity of a function. It is characterised by the value of a Prover-Delayer game first proposed by Pudlák and Impagliazzo in the context of tree-like resolution proofs. In this paper we study this measure further. We obtain an upper bound on depth in terms of rank and Fourier sparsity. We obtain upper and lower bounds on rank in terms of (variants of) certificate complexity. We also obtain upper and lower bounds on the rank for composed functions in terms of the depth of the outer function and the rank of the inner function. This allow us to easily recover known asympotical lower bounds on logarithm of the size for Iterated AND-OR and Iterated 3-bit Majority. We compute the rank exactly for several natural functions and use them to show that all the bounds we have obtained are tight. We also show that rank in the simple decision tree model can be used to bound query complexity, or depth, in the more general conjunctive decision tree model. Finally, we improve upon the known size lower bound for the Tribes function and conclude that in the size-rank relationship for decision trees, obtained by Ehrenfeucht and Haussler, the upper bound for Tribes is asymptotically tight.

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

↑