paper-with-me

Papers

Diffusion Boosted Trees

2024-06-03 · Xizewen Han, Mingyuan Zhou

Combining the merits of both denoising diffusion probabilistic models and gradient boosting, the diffusion boosting paradigm is introduced for tackling supervised learning problems. We develop Diffusion Boosted Trees (DBT), which can be viewed as both a new denoising diffusion generative model parameterized by decision trees (one single tree for each diffusion timestep), and a new boosting algorithm that combines the weak learners into a strong learner of conditional distributions without making explicit parametric assumptions on their density forms. We demonstrate through experiments the advantages of DBT over deep neural network-based diffusion models as well as the competence of DBT on real-world regression tasks, and present a business application (fraud detection) of DBT for classification on tabular data with the ability of learning to defer.

📄 PDF Abstract BibTeX arXiv:2406.01813

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingFraud Detection

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Treeffuser: Probabilistic Predictions via Conditional Diffusions with Gradient-Boosted Trees

2024-06-11 · Nicolas Beltran-Velez, Alessandro Antonio Grande, Achille Nazaret, Alp Kucukelbir 외

Probabilistic prediction aims to compute predictive distributions rather than single point predictions. These distributions enable practitioners to quantify uncertainty, compute risk, and detect outliers. However, most p…

Relational Boosted Regression Trees

2021-07-25 · Sonia Cromp, Alireza Samadian, Kirk Pruhs

Many tasks use data housed in relational databases to train boosted regression tree models. In this paper, we give a relational adaptation of the greedy algorithm for training boosted regression trees. For the subproblem…

regression

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…

TF Boosted Trees: A scalable TensorFlow based framework for gradient boosting

2017-10-31 · Natalia Ponomareva, Soroush Radpour, Gilbert Hendry, Salem Haykal 외

TF Boosted Trees (TFBT) is a new open-sourced frame-work for the distributed training of gradient boosted trees. It is based on TensorFlow, and its distinguishing features include a novel architecture, automatic loss dif…

Unmasking Trees for Tabular Data

2024-07-08 · Calvin Mccarter

Despite much work on advanced deep learning and generative modeling techniques for tabular data generation and imputation, traditional methods have continued to win on imputation benchmarks. We herein present UnmaskingTr…

Density EstimationImputationIn-Context LearningTabular Data Generation