arXiv Machine Learning
Vectorized Dynamic Histograms for Sparse Oblique Forests
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 5
Double Descent in Gradient Boosting Decision Trees via Split-Candidate Scaling
arXiv:2608. 03111v1 Announce Type: new Abstract: Double descent is commonly studied by scaling an explicit capacity parameter, such as neural-network width.
arXiv Machine Learning
Jul 30
TreeCCA: Canonical Correlation Analysis via Gradient-Boosted Trees
arXiv:2607. 27027v1 Announce Type: new Abstract: Gradient-boosted trees dominate tabular machine learning, yet canonical correlation analysis has always relied on linear or neural encoders.
arXiv Machine Learning
Jun 26
EMA-FS: Accelerating GBDT Training via Gain-Informed Feature Screening
arXiv:2606. 26337v1 Announce Type: new Abstract: Gradient Boosted Decision Trees (GBDT), exemplified by LightGBM, spend a dominant fraction of training time -- typically 65-70% -- constructing per-feature histograms.
Hugging Face Trending Papers
Aug 4
Double Descent in Gradient Boosting Decision Trees via Split-Candidate Scaling
Double descent is commonly studied by scaling an explicit capacity parameter, such as neural-network width. For gradient boosting decision trees (GBDTs), however, an analogous single-axis capacity parameter has not been established.
Hugging Face Trending Papers
Jun 24
EMA-FS: Accelerating GBDT Training via Gain-Informed Feature Screening
Gradient Boosted Decision Trees (GBDT), exemplified by LightGBM, spend a dominant fraction of training time -- typically 65-70% -- constructing per-feature histograms. Existing approaches such as random feature subsampling (feature_fraction) discard features without regard for their predictive utility.
arXiv Machine Learning
Jun 3
How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integration
arXiv:2606. 03549v1 Announce Type: new Abstract: Hyperparameter optimization (HPO) for Random Forest faces a specific difficulty in tuning the number of trees: the predictive score typically improves monotonically with ensemble size, so standard methods such as Tree-structured Parzen Estimator (TPE) and Hyperband require a predefined search range and often drive the estimate toward its right boundary.