Twoblock clustering trees with coskewness-based dimension reduction: recovering piecewise multivariate linear regimes
Abstract
The twoblock clustering tree (\tbtree) is introduced as a highly interpretable regression tree for multivariate responses. Twoblock trees are deterministic decision trees that have local multivariate linear models as their leaves and use dense or sparse twoblock dimension reduction as local leaf models and in the impurity. The resulting models are both computationally efficient and can be highly interpretable. The estimator's primary aim is an interpretable, regime-aligned piecewise-linear description of the data, with predictive competitiveness retained as a constraint through a split/leaf decoupling. Beyond proposing the decision tree estimator itself, this paper also introduces an estimator for the twoblock dimension reduced space based on maximizing coskewness, which facilitates identification of non-normal clusters in the data. The tree inherently produces a set of local linear models and is therefore apt to recover piecewise linear regimes, which is illustrated in a simulation. However, two real-world data examples illustrate that twoblock trees are also capable of modeling more complexly nonlinear dependencies and can perform on par with black-box modeling techniques, such as random forests. At each point, both the twoblock models that generate the splits, as well as the ones in the leaves, can be inspected and interpreted.
Related
- Kernelised covariance matrices, dimension reduction and imbalanced spectral clustering
- Dissecting microbial community structure and heterogeneity via multivariate covariate-adjusted clustering
- Robust model-based clustering via mixtures of multivariate pseudo-Voigt distributions
- Recovering the reaction coefficient in a time-fractional diffusion equation with variable coefficients in any spatial dimension
- Latent-Class Poisson-Lognormal Mixed Models for Clustering Multivariate Longitudinal Count Data
BibTeX
@misc{serneels2026twoblock,
title = {{Twoblock clustering trees with coskewness-based dimension reduction: recovering piecewise multivariate linear regimes}},
author = {Sven Serneels},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2607.20760},
eprint = {2607.20760},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.20760},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Twoblock clustering trees with coskewness-based dimension reduction: recovering piecewise multivariate linear regimes
AU - Sven Serneels
PY - 2026
DA - 2026/10/08
PB - arXiv
DO - 10.48550/arxiv.2607.20760
UR - https://arxiv.org/abs/2607.20760
AB - The twoblock clustering tree (\tbtree) is introduced as a highly interpretable regression tree for multivariate responses. Twoblock trees are deterministic decision trees that have local multivariate linear models as their leaves and use dense or sparse twoblock dimension reduction as local leaf models and in the impurity. The resulting models are both computationally efficient and can be highly interpretable. The estimator's primary aim is an interpretable, regime-aligned piecewise-linear description of the data, with predictive competitiveness retained as a constraint through a split/leaf decoupling. Beyond proposing the decision tree estimator itself, this paper also introduces an estimator for the twoblock dimension reduced space based on maximizing coskewness, which facilitates identification of non-normal clusters in the data. The tree inherently produces a set of local linear models and is therefore apt to recover piecewise linear regimes, which is illustrated in a simulation. However, two real-world data examples illustrate that twoblock trees are also capable of modeling more complexly nonlinear dependencies and can perform on par with black-box modeling techniques, such as random forests. At each point, both the twoblock models that generate the splits, as well as the ones in the leaves, can be inspected and interpreted.
ER -