# Regularization by spectral filtering

Spectral regularization is any of a class of regularization techniques used in machine learning to control the impact of noise and prevent overfitting. Spectral regularization can be used in a broad range of applications, from deblurring images to classifying emails into a spam folder and a non-spam folder. For instance, in the email classification example, spectral regularization can be used to reduce the impact of noise and prevent overfitting when a machine learning system is being trained on a labeled set of emails to learn how to tell a spam and a non-spam email apart.
Spectral regularization algorithms rely on methods that were originally defined and studied in the theory of ill-posed inverse problems (for instance, see) focusing on the inversion of a linear operator (or a matrix) that possibly has a bad condition number or an unbounded inverse. In this context, regularization amounts to substituting the original operator by a bounded operator called the "regularization operator" that has a condition number controlled by a regularization parameter, a classical example being Tikhonov regularization. To ensure stability, this regularization parameter is tuned based on the level of noise. The main idea behind spectral regularization is that each regularization operator can be described using spectral calculus as an appropriate filter on the eigenvalues of the operator that defines the problem, and the role of the filter is to "suppress the oscillatory behavior corresponding to small eigenvalues". Therefore, each algorithm in the class of spectral regularization algorithms is defined by a suitable filter function (which needs to be derived for that particular algorithm). Three of the most commonly used regularization algorithms for which spectral filtering is well-studied are Tikhonov regularization, Landweber iteration, and truncated singular value decomposition (TSVD). As for choosing the regularization parameter, examples of candidate methods to compute this parameter include the discrepancy principle, generalized cross validation, and the L-curve criterion.
It is of note that the notion of spectral filtering studied in the context of machine learning is closely connected to the literature on function approximation (in signal processing).

## Notation

The training set is defined as $S=\{(x_{1},y_{1}),\dots ,(x_{n},y_{n})\}$, where $X$ is the $n\times d$ input matrix and $Y=(y_{1},\dots ,y_{n})$ is the output vector. Where applicable, the kernel function is denoted by $k$, and the $n\times n$ kernel matrix is denoted by $K$ which has entries $K_{ij}=k(x_{i},x_{j})$ and ${\mathcal {H}}$ denotes the Reproducing Kernel Hilbert Space (RKHS) with kernel $k$. The regularization parameter is denoted by $\lambda$.
(Note: For $g\in G$ and $f\in F$, with $G$ and $F$ being Hilbert spaces, given a linear, continuous operator $L$, assume that $g=Lf$ holds. In this setting, the direct problem would be to solve for $g$ given $f$ and the inverse problem would be to solve for $f$ given $g$. If the solution exists, is unique and stable, the inverse problem (i.e. the problem of solving for $f$) is well-posed; otherwise, it is ill-posed.)

## Relation to the theory of ill-posed inverse problems

The connection between the regularized least squares (RLS) estimation problem (Tikhonov regularization setting) and the theory of ill-posed inverse problems is an example of how spectral regularization algorithms are related to the theory of ill-posed inverse problems.
The RLS estimator solves $\min _{f\in {\mathcal {H}}}{\frac {1}{n}}\sum _{i=1}^{n}(y_{i}-f(x_{i}))^{2}+\lambda \left\|f\right\|_{\mathcal {H}}^{2}$ and the RKHS allows for expressing this RLS estimator as $f_{S}^{\lambda }(X)=\sum _{i=1}^{n}c_{i}k(x,x_{i})$ where $(K+n\lambda I)c=Y$ with $c=(c_{1},\dots ,c_{n})$. The penalization term is used for controlling smoothness and preventing overfitting. Since the solution of empirical risk minimization $\min _{f\in {\mathcal {H}}}{\frac {1}{n}}\sum _{i=1}^{n}(y_{i}-f(x_{i}))^{2}$ can be written as $f_{S}^{\lambda }(X)=\sum _{i=1}^{n}c_{i}k(x,x_{i})$ such that $Kc=Y$, adding the penalty function amounts to the following change in the system that needs to be solved: $\left\{\min _{f\in {\mathcal {H}}}{\frac {1}{n}}\sum _{i=1}^{n}\left(y_{i}-f(x_{i})\right)^{2}\rightarrow \min _{f\in {\mathcal {H}}}{\frac {1}{n}}\sum _{i=1}^{n}\left(y_{i}-f(x_{i})\right)^{2}+\lambda \left\|f\right\|_{\mathcal {H}}^{2}\right\}\equiv {\biggl \Kc=Y\rightarrow \left(K+n\lambda I\right)c=Y{\biggr \}}.$
In this learning setting, the kernel matrix can be decomposed as $K=Q\Sigma Q^{T}$, with $\sigma =\operatorname {diag} (\sigma _{1},\dots ,\sigma _{n}),~\sigma _{1}\geq \sigma _{2}\geq \cdots \geq \sigma _{n}\geq 0$ and $q_{1},\dots ,q_{n}$ are the corresponding eigenvectors. Therefore, in the initial learning setting, the following holds: $c=K^{-1}Y=Q\Sigma ^{-1}Q^{T}Y=\sum _{i=1}^{n}{\frac {1}{\sigma _{i}}}\langle q_{i},Y\rangle q_{i}.$
Thus, for small eigenvalues, even small perturbations in the data can lead to considerable changes in the solution. Hence, the problem is ill-conditioned, and solving this RLS problem amounts to stabilizing a possibly ill-conditioned matrix inversion problem, which is studied in the theory of ill-posed inverse problems; in both problems, a main concern is to deal with the issue of numerical stability.

## Implementation of algorithms

Each algorithm in the class of spectral regularization algorithms is defined by a suitable filter function, denoted here by $G_{\lambda }(\cdot )$. If the Kernel matrix is denoted by $K$, then $\lambda$ should control the magnitude of the smaller eigenvalues of $G_{\lambda }(K)$. In a filtering setup, the goal is to find estimators $f_{S}^{\lambda }(X):=\sum _{i=1}^{n}c_{i}k(x,x_{i})$ where $c=G_{\lambda }(K)Y$. To do so, a scalar filter function $G_{\lambda }(\sigma )$ is defined using the eigen-decomposition of the kernel matrix: $G_{\lambda }(K)=QG_{\lambda }(\Sigma )Q^{T},$ which yields $G_{\lambda }(K)Y~=~\sum _{i=1}^{n}G_{\lambda }(\sigma _{i})\langle q_{i},Y\rangle q_{i}.$
Typically, an appropriate filter function should have the following properties:
* As $\lambda$ goes to zero, $G_{\lambda }(\sigma )~\rightarrow ~1/\sigma$.
* The magnitude of the (smaller) eigenvalues of $G_{\lambda }$ is controlled by $\lambda$.
While the above items give a rough characterization of the general properties of filter functions for all spectral regularization algorithms, the derivation of the filter function (and hence its exact form) varies depending on the specific regularization method that spectral filtering is applied to.

### Filter function for Tikhonov regularization

In the Tikhonov regularization setting, the filter function for RLS is described below. As shown in, in this setting, $c=\left(K+n\lambda I\right)^{-1}Y$. Thus, $c=(K+n\lambda I)^{-1}Y=Q(\Sigma +n\lambda I)^{-1}Q^{T}Y=\sum _{i=1}^{n}{\frac {1}{\sigma _{i}+n\lambda }}<q_{i},Y>q_{i}.$
The undesired components are filtered out using regularization:
* If $\sigma \gg \lambda n$, then ${\frac {1}{\sigma _{i}+n\lambda }}\sim {\frac {1}{\sigma _{i}}}$.
* If $\sigma \ll \lambda n$, then ${\frac {1}{\sigma _{i}+n\lambda }}\sim {\frac {1}{\lambda n}}$.
The filter function for Tikhonov regularization is therefore defined as: $G_{\lambda }(\sigma )={\frac {1}{\sigma +n\lambda }}.$

### Filter function for Landweber iteration

The idea behind the Landweber iteration is gradient descent:
In this setting, if $n$ is larger than $K$'s largest eigenvalue, the above iteration converges by choosing $\eta =2/n$ as the step-size:. The above iteration is equivalent to minimizing ${\frac {1}{n}}\left\|Y-Kc\right\|_{2}^{2}$ (i.e. the empirical risk) via gradient descent; using induction, it can be proved that at the $t$-th iteration, the solution is given by $c=\eta \sum _{i=0}^{t-1}\left(I-\eta K\right)^{i}Y.$
Thus, the appropriate filter function is defined by: $G_{\lambda }(\sigma )=\eta \sum _{i=0}^{t-1}\left(I-\eta \sigma \right)^{i}.$
It can be shown that this filter function corresponds to a truncated power expansion of $K^{-1}$; to see this, note that the relation $\sum _{i\geq 0}x^{i}=1/(1-x)$, would still hold if $x$ is replaced by a matrix; thus, if $K$ (the kernel matrix), or rather $I-\eta K$, is considered, the following holds: $K^{-1}=\eta \sum _{i=0}^{\infty }\left(I-\eta K\right)^{i}\sim \eta \sum _{i=0}^{t-1}\left(I-\eta K\right)^{i}.$
In this setting, the number of iterations gives the regularization parameter; roughly speaking, $t\sim 1/\lambda$. If $t$ is large, overfitting may be a concern. If $t$ is small, oversmoothing may be a concern. Thus, choosing an appropriate time for early stopping of the iterations provides a regularization effect.

### Filter function for TSVD

In the TSVD setting, given the eigen-decomposition $K=Q\Sigma Q^{T}$ and using a prescribed threshold $\lambda n$, a regularized inverse can be formed for the kernel matrix by discarding all the eigenvalues that are smaller than this threshold. Thus, the filter function for TSVD can be defined as $G_{\lambda }(\sigma )={\begin{cases}1/\sigma ,&{\text{if }}\sigma \geq \lambda n\\[1ex]0,&{\text{otherwise}}\end{cases}}$
It can be shown that TSVD is equivalent to the (unsupervised) projection of the data using (kernel) Principal Component Analysis (PCA), and that it is also equivalent to minimizing the empirical risk on the projected data (without regularization). Note that the number of components kept for the projection is the only free parameter here.