# Is there a closed formula/function for decision trees?

i've been studying gradient boosting so realize the pure algorithm requires a function F/model to get boosted.What is the explicit F on gradient boosting trees?

• it is not (theoreticaly) necessary for $F$ to have a closed-form formula. Gradient can be numericaly computed Jan 15, 2021 at 16:09
• gnosisda.gr/wp-content/uploads/2020/07/… Jan 15, 2021 at 16:12
• Nikos M. even though it isn't necessary for F to have a closed formula, Can I express the functional form as sum of indicator terms and work to that? Feb 4, 2021 at 0:33