Math 2.0

Operator theory Definition

Tikhonov regularization

Builds on Hilbert spaceContinuous linear mapHilbert space adjointMoore–Penrose inverse

Definition

Let XX and YY be real or complex Hilbert spaces, let K ⁣:X→YK \colon X \to Y be a bounded linear operator with adjoint K∗K^*, let y∈Yy \in Y and let α>0\alpha > 0. The Tikhonov regularized solution of Kx=yK x = y with parameter α\alpha is the unique minimizer xα∈Xx_\alpha \in X of the Tikhonov functional Jα(x)=∥Kx−y∥2+α∥x∥2.J_\alpha(x) = \norm{K x - y}^2 + \alpha \norm{x}^2. It is given by xα=(K∗K+αI)−1K∗y.x_\alpha = (K^* K + \alpha I)^{-1} K^* y. Tikhonov regularization is the method that approximates solutions of Kx=yK x = y by xαx_\alpha, with α\alpha chosen according to the noise level of the data.

Remarks

The operator K∗K+αIK^* K + \alpha I satisfies ⟨(K∗K+αI)x,x⟩≥α∥x∥2\ip{(K^* K + \alpha I) x}{x} \ge \alpha \norm{x}^2, so it is invertible with inverse of norm at most 1/α1/\alpha; the minimizer is characterized by the normal equation (K∗K+αI)x=K∗y(K^* K + \alpha I) x = K^* y. So xαx_\alpha exists, is unique, and depends continuously on yy.

If yy lies in the range of KK, then xα→K†yx_\alpha \to K^\dagger y as α→0\alpha \to 0, where K†yK^\dagger y is the solution of smallest norm, given by the Moore–Penrose inverse. For noisy data yδy^\delta with ∥yδ−y∥≤δ\norm{y^\delta - y} \le \delta, the choice α(δ)→0\alpha(\delta) \to 0 with δ2/α(δ)→0\delta^2 / \alpha(\delta) \to 0 gives xα(δ)δ→K†yx_{\alpha(\delta)}^\delta \to K^\dagger y as δ→0\delta \to 0. For compact KK with singular system (σn,vn,un)(\sigma_n, v_n, u_n), xα=∑nσnσn2+α⟨y,un⟩vnx_\alpha = \sum_n \frac{\sigma_n}{\sigma_n^2 + \alpha} \ip{y}{u_n} v_n, so the unbounded factors 1/σn1/\sigma_n of Picard's criterion are replaced by factors bounded by 1/(2α)1/(2\sqrt{\alpha}).

Example: X=Y=ℝX = Y = \R and Kx=kxK x = k x with k≠0k \ne 0. Then Jα(x)=(kx−y)2+αx2J_\alpha(x) = (k x - y)^2 + \alpha x^2 has derivative 2k(kx−y)+2αx2k(k x - y) + 2\alpha x, which vanishes at xα=ky/(k2+α)x_\alpha = k y / (k^2 + \alpha), in agreement with the formula.

Non-example: the case α=0\alpha = 0 is excluded. For K=0K = 0 on X=Y=ℝX = Y = \R, every xx minimizes ∥Kx−y∥2\norm{K x - y}^2, so there is no unique minimizer.

In finite dimensions, with KK a data matrix, xαx_\alpha is the ridge regression estimator.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Continuous linear map concept
  2. Hilbert space concept
  3. Hilbert space adjoint concept
  4. Moore–Penrose inverse concept
  5. Tikhonov regularization definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Ridge_regression
About this page
TagZE1FSZ6GJF
URIm2://ZE1FSZ6GJF
Kinddefinition
WritingW0 stub
MSC47A52, 45Q05, 65R30
DefinesTikhonov regularization
UsesHilbert space, Continuous linear map, Hilbert space adjoint, Moore–Penrose inverse

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.