6 citations · 15 across the 5 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
stat.ML2022★ 2 cited
A Mixing Time Lower Bound for a Simplified Version of BART
Omer Ronen, Theo Saarinen, Yan Shuo Tan +2
Bayesian Additive Regression Trees (BART) is a popular Bayesian non-parametric regression algorithm. The posterior is a distribution over sums of decision trees, and predictions ar…
stat.ML2021★ 2 cited
A cautionary tale on fitting decision trees to data from additive models: generalization lower bounds
Yan Shuo Tan, Abhineet Agarwal, Bin Yu
Decision trees are important both as interpretable models amenable to high-stakes decision-making, and as building blocks of ensemble methods such as random forests and gradient bo…