Globally injective and bijective neural operators
Takashi Furuya, Michael Puthawala, Matti Lassas, Maarten V. de Hoop

TL;DR
This paper investigates conditions under which neural operators are injective and surjective, providing theoretical guarantees and universal approximation results, with implications for inverse problems and Bayesian uncertainty quantification.
Contribution
It establishes sharp conditions for injectivity and surjectivity of neural operators, proves their universality, and extends analysis to deep subnetworks using advanced mathematical tools.
Findings
Injective neural operators can be characterized with sharp conditions.
Finite-rank neural networks preserve injectivity.
Subnetwork conditions ensure invertibility and surjectivity.
Abstract
Recently there has been great interest in operator learning, where networks learn operators between function spaces from an essentially infinite-dimensional perspective. In this work we present results for when the operators learned by these networks are injective and surjective. As a warmup, we combine prior work in both the finite-dimensional ReLU and operator learning setting by giving sharp conditions under which ReLU layers with linear neural operators are injective. We then consider the case the case when the activation function is pointwise bijective and obtain sufficient conditions for the layer to be injective. We remark that this question, while trivial in the finite-rank case, is subtler in the infinite-rank case and is proved using tools from Fredholm theory. Next, we prove that our supplied injective neural operators are universal approximators and that their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsModel Reduction and Neural Networks · Neural Networks and Applications · Numerical methods in inverse problems
