Transformed Low-Rank Parameterization Can Help Robust Generalization for Tensor Neural Networks
Not on the map. Why?
Abstract (arXiv)
Achieving efficient and robust multi-channel data learning is a challenging task in data science. By exploiting low-rankness in the transformed domain, i.e., transformed low-rankness, tensor Singular Value Decomposition (t-SVD) has achieved extensive success in multi-channel data representation and has recently been extended to function representation such as Neural Networks with t-product layers (t-NNs). However, it still remains unclear how t-SVD theoretically affects the learning behavior of t-NNs. This paper is the first to answer this question by deriving the upper bounds of the generalization error of both standard and adversarially trained t-NNs. It reveals that the t-NNs compressed by exact transformed low-rank parameterization can achieve a sharper adversarial generalization bound. In practice, although t-NNs rarely have exactly transformed low-rank weights, our analysis further shows that by adversarial training with gradient flow (GF), the over-parameterized t-NNs with ReLU activations are trained with implicit regularization towards transformed low-rank parameterization under certain conditions. We also establish adversarial generalization bounds for t-NNs with approximately transformed low-rank weights. Our analysis indicates that the transformed low-rank parameterization can promisingly enhance robust generalization for t-NNs.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 26 of its 59 references that are in the map. First posted on arXiv 1 Mar 2023.
Builds on
26 of 59 references.
References · 26
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2017Size-Independent Sample Complexity of Neural Networkscited by 289
- 2016Adversarial Training Methods for Semi-Supervised Text Classificationcited by 280
- 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
- 2020Directional convergence and alignment in deep learningcited by 172
- 2018Rademacher Complexity for Adversarially Robust Generalizationcited by 132
- 2018Tensor Robust Principal Component Analysis with A New Tensor Nuclear Normcited by 110
- 2022PAC-Bayes Compression Bounds So Tight That They Can Explain Generalizationcited by 75
14 more
- 2020A Unifying View on Implicit Bias in Training Linear Neural Networkscited by 74
- 2022Implicit Regularization Towards Rank Minimization in ReLU Networkscited by 53
- 2020Adversarial Learning Guarantees for Linear Hypotheses and Neural Networkscited by 47
- 2020Implicit Regularization in ReLU Networks with the Square Losscited by 45
- 2019Compression based bound for non-compressed network: unified generalization error analysis of large compressible deep neural networkcited by 39
- 2017On Polynomial Time Methods for Exact Low Rank Tensor Completioncited by 27
- 2016Low-tubal-rank Tensor Completion using Alternating Minimizationcited by 18
- 2022Adversarial Rademacher Complexity of Deep Neural Networkscited by 18
- 2020Understanding Generalization in Deep Learning via Tensor Methodscited by 13
- 2022On Measuring Excess Capacity in Neural Networkscited by 9
- 2019On the Effect of Low-Rank Weights on Adversarial Robustness of Neural Networkscited by 7
- 2020Sparse Nonnegative Tensor Factorization and Completion with Noisy Observationscited by 7
- 2018Stable Tensor Neural Networks for Rapid Deep Learningcited by 6
- 2020Trace-Norm Adversarial Examplescited by 1
Built on by
Citing papers per year: 2024: 2; 2025: 2.
4 papers.
- 2024OTLRM: Orthogonal Learning-based Low-Rank Metric for Multi-Dimensional Inverse Problemscited by 5
- 2024Tropical Decision Boundaries for Neural Networks Are Robust Against Adversarial Attackscited by 1
- 2025Low-Rank Tensor Decompositions for the Theory of Neural Networkscited by 1
- 2025No-Rank Tensor Decomposition Using Metric Learningcited by 0
- 2025No-Rank Tensor Decomposition Using Metric Learning3 Nov 2025
- 2025Low-Rank Tensor Decompositions for the Theory of Neural Networks25 Aug 2025
- 2024OTLRM: Orthogonal Learning-based Low-Rank Metric for Multi-Dimensional Inverse Problems15 Dec 2024
- 2024Tropical Decision Boundaries for Neural Networks Are Robust Against Adversarial Attacks1 Feb 2024