mlsanityData to 14 Oct 2026

Gradient Boosted Filters For Signal Processing

arXiv 2405.09305 ↗First posted 15 May 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Gradient boosted decision trees have achieved remarkable success in several domains, particularly those that work with static tabular data. However, the application of gradient boosted models to signal processing is underexplored. In this work, we introduce gradient boosted filters for dynamic data, by employing Hammerstein systems in place of decision trees. We discuss the relationship of our approach to the Volterra series, providing the theoretical underpinning for its application. We demonstrate the effective generalizability of our approach with examples.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 20 references that are in the map. First posted on arXiv 15 May 2024.

Builds on

5 of 20 references.

References · 5

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 2018An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modelingcited by 1,476
  3. 2019InterpretML: A Unified Framework for Machine Learning Interpretabilitycited by 246
  4. 2018CatBoost: gradient boosting with categorical features supportcited by 208
  5. 2021VolterraNet: A higher order convolutional network with group equivariance for homogeneous manifoldscited by 11

Built on by

Not cited yet.