Sign inGet started
Paper · arXiv

Adaptive Norm-Based Regularization for Neural Networks

In this paper, we study norm-based regularization methods for neural networks. We compare existing penalization approaches and introduce two regularization strategies that extend classical ridge- and lasso-type penalties to neural network models. The first strategy modifies weight decay by incorporating the covariance structure of the input features into a ridge-type $\ell_2$ penalty, allowing regularization to account for feature dependence. The second combines an $\ell_1$ sparsity penalty with covariance-aware $\ell_2$ regularization, producing neural network weights that are both sparse and structurally informed. Monte Carlo simulations are used to evaluate these methods under differen...

AuthorsMuhammad Qasim, Farrukh Javed
Primary categorystat.ML
Published30 April 2026
Last updated at source30 April 2026
stat.MLcs.LGstat.AP
Embed this entry
<iframe src="https://silytics.si/embed/item/bbb18736-278f-4fca-bbf8-b7ebf3b55be2" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.