paper-with-me

Papers

Gradient boosting with vector-valued leafs

2026-06-28 · David Cortes arxiv

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. The concept extends naturally to objective functions operating on vectors - for example, multinomial logistic log-likelihood for multi-class classification, where observations have a score for each class - but popular frameworks approach these functions by either updating one value of the input vectors at a time, or by using a diagonal upper bound on the second derivative. This work extends the usual gradient boosting framework to functions of vector inputs and sketches a simple algorithm that can be used efficiently with histogram-based decision trees.

📄 PDF Abstract BibTeX arXiv:2606.29326

Code (0)

등록된 구현이 없습니다.

Tasks

Multi-class Classification

Similar Papers 제목 키워드 기반

Compact Multi-Class Boosted Trees

2017-10-31 · Natalia Ponomareva, Thomas Colthurst, Gilbert Hendry, Salem Haykal 외

Gradient boosted decision trees are a popular machine learning technique, in part because of their ability to give good accuracy with small models. We describe two extensions to the standard tree boosting algorithm desig…

$(α,β)$-Stability for Boosting Vector-Valued Prediction

2026-02-21 · Jian Qian, Shu Ge arxiv

Despite the widespread use of boosting in structured prediction, a general theoretical understanding of aggregation beyond scalar prediction remains incomplete. We study vector-valued prediction under a target divergence…

Structured PredictionDensity Estimation

Wasserstein Gradient Boosting: A Framework for Distribution-Valued Supervised Learning

2024-05-15 · Takuo Matsubara

Gradient boosting is a sequential ensemble method that fits a new weaker learner to pseudo residuals at each iteration. We propose Wasserstein gradient boosting, a novel extension of gradient boosting that fits a new wea…

regressionUncertainty Quantification

The return of AdaBoost.MH: multi-class Hamming trees

2013-12-20 · Balázs Kégl

Within the framework of AdaBoost.MH, we propose to train vector-valued decision trees to optimize the multi-class edge without reducing the multi-class problem to $K$ binary one-against-all classifications. The key eleme…

Computational Efficiency

A Combined Deep Learning-Gradient Boosting Machine Framework for Fluid Intelligence Prediction

2019-10-16 · Yeeleng S. Vang, Yingxin Cao, Xiaohui Xie

The ABCD Neurocognitive Prediction Challenge is a community driven competition asking competitors to develop algorithms to predict fluid intelligence score from T1-w MRIs. In this work, we propose a deep learning combine…