Bayesian regularization: From Tikhonov to horseshoe
نویسندگان
چکیده
منابع مشابه
Tikhonov Regularization
An important issue in quantitative nance is model calibration. The calibration problem is the inverse of the pricing problem. Instead of computing prices in a model with given values for its parameters, one wishes to compute the values of the model parameters that are consistent with observed prices. Now, it is well-known by physicists that such inverse problems are typically ill-posed. So, if ...
متن کاملMulti-Parameter Tikhonov Regularization
We study multi-parameter Tikhonov regularization, i.e., with multiple penalties. Such models are useful when the sought-for solution exhibits several distinct features simultaneously. Two choice rules, i.e., discrepancy principle and balancing principle, are studied for choosing an appropriate (vector-valued) regularization parameter, and some theoretical results are presented. In particular, t...
متن کاملNonstationary Iterated Tikhonov Regularization
A convergence rate is established for nonstationary iterated Tik-honov regularization, applied to ill-posed problems involving closed, densely deened linear operators, under general conditions on the iteration parameters. It is also shown that an order-optimal accuracy is attained when a certain a posteriori stopping rule is used to determine the iteration number.
متن کاملOn fractional Tikhonov regularization
It is well known that Tikhonov regularization in standard form may determine approximate solutions that are too smooth, i.e., the approximate solution may lack many details that the desired exact solution might possess. Two different approaches, both referred to as fractional Tikhonov methods have been introduced to remedy this shortcoming. This paper investigates the convergence properties of ...
متن کاملArnoldi-Tikhonov regularization methods
Tikhonov regularization for large-scale linear ill-posed problems is commonly implemented by determining a partial Lanczos bidiagonalization of the matrix of the given system of equations. This paper explores the possibility of instead computing a partial Arnoldi decomposition of the given matrix. Computed examples illustrate that this approach may require fewer matrix-vector product evaluation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Wiley Interdisciplinary Reviews: Computational Statistics
سال: 2019
ISSN: 1939-5108,1939-0068
DOI: 10.1002/wics.1463