ID3学习Juntas以实现平滑的产品分销
ID3 Learns Juntas for Smoothed Product Distributions
摘要:
近年来,有许多尝试来了解流行的语言学。这种启发式算法的一个例子是用于学习决策树的ID 3算法。该算法在实践中得到了广泛的应用,但是研究其行为的理论研究却很少。在本文中,我们分析了ID 3算法,当目标函数是一个$k$ -Junta,一个函数,它依赖于$k$出的$n$变量的输入。我们证明,当$k = \log n$,ID 3算法学习在多项式时间$k$ -Juntas,在平滑的分析模型Kalai & Teng。也就是说,当观察到的分布是原始分布的“噪声”变体时,我们显示了可学习性结果。
英文摘要:
In recent years, there are many attempts to understand popular heuristics. An example of such a heuristic algorithm is the ID3 algorithm for learning decision trees. This algorithm is commonly used in practice, but there are very few theoretical works studying its behavior. In this paper, we analyze the ID3 algorithm, when the target function is a $k$-Junta, a function that depends on $k$ out of $n$ variables of the input. We prove that when $k = \log n$, the ID3 algorithm learns in polynomial time $k$-Juntas, in the smoothed analysis model of Kalai & Teng. That is, we show a learnability result when the observed distribution is a "noisy" variant of the original distribution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。