We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
This paper examines a novel gradient boosting framework for regression. We regularize gradient boosted trees by introducing subsampling and employ a modified shrinkage algorithm so that at every boosting stage the estimate is given by an average of trees. The resulting algorithm, titled Boulevard, is shown to converge as the number of trees grows. We also demonstrate a central limit theorem for this limit, allowing a characterization of uncertainty for predictions. A simulation study and real world examples provide support for both the predictive accuracy of the model and its limiting behavior.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1806.09762")
get_code_for_paper("1806.09762")
have("1806.09762")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1806.09762.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1806.09762)
Connect an agent — have() is free.