Derives tighter Koopman-based generalization bounds for multi-task DNNs by assuming small weight-matrix condition numbers and using a tailored Sobolev space as hypothesis class.
In: The Twelfth International Conference on Learning Representations (2024), https://openreview.net/forum?id=JN7TcCm9LF
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Derives tighter generalization bounds for vector-valued neural networks and deep kernel methods in multi-task learning via Koopman and PF operators, with sketching for efficiency and a new vvRKHS framework.
citing papers explorer
-
On the Koopman-Based Generalization Bounds for Multi-Task Deep Learning
Derives tighter Koopman-based generalization bounds for multi-task DNNs by assuming small weight-matrix condition numbers and using a tailored Sobolev space as hypothesis class.
-
Operator-Based Generalization Bound for Deep Learning: Insights on Multi-Task Learning
Derives tighter generalization bounds for vector-valued neural networks and deep kernel methods in multi-task learning via Koopman and PF operators, with sketching for efficiency and a new vvRKHS framework.