A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
PILOT is a fast algorithm for linear model trees that outperforms existing methods.
BART and MOTR-BART improve tree-based predictions with local linear models.
GLMM trees identify subgroups with different growth patterns in longitudinal data.
The paper proposes a new variant of a decision tree, called an Extreme Learning Tree. It consists of an extremely random tree with non-linear data transformation, and a linear observer that provides predictions based on the leaf index where the data samples fall. The proposed method outperforms linear models on a bench…
We present a detailed analysis of the class of regression decision tree algorithms which employ a regulized piecewise-linear node-splitting criterion and have regularized linear models at the leaves. From a theoretic standpoint, based on Rademacher complexity framework, we present new high-probability upper bounds for …
This paper develops a new method to model treatment effects that are heterogeneous across different quantiles.
New method estimates root-directed tree from extreme data.
Enhanced ODT with Feature Concatenation boosts learning efficiency.
New method identifies causal parameters in tree-shaped linear models using cycles.
LGB+ improves macroeconomic forecasting by combining linear and tree models.
Researchers improve tree model recovery from noisy data.
A novel tree algorithm improves time series forecasting accuracy.
Enhances GBDT robustness with one-hot encoding and regularization.
This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models, hidden Markov models, Gaussian mixture models, and Markov evolutionary trees. The …
Tree-based machine learning models such as random forests, decision trees, and gradient boosted trees are the most popular non-linear predictive models used in practice today, yet comparatively little attention has been paid to explaining their predictions. Here we significantly improve the interpretability of tree-bas…
Proposes extensions to semi-parametric models using BART for shared covariates.
Two algorithms for interpreting and boosting tree-based models using rule covering.
Paper proposes a novel SVM method for creating survival trees.
Improves local model explanations using GANs and Linear Model Trees.
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…
Ensemble of regression trees have become popular statistical tools for the estimation of conditional mean given a set of predictors. However, quantile regression trees and their ensembles have not yet garnered much attention despite the increasing popularity of the linear quantile regression model. This work proposes a…
Paper simplifies complex sports analytics models for better understanding.
BAVART model combines VAR and BART for non-linear forecasting.
We study the robustness verification problem for tree-based models, including decision trees, random forests (RFs) and gradient boosted decision trees (GBDTs). Formal robustness verification of decision tree ensembles involves finding the exact minimal adversarial perturbation or a guaranteed lower bound of it. Existin…
Variable selection for high-dimensional linear models has received a lot of attention lately, mostly in the context of l1-regularization. Part of the attraction is the variable selection effect: parsimonious models are obtained, which are very suitable for interpretation. In terms of predictive power, however, these re…
Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification errors. The resulting classifier is linear in the log-transformed univariate and b…
Paper proposes a new method for density estimation using tree tensor-network states.
AGBoost uses attention weights to improve GBM for regression problems.
This paper proposes an online tree-based Bayesian approach for reinforcement learning. For inference, we employ a generalised context tree model. This defines a distribution on multivariate Gaussian piecewise-linear models, which can be updated in closed form. The tree structure itself is constructed using the cover tr…
Regression Trees analyze stock returns, revealing market excess return as the most informative factor.
In this paper, we investigate adaptive nonlinear regression and introduce tree based piecewise linear regression algorithms that are highly efficient and provide significantly improved performance with guaranteed upper bounds in an individual sequence manner. We use a tree notion in order to partition the space of regr…
TRUST improves tree models' accuracy while maintaining interpretability.
Study finds a linear lower bound on conformal dimension for random hyperbolic groups.
Kauri is a novel unsupervised binary tree for clustering that outperforms existing methods.
The theme in this paper is the recombining binomial tree to price American put option when the underlying stock follows constant elasticity of variance(CEV) process. Recombining nodes of binomial tree are decided from finite difference scheme to emulate CEV process and the tree has a linear complexity. Also it is deriv…
Tree-AMP simplifies inference in complex tree-structured models.
dtControl uses decision trees to represent controllers efficiently and explainably.
Novel algorithm optimizes decision trees for nonlinear metrics.
Decision trees perform well in complex interactions, even when interactions are not fully accounted for.
New framework detects model weaknesses in decision tree ensembles.
Learning a regression function using censored or interval-valued output data is an important problem in fields such as genomics and medicine. The goal is to learn a real-valued prediction function, and the training output labels indicate an interval of possible values. Whereas most existing algorithms for this task are…
Although adversarial examples and model robustness have been extensively studied in the context of linear models and neural networks, research on this issue in tree-based models and how to make tree-based models robust against adversarial examples is still limited. In this paper, we show that tree based models are also…
Despite outstanding contribution to the significant progress of Artificial Intelligence (AI), deep learning models remain mostly black boxes, which are extremely weak in explainability of the reasoning process and prediction results. Explainability is not only a gateway between AI and society but also a powerful tool t…
We consider the problem of the estimation of a high-dimensional probability distribution from i.i.d. samples of the distribution using model classes of functions in tree-based tensor formats, a particular case of tensor networks associated with a dimension partition tree. The distribution is assumed to admit a density …
Linear algebra algorithms are used widely in a variety of domains, e.g machine learning, numerical physics and video games graphics. For all these applications, loop-level parallelism is required to achieve high performance. However, finding the optimal way to schedule the workload between threads is a non-trivial prob…
The kernel method is a potential approach to analyzing structured data such as sequences, trees, and graphs; however, unordered trees have not been investigated extensively. Kimura et al. (2011) proposed a kernel function for unordered trees on the basis of their subpaths, which are vertical substructures of trees resp…
DTE uses tree leaf means to embed data, balancing accuracy and speed.
This paper approximates 1-Wasserstein distance using tree-based embedding.