Built independently by an author, for readers. Read the story and support ChapterPal

keyword

Jacobian regularization

Jacobian regularization is a machine learning technique that penalizes or constrains the Jacobian matrix, which contains the first-order partial derivatives of a model output with respect to its inputs or intermediate representations, during the training process. By minimizing a norm of the Jacobian, such as the Frobenius or spectral norm, this approach bounds the local Lipschitz constant and enforces smooth mathematical behavior in the neighborhood of data points. Controlling these derivative magnitudes prevents small input perturbations from causing disproportionate shifts in predictions, which in turn increases classification margins, mitigates overfitting, and enhances model robustness against random noise and adversarial attacks.

1 item

On Mixup Regularization

On Mixup Regularization

Luigi Carratino, Moustapha Cissé, Rodolphe Jenatton, Jean-Philippe Vert

OrganizationsGoogleMaLGaUniversity of Genoa

Why you should read this

Explains the theoretical mechanisms behind Mixup by formalizing it as empirical risk minimization with data transformation and random perturbations, leading to a simple test-time adjustment that improves prediction accuracy and calibration.

Mixup is a data augmentation technique that creates new examples as convex combinations of training points and labels. This simple technique has empirically shown to improve the accuracy of many state-of-the-art models in different settings and applications, but the reasons behind this empirical success remain poorly understood. In this paper we take a substantial step in explaining the theoretical foundations of Mixup, by clarifying its regularization effects. We show that Mixup can be interpreted as standard empirical risk minimization estimator subject to a combination of data transformation and random perturbation of the transformed data. We gain two core insights from this new interpretation. First, the data transformation suggests that, at test time, a model trained with Mixup should also be applied to transformed data, a one-line change in code that we show empirically to improve both accuracy and calibration of the prediction. Second, we show how the random perturbation of the new interpretation of Mixup induces multiple known regularization schemes, including label smoothing and reduction of the Lipschitz constant of the estimator. These schemes interact synergistically with each other, resulting in a self calibrated and effective regularization effect that prevents overfitting and overconfident predictions. We corroborate our theoretical analysis with experiments that support our conclusions.

Added

2026-10-01