No article text was recorded for this version.
tree depth scalability
Version 1 of 135 papers38 conceptsfrozen 2026-10-04
Papers in this version
- Blog: MurTree: Optimal Decision Trees via Dynamic Programming and Search
- Blog: Piecewise Constant and Linear Regression Trees: An Optimal Dynamic Programming Approach
- Blog: A Scalable Deterministic Global Optimization Algorithm for Training Optimal Decision Tree
- Blog: A theoretical and computational analysis of full strong-branching
- Blog: PyDL8.5: a Library for Learning Optimal Decision Trees
- Blog: Breiman meets Bellman: Non-Greedy Decision Trees with MDPs
- Blog: Sample-Based Tree Search with Fixed and Adaptive State Abstractions
- Blog: Optimal model order selection based on regression tree in speaker identification
- Blog: Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features
- Blog: Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next
- Blog: Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features
- Blog: Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
- Blog: SAT-based Decision Tree Learning for Large Data Sets
- Blog: Fast Calculation of Feature Contributions in Boosting Trees
- Blog: Face Alignment with Cascaded Semi-Parametric Deep Greedy Neural Forests
- Blog: SAT-Based Learning of Compact Binary Decision Diagrams for Classification
- Blog: A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees
- Blog: Reducing human interactions in Web directory searches
- Blog: Random Forest for the Contextual Bandit Problem
- Blog: SORTeD Rashomon Sets of Sparse Decision Trees: Anytime Enumeration
- Blog: ARISE: Iterative Rule Induction and Synthetic Data Generation for Text Classification
- Blog: Branches: Efficiently Seeking Optimal Sparse Decision Trees via AO*
- Blog: Efficient Non-greedy Optimization of Decision Trees
- Blog: Tree Ensemble Explainability through the Hoeffding Functional Decomposition and TreeHFD Algorithm
- Blog: A sub-optimal viterbi-like search for linear dynamic models classification
- Blog: Privet: A Privacy-Preserving Vertical Federated Learning Service for Gradient Boosted Decision Tables
- Blog: Fast Estimation of Partial Dependence Functions using Trees
- Blog: Optimal Decision Tree Policies for Markov Decision Processes
- Blog: A Gradient-Based Split Criterion for Highly Accurate and Transparent Model Trees
- Blog: The Tree Ensemble Layer: Differentiability meets Conditional Computation
- Blog: Offline Multi-Action Policy Learning: Generalization and Optimization
- Blog: ForestPrune: Compact Depth-Pruned Tree Ensembles
- Blog: Improving Continuous Monte Carlo Tree Search for Identifying Parameters in Hybrid Gene Regulatory Networks
- Blog: Exact Learning of Linear Model Predictive Control Laws using Oblique Decision Trees with Linear Predictions
- Blog: Optimal Survival Trees: A Dynamic Programming Approach
History & citation
Current · Permanent link
- This direction split from Global Optimization of Sparse and Interpretable Decision Trees (60% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_tree_depth_scalability_3741a6e7,
title = {tree depth scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tree-depth-scalability/rdr_3741a6e799e14d2b9e882c9a5b515c9d},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_tree_depth_scalability_3741a6e7_v1,
title = {tree depth scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/tree-depth-scalability/rdr_3741a6e799e14d2b9e882c9a5b515c9d/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}