paper-with-me

Papers

Task-wise Split Gradient Boosting Trees for Multi-center Diabetes Prediction

2021-08-16 · Mingcheng Chen, Zhenghui Wang, Zhiyun Zhao, Weinan Zhang, Xiawei Guo, Jian Shen, Yanru Qu, Jieli Lu, Min Xu, Yu Xu, Tiange Wang, Mian Li, Wei-Wei Tu, Yong Yu, Yufang Bi, Weiqing Wang, Guang Ning

Diabetes prediction is an important data science application in the social healthcare domain. There exist two main challenges in the diabetes prediction task: data heterogeneity since demographic and metabolic data are of different types, data insufficiency since the number of diabetes cases in a single medical center is usually limited. To tackle the above challenges, we employ gradient boosting decision trees (GBDT) to handle data heterogeneity and introduce multi-task learning (MTL) to solve data insufficiency. To this end, Task-wise Split Gradient Boosting Trees (TSGB) is proposed for the multi-center diabetes prediction task. Specifically, we firstly introduce task gain to evaluate each task separately during tree construction, with a theoretical analysis of GBDT's learning objective. Secondly, we reveal a problem when directly applying GBDT in MTL, i.e., the negative task gain problem. Finally, we propose a novel split method for GBDT in MTL based on the task gain statistics, named task-wise split, as an alternative to standard feature-wise split to overcome the mentioned negative task gain problem. Extensive experiments on a large-scale real-world diabetes dataset and a commonly used benchmark dataset demonstrate TSGB achieves superior performance against several state-of-the-art methods. Detailed case studies further support our analysis of negative task gain problems and provide insightful findings. The proposed TSGB method has been deployed as an online diabetes risk assessment software for early diagnosis.

📄 PDF Abstract BibTeX arXiv:2108.07107

Code (1)

felixwzh/tsgb 공식 구현

Tasks

Diabetes PredictionMulti-Task Learning

Similar Papers 제목 키워드 기반

Infinitesimal gradient boosting

2021-04-26 · Clément Dombry, Jean-Jil Duchamps

We define infinitesimal gradient boosting as a limit of the popular tree-based gradient boosting algorithm from machine learning. The limit is considered in the vanishing-learning-rate asymptotic, that is when the learni…

Double Descent in Gradient Boosting Decision Trees via Split-Candidate Scaling

2026-08-04 · Ryuichi Kanoh arxiv

Double descent is commonly studied by scaling an explicit capacity parameter, such as neural-network width. For gradient boosting decision trees (GBDTs), however, an analogous single-axis capacity parameter has not been …

Gradient Boosting With Piece-Wise Linear Regression Trees

2018-02-15 · Yu Shi, Jian Li, Zhize Li

Gradient Boosted Decision Trees (GBDT) is a very successful ensemble learning algorithm widely used across a variety of applications. Recently, several variants of GBDT training algorithms and implementations have been d…

Ensemble Learningregression

Era Splitting: Invariant Learning for Decision Trees

2023-09-25 · Timothy DeLise

Real-life machine learning problems exhibit distributional shifts in the data from one time to another or from one place to another. This behavior is beyond the scope of the traditional empirical risk minimization paradi…

Domain Adaptation

An information criterion for automatic gradient tree boosting

2020-08-13 · Berent Ånund Strømnes Lunde, Tore Selland Kleppe, Hans Julius Skaug

An information theoretic approach to learning the complexity of classification and regression trees and the number of trees in gradient tree boosting is proposed. The optimism (test loss minus training loss) of the greed…

Model Selectionregression