Tree models and information criterion I am currently trying to compare the complexity of models. Among the models I have are some trees. The trees are not parametric models, hence they don't have the notion of 'trainable parameters' that are used in information criterion (AIC / BIC). I was wondering if there is a way to compare the complexity of trees to models with trainable parameters. Intuitively I would use the number of values to encode the model. So the complexity of the model would be the number of splits (split level) + the number of leafs (terminal value).
Is this approach correct ? Is there better way to compare trees complexity to other models ?

As outlined here Ye developed a method for estimating the effective number of parameters used by recursive partitioning, when Y is continuous.  The results are scary, i.e., trees effectively estimate a huge number of parameters, which gives insights into why trees are so brittle and independently validate so seldom.
The simplest way to go is to use the bootstrap to estimate the likely future performance of a tree in comparison with a model.  You'll quickly see why trees are not competitive.  In order to be accurate they have to be pruned which removes some predictive ability.
