Feb 2026· arXiv.org· Vol abs/2602.06042· 1 citation· 26 references
Computer Science
TL;DR
This paper proposes a natural generalization of PInv to the nonlinear regime in general and to neural networks in particular, and introduces Surjective Pseudo-invertible Neural Networks (SPNN), a class of architectures explicitly designed to admit a tractable non-linear PInv.
Abstract
The Moore-Penrose Pseudo-inverse (PInv) serves as the fundamental solution for linear systems. In this paper, we propose a natural generalization of PInv to the nonlinear regime in general and to neural networks in particular. We introduce Surjective Pseudo-invertible Neural Networks (SPNN), a class of architectures explicitly designed to admit a tractable non-linear PInv. The proposed non-linear PInv and its implementation in SPNN satisfy fundamental geometric properties. One such property is null-space projection or"Back-Projection", $x'= x + A^\dagger(y-Ax)$, which moves a sample $x$ to its closest consistent state $x'$ satisfying $Ax=y$. We formalize Non-Linear Back-Projection (NLBP), a method that guarantees the same consistency constraint for non-linear mappings $f(x)=y$ via our defined PInv. We leverage SPNNs to expand the scope of zero-shot inverse problems. Diffusion-based null-space projection has revolutionized zero-shot solving for linear inverse problems by exploiting closed-form back-projection. We extend this method to non-linear degradations. Here,"degradation"is broadly generalized to include any non-linear loss of information, spanning from optical distortions to semantic abstractions like classification. This approach enables zero-shot inversion of complex degradations and allows precise semantic control over generative outputs without retraining the diffusion prior.
Uncertainty quantification (UQ) for random partial differential equations (PDEs) is ubiquitous in computational science and engineering. However, classical spectral solvers for this class of problems face the curse of dimensionality, and existing neural solvers often ignore the stochastic structure that makes moments a...
An exact distance identity for two coupled updates is derived and approximate non-expansiveness of the common-example map is proved, with a quadratic defect only when the two latent margins straddle zero.
The lifted-selector reduction has an inverse-polynomial radial gap, proved through a quantitative theorem for rational cyclic zonogons, and the results apply to Euclidean zonotope radius and positive-semidefinite binary quadratic maximization parameterized by rank.
Pahan Dewasurendra, Subhashini Jayawardhana· 2 citations
We propose a scaled projection neural network for solving quasi-variational inequalities in which the constraint set S(x)=m(x)+S depends on the state through a contraction mapping m that translates a fixed closed convex set S, while the projection is performed with respect to a fixed symmetric positive definite matrix...
M. Alshahrani, Q. Ansari· Neural Networks· 0 citations
A stochastic first-order version of the Mirror Langevin Algorithm (sFO-MLA) is studied and finite-time Wasserstein guarantees for sFO-MLA are established that explicitly separate mixing, Euler--Maruyama discretization, and stochastic-gradient errors.
Rui-Ting Tong, Antik Chakraborty, R. Pasupathy· 0 citations
It is proved that the extracted trend is invariant across representations, and a closed-form Bregman-type divergence quantifying their disagreement under a shared coefficient vector is obtained, and this divergence vanishes as $\lambda\to\infty$.
Shintaro Yoshizawa· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
Exploring how generative AI could make machine vision more accessible to businesses. The post GenEye in a Box: Making Machine Vision Something You Can Just Ask For appeared first on GPT-Lab.
Microsoft Research Blog· microsoft.comAug 11, 2026
Radiology AI is evolving beyond report generation. CARE-X explores a unified approach that combines flexible reasoning, calibrated predictions, and measurement-based tools for chest X-ray interpretation. The post Introducing CARE-X: Towards Clinically Useful Radiology VLMs with Auxiliary Supervision, Reward-Aligned Learning, and Tool-Augmented Measurement appeared first on Microsoft Research.