A grammar-driven tree-to-tree model improves program translation accuracy.
problem Improving program translation accuracy between programming languages.
method A grammar-driven tree-to-tree model that exploits known grammar rules of the target language.
result The grammar-based model outperforms state-of-the-art models in program translation accuracy.
Researchers improve tree model recovery from noisy data.
problem Learning tree structured models from corrupted data.
method Linear latent tree models and continuous corruption model.
result Chow-Liu algorithm consistently learns tree from noisy data.
Novel non-parametric tree model learns tree distributions.
problem Learning distributions for tree-structured data.
method Bottom-up hidden tree Markov model with infinite states.
result Novel non-parametric generalization of hidden tree Markov model.
Latent tree models are used in various fields like phylogenetics and computer vision.
problem Representing and analyzing complex data structures with latent variables.
method Graphical models defined on trees, focusing on tree metrics.
result Latent tree models encompass various well-known models and contain fundamental limits of what can be learned.
We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…
SBT model uses randomized sharding and sub-models to improve Bayesian Additive Regression Trees.
problem Improving efficiency and accuracy of Bayesian Additive Regression Trees.
method Randomized sharding, sub-models, intersection tree structure, optimal design.
result Theoretical optimal weights and worst-case complexity of SBT model.
Optimal Survival Trees improve accuracy in medical data analysis.
problem Analyzing censored outcomes in medical data.
method Mixed-integer optimization and local search techniques.
result Improves accuracy in large datasets compared to existing methods.
A novel tree algorithm improves time series forecasting accuracy.
problem Improving accuracy in non-linear time series forecasting.
method Developed a hierarchical TAR model as a regression tree that trains globally across series, introducing a forecasting-specific tree algorithm with cross-series learning.
result Significantly higher accuracy than state-of-the-art tree-based algorithms and benchmarks across four metrics.
PILOT is a fast algorithm for linear model trees that outperforms existing methods.
problem Fitting linear model trees to large datasets efficiently and accurately.
method Greedy training with L2 boosting and model selection rule. result PILOT outperforms standard decision trees and other linear model trees on various datasets.
Bayesian method simplifies complex tree ensembles for better interpretability.
problem Limited interpretability of tree ensembles.
method Formalizing model selection as a Bayesian optimization problem.
result Simplified tree ensembles maintain prediction performance while being interpretable.
The paper shows tree models are vulnerable to adversarial examples and develops a robust algorithm.
problem Vulnerability of tree-based models to adversarial examples.
method Develops a novel algorithm to learn robust trees by optimizing performance under worst-case perturbation of input features.
result The proposed algorithms substantially improve the robustness of tree-based models against adversarial examples.
The paper simplifies complex tree ensembles for better interpretability.
problem Limited interpretability of tree ensembles like random forest and boosted trees.
method A post-processing method that approximates complex tree ensembles with a simpler, interpretable model using the EM algorithm.
result Complex tree ensembles can be approximated reasonably by simpler, interpretable models.
ForestPrune optimizes tree ensemble pruning for compactness and speed.
problem Large tree ensembles in predictive models consume excessive memory and reduce interpretability.
method Developed a specialized optimization algorithm to efficiently prune tree ensembles by depth layers.
result ForestPrune produces compact, high-performing models that outperform existing post-processing methods.
Tree-structured boosting connects gradient boosted stumps and full decision trees.
problem Connecting gradient boosted stumps and full decision trees.
method Introducing tree-structured boosting to create a single decision tree.
result Tree-structured boosting produces models equivalent to CART or gradient boosted stumps at the extremes.
Multistage Defer Trees improve model accuracy while maintaining interpretability.
problem Balancing model accuracy and interpretability, especially in noisy domains.
method A sequence of sparse decision trees that defer predictions to the next tree or a black box.
result Matches the performance of complex tree-based ensembles while using only one or a few sparse trees.
P-Trees improve investment performance by optimizing the efficient frontier.
problem Optimizing investment performance in complex financial markets.
method Introducing P-Trees, a new tree-based model for analyzing panel data.
result P-Trees significantly advance the efficient frontier and outperform existing models.
Efficiently updates posterior tree distributions over meta-trees.
problem Updating posterior distributions over meta-trees efficiently.
method Batch updating method for posterior tree distributions.
result More efficient batch updating method.
SNJ recovers latent tree models from similarity matrices.
problem Reconstructing latent tree models from observed data.
method Spectral Neighbor Joining (SNJ) method.
result SNJ is consistent and requires fewer samples for accurate tree recovery.
Flexible tree ensemble learning framework supports arbitrary loss functions and multi-task learning.
problem Limited modeling capabilities of existing tree ensemble learning toolkits.
method Differentiable tree ensembles with tensor-based formulation for efficient training.
result Our framework leads to 100x more compact and 23% more expressive tree ensembles.
Develops a new method to recover large latent tree models efficiently.
problem Inference of large latent tree structures from terminal node observations.
method Spectral Top-Down Recovery (STDR) using Fiedler vector partitioning.
result Proves statistical consistency and sample complexity for accurate tree recovery.
Improves tree model performance by considering future node splits.
problem Improving tree model performance.
method Next-Depth Lookahead Tree (NDLT) model that evaluates future node splits.
result Enhanced tree model performance.
PhyloVAE learns tree topologies without supervision.
problem Learning accurate tree representations from evolutionary data.
method Unsupervised learning via variational autoencoders with efficient tree generation.
result PhyloVAE generates high-resolution tree topologies efficiently.
The paper uses tensor decompositions to improve neural network models for tree data.
problem Encoding structural knowledge from tree-structured data efficiently.
method Introduces new aggregation functions using Canonical and Tensor-Train decompositions.
result Proposed models outperform traditional methods on tree classification tasks.
DNDT combines neural networks and decision trees for tabular data.
problem Tabular data processing with interpretability and efficiency.
method Deep Neural Decision Trees (DNDT) using neural networks to model decision trees.
result DNDT achieves both interpretability and efficiency in tabular data processing.
ENTMOOT integrates tree models for better decision-making and optimization.
problem Difficult optimization of tree models and lack of reliable uncertainty measures.
method Integrates already trained tree models into optimization problems with a reliable uncertainty measure.
result Proves globally optimal solutions for optimization problems.
This work automates decision tree construction from neural networks.
problem Creating optimal decision tree architectures from neural networks.
method Automatic induction of non-greedy decision trees using weights transfer from neural networks.
result Improved model performance over fixed hyperparameters.
Collaborative Trees model analyzes feature interactions and additive effects.
problem Analyzing complex statistical associations between features and response variables.
method Proposes a novel tree model and its bagging version to decompose mean decrease in impurity and visualize feature contributions.
result Demonstrates the superior capability of the tree model in estimating additive effects and interaction effects.
Bayesian tensor factorization approximates a complex tree model.
problem Intractable size of state-transition matrix in Hidden Tree Markov Models.
method Tucker factorization of tensors for probabilistic interpretation.
result New model outperforms existing approximations on tree-structured data tasks.
New trees-based models handle correlated data better.
problem Standard trees-based models ignore correlation structure.
method Explicitly accounts for correlation structure in splitting criterion, stopping rules, and fitted values.
result New approach superior to standard models in simulations and real data.
Proposes regional tree regularization for interpretable deep models.
problem Lack of interpretability in deep neural networks.
method Encourages deep models to be well-approximated by separate decision trees for predefined regions of the input space.
result Regional tree regularization delivers more accurate predictions than training separate decision trees for each region, while producing simpler explanations.
Integrates regression trees to explain latent factor models in recommendation systems.
problem Difficulty in explaining latent factor models in personalized recommendations.
method Builds regression trees on users and items using user-generated reviews to guide latent factor model learning and explain latent factors.
result Model generates explainable recommendations by tracking latent profiles through regression tree paths.
A new tree-based model for multivariate responses interprets piecewise linear regimes.
problem Recovering piecewise multivariate linear regimes in complex data.
method Twoblock clustering trees with coskewness-based dimension reduction.
result Recovery of piecewise linear regimes in data.
The study analyzes when Bayesian averaging over decision trees is reliable.
problem When do Bayesian model averaging weights over decision trees provide reliable information?
method Closed-form solution for Bayesian decision trees with Catalan-exponential priors.
result Established a complete non-asymptotic theory of rational commitment thresholds.
Study on wind-tree models yields formulas for periodic trajectories.
problem Counting periodic trajectories in wind-tree models.
method Asymptotic formulas and explicit computation of Siegel-Veech constants.
result Asymptotic formulas for closed billiard trajectories in wind-tree models.
A new tree-based model improves uncertainty estimation in sequential optimization.
problem Improving uncertainty estimation in sequential model-based optimization.
method Proposed a new ensemble of randomized trees (BwO forest) with bagging and oversampling.
result BwO forest outperforms existing tree-based models in various optimization scenarios.
We propose a tree regularization framework, which enables many tree models to perform feature selection efficiently. The key idea of the regularization framework is to penalize selecting a new feature for splitting when its gain (e.g. information gain) is similar to the features used in previous splits. The regularizat…
BART and MOTR-BART improve tree-based predictions with local linear models.
problem Non-linearity and high-order interactions in data.
method Bayesian Additive Regression Trees (BART) and Model Trees BART (MOTR-BART) using piecewise linear functions.
result MOTR-BART achieves equal or better performance with fewer trees than BART.
Dynamic Model Tree improves online learning for evolving data streams.
problem Effective and transparent machine learning on data streams is challenging.
method Revisit Model Trees for data stream applications, introducing Dynamic Model Tree.
result Dynamic Model Tree reduces the number of splits and outperforms state-of-the-art models.
Two extensions improve gradient boosting for multiclass problems.
problem Multiclass classification with small models.
method Two extensions to gradient boosting: vector-valued trees and layer-by-layer boosting.
result Extensions lead to faster convergence and more compact ensembles.
GLMM trees identify subgroups with different growth patterns in longitudinal data.
problem Identifying subgroups with distinct growth trajectories in longitudinal studies.
method Extended GLMM trees for longitudinal data.
result Extended GLMM trees outperform other methods in accuracy and speed.
A new tree method for tensor data improves regression accuracy.
problem Efficiently modeling tensor data for regression problems.
method Scalar-output regression tree models for scalar-on-tensor problems, and tensor-on-tensor problems using additive tree ensemble approaches.
result The tensor-input tree (TT) method outperforms tensor-input GP models in efficiency and accuracy.
Kauri is a novel unsupervised binary tree for clustering that outperforms existing methods.
problem Learning a tree end-to-end for clustering without labels is an open challenge.
method Greedy maximization of the kernel KMeans objective without centroids.
result Kauri often outperforms existing unsupervised clustering methods, especially with non-linear kernels.
TRUST improves tree models' accuracy while maintaining interpretability.
problem Piecewise-constant regression trees lack in predictive accuracy compared to black-box models.
method Combines Random Forest accuracy with interpretability of shallow trees and sparsity of linear models, using LLMs for explanations.
result TRUST outperforms other interpretable models in predictive accuracy and matches Random Forest's accuracy.
Tree prototypes improve tree ensemble interpretability.
problem Making tree ensembles interpretable.
method Introducing prototypes, a new distance for GBTs, and adaptive selection methods.
result Prototypes can perform as well as or better than original tree ensembles when used as nearest-prototype classifiers.
Tree-AMP simplifies inference in complex tree-structured models.
problem Inference in high-dimensional tree-structured models.
method Approximate Message Passing algorithms for various machine learning tasks.
result Theoretical performance predictions and automated entropy estimation.
New algorithm speeds up robustness verification for tree-based models.
problem Formal robustness verification of tree-based models, especially ensembles.
method Reformulated as max-clique problem on a multi-partite graph with bounded boxicity; developed efficient multi-level verification algorithm.
result Tight lower bounds on robustness of decision tree ensembles, hundreds of times faster than previous approach.
The paper tackles high-dimensional function approximation using tree-based tensor formats.
problem Approximating high-dimensional functions in statistical learning.
method Empirical risk minimization over tree-based tensor formats, exploiting multilinear models and sparsity.
result Numerical stability and reliability of the proposed algorithms for learning.
A new decision tree variant improves linear model performance.
problem Improving decision tree performance on non-linear data.
method Extremely random tree with non-linear data transformation and linear observer.
result Outperforms linear models on benchmark dataset.