educative.io

Eval Complexity of Multiple Additive Regression Trees (MART)

Why is the complexity of Multiple Additive Regression Trees (MART) O(f * n_trees * d) and not just O(n_trees * d)? Doesn’t traversing a tree from top to bottom include all the necessary features?

Found this in https://www.educative.io/module/lesson/grokking-ml-interview/gkmOqkBW28G

have the same question