Fully-Dynamic Approximate Decision Trees With Worst-Case Update Time Guarantees

We give the first algorithm that maintains an approximate decision tree over an arbitrary sequence of insertions and deletions of labeled examples, with strong guarantees on the worst-case running time per update request. For instance, we show how to maintain a decision tree where every vertex has Gini gain within an additive α of the optimum by performing OBig(fracd,(log n)4α3Big) elementary operations per update, where d is the number of features and n the maximum size of the active set (the net result of the update requests). We give similar bounds for the information gain and the variance gain. In fact, all these bounds are corollaries of a more general result, stated in terms of decision rules -- functions that, given a set S of labeled examples, decide whether to split S or predict a label. Decision rules give a unified view of greedy decision tree algorithms regardless of the example and label domains, and lead to a general notion of ε-approximate decision trees that, for natural decision rules such as those used by ID3 or C4.5, implies the gain approximation guarantees above. The heart of our work provides a deterministic algorithm that, given any decision rule and any ε > 0, maintains an ε-approximate tree using O!left(fracd, f(n)n operatornamepolyfrachεright) operations per update, where f(n) is the complexity of evaluating the rule over a set of n examples and h is the maximum height of the maintained tree.