arXiv (All)
open access
Uncertainty Quantification for Landweber Iteration with Randomized Normal-Operator Approximation
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 d
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Injecting Measurement Information Yields a Fast and Noise-Robust Diffusion-Based Inverse Problem Solver#177108
- Full-Model Optimality for Tunable Linear Generative Priors in Compressed Sensing#924919
- Full-Model Optimality for Tunable Linear Generative Priors in Compressed Sensing#920685
- Inverse spectral problems for positive Hankel operators#147074
- Numerical differentiation by the polynomial-exponential basis#1110044
Record · ID 1155817
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive