Diffusion Boosted Trees

Xizewen Han, Mingyuan Zhou
6/3/2024
stat.MLcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{han2024diffusion,
  title  = {Diffusion Boosted Trees},
  author = {Xizewen Han and Mingyuan Zhou},
  year   = {2024},
  eprint = {2406.01813},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.01813v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2406.01813.svg)](https://codeofpaper.com/paper/2406.01813)

Discussion