analiza aiqbench
This research establishes rigorous theoretical bounds for multi-input neural operators within Sobolev spaces, offering a novel framework where error rates depend explicitly on input dimensionality and regularity interactions rather than just model complexity. By addressing the complexities of multiple inputs defined on different domains, this work advances the mathematical foundations necessary for applying operator learning to partial differential equations in scientific computing.
Generalization Guarantees for Multi-Input Neural Operator Learning in Sobolev Spaces
arXiv:2606.17419v1 Announce Type: new Abstract: We develop approximation and generalization error estimates for multi-input neural operators, with the output error measured in Sobolev norms. In contrast to standard operator-learning settings with a single input function, our framework allows multiple input functions defined on possibly different domains, with different dimensions and Sobolev regularities. The derived rates explicitly quantify the contribution of each input space to the final error bound. In particular, in the balanced regime, the approximation and generalization rates are governed by the interaction between the input dimensions, regularities, and Sobolev orders, while the dependence on the model complexity retains a \(\log\log/\log\)-type structure. Our analysis provides a general theoretical framework for multi-input operator learning, including Sobolev training, and is applicable to operator learning problems arising from partial differential equations and scientific computing.
Abstract:We develop approximation and generalization error estimates for multi-input neural operators, with the output error measured in Sobolev norms. In contrast to standard operator-learning settings with a single input function, our framework allows multiple input functions defined on possibly different domains, with different dimensions and Sobolev regularities. The derived rates explicitly quantify the contribution of each input space to the final error bound. In particular, in the balanced regime, the approximation and generalization rates are governed by the interaction between the input dimensions, regularities, and Sobolev orders, while the dependence on the model complexity retains a \(\log\log/\log\)-type structure. Our analysis provides a general theoretical framework for multi-input operator learning, including Sobolev training, and is applicable to operator learning problems arising from partial differential equations and scientific computing.
Machine Learning (cs.LG); Numerical Analysis (math.NA)
arXiv:2606.17419 [cs.LG]
(or arXiv:2606.17419v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.17419 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 224 cuvinte
Subiecte conexe
Generalization Guarantees of Randomized Block Coordinate Descent for Nonconvex Learning
arXiv · 16 oct. 2026

Quantum algorithm training now provably stable across system dimensions
Quantum Zeitgeist · 1 sept. 2026
Optimal Hidden-Target Learning for Online Inventory Optimization on General Convex Sets
arXiv · 15 iun. 2026
Convergence guarantee for linearly-constrained combinatorial optimization with a quantum alternating operator ansatz
arXiv · 21 aug. 2026