PulseAugur
EN
LIVE 11:53:39

Smooth-basis models challenge tree ensembles in tabular regression

Researchers have revisited Chebyshev polynomial and Anisotropic RBF models for tabular regression, developing new implementations and comparing them against tree ensembles and transformers. While transformers showed higher accuracy, their computational demands limit their applicability. Among CPU-viable models, the smooth-basis models performed comparably to tree ensembles in accuracy but demonstrated better generalization. The study recommends including smooth-basis models in the selection process for tabular regression tasks, especially when gradual prediction variation and tighter generalization are beneficial. AI

IMPACT Smooth-basis models offer a competitive alternative to tree ensembles for tabular data, particularly when generalization is key.

RANK_REASON The cluster contains an academic paper detailing new models and benchmark results. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

COVERAGE [1]

  1. arXiv cs.AI TIER_1 English(EN) · Luciano Gerber, Huw Lloyd ·

    Revisiting Chebyshev Polynomial and Anisotropic RBF Models for Tabular Regression

    arXiv:2602.22422v2 Announce Type: replace-cross Abstract: Smooth-basis models such as Chebyshev polynomial regressors and radial basis function (RBF) networks are well established in numerical analysis. Their continuously differentiable prediction surfaces suit surrogate optimisa…