arXiv Machine Learning By Donghwan Kim, Seung Hwan Park, Jun-Geol Baek

A Kernel Fisher Discriminant Analysis-Based Tree Ensemble Classifier: KFDA Forest

Read the original on arXiv Machine Learning →

arXiv:2606. 29053v1 Announce Type: new Abstract: In general, an ensemble classifier is more accurate than a single classifier.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 18

Kernel of Partition Paths: A Unified Representation for Tree Ensembles

arXiv:2606. 18853v1 Announce Type: cross Abstract: A recent line of work has reframed individual decision trees as linear models on engineered features associated with their splits, opening routes for oracle inequalities and feature-importance reinterpretation, but leaving open the question of what unified geometric object a forest induces when one indexes its feature map by nodes rather than by splits.

By Nicolas Mahler
arXiv Machine Learning
Jun 30

Gradient boosting with vector-valued leafs

arXiv:2606. 29326v1 Announce Type: cross Abstract: Gradient boosting in the form of decision tree ensembles has successfully been applied to a variety of problems using simple objective functions based on log-likelihoods of a single variable.

By David Cortes
Hugging Face Trending Papers
Aug 20

DICS: Data-Informed Centroid Splitting for Decision Tree Classifiers

The paper introduces DICS, a clustering-based framework that uses data-informed priors to construct a compact set of candidate splits for decision tree classifiers. By incorporating class-aware structure, DICS reduces the split search space, preserving predictive performance while cutting training time. The authors provide theoretical analysis and experimental results showing comparable accuracy to exhaustive search across synthetic and benchmark datasets.