
























Abstract:We study the approximation and statistical complexity of learning collections of operators in a shared multi-task setting, with a focus on the Multiple Neural Operators (MNO) architecture. For broad classes of Lipschitz multiple operator maps, we derive near-optimal upper bounds for approximation and statistical generalization. On the lower-bound side, we establish a curse of parametric complexity and prove corresponding minimax rates. Together, these results show that shared representations across tasks do not increase the overall cost: multi-task operator learning follows the same scaling laws as single operator learning. We also compare MNO with a multi-task extension of DeepONet based on concatenated task inputs and show that, from a worst-case approximation-complexity perspective, both architectures satisfy essentially the same asymptotic rates.
| Subjects: | Machine Learning (cs.LG); Numerical Analysis (math.NA); Machine Learning (stat.ML) |
| Cite as: | arXiv:2605.22724 [cs.LG] |
| (or arXiv:2605.22724v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.22724 arXiv-issued DOI via DataCite (pending registration) |
From: Adrien Weihs [view email]
[v1]
Thu, 21 May 2026 16:57:33 UTC (112 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。