A Mixing Time Lower Bound for a Simplified Version of BART

no code implementations • 17 Oct 2022 • Omer Ronen, Theo Saarinen, Yan Shuo Tan, James Duncan, Bin Yu

In this paper, we provide the first lower bound on the mixing time for a simplified version of BART in which we reduce the sum to a single tree and use a subset of the possible moves for the MCMC proposal distribution.

Causal Inference regression

Hierarchical Shrinkage: improving the accuracy and interpretability of tree-based methods

2 code implementations • 2 Feb 2022 • Abhineet Agarwal, Yan Shuo Tan, Omer Ronen, Chandan Singh, Bin Yu

Tree-based models such as decision trees and random forests (RF) are a cornerstone of modern machine-learning practice.

Fast Interpretable Greedy-Tree Sums

2 code implementations • 28 Jan 2022 • Yan Shuo Tan, Chandan Singh, Keyan Nasseri, Abhineet Agarwal, James Duncan, Omer Ronen, Matthew Epland, Aaron Kornblith, Bin Yu

In such settings, practitioners often use highly interpretable decision tree models, but these suffer from inductive bias against additive structure.

Additive models Decision Making +4