Asymptotic Optimism for Tensor Regression Models with Applications to Neural Network Compression

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Shi, Haoming, Chi, Eric C., Luo, Hengrui
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908916762279936
author Shi, Haoming
Chi, Eric C.
Luo, Hengrui
author_facet Shi, Haoming
Chi, Eric C.
Luo, Hengrui
contents We study rank selection for low-rank tensor regression under random covariates design. Under a Gaussian random-design model and some mild conditions, we derive population expressions for the expected training-testing discrepancy (optimism) for both CP and Tucker decomposition. We further demonstrate that the optimism is minimized at the true tensor rank for both CP and Tucker regression. This yields a prediction-oriented rank-selection rule that aligns with cross-validation and extends naturally to tensor-model averaging. We also discuss conditions under which under- or over-ranked models may appear preferable, thereby clarifying the scope of the method. Finally, we showcase its practical utility on a real-world image regression task and extend its application to tensor-based compression of neural network, highlighting its potential for model selection in deep learning.
format Preprint
id arxiv_https___arxiv_org_abs_2603_26048
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Asymptotic Optimism for Tensor Regression Models with Applications to Neural Network Compression
Shi, Haoming
Chi, Eric C.
Luo, Hengrui
Machine Learning
Statistics Theory
We study rank selection for low-rank tensor regression under random covariates design. Under a Gaussian random-design model and some mild conditions, we derive population expressions for the expected training-testing discrepancy (optimism) for both CP and Tucker decomposition. We further demonstrate that the optimism is minimized at the true tensor rank for both CP and Tucker regression. This yields a prediction-oriented rank-selection rule that aligns with cross-validation and extends naturally to tensor-model averaging. We also discuss conditions under which under- or over-ranked models may appear preferable, thereby clarifying the scope of the method. Finally, we showcase its practical utility on a real-world image regression task and extend its application to tensor-based compression of neural network, highlighting its potential for model selection in deep learning.
title Asymptotic Optimism for Tensor Regression Models with Applications to Neural Network Compression
topic Machine Learning
Statistics Theory
url https://arxiv.org/abs/2603.26048