# Generalization Error Analysis of Neural networks with Gradient Based Regularization

Source: [Generalization Error Analysis of Neural networks with Gradient Based Regularization](<https://www.sota2.com/research/paper/68fa59c01e209131ce9b9e9f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T16:05:54.285Z

Authors: Lingfeng Li, Xue-Cheng Tai, Jiang Yang

Published: 2021-07-06T07:54:36.000Z

## Abstract

We study gradient-based regularization methods for neural networks. We mainly focus on two regularization methods: the total variation and the Tikhonov regularization. Applying these methods is equivalent to using neural networks to solve some partial differential equations, mostly in high dimensions in practical applications. In this work, we introduce a general framework to analyze the generalization error of regularized networks. The error estimate relies on two assumptions on the approximation error and the quadrature error. Moreover, we conduct some experiments on the image classification tasks to show that gradient-based methods can significantly improve the generalization ability and adversarial robustness of neural networks. A graphical extension of the gradient-based methods are also considered in the experiments.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2107.02797>)

[PDF](<https://arxiv.org/pdf/2107.02797.pdf>)