SGLB: Stochastic Gradient Langevin Boosting
Not on the map. Why?
Abstract (arXiv)
This paper introduces Stochastic Gradient Langevin Boosting (SGLB) - a powerful and efficient machine learning framework that may deal with a wide range of loss functions and has provable generalization guarantees. The method is based on a special form of the Langevin diffusion equation specifically designed for gradient boosting. This allows us to theoretically guarantee the global convergence even for multimodal loss functions, while standard gradient boosting algorithms can guarantee only local optimum. We also empirically show that SGLB outperforms classic gradient boosting when applied to classification tasks with 0-1 loss function, which is known to be multimodal.
Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 5; 2023: 3; 2024: 2; 2025: 0; 2026: 2.
12 papers.
- 2022When to intervene? Prescriptive Process Monitoring Under Uncertainty and Resource Constraintscited by 11
- 2022Instance-Based Uncertainty Estimation for Gradient-Boosted Regression Treescited by 9
- 2022Gradient Boosting Performs Gaussian Process Inferencecited by 4
- 2022Which Tricks Are Important for Learning to Rank?cited by 3
- 2024Diffusion Boosted Treescited by 2
- 2023SE(3)-Invariant Multiparameter Persistent Homology for Chiral-Sensitive Molecular Property Predictioncited by 1
- 2022High-Order Optimization of Gradient Boosted Decision Treescited by 0
- 2023Variational Boosted Soft Treescited by 0
- 2023Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boostingcited by 0
- 2024ClickTree: A Tree-based Method for Predicting Math Students' Performance Based on Clickstream Datacited by 0
- 2026Statistical Inference for Explainable Boosting Machinescited by 0
- 2026Conditioning Tree-Based Diffusions and Flows for Probabilistic Tabular Regressioncited by 0
- 2026Conditioning Tree-Based Diffusions and Flows for Probabilistic Tabular Regression30 Jul 2026
- 2026Statistical Inference for Explainable Boosting Machines26 Jan 2026
- 2024Diffusion Boosted Trees3 Jun 2024
- 2024ClickTree: A Tree-based Method for Predicting Math Students' Performance Based on Clickstream Data1 Mar 2024
- 2023SE(3)-Invariant Multiparameter Persistent Homology for Chiral-Sensitive Molecular Property Prediction12 Dec 2023
- 2023Ito Diffusion Approximation of Universal Ito Chains for Sampling, Optimization and Boosting9 Oct 2023
- 2023Variational Boosted Soft Trees21 Feb 2023
- 2022High-Order Optimization of Gradient Boosted Decision Trees21 Nov 2022
- 2022When to intervene? Prescriptive Process Monitoring Under Uncertainty and Resource Constraints15 Jun 2022
- 2022Gradient Boosting Performs Gaussian Process Inference11 Jun 2022
- 2022Instance-Based Uncertainty Estimation for Gradient-Boosted Regression Trees23 May 2022
- 2022Which Tricks Are Important for Learning to Rank?4 Apr 2022