Claims computable MI/CMI bounds on fairness generalization error, but the core derivation uses an invalid variance-based Hoeffding step.
On the Generalization of Models Trained with SGD: Information-Theoretic Bounds and Implications
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This paper follows up on a recent work of Neu et al. (2021) and presents some new information-theoretic upper bounds for the generalization error of machine learning models, such as neural networks, trained with SGD. We apply these bounds to analyzing the generalization behaviour of linear and two-layer ReLU networks. Experimental study of these bounds provide some insights on the SGD training of neural networks. They also point to a new and simple regularization scheme which we show performs comparably to the current state of the art.
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Fairness Overfitting in Machine Learning: An Information-Theoretic Perspective
Claims computable MI/CMI bounds on fairness generalization error, but the core derivation uses an invalid variance-based Hoeffding step.