Logo image
On the Koopman-Based Generalization Bounds for Multi-Task Deep Learning
Conference proceeding   Peer reviewed

On the Koopman-Based Generalization Bounds for Multi-Task Deep Learning

Mahdi Mohammadigohari, Giuseppe Di Fatta, Giuseppe Nicosia and PM Pardalos
Machine Learning, Optimization, and Data Science: 11th International Conference, LOD 2025, Castiglione della Pescaia, Italy, September 21–24, 2025, Revised Selected Papers, Part I, Vol.16468, pp.376-392
Lecture Notes in Computer Science, 16468
11th International Conference on Machine Learning, Optimization, and Data Science (LOD 2025) (Castiglione della Pescaia, 21/09/2025–24/09/2025)
2026
Handle:
https://hdl.handle.net/10863/52405

Abstract

The paper establishes generalization bounds for multitask deep neural networks using operator-theoretic techniques. The authors propose a tighter bound than those derived from conventional norm based methods by leveraging small condition numbers in the weight matrices and introducing a tailored Sobolev space as an expanded hypothesis space. This enhanced bound remains valid even in single output settings, outperforming existing Koopman based bounds. The resulting framework maintains key advantages such as flexibility and independence from network width, offering a more precise theoretical understanding of multitask deep learning in the context of kernel methods.
url
https://link.springer.com/chapter/10.1007/978-3-032-21480-5_25View

Details

Metrics

1 Record Views
Logo image