Generalization Bounds and Statistical Guarantees for Multi-Task and Multiple Operator Learning with MNO Networks

Multiple operator learning concerns learning operator families G[α]:U→ Vα∈ W indexed by an operator descriptor α. Training data are collected hierarchically by sampling operator instances α, then input functions u per instance, and finally evaluation points x per input, yielding noisy observations of G[α][u](x). While recent work has developed expressive multi-task and multiple operator learning architectures and approximation-theoretic scaling laws, quantitative statistical generalization guarantees remain limited. We provide a covering-number-based generalization analysis for separable models, focusing on the Multiple Neural Operator (MNO) architecture: we first derive explicit metric-entropy bounds for hypothesis classes given by linear combinations of products of deep ReLU subnetworks, and then combine these complexity bounds with approximation guarantees for MNO to obtain an explicit approximation-estimation tradeoff for the expected test error on new (unseen) triples (α,u,x). The resulting bound makes the dependence on the hierarchical sampling budgets (nα,nu,nx) transparent and yields an explicit learning-rate statement in the operator-sampling budget nα, providing a sample-complexity characterization for generalization across operator instances. The structure and architecture can also be viewed as a general purpose solver or an example of a "small'' PDE foundation model, where the triples are one form of multi-modality.