NANAFAAug 3, 2010

Applying Lepskij-Balancing in Practice

arXiv:1008.06572 citationsh-index: 21
Originality Synthesis-oriented
AI Analysis

For practitioners using regularization of inverse problems, this work clarifies a practical discrepancy and offers a simple improvement.

The paper explains why the Lepskij balancing principle's parameter τ is often unnecessary in practice and proposes a small modification that improves both speed and accuracy.

In a stochastic noise setting the Lepskij balancing principle for choosing the regularization parameter in the regularization of inverse problems is depending on a parameter $τ$ which in the currently known proofs is depending on the unknown noise level of the input data. However, in practice this parameter seems to be obsolete. We will present an explanation for this behavior by using a stochastic model for noise and initial data. Furthermore, we will prove that a small modification of the algorithm also improves the performance of the method, in both speed and accuracy.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes