Metraipolis › archive › dc_7e942de57136

Sparse Oblique Rule Boosting for Simpler Additive Rule Ensembles — arXiv:2609.06426

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06426
License (as archived)
CC0-1.0
Archived
2026-10-16T13:56:46.126Z
SHA-256 of the archived text
9b39fc8a74aacf59f9e325388f597867f86e93969e07e6caf0784e8e3efbe268
Stable URL of this page
https://metraipolis.com/documento/dc_7e942de57136

How to cite

Sparse Oblique Rule Boosting for Simpler Additive Rule Ensembles — arXiv:2609.06426 — arXiv (en), https://arxiv.org/abs/2609.06426 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7e942de57136 (Metraipolis archive dc_7e942de57136, sha256 9b39fc8a74aacf59f9e325388f597867f86e93969e07e6caf0784e8e3efbe268)
BibTeX
@misc{dc7e942de57136,
  title = {Sparse Oblique Rule Boosting for Simpler Additive Rule Ensembles — arXiv:2609.06426},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06426},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7e942de57136; sha256 9b39fc8a74aacf59f9e325388f597867f86e93969e07e6caf0784e8e3efbe268},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06426. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Small additive ensembles of symbolic rules offer interpretable prediction models. Traditionally, these ensembles use rule conditions based on conjunctions of simple threshold propositions $x \geq t$ on a single input variable $x$ and threshold $t$, resulting geometrically in axis-parallel polytopes as decision regions. While this form ensures a high degree of interpretability for individual rules and can be learned efficiently using the gradient boosting approach, it relies on having access to a curated set of expressive input features so that a small ensemble of axis-parallel regions can describe the target variable well. Absent such features, reaching sufficient accuracy requires increasing the number and complexity of individual rules, which diminishes the interpretability of the model. Here, we extend classical rule ensembles by introducing logical propositions with learnable sparse linear transformations of input variables, i.e., propositions of the form $\mathbf{x}^T\mathbf{w} \geq t$, where $\mathbf{w}$ is a learnable sparse weight vector, enabling decision regions as general polyhedrons with oblique faces. We propose a learning method using gradient boosting based on a weighted logistic regression. Empirical results across 14 regression and classification tasks demonstrate that the proposed method achieves lower model complexity than competitive baselines while maintaining similar or better predictive accuracy. Hence, the approach provides a favorable trade-off between interpretability and accuracy and reduces the reliance on manual feature engineering.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.06426 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:39:42.868Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).