pith. sign in

arxiv: 2408.01926 · v2 · pith:SNGCS2C7new · submitted 2024-08-04 · 💻 cs.LG · stat.ME· stat.ML

Efficient Decision Trees for Tensor Regressions

classification 💻 cs.LG stat.MEstat.ML
keywords scalar-on-tensortreemodelsefficientmethodproblemsregressiontensor-input
0
0 comments X
read the original abstract

We proposed the tensor-input tree (TT) method for scalar-on-tensor and tensor-on-tensor regression problems. We first address scalar-on-tensor problem by proposing scalar-output regression tree models whose input variable are tensors (i.e., multi-way arrays). We devised and implemented fast randomized and deterministic algorithms for efficient fitting of scalar-on-tensor trees, making TT competitive against tensor-input GP models. Based on scalar-on-tensor tree models, we extend our method to tensor-on-tensor problems using additive tree ensemble approaches. Theoretical justification and extensive experiments on real and synthetic datasets are provided to illustrate the performance of TT.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Stabilizing the Splits through Minimax Decision Trees

    math.ST 2025-02 unverdicted novelty 6.0

    MinimaxSplit trees and forests minimize maximum child impurity for splits, with oracle inequalities claiming faster excess risk convergence than CART under non-atomicity conditions, plus empirical gains on EEG regress...