Woodelf++: A Fast and Unified Partial Dependence Plot Algorithm for Decision Tree Ensembles
Fuente:
arXiv
Saved in:
| Main Authors: | Wettenstein, Ron, Nadel, Alexander, Boker, Udi |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
WOODELF-HD: Efficient Background SHAP for High-Depth Decision Trees
by: Wettenstein, Ron, et al.
Published: (2026)
by: Wettenstein, Ron, et al.
Published: (2026)
From Decision Trees to Boolean Logic: A Fast and Unified SHAP Algorithm
by: Nadel, Alexander, et al.
Published: (2025)
by: Nadel, Alexander, et al.
Published: (2025)
Quadrature-TreeSHAP: Depth-Independent TreeSHAP and Shapley Interactions
by: Wettenstein, Ron, et al.
Published: (2026)
by: Wettenstein, Ron, et al.
Published: (2026)
Fast Estimation of Partial Dependence Functions using Trees
by: Liu, Jinyang, et al.
Published: (2024)
by: Liu, Jinyang, et al.
Published: (2024)
Why You Should Not Trust Interpretations in Machine Learning: Adversarial Attacks on Partial Dependence Plots
by: Xin, Xi, et al.
Published: (2024)
by: Xin, Xi, et al.
Published: (2024)
Glitches in Decision Tree Ensemble Models
by: Chandra, Satyankar, et al.
Published: (2025)
by: Chandra, Satyankar, et al.
Published: (2025)
Watermarking Decision Tree Ensembles
by: Calzavara, Stefano, et al.
Published: (2024)
by: Calzavara, Stefano, et al.
Published: (2024)
Dynamic Deep-Reinforcement-Learning Algorithm in Partially Observable Markov Decision Processes
by: Omi, Saki, et al.
Published: (2023)
by: Omi, Saki, et al.
Published: (2023)
Data-Aware and Scalable Sensitivity Analysis for Decision Tree Ensembles
by: Varshney, Namrita, et al.
Published: (2026)
by: Varshney, Namrita, et al.
Published: (2026)
GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data
by: Marton, Sascha, et al.
Published: (2023)
by: Marton, Sascha, et al.
Published: (2023)
Discounted-Sum Automata with Multiple Discount Factors
by: Boker, Udi, et al.
Published: (2023)
by: Boker, Udi, et al.
Published: (2023)
Token Games and History-Deterministic Quantitative-Automata
by: Boker, Udi, et al.
Published: (2021)
by: Boker, Udi, et al.
Published: (2021)
Boosting-Based Sequential Meta-Tree Ensemble Construction for Improved Decision Trees
by: Maniwa, Ryota, et al.
Published: (2024)
by: Maniwa, Ryota, et al.
Published: (2024)
Superfast Selection for Decision Tree Algorithms
by: Wang, Huaduo, et al.
Published: (2024)
by: Wang, Huaduo, et al.
Published: (2024)
A Multi-directional Meta-Learning Framework for Class-Generalizable Anomaly Detection
by: Roy, Padmaksha, et al.
Published: (2026)
by: Roy, Padmaksha, et al.
Published: (2026)
Analysis of the Identifying Regulation with Adversarial Surrogates Algorithm
by: Teichner, Ron, et al.
Published: (2024)
by: Teichner, Ron, et al.
Published: (2024)
Decision Predicate Graphs: Enhancing Interpretability in Tree Ensembles
by: Arrighi, Leonardo, et al.
Published: (2024)
by: Arrighi, Leonardo, et al.
Published: (2024)
Wine Quality Prediction with Ensemble Trees: A Unified, Leak-Free Comparative Study
by: Chen, Zilang
Published: (2025)
by: Chen, Zilang
Published: (2025)
Learning Decision Trees and Forests with Algorithmic Recourse
by: Kanamori, Kentaro, et al.
Published: (2024)
by: Kanamori, Kentaro, et al.
Published: (2024)
Tree Ensemble Explainability through the Hoeffding Functional Decomposition and TreeHFD Algorithm
by: Bénard, Clément
Published: (2025)
by: Bénard, Clément
Published: (2025)
Beyond Marginals: Learning Joint Spatio-Temporal Patterns for Multivariate Anomaly Detection
by: Roy, Padmaksha, et al.
Published: (2025)
by: Roy, Padmaksha, et al.
Published: (2025)
When unlearning is free: leveraging low influence points to reduce computational costs
by: Kleiman, Anat, et al.
Published: (2025)
by: Kleiman, Anat, et al.
Published: (2025)
Register Your Forests: Decision Tree Ensemble Optimization by Explicit CPU Register Allocation
by: Biebert, Daniel, et al.
Published: (2024)
by: Biebert, Daniel, et al.
Published: (2024)
Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions
by: Park, Sungwoo, et al.
Published: (2024)
by: Park, Sungwoo, et al.
Published: (2024)
Stacked Confusion Reject Plots (SCORE)
by: Hasler, Stephan, et al.
Published: (2024)
by: Hasler, Stephan, et al.
Published: (2024)
Optimal Decision Tree Pruning Revisited: Algorithms and Complexity
by: Harviainen, Juha, et al.
Published: (2025)
by: Harviainen, Juha, et al.
Published: (2025)
Classy Ensemble: A Novel Ensemble Algorithm for Classification
by: Sipper, Moshe
Published: (2023)
by: Sipper, Moshe
Published: (2023)
Beyond Numerical Features: CNN-Driven Algorithm Selection via Contour Plots for Continuous Black-Box Optimization
by: Yuan, Yiliang, et al.
Published: (2026)
by: Yuan, Yiliang, et al.
Published: (2026)
A Unified Theory of Diversity in Ensemble Learning
by: Wood, Danny, et al.
Published: (2023)
by: Wood, Danny, et al.
Published: (2023)
Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)
by: Cassel, Asaf, et al.
Published: (2024)
Fast Ensembling with Diffusion Schrödinger Bridge
by: Kim, Hyunsu, et al.
Published: (2024)
by: Kim, Hyunsu, et al.
Published: (2024)
Partial Fusion of Neural Networks: Efficient Tradeoffs Between Ensembles and Weight Aggregation
by: Morelli, Fabian, et al.
Published: (2026)
by: Morelli, Fabian, et al.
Published: (2026)
Constrained Online Decision-Making: A Unified Framework
by: Hu, Haichen, et al.
Published: (2025)
by: Hu, Haichen, et al.
Published: (2025)
A Fast Convergence Theory for Offline Decision Making
by: Mao, Chenjie, et al.
Published: (2024)
by: Mao, Chenjie, et al.
Published: (2024)
Fast Bayesian Optimization of Function Networks with Partial Evaluations
by: Buathong, Poompol, et al.
Published: (2025)
by: Buathong, Poompol, et al.
Published: (2025)
A Simple Approximation Algorithm for Optimal Decision Tree
by: Zhuo, Zhengjia, et al.
Published: (2025)
by: Zhuo, Zhengjia, et al.
Published: (2025)
Accelerated Sinkhorn Algorithms for Partial Optimal Transport
by: Truong, Nghia Thu, et al.
Published: (2026)
by: Truong, Nghia Thu, et al.
Published: (2026)
A Unified Approach to Extract Interpretable Rules from Tree Ensembles via Integer Programming
by: Bonasera, Lorenzo, et al.
Published: (2024)
by: Bonasera, Lorenzo, et al.
Published: (2024)
Flexible Routing via Uncertainty Decomposition
by: Peale, Charlotte, et al.
Published: (2026)
by: Peale, Charlotte, et al.
Published: (2026)
When does a predictor know its own loss?
by: Gollakota, Aravind, et al.
Published: (2025)
by: Gollakota, Aravind, et al.
Published: (2025)
Similar Items
-
WOODELF-HD: Efficient Background SHAP for High-Depth Decision Trees
by: Wettenstein, Ron, et al.
Published: (2026) -
From Decision Trees to Boolean Logic: A Fast and Unified SHAP Algorithm
by: Nadel, Alexander, et al.
Published: (2025) -
Quadrature-TreeSHAP: Depth-Independent TreeSHAP and Shapley Interactions
by: Wettenstein, Ron, et al.
Published: (2026) -
Fast Estimation of Partial Dependence Functions using Trees
by: Liu, Jinyang, et al.
Published: (2024) -
Why You Should Not Trust Interpretations in Machine Learning: Adversarial Attacks on Partial Dependence Plots
by: Xin, Xi, et al.
Published: (2024)