Large-sample convergence conjecture for infinitesimal gradient boosting

About 4 years old · traced to

Let (F^t)t≥0(\hat{F}_t)_{t\geq 0} be the infinitesimal gradient boosting trajectory, let β≥0\beta\geq 0 be the tree-randomization parameter, let Pd(F∗)\mathcal{P}_d(F^*) denote the projection of the regression target onto the relevant degree-dd function space, let LL be the loss, and let W∞∩Ld2\mathbb{W}^\infty\cap L^2_d be the function space containing the boosting trajectory. Large-sample convergence conjecture. (i) In regression, when β>0\beta>0, strong convergence holds

F^t⟶L2Pd(F∗),as t→∞.\hat{F}_t \overset{L^2}{\longrightarrow} \mathcal{P}_d(F^*),\quad\text{as }t\to\infty.

(ii) In the general case, when β≥0\beta\geq 0,

E[L(Y,F^t(X))]⟶inf⁡F∈W∞∩Ld2E[L(Y,F(X))],as t→∞.\mathbb{E}[L(Y,\hat{F}_t(X))]\longrightarrow \inf_{F\in\mathbb{W}^\infty\cap L^2_d}\mathbb{E}[L(Y,F(X))],\quad\text{as }t\to\infty.

The preceding proposition establishes only weak convergence in regression in general, with strong convergence proved for completely random trees (β=0\beta=0); the conjecture asserts the stronger result for β>0\beta>0 and extends the expected asymptotic optimality to classification and other losses. The paper does not prove these claims.

References

Primary source

Clement Dombry and Jean-Jil Duchamps, “A large sample theory for infinitesimal gradient boosting”, arXiv:2210.00736 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.