Regularization independent of the noise level: an analysis of quasi-optimality

نویسندگان

  • Frank Bauer
  • Markus Reiß
چکیده

The quasi-optimality criterion chooses the regularization parameter in inverse problems without taking into account the noise level. This rule works remarkably well in practice, although Bakushinskii has shown that there are always counterexamples with very poor performance. We propose an average case analysis of quasi-optimality for spectral cut-off estimators and we prove that the quasi-optimality criterion determines estimators which are rate-optimal on average. Its practical performance is illustrated with a calibration problem from mathematical finance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A family of rules for the choice of the regularization parameter in the Lavrentiev method in the case of rough estimate of the noise level of the data

We consider the Lavrentiev method for the regularization of linear ill-posed problems with noisy data. Classical rules for the choice of the regularization parameter that use the noise level work well for almost exact noise level information, they fail in the case of the underestimated noise level and give a much larger error than the error by the optimal parameter in the case of the overestima...

متن کامل

Parametric Estimates of High Frequency Market Microstructure Noise as an Unsystematic Risk

Noise is essential for the existence of a liquid market, and if noise traders are not present in the market, the trade volume will drop severely and an important aspect of the market philosophy will be lost. However, these noise traders bring noise to the market, and the existence of noise in prices indicates a temporary deviation in prices from their fundamental values. In particular, high-fre...

متن کامل

Parameter choice methods using minimization schemes

Regularization is typically based on the choice of some parametric family of nearby solutions, and the choice of this family is a task in itself. Then, a suitable parameter must be chosen in order to find an approximation of good quality. We focus on the second task. There exist deterministic and stochasticmodels for describing noise and solutions in inverse problems.Wewill establish a unified ...

متن کامل

(S1/2) regularization methods and fixed point algorithms for affine rank minimization problems

The affine rank minimization problem is to minimize the rank of a matrix under linear constraints. It has many applications in various areas such as statistics, control, system identification and machine learning. Unlike the literatures which use the nuclear norm or the general Schatten q (0 < q < 1) quasi-norm to approximate the rank of a matrix, in this paper we use the Schatten 1/2 quasi-nor...

متن کامل

Patch Smoothers for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems

We consider a multigrid method for solving the discretized optimality system of a PDE-constrained optimization problem. In particular, we discuss the construction of an additive Schwarz-type smoother for a class of elliptic optimal control problems. A rigorous multigrid convergence analysis yields level-independent convergence rates. Numerical experiments indicate that the convergence rates are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008