Low-rank layers in deep networks yield Gaussian complexity bounds where the rank factor appears once, not once per layer, improving on prior norm-based bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On Generalization Bounds for Neural Networks with Low Rank Layers
Low-rank layers in deep networks yield Gaussian complexity bounds where the rank factor appears once, not once per layer, improving on prior norm-based bounds.