Probit Monotone BART

Jared D. Fisher
8/29/2025
stat.MLcs.LGstat.CO

No confident code implementation found for this paper.

Abstract

Bayesian Additive Regression Trees (BART) of Chipman et al. (2010) has proven to be a powerful tool for nonparametric modeling and prediction. Monotone BART (Chipman et al., 2022) is a recent development that allows BART to be more precise in estimating monotonic functions. We further these developments by proposing probit monotone BART, which allows the monotone BART framework to estimate conditional mean functions when the outcome variable is binary.

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

On the Gaussian process limit of Bayesian Additive Regression Trees

83% match1 repo2024

ASBART:Accelerated Soft Bayes Additive Regression Trees

81% match2023

Bayesian Additive Regression Trees for functional ANOVA model

80% match2025

The Computational Curse of Big Data for Bayesian Additive Regression Trees: A Hitting Time Analysis

80% match2024

Bayesian Additive Regression Networks

79% match1 repo2322024

Oblique Bayesian additive regression trees

79% match2024

Cite this paper

@article{fisher2025probit,
  title  = {Probit Monotone BART},
  author = {Jared D. Fisher},
  year   = {2025},
  eprint = {2509.00263},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.00263v1}
}

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/2509.00263.svg)](https://codeofpaper.com/paper/2509.00263)

Discussion