mlsanityData to 14 Oct 2026

Soft Gradient Boosting with Learnable Feature Transforms for Sequential Regression

arXiv 2509.12920 ↗First posted 16 Sep 2025cs.LG eess.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a soft gradient boosting framework for sequential regression that embeds a learnable linear feature transform within the boosting procedure. At each boosting iteration, we train a soft decision tree and learn a linear input feature transform Q together. This approach is particularly advantageous in high-dimensional, data-scarce scenarios, as it discovers the most relevant input representations while boosting. We demonstrate, using both synthetic and real-world datasets, that our method effectively and efficiently increases the performance by an end-to-end optimization of feature selection/transform and boosting while avoiding overfitting. We also extend our algorithm to differentiable non-linear transforms if overfitting is not a problem. To support reproducibility and future work, we share our code publicly.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 31 references that are in the map. First posted on arXiv 16 Sep 2025.

Builds on

8 of 31 references.

References · 8

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  3. 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
  4. 2021Autoformer: Decomposition Transformers with Auto-Correlation for Long-Term Series Forecastingcited by 1,676
  5. 2017Modeling Long- and Short-Term Temporal Patterns with Deep Neural Networkscited by 879
  6. 2023Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performancecited by 147
  7. 2019Gradient Boosted Feature Selectioncited by 13
  8. 2020Soft Gradient Boosting Machinecited by 7

Built on by

Not cited yet.