mlsanityData to 14 Oct 2026

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

arXiv 2603.26048 ↗First posted 27 Mar 2026stat.ML cs.LG math.STcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 54 references that are in the map. First posted on arXiv 27 Mar 2026.

Builds on

8 of 54 references.

References · 8

  1. 2024AlphaLoRA: Assigning LoRA Experts Based on Layer Training Qualitycited by 20
  2. 2023Sharded Bayesian Additive Regression Treescited by 6
  3. 2025Asymptotic Optimism of Random-Design Linear and Kernel Regression Modelscited by 3
  4. 2026Wedge Sampling: Efficient Tensor Completion with Nearly-Linear Sample Complexitycited by 3
  5. 2022An efficient tensor regression for high-dimensional datacited by 2
  6. 2024Frontal Slice Approaches for Tensor Linear Systemscited by 2
  7. 2026Wavelet Tree Ensembles for Triangulable Manifoldscited by 2
  8. 2022Tucker tensor factor models: matricization and mode-wise PCA estimationcited by 1

Built on by

Not cited yet.