mlsanityData to 7 Oct 2026

On Learning the Optimal Regularization Parameter in Inverse Problems

arXiv 2311.15845 ↗First posted 27 Nov 2023math.ST math.OC stat.THcited by 5

Not on the map. Why?

Abstract (arXiv)

Selecting the best regularization parameter in inverse problems is a classical and yet challenging problem. Recently, data-driven approaches have become popular to tackle this challenge. These approaches are appealing since they do require less a priori knowledge, but their theoretical analysis is limited. In this paper, we propose and study a statistical machine learning approach, based on empirical risk minimization. Our main contribution is a theoretical analysis, showing that, provided with enough data, this approach can reach sharp rates while being essentially adaptive to the noise and smoothness of the problem. Numerical simulations corroborate and illustrate the theoretical findings. Our results are a step towards grounding theoretically data-driven approaches to inverse problems.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Nov 2023.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 3.

5 papers.