4 papers · 1 filter
CLARITree: Cholesky and Lookahead Accelerations for Regression with Interpretable Piecewise Linear Trees
Yixiao Wang, Hayden McTavish, Varun Babbar +2
Regression trees are among the most interpretable yet expressive model classes in machine learning. Historically, greedy induction has been the dominant approach for constructing w…
From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets
Zakk Heile, Hayden McTavish, Varun Babbar +2
Standard machine learning pipelines often admit many near-optimal models. These "Rashomon sets" pose a range of challenges and opportunities for uncertainty-aware, robust decision…
Near Optimal Decision Trees in a SPLIT Second
Varun Babbar, Hayden McTavish, Cynthia Rudin +1
Decision tree optimization is fundamental to interpretable machine learning. The most popular approach is to greedily search for the best feature at every decision point, which is…
"What is Different Between These Datasets?" A Framework for Explaining Data Distribution Shifts
Varun Babbar, Zhicheng Guo, Cynthia Rudin
The performance of machine learning models relies heavily on the quality of input data, yet real-world applications often face significant data-related challenges. A common issue a…