On Unified and Sharpened CMI Bounds for Generalization Errors

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Lu, Yang, Frey, Matthias, Kuijper, Margreta, Zhu, Jingge
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913148464791552
author Lu, Yang
Frey, Matthias
Kuijper, Margreta
Zhu, Jingge
author_facet Lu, Yang
Frey, Matthias
Kuijper, Margreta
Zhu, Jingge
contents We present a new family of information-theoretic generalization bounds within the framework of conditional mutual information (CMI). Most of our results are established based on the leave-$m$-out (L$m$O) cross-validation error, with $m$ denoting the number of the hold-out supersamples. Under this setting, we propose a unified CMI-based bound, allowing to envelop and reproduce many known CMI-based bounds and also bridge the gap between the MI- and CMI-based bounds when $m$ tends to infinity. The proposed framework not only provides a unified description of the existing bounds but also develops new, sharper bounds. We show the benefits of the proposed bounds through several simple examples, where the existing results are either inapplicable or looser. Moreover, under the premise that the loss function is bounded, we tighten the CMI quantities involved in the proposed bounds by reducing the number of conditional terms, thereby enhancing the proposed framework. We show empirically that the resulting new bounds improve upon the previously known ones.
format Preprint
id arxiv_https___arxiv_org_abs_2605_21056
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle On Unified and Sharpened CMI Bounds for Generalization Errors
Lu, Yang
Frey, Matthias
Kuijper, Margreta
Zhu, Jingge
Information Theory
We present a new family of information-theoretic generalization bounds within the framework of conditional mutual information (CMI). Most of our results are established based on the leave-$m$-out (L$m$O) cross-validation error, with $m$ denoting the number of the hold-out supersamples. Under this setting, we propose a unified CMI-based bound, allowing to envelop and reproduce many known CMI-based bounds and also bridge the gap between the MI- and CMI-based bounds when $m$ tends to infinity. The proposed framework not only provides a unified description of the existing bounds but also develops new, sharper bounds. We show the benefits of the proposed bounds through several simple examples, where the existing results are either inapplicable or looser. Moreover, under the premise that the loss function is bounded, we tighten the CMI quantities involved in the proposed bounds by reducing the number of conditional terms, thereby enhancing the proposed framework. We show empirically that the resulting new bounds improve upon the previously known ones.
title On Unified and Sharpened CMI Bounds for Generalization Errors
topic Information Theory
url https://arxiv.org/abs/2605.21056