Elliptic Loss Regularization

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hasan, Ali, Yang, Haoming, Ng, Yuting, Tarokh, Vahid
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910857314697216
author Hasan, Ali
Yang, Haoming
Ng, Yuting
Tarokh, Vahid
author_facet Hasan, Ali
Yang, Haoming
Ng, Yuting
Tarokh, Vahid
contents Regularizing neural networks is important for anticipating model behavior in regions of the data space that are not well represented. In this work, we propose a regularization technique for enforcing a level of smoothness in the mapping between the data input space and the loss value. We specify the level of regularity by requiring that the loss of the network satisfies an elliptic operator over the data domain. To do this, we modify the usual empirical risk minimization objective such that we instead minimize a new objective that satisfies an elliptic operator over points within the domain. This allows us to use existing theory on elliptic operators to anticipate the behavior of the error for points outside the training set. We propose a tractable computational method that approximates the behavior of the elliptic operator while being computationally efficient. Finally, we analyze the properties of the proposed regularization to understand the performance on common problems of distribution shift and group imbalance. Numerical experiments confirm the utility of the proposed regularization technique.
format Preprint
id arxiv_https___arxiv_org_abs_2503_02138
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Elliptic Loss Regularization
Hasan, Ali
Yang, Haoming
Ng, Yuting
Tarokh, Vahid
Machine Learning
Artificial Intelligence
Regularizing neural networks is important for anticipating model behavior in regions of the data space that are not well represented. In this work, we propose a regularization technique for enforcing a level of smoothness in the mapping between the data input space and the loss value. We specify the level of regularity by requiring that the loss of the network satisfies an elliptic operator over the data domain. To do this, we modify the usual empirical risk minimization objective such that we instead minimize a new objective that satisfies an elliptic operator over points within the domain. This allows us to use existing theory on elliptic operators to anticipate the behavior of the error for points outside the training set. We propose a tractable computational method that approximates the behavior of the elliptic operator while being computationally efficient. Finally, we analyze the properties of the proposed regularization to understand the performance on common problems of distribution shift and group imbalance. Numerical experiments confirm the utility of the proposed regularization technique.
title Elliptic Loss Regularization
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2503.02138