Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 3 min ago
PreprintCC BY 4.0HAL

A functional central limit theorem for kernel gradient flow and infinitesimal gradient boosting

Abstract

Building on the large-sample analysis of infinitesimal gradient boosting (Dombry and Duchamps, 2024b), we study the fluctuations of the process around its deterministic limit and establish a functional central limit theorem: the rescaled deviations converge in distribution to a Gaussian process. The analysis is carried out in a reproducing kernel Hilbert space (RKHS) naturally associated with the softmax gradient tree base learner, in which the boosting process is characterized as the solution of an autonomous ordinary differential equation (ODE). The proof rests on a general stochastic perturbation analysis of ODEs in Banach spaces, which is of independent interest: whenever a sequence of vector fields converges and satisfies a central limit theorem, so does the associated ODE solution. We first illustrate this perturbation approach in the simpler setting of kernel gradient flow, where the Gaussian limit admits an explicit characterization, and then consider the more complicated tree-based gradient boosting setting.

Related

  1. A Functional Central Limit Theorem For A Rank-Killed Particle System With Persistent Copies
    Ewan Cameron
    HALPreprintPublisher termsFull textStatisticsHAL
  2. Quenched functional central limit theorem for the random conductance model under minimal moments
    Leonid Kolesnikov, Yannic Steenbeck
    arXivPreprintCC BY-NC-SA 4.0Full textProbabilityarXiv
  3. A note on functional non-central limit theorem for periodic regime-switching stable-like processes
    Nikola Sandrić
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  4. A functional central limit theorem for the KPZ equation with narrow wedge initial data
    Raluca M. Balan, Le Chen, Jinxin Wang
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
  5. A functional central limit theorem for particle systems under polynomial growth conditions, with applications to statistics
    Mark Podolskij, Fabrice Wunderlich
    arXivPreprintarXiv licenceFull textProbabilityStatisticsarXiv
BibTeX
@misc{dombry2026functional,
  title = {{A functional central limit theorem for kernel gradient flow and infinitesimal gradient boosting}},
  author = {Clément Dombry and Jean-Jil Duchamps},
  howpublished = {HAL},
  year = {2026},
  month = jun,
  doi = {10.48550/arxiv.2606.25494},
  eprint = {2606.25494},
  archivePrefix = {arXiv},
  url = {https://hal.science/hal-05666410v2},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - A functional central limit theorem for kernel gradient flow and infinitesimal gradient boosting
AU  - Clément Dombry
AU  - Jean-Jil Duchamps
PY  - 2026
DA  - 2026/06/23
PB  - HAL
DO  - 10.48550/arxiv.2606.25494
UR  - https://hal.science/hal-05666410v2
AB  - Building on the large-sample analysis of infinitesimal gradient boosting (Dombry and Duchamps, 2024b), we study the fluctuations of the process around its deterministic limit and establish a functional central limit theorem: the rescaled deviations converge in distribution to a Gaussian process. The analysis is carried out in a reproducing kernel Hilbert space (RKHS) naturally associated with the softmax gradient tree base learner, in which the boosting process is characterized as the solution of an autonomous ordinary differential equation (ODE). The proof rests on a general stochastic perturbation analysis of ODEs in Banach spaces, which is of independent interest: whenever a sequence of vector fields converges and satisfies a central limit theorem, so does the associated ODE solution. We first illustrate this perturbation approach in the simpler setting of kernel gradient flow, where the Gaussian limit admits an explicit characterization, and then consider the more complicated tree-based gradient boosting setting.
ER  -