On Testing Decision Tree.

In this paper, we study testing decision tree of size and depth that are significantly smaller than the number of attributes n. Our main result addresses the problem of poly(n, 1/ε) time algorithms with poly(s, 1/ε) query complexity (independent of n) that distinguish between functions that are decision trees of size s from functions that are ε-far from any decision tree of size φ(s, 1/ε), for some function φ > s. The best known result is the recent one that follows from Blanc, Lange and Tan, [3], that gives φ(s, 1/ε) = 2O((log 3 s)/ε). In this paper, we give a new algorithm that achieves φ(s, 1/ε) = 2O(log (s/ε)). Moreover, we study the testability of depth-d decision tree and give a distribution free tester that distinguishes between depth-d decision tree and functions that are ε-far from depth-d2 decision tree. 2012 ACM Subject Classification Theory of computation → Oracles and decision trees