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

• URL: http://arxiv.org/abs/2604.01961v1
• Date: Thu, 02 Apr 2026 12:23:35 GMT
• Title: Generalization Bounds and Statistical Guarantees for Multi-Task and Multiple Operator Learning with MNO Networks
• Abstract summary: Multiple operator learning concerns learning operator families $G[]:Uto V_in W$ indexed by an operator descriptor $$.<n>Training data are collected hierarchically by sampling operator instances $$, then input functions $u$ per instance, and finally evaluation points $x$ per input.<n>We provide a covering-number-based generalization analysis for separable models, focusing on the Multiple Neural Operator architecture.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multiple operator learning concerns learning operator families $\{G[α]:U\to V\}_{α\in 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_α,n_u,n_x)$ 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.

Related papers

• Distributed Fast Fixed-Point Algorithms for Composite Monotone Inclusions over Networks [4.094815321148208]
  We develop efficient algorithms for solving a class of monotone inclusions, $0 in sum_i=1n (G_ix + T_ix)$, over a connected network of $n$ agents.<n>Existing distributed algorithms for this problem class are primarily non-accelerated, and their exact convergence rates in the original primal space are largely unexplored.
  arXiv  Detail & Related papers  (2026-09-14T02:56:00Z)
• Multiple Neural Operators Achieve Near-Optimal Rates for Multi-Task Learning [0.0]
  We study the approximation and statistical complexity of learning collections of operators in a shared multi-task setting.<n>For broad classes of Lipschitz multiple operator maps, we derive near-optimal upper bounds for approximation and statistical generalization.<n>On the lower-bound side, we establish a curse of parametric complexity and prove corresponding minimax rates.
  arXiv  Detail & Related papers  (2026-05-21T16:57:33Z)
• Almost Asymptotically Optimal Active Clustering Through Pairwise Observations [59.20614082241528]
  We propose a new analysis framework for clustering $M$ items into an unknown number of $K$ distinct groups using noisy and actively collected responses.<n>We establish a fundamental lower bound on the expected number of queries needed to achieve a desired confidence in the accuracy of the clustering.<n>We develop a computationally feasible variant of the Generalized Likelihood Ratio statistic and show that its performance gap to the lower bound can be accurately empirically estimated.
  arXiv  Detail & Related papers  (2026-02-05T14:16:47Z)
• A Deep Learning Framework for Multi-Operator Learning: Architectures and Approximation Theory [2.2731895181875346]
  We study the problem of learning collections of operators and provide both theoretical and empirical advances.<n>We distinguish between two regimes: (i) multiple operator learning, where a single network represents a continuum of operators parameterized by a parametric function, and (ii) learning several distinct single operators, where each operator is learned independently.<n>Overall, this work establishes a unified theoretical and practical foundation for scalable operator learning across multiple operators.
  arXiv  Detail & Related papers  (2025-10-29T10:52:02Z)
• The Generative Leap: Sharp Sample Complexity for Efficiently Learning Gaussian Multi-Index Models [71.5283441529015]
  In this work we consider generic Gaussian Multi-index models, in which the labels only depend on the (Gaussian) $d$-dimensional inputs through their projection onto a low-dimensional $r = O_d(1)$ subspace.<n>We introduce the generative leap exponent $kstar$, a natural extension of the generative exponent from [Damian et al.'24] to the multi-index setting.
  arXiv  Detail & Related papers  (2025-06-05T18:34:56Z)
• Sharper Risk Bound for Multi-Task Learning with Multi-Graph Dependent Data [5.42833955464548]
  Existing generalization analyses yield a emphsub-optimal risk bound of $O(frac1sqrtn)$, where $n$ is the number of training samples of each task.<n>This paper proposes a new Bennett-type inequality, enabling the derivation of a sharper risk bound of $O(fraclog nn)$.
  arXiv  Detail & Related papers  (2025-02-25T12:57:53Z)
• Computational-Statistical Gaps in Gaussian Single-Index Models [77.1473134227844]
  Single-Index Models are high-dimensional regression problems with planted structure. We show that computationally efficient algorithms, both within the Statistical Query (SQ) and the Low-Degree Polynomial (LDP) framework, necessarily require $Omega(dkstar/2)$ samples.
  arXiv  Detail & Related papers  (2024-03-08T18:50:19Z)
• On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem [0.0]
  We contribute to the efficient approximation of the $mathcalNP$-hard multi-objective minimum spanning tree problem (moMST) adopting evolutionary computation. We design several highly biased sub-graph-based mutation operators founded on the gained insights. Our results confirm that the sub-graph based operators beat baseline algorithms from the literature.
  arXiv  Detail & Related papers  (2023-05-31T22:35:17Z)
• Bilinear Classes: A Structural Framework for Provable Generalization in RL [119.42509700822484]
  Bilinear Classes is a new structural framework which permits generalization in reinforcement learning. The framework incorporates nearly all existing models in which a sample complexity is achievable. Our main result provides an RL algorithm which has sample complexity for Bilinear Classes.
  arXiv  Detail & Related papers  (2021-03-19T16:34:20Z)
• On Function Approximation in Reinforcement Learning: Optimism in the Face of Large State Spaces [208.67848059021915]
  We study the exploration-exploitation tradeoff at the core of reinforcement learning. In particular, we prove that the complexity of the function class $mathcalF$ characterizes the complexity of the function. Our regret bounds are independent of the number of episodes.
  arXiv  Detail & Related papers  (2020-11-09T18:32:22Z)
• Supervised Quantile Normalization for Low-rank Matrix Approximation [50.445371939523305]
  We learn the parameters of quantile normalization operators that can operate row-wise on the values of $X$ and/or of its factorization $UV$ to improve the quality of the low-rank representation of $X$ itself. We demonstrate the applicability of these techniques on synthetic and genomics datasets.
  arXiv  Detail & Related papers  (2020-02-08T21:06:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.