9 citations · 17 across the 3 of their papers we have counts for
3 papers
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…
cs.LG2022★ 6 cited
Hierarchical Shrinkage: improving the accuracy and interpretability of tree-based methods
Abhineet Agarwal, Yan Shuo Tan, Omer Ronen +2
Tree-based models such as decision trees and random forests (RF) are a cornerstone of modern machine-learning practice. To mitigate overfitting, trees are typically regularized by…
cs.LG2022★ 9 cited
Fast Interpretable Greedy-Tree Sums
Yan Shuo Tan, Chandan Singh, Keyan Nasseri +6
Modern machine learning has achieved impressive prediction performance, but often sacrifices interpretability, a critical consideration in high-stakes domains such as medicine. In…