Large-sample convergence conjecture for infinitesimal gradient boosting
Large-sample convergence conjecture for infinitesimal gradient boosting
Let be the infinitesimal gradient boosting trajectory, let be the tree-randomization parameter, let denote the projection of the regression target onto the relevant degree- function space, let be the loss, and let be the function space containing the boosting trajectory. Large-sample convergence conjecture. (i) In regression, when , strong convergence holds
(ii) In the general case, when ,
The preceding proposition establishes only weak convergence in regression in general, with strong convergence proved for completely random trees (); the conjecture asserts the stronger result for and extends the expected asymptotic optimality to classification and other losses. The paper does not prove these claims.
Sources & referencesView supporting material
Primary source
Clement Dombry and Jean-Jil Duchamps, “A large sample theory for infinitesimal gradient boosting”, arXiv:2210.00736 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.