Sample compression unleashed : New generalization bounds for real valued losses
<|reference_start|>Sample compression unleashed : New generalization bounds for real valued losses: The sample compression theory provides generalization guarantees for predictors that can be fully defined using a subset of the training dataset and a (short) message string, generally defined as a binary sequence. Previous works provided generalization bounds for the zero-one loss, which is restrictive, notably when applied to deep learning approaches. In this paper, we present a general framework for deriving new sample compression bounds that hold for real-valued losses. We empirically demonstrate the tightness of the bounds and their versatility by evaluating them on different types of models, e.g., neural networks and decision forests, trained with the Pick-To-Learn (P2L) meta-algorithm, which transforms the training method of any machine-learning predictor to yield sample-compressed predictors. In contrast to existing P2L bounds, ours are valid in the non-consistent case.<|reference_end|>
@article{bazinet2024sample,
    title={Sample Compression Unleashed: New Generalization Bounds for Real Valued
  Losses},
    author={Mathieu Bazinet, Valentina Zantedeschi, Pascal Germain},
    journal={arXiv preprint arXiv:2409.17932},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.17932},
    primaryClass={cs.LG}
}