Structure-Preserving Nonlinear Sufficient Dimension Reduction for Tensors

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Lin, Dianjun, Li, Bing, Xue, Lingzhou
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908730209075200
author Lin, Dianjun
Li, Bing
Xue, Lingzhou
author_facet Lin, Dianjun
Li, Bing
Xue, Lingzhou
contents We introduce two nonlinear sufficient dimension reduction methods for regressions with tensor-valued predictors. Our goal is two-fold: the first is to preserve the tensor structure when performing dimension reduction, particularly the meaning of the tensor modes, for improved interpretation; the second is to substantially reduce the number of parameters in dimension reduction, thereby achieving model parsimony and enhancing estimation accuracy. Our two tensor dimension reduction methods echo the two commonly used tensor decomposition mechanisms: one is the Tucker decomposition, which reduces a larger tensor to a smaller one; the other is the CP-decomposition, which represents an arbitrary tensor as a sequence of rank-one tensors. We developed the Fisher consistency of our methods at the population level and established their consistency and convergence rates. Both methods are easy to implement numerically: the Tucker-form can be implemented through a sequence of least-squares steps, and the CP-form can be implemented through a sequence of singular value decompositions. We investigated the finite-sample performance of our methods and showed substantial improvement in accuracy over existing methods in simulations and two data applications.
format Preprint
id arxiv_https___arxiv_org_abs_2512_20057
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Structure-Preserving Nonlinear Sufficient Dimension Reduction for Tensors
Lin, Dianjun
Li, Bing
Xue, Lingzhou
Statistics Theory
Methodology
Machine Learning
62H25, 62G08
We introduce two nonlinear sufficient dimension reduction methods for regressions with tensor-valued predictors. Our goal is two-fold: the first is to preserve the tensor structure when performing dimension reduction, particularly the meaning of the tensor modes, for improved interpretation; the second is to substantially reduce the number of parameters in dimension reduction, thereby achieving model parsimony and enhancing estimation accuracy. Our two tensor dimension reduction methods echo the two commonly used tensor decomposition mechanisms: one is the Tucker decomposition, which reduces a larger tensor to a smaller one; the other is the CP-decomposition, which represents an arbitrary tensor as a sequence of rank-one tensors. We developed the Fisher consistency of our methods at the population level and established their consistency and convergence rates. Both methods are easy to implement numerically: the Tucker-form can be implemented through a sequence of least-squares steps, and the CP-form can be implemented through a sequence of singular value decompositions. We investigated the finite-sample performance of our methods and showed substantial improvement in accuracy over existing methods in simulations and two data applications.
title Structure-Preserving Nonlinear Sufficient Dimension Reduction for Tensors
topic Statistics Theory
Methodology
Machine Learning
62H25, 62G08
url https://arxiv.org/abs/2512.20057