Operator-Based Generalization Bound for Deep Learning: Insights on Multi-Task Learning
Not on the map. Why?
Abstract (arXiv)
This paper presents novel generalization bounds for vector-valued neural networks and deep kernel methods, focusing on multi-task learning through an operator-theoretic framework. Our key development lies in strategically combining a Koopman based approach with existing techniques, achieving tighter generalization guarantees compared to traditional norm-based bounds. To mitigate computational challenges associated with Koopman-based methods, we introduce sketching techniques applicable to vector valued neural networks. These techniques yield excess risk bounds under generic Lipschitz losses, providing performance guarantees for applications including robust and multiple quantile regression. Furthermore, we propose a novel deep learning framework, deep vector-valued reproducing kernel Hilbert spaces (vvRKHS), leveraging Perron Frobenius (PF) operators to enhance deep kernel methods. We derive a new Rademacher generalization bound for this framework, explicitly addressing underfitting and overfitting through kernel refinement strategies. This work offers novel insights into the generalization properties of multitask learning with deep learning architectures, an area that has been relatively unexplored until recent developments.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 25 of its 40 references that are in the map. First posted on arXiv 22 Dec 2025.
Builds on
25 of 40 references.
References · 25
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2019Benign Overfitting in Linear Regressioncited by 549
- 2020Multi-Task Learning with Deep Neural Networks: A Surveycited by 375
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2017Size-Independent Sample Complexity of Neural Networkscited by 290
- 2014Sketching as a Tool for Numerical Linear Algebracited by 288
- 2016Generalization Properties of Learning with Random Featurescited by 164
- 2021The Promises and Pitfalls of Deep Kernel Learningcited by 81
- 2020Deep Neural Tangent Kernel and Laplace Kernel Have the Same RKHScited by 74
- 2014Convolutional Kernel Networkscited by 47
- 2019Compression based bound for non-compressed network: unified generalization error analysis of large compressible deep neural networkcited by 39
13 more
- 2022Robust Fine-Tuning of Deep Neural Networks with Hessian-based Generalization Guaranteescited by 34
- 2015Randomized sketches for kernels: Fast and optimal non-parametric regressioncited by 31
- 2017A representer theorem for deep kernel learningcited by 26
- 2023Towards Optimal Sobolev Norm Rates for the Vector-Valued Regularized Least-Squares Algorithmcited by 22
- 2023Variation Spaces for Multi-Output Neural Networks: Insights on Multi-Task Learning and Network Compressioncited by 18
- 2016Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learningcited by 16
- 2023Provable Multi-Task Representation Learning by Two-Layer ReLU Neural Networkscited by 16
- 2014Scalable Matrix-valued Kernel Learning for High-dimensional Nonlinear Multivariate Regression and Granger Causalitycited by 13
- 2018Autoencoding any Data through Kernel Autoencoderscited by 10
- 2023Koopman-based generalization bound: New aspect for full-rank weightscited by 9
- 2021Entangled Kernels -- Beyond Separabilitycited by 7
- 2023Deep Learning with Kernels through RKHM and the Perron-Frobenius Operatorcited by 7
- 2022Fast Kernel Methods for Generic Lipschitz Losses via p-Sparsified Sketchescited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.