Search arXiv⌕ Search

arXiv · 2610.00882

Uncertainty Quantification for Landweber Iteration with Randomized Normal-Operator Approximation

Abstract

Iterative methods are extremely popular for solving linear ill-posed inverse problems. While deterministic convergence, or more precisely, semi-convergence of such methods is widely studied, the problem of quantifying uncertainty in the resulting reconstructions due to random noise in the observed data has received far less attention. In this work, we study uncertainty quantification for the Landweber iteration in linear inverse problems using the Radon transform as a motivating example. We interpret the Landweber reconstruction statistically by analyzing how uncertainty in the measured data is propagated through the reconstruction map. This perspective is closely related to generalized fiducial inference, where uncertainty about the parameter is induced by inverting the relation between the observed data and the unknown (fixed) quantity. We combine the resulting stochastic uncertainty with a theoretical bound on the regularization bias to construct confidence intervals for the reconstructed solution. The evaluation of the resulting uncertainty estimates require repeated operations with the forward operator that can become expensive in large-scale problems. To reduce this cost, we use randomized singular value decomposition to obtain a low-rank approximation of the normal operator associated with the Radon transform and incorporate this approximation in quantifying uncertainty. {In particular, this requires that the additional randomization error introduced due to the use of such randomized techniques be included in our approach for uncertainty quantification.} Numerical results show that the proposed method provides accurate reconstructions and reliable uncertainty estimates at substantially reduced computational cost.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anuj Abhishek, Sean Holman. 2026-10-01. Uncertainty Quantification for Landweber Iteration with Randomized Normal-Operator Approximation. https://arxiv.org/abs/2610.00882

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Neural network-driven domain decomposition for efficient solutions to the Helmholtz equation

Accurately simulating wave propagation is crucial in fields such as acoustics, electromagnetism, and seismic analysis. Traditional numerical methods, like finite difference and finite element approaches, are widely used to solve governing partial differential equations (PDEs) such as the Helmholtz equation. However, these methods face significant computational challenges when applied to high-frequency wave problems in complex two-dimensional domains. This work investigates Finite Basis Physics-Informed Neural Networks (FBPINNs) and their multilevel extensions as a promising alternative. These methods leverage domain decomposition, partitioning the computational domain into overlapping sub-domains, each governed by a local neural network. We assess their accuracy and computational efficiency in solving the Helmholtz equation for the homogeneous case, demonstrating their potential to mitigate the limitations of traditional approaches.

math.NA↗

Differentiating through Stochastic Differential Equations: A Primer

Dynamical systems are essential to model various phenomena in physics, finance, economics, and are also of current interest in machine learning. A central modeling task is investigating parameter sensitivity, whether tuning atmospheric coefficients, computing financial Greeks, or optimizing neural networks. These sensitivities are mathematically expressed as derivatives of an objective function with respect to parameters of interest and are rarely available analytically, necessitating numerical methods for approximating them. While the literature for differentiation of deterministic systems is well-covered, the treatment of stochastic systems, such as stochastic differential equations (SDEs), in most curricula is less comprehensive than what the subtleties arising from the interplay of noise and discretization warrant. This paper provides a primer on numerical differentiation of SDEs organized as a two-tale narrative. Tale 1 demonstrates that differentiating through discretized SDEs, known as the discretize-optimize approach, is reliable for both Itô and Stratonovich calculus. Tale 2 examines the optimize-discretize approach, investigating the continuous limit of adjoint equations from Tale 1 corresponding to the desired gradients. Our aim is to equip readers with a clear guide on the numerical differentiation of SDEs: computing gradients correctly in both Itô and Stratonovich settings, understanding when discretize-optimize and optimize-discretize agree or diverge, and developing intuition for reasoning about stochastic differentiation beyond the cases explicitly covered.

math.NA↗

A discrete gradient scheme for preserving QSR-dissipativity

The notion of dissipative dynamical systems provides a formal description of processes that cannot generate energy internally. For these systems, changes in energy can only occur due to an external energy supply or dissipation effects. Unfortunately, dissipative properties tend to deteriorate in numerical computations, especially in nonlinear systems. Discrete gradient methods can help mitigate this problem. In this paper, we present a class of structure-preserving time discretization schemes based on discrete gradients for a special class of systems that are dissipative with respect to a quadratic supply rate.

math.NA↗