arXiv Machine Learning
Jun 24
Experiments with Optimal Model Trees
arXiv:2503. 12902v4 Announce Type: replace Abstract: Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems.
Kernel of Partition Paths: A Unified Representation for Tree Ensembles
arXiv:2606. 18853v1 Announce Type: cross Abstract: A recent line of work has reframed individual decision trees as linear models on engineered features associated with their splits, opening routes for oracle inequalities and feature-importance reinterpretation, but leaving open the question of what unified geometric object a forest induces when one indexes its feature map by nodes rather than by splits.
Related stories
arXiv Machine Learning
Jun 30
A Kernel Fisher Discriminant Analysis-Based Tree Ensemble Classifier: KFDA Forest
arXiv:2606. 29053v1 Announce Type: new Abstract: In general, an ensemble classifier is more accurate than a single classifier.
arXiv Machine Learning
Jun 2
Decision-Path Patterns as Tree Reliability Signals: Path-based Adaptive Weighting for Random Forest Classification
arXiv:2605. 20716v5 Announce Type: replace Abstract: Random forests construct each tree with a different, randomised representation of the feature space.
arXiv Machine Learning
Aug 6
Data-Aware and Scalable Sensitivity Analysis for Decision Tree Ensembles
arXiv:2602. 07453v2 Announce Type: replace Abstract: Decision tree ensembles are widely used in critical domains, making robustness and sensitivity analysis essential to their trustworthiness.
arXiv Machine Learning
Aug 18
Learning Auditable Classifier Models: Source-Disjoint Tree Ensembles
arXiv:2608. 15725v1 Announce Type: new Abstract: Predictive models in clinical and regulated settings must be accurate and fully auditable.
arXiv Machine Learning
Jun 15
A General Framework for Decision Trees via Bregman Divergences
arXiv:2606. 13984v1 Announce Type: cross Abstract: Decision trees are one of the fundamental tools in statistical learning due to their interpretability, flexibility, and their ability to adapt to nonlinear structures.
arXiv Machine Learning
Jul 28
Distributional Split Criteria for Random Forests: Extensions, Shrinkage, and the Robustness of Mean Splitting
arXiv:2607. 23721v1 Announce Type: cross Abstract: Distributional random forests replace mean-based CART splitting with criteria that compare the full conditional response distribution in candidate children.
arXiv Machine Learning
Jun 5
Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach
arXiv:2605. 13830v2 Announce Type: replace-cross Abstract: Decision tree ensembles (DTE) are a popular model for a wide range of AI classification tasks, used in multiple safety critical domains, and hence verifying properties on these models has been an active topic of study over the last decade.
arXiv Machine Learning
Aug 28
Common Geodesics Do Not Guarantee Fisher Consistency of the Structured SVM: Minimal Counterexamples and a Tree-Metric Classification
The paper demonstrates that the common-geodesic condition—where every output triple shares a geodesic point in a metric—does not ensure Fisher consistency for the structured SVM with the standard coordinate-wise argmax decoder. It presents minimal counterexamples, including a four-output star and a tree-metric classification, showing that only path-shaped trees maintain argmax consistency. The study also identifies the smallest full-support counterexamples and provides exact primal-dual certificates for all optimality claims.
arXiv Machine Learning
Sep 22
Beyond Point Prediction: Artificial Representative Trees with Uncertainty
arXiv:2609.24528v1 Announce Type: cross Abstract: Random forests (RFs) predict well but are opaque, whereas single decision trees are interpretable but unstable. Artificial representative trees (ARTs...
Hugging Face Trending Papers
Jun 2
How Many Trees in a Random Forest? A Revisited Approach with Plateau Search and Optuna Integration
Hyperparameter optimization (HPO) for Random Forest faces a specific difficulty in tuning the number of trees: the predictive score typically improves monotonically with ensemble size, so standard methods such as Tree-structured Parzen Estimator (TPE) and Hyperband require a predefined search range and often drive the estimate toward its right boundary. Early-stopping strategies avoid fixing such a range, but can be sensitive to score noise and prone to premature stopping.
Hugging Face Trending Papers
Sep 1
Sierpiński--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximation
This paper introduces the Sierpiński-Knopp (SK) Wasserstein distance, a fast metric between persistence diagrams. The SK-Wasserstein distance, denoted $d_{\mathrm{SK}}$, maps diagram points and their...