I understand functional gradient descent algorithms implemented in mboost and coxboost. I am also under an impression (please correct me if this is wrong) that gbm and xgboost implement tree-based boosting, constrasting the ‘functional’ based boosting algorithms. The prediction output of both gbm and xgboost are the f(x) of the proportional hazard function h(t)= h_0 * exp(f(x)), in other words, the linear predictor of the cox model. This is different from other tree-based methods, say random forest, where the prediction output is the cumulative hazard distribution (non-parametric).