From b3f74565d8bb0110c5ba7790aac0882bf3d4b289 Mon Sep 17 00:00:00 2001 From: Morten Hjorth-Jensen Date: Fri, 10 Sep 2021 16:11:46 +0200 Subject: [PATCH] updated book chapter --- doc/BookChapters/chapter1.do.txt | 4 +- doc/BookChapters/chapter3.do.txt | 2472 ++++++-- .../_build/.doctrees/chapter2.doctree | Bin 168736 -> 386730 bytes .../_build/.doctrees/chapter3.doctree | Bin 144165 -> 169276 bytes .../_build/.doctrees/environment.pickle | Bin 184724 -> 188475 bytes .../_build/html/_images/chapter3_25_2.png | Bin 0 -> 5116 bytes .../_build/html/_sources/chapter2.ipynb | 4954 ++++++++++++---- .../_build/html/_sources/chapter3.ipynb | 2020 ++++--- doc/LectureNotes/_build/html/chapter2.html | 2937 +++++++--- doc/LectureNotes/_build/html/chapter3.html | 1750 +++--- doc/LectureNotes/_build/html/genindex.html | 4 +- doc/LectureNotes/_build/html/intro.html | 4 +- doc/LectureNotes/_build/html/objects.inv | Bin 742 -> 743 bytes .../_build/html/reports/chapter2.log | 91 +- doc/LectureNotes/_build/html/search.html | 4 +- doc/LectureNotes/_build/html/searchindex.js | 2 +- .../_build/jupyter_execute/chapter2.ipynb | 5141 +++++++++++++---- .../_build/jupyter_execute/chapter2.py | 2984 +++++++--- .../_build/jupyter_execute/chapter3.ipynb | 2361 ++++---- .../_build/jupyter_execute/chapter3.py | 1511 +++-- .../_build/jupyter_execute/chapter3_25_2.png | Bin 0 -> 5116 bytes doc/LectureNotes/chapter2.ipynb | 4954 ++++++++++++---- doc/LectureNotes/chapter3.ipynb | 2020 ++++--- 23 files changed, 23336 insertions(+), 9877 deletions(-) create mode 100644 doc/LectureNotes/_build/html/_images/chapter3_25_2.png create mode 100644 doc/LectureNotes/_build/jupyter_execute/chapter3_25_2.png diff --git a/doc/BookChapters/chapter1.do.txt b/doc/BookChapters/chapter1.do.txt index 5c3670c10..029b8a4a0 100644 --- a/doc/BookChapters/chapter1.do.txt +++ b/doc/BookChapters/chapter1.do.txt @@ -1,7 +1,5 @@ ======= Linear Regression ======= -"Video of Lecture":"https://www.uio.no/studier/emner/matnat/fys/FYS-STK3155/h20/forelesningsvideoer/LectureAug21.mp4?vrtx=view-as-webpage" - ===== Introduction ===== @@ -9,7 +7,7 @@ -Our emphasis throughout this series of lectures (small change) +Our emphasis throughout this series of lectures is on understanding the mathematical aspects of different algorithms used in the fields of data analysis and machine learning. diff --git a/doc/BookChapters/chapter3.do.txt b/doc/BookChapters/chapter3.do.txt index 5c1b8e90a..0ebd9707c 100644 --- a/doc/BookChapters/chapter3.do.txt +++ b/doc/BookChapters/chapter3.do.txt @@ -1,28 +1,120 @@ ======= Ridge and Lasso Regression ======= -"Video of Lecture":"https://www.uio.no/studier/emner/matnat/fys/FYS-STK4155/h20/forelesningsvideoer/LectureSeptember10.mp4?vrtx=view-as-webpage" + + +===== Mathematical Interpretation of Ordinary Least Squares ===== + +What is presented here is a mathematical analysis of various regression algorithms (ordinary least squares, Ridge and Lasso Regression). The analysis is based on an important algorithm in linear algebra, the so-called Singular Value Decomposition (SVD). + + +We have shown that in ordinary least squares the optimal parameters $\beta$ are given by + +!bt +\[ +\hat{\bm{\beta}} = \left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\bm{y}. +\] +!et + +The _hat_ over $\bm{\beta}$ means we have the optimal parameters after minimization of the cost function. + +This means that our best model is defined as + +!bt +\[ +\tilde{\bm{y}}=\bm{X}\hat{\bm{\beta}} = \bm{X}\left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\bm{y}. +\] +!et + +We now define a matrix +!bt +\[ +\bm{A}=\bm{X}\left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T. +\] +!et + +We can rewrite +!bt +\[ +\tilde{\bm{y}}=\bm{X}\hat{\bm{\beta}} = \bm{A}\bm{y}. +\] +!et + +The matrix $\bm{A}$ has the important property that $\bm{A}^2=\bm{A}$. This is the definition of a projection matrix. +We can then interpret our optimal model $\tilde{\bm{y}}$ as being represented by an orthogonal projection of $\bm{y}$ onto a space defined by the column vectors of $\bm{X}$. In our case here the matrix $\bm{A}$ is a square matrix. If it is a general rectangular matrix we have an oblique projection matrix. + + + + +We have defined the residual error as +!bt +\[ +\bm{\epsilon}=\bm{y}-\tilde{\bm{y}}=\left[\bm{I}-\bm{X}\left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\right]\bm{y}. +\] +!et + +The residual errors are then the projections of $\bm{y}$ onto the orthogonal component of the space defined by the column vectors of $\bm{X}$. + + +If the matrix $\bm{X}$ is an orthogonal (or unitary in case of complex values) matrix, we have + +!bt +\[ +\bm{X}^T\bm{X}=\bm{X}\bm{X}^T = \bm{I}. +\] +!et + +In this case the matrix $\bm{A}$ becomes +!bt +\[ +\bm{A}=\bm{X}\left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T)=\bm{I}, +\] +!et +and we have the obvious case +!bt +\[ +\bm{\epsilon}=\bm{y}-\tilde{\bm{y}}=0. +\] +!et + +This serves also as a useful test of our codes. + + ===== The singular value decomposition ===== + The examples we have looked at so far are cases where we normally can -invert the matrix $\bm{X}^T\bm{X}$. Using a polynomial expansion as we -did both for the masses and the fitting of the equation of state, -leads to row vectors of the design matrix which are essentially -orthogonal due to the polynomial character of our model. Obtaining the inverse of the design matrix is then often done via a so-called LU, QR or Cholesky decomposition. +invert the matrix $\bm{X}^T\bm{X}$. Using a polynomial expansion where we fit of various functions leads to +row vectors of the design matrix which are essentially orthogonal due +to the polynomial character of our model. Obtaining the inverse of the +design matrix is then often done via a so-called LU, QR or Cholesky +decomposition. - -This may +As we will also see in the first project, +this may however not the be case in general and a standard matrix inversion algorithm based on say LU, QR or Cholesky decomposition may lead to singularities. We will see examples of this below. -There is however a way to partially circumvent this problem and also gain some insights about the ordinary least squares approach, and later shrinkage methods like Ridge and Lasso regressions. +There is however a way to circumvent this problem and also +gain some insights about the ordinary least squares approach, and +later shrinkage methods like Ridge and Lasso regressions. + +This is given by the _Singular Value Decomposition_ (SVD) algorithm, +perhaps the most powerful linear algebra algorithm. The SVD provides +a numerically stable matrix decomposition that is used in a large +swath oc applications and the decomposition is always stable +numerically. + +In machine learning it plays a central role in dealing with for +example design matrices that may be near singular or singular. +Furthermore, as we will see here, the singular values can be related +to the covariance matrix (and thereby the correlation matrix) and in +turn the variance of a given quantity. It plays also an important role +in the principal component analysis where high-dimensional data can be +reduced to the statistically relevant features. -This is given by the _Singular Value Decomposition_ algorithm, perhaps -the most powerful linear algebra algorithm. Let us look at a -different example where we may have problems with the standard matrix -inversion algorithm. Thereafter we dive into the math of the SVD. @@ -69,6 +161,7 @@ We see easily that $\mbox{det}(\bm{X}) = x_{11} x_{22} - x_{12} x_{21} = 1 \tim This is equivalent to saying that the matrix $\bm{X}$ has at least an eigenvalue which is zero. + If our design matrix $\bm{X}$ which enters the linear regression problem !bt \begin{align} @@ -92,6 +185,8 @@ where $\bm{I}$ is the identity matrix. When we discuss _Ridge_ regression this +===== Basic math of the SVD ===== + From standard linear algebra we know that a square matrix $\bm{X}$ can be diagonalized if and only it is a so-called "normal matrix":"https://en.wikipedia.org/wiki/Normal_matrix", that is if $\bm{X}\in {\mathbb{R}}^{n\times n}$ @@ -130,7 +225,6 @@ $\bm{X}\bm{X}^T=\bm{X}^T\bm{X}$ is not fulfilled. -===== The SVD, a Fantastic Algorithm ===== However, and this is the strength of the SVD algorithm, any general @@ -178,7 +272,6 @@ near singular or singular matrices. The columns of $\bm{U}$ are called the left singular vectors while the columns of $\bm{V}$ are the right singular vectors. -===== Economy-size SVD ===== If we assume that $n > p$, then our matrix $\bm{U}$ has dimension $n \times n$. The last $n-p$ columns of $\bm{U}$ become however @@ -197,41 +290,39 @@ If $p > n$, then only the first $n$ columns of $\bm{V}$ are computed and $\bm{\S The $n=p$ case is obvious, we retain the full SVD. In general the economy-size SVD leads to less FLOPS and still conserving the desired accuracy. +!split +===== Codes for the SVD ===== !bc pycod import numpy as np # SVD inversion -def SVDinv(A): +def SVD(A): ''' Takes as input a numpy matrix A and returns inv(A) based on singular value decomposition (SVD). SVD is numerically more stable than the inversion algorithms provided by numpy and scipy.linalg at the cost of being slower. ''' - U, s, VT = np.linalg.svd(A) -# print('test U') -# print( (np.transpose(U) @ U - U @np.transpose(U))) -# print('test VT') -# print( (np.transpose(VT) @ VT - VT @np.transpose(VT))) + U, S, VT = np.linalg.svd(A,full_matrices=True) + print('test U') + print( (np.transpose(U) @ U - U @np.transpose(U))) + print('test VT') + print( (np.transpose(VT) @ VT - VT @np.transpose(VT))) print(U) - print(s) + print(S) print(VT) D = np.zeros((len(U),len(VT))) for i in range(0,len(VT)): - D[i,i]=s[i] - UT = np.transpose(U); V = np.transpose(VT); invD = np.linalg.inv(D) - return np.matmul(V,np.matmul(invD,UT)) + D[i,i]=S[i] + return U @ D @ VT -X = np.array([ [1.0, -1.0, 2.0], [1.0, 0.0, 1.0], [1.0, 2.0, -1.0], [1.0, 1.0, 0.0] ]) +X = np.array([ [1.0,-1.0], [1.0,-1.0]]) +#X = np.array([[1, 2], [3, 4], [5, 6]]) + print(X) -A = np.transpose(X) @ X -print(A) -# Brute force inversion of super-collinear matrix -#B = np.linalg.inv(A) -#print(B) -C = SVDinv(A) -print(C) - +C = SVD(X) +# Print the difference between the original matrix and the SVD one +print(C-X) !ec The matrix $\bm{X}$ has columns that are linearly dependent. The first @@ -245,76 +336,720 @@ in the program terminating due to a singular matrix. +The $U$, $S$, and $V$ matrices returned from the _svd()_ function +cannot be multiplied directly. -There are several interesting mathematical properties which will be -relevant when we are going to discuss the differences between say -ordinary least squares (OLS) and _Ridge_ regression. +As you can see from the code, the $S$ vector must be converted into a +diagonal matrix. This may cause a problem as the size of the matrices +do not fit the rules of matrix multiplication, where the number of +columns in a matrix must match the number of rows in the subsequent +matrix. -We have from OLS that the parameters of the linear approximation are given by +If you wish to include the zero singular values, you will need to +resize the matrices and set up a diagonal matrix as done in the above +example + + + + + +===== Mathematics of the SVD and implications ===== + +Let us take a closer look at the mathematics of the SVD and the various implications for machine learning studies. + +Our starting point is our design matrix $\bm{X}$ of dimension $n\times p$ !bt \[ -\bm{\tilde{y}} = \bm{X}\bm{\beta} = \bm{X}\left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\bm{y}. +\bm{X}=\begin{bmatrix} +x_{0,0} & x_{0,1} & x_{0,2}& \dots & \dots x_{0,p-1}\\ +x_{1,0} & x_{1,1} & x_{1,2}& \dots & \dots x_{1,p-1}\\ +x_{2,0} & x_{2,1} & x_{2,2}& \dots & \dots x_{2,p-1}\\ +\dots & \dots & \dots & \dots \dots & \dots \\ +x_{n-2,0} & x_{n-2,1} & x_{n-2,2}& \dots & \dots x_{n-2,p-1}\\ +x_{n-1,0} & x_{n-1,1} & x_{n-1,2}& \dots & \dots x_{n-1,p-1}\\ +\end{bmatrix}. \] !et -The matrix to invert can be rewritten in terms of our SVD decomposition as +We can SVD decompose our matrix as +!bt +\[ +\bm{X}=\bm{U}\bm{\Sigma}\bm{V}^T, +\] +!et +where $\bm{U}$ is an orthogonal matrix of dimension $n\times n$, meaning that $\bm{U}\bm{U}^T=\bm{U}^T\bm{U}=\bm{I}_n$. Here $\bm{I}_n$ is the unit matrix of dimension $n \times n$. + +Similarly, $\bm{V}$ is an orthogonal matrix of dimension $p\times p$, meaning that $\bm{V}\bm{V}^T=\bm{V}^T\bm{V}=\bm{I}_p$. Here $\bm{I}_n$ is the unit matrix of dimension $p \times p$. + +Finally $\bm{\Sigma}$ contains the singular values $\sigma_i$. This matrix has dimension $n\times p$ and the singular values $\sigma_i$ are all positive. The non-zero values are ordered in descending order, that is !bt \[ -\bm{X}^T\bm{X} = \bm{V}\bm{\Sigma}^T\bm{U}^T\bm{U}\bm{\Sigma}\bm{V}^T. +\sigma_0 > \sigma_1 > \sigma_2 > \dots > \sigma_{p-1} > 0. \] !et -Using the orthogonality properties of $\bm{U}$ we have + +All values beyond $p-1$ are all zero. + + +As an example, consider the following $3\times 2$ example for the matrix $\bm{\Sigma}$ !bt \[ -\bm{X}^T\bm{X} = \bm{V}\bm{\Sigma}^T\bm{\Sigma}\bm{V}^T = \bm{V}\bm{D}\bm{V}^T, +\bm{\Sigma}= +\begin{bmatrix} +2& 0 \\ +0 & 1 \\ +0 & 0 \\ +\end{bmatrix} \] !et -with $\bm{D}$ being a diagonal matrix with values along the diagonal given by the singular values squared. -This means that +The singular values are $\sigma_0=2$ and $\sigma_1=1$. It is common to rewrite the matrix $\bm{\Sigma}$ as + !bt \[ -(\bm{X}^T\bm{X})\bm{V} = \bm{V}\bm{D}, +\bm{\Sigma}= +\begin{bmatrix} +\bm{\tilde{\Sigma}}\\ +\bm{0}\\ +\end{bmatrix}, \] !et -that is the eigenvectors of $(\bm{X}^T\bm{X})$ are given by the columns of the right singular matrix of $\bm{X}$ and the eigenvalues are the squared singular values. It is easy to show (show this) that + +where !bt \[ -(\bm{X}\bm{X}^T)\bm{U} = \bm{U}\bm{D}, +\bm{\tilde{\Sigma}}= +\begin{bmatrix} +2& 0 \\ +0 & 1 \\ +\end{bmatrix}, \] !et -that is, the eigenvectors of $(\bm{X}\bm{X})^T$ are the columns of the left singular matrix and the eigenvalues are the same. +contains only the singular values. Note also (and we will use this below) that -Going back to our OLS equation we have !bt \[ -\bm{X}\bm{\beta} = \bm{X}\left(\bm{V}\bm{D}\bm{V}^T \right)^{-1}\bm{X}^T\bm{y}=\bm{U\Sigma V^T}\left(\bm{V}\bm{D}\bm{V}^T \right)^{-1}(\bm{U\Sigma V^T})^T\bm{y}=\bm{U}\bm{U}^T\bm{y}. +\bm{\Sigma}^T\bm{\Sigma}= +\begin{bmatrix} +4& 0 \\ +0 & 1 \\ +\end{bmatrix}, +\] +!et +which is a $2\times 2 $ matrix while +!bt +\[ +\bm{\Sigma}\bm{\Sigma}^T= +\begin{bmatrix} +4& 0 & 0\\ +0 & 1 & 0\\ +0 & 0 & 0\\ +\end{bmatrix}, \] !et -We will come back to this expression when we discuss Ridge regression. - -$$ \tilde{y}^{OLS}=\bm{X}\hat{\beta}^{OLS}=\sum_{j=1}^p \bm{u}_j\bm{u}_j^T\bm{y}$$ and for Ridge we have  - -$$ \tilde{y}^{Ridge}=\bm{X}\hat{\beta}^{Ridge}=\sum_{j=1}^p \bm{u}_j\frac{\sigma_j^2}{\sigma_j^2+\lambda}\bm{u}_j^T\bm{y}$$ .  - -It is indeed the economy-sized SVD, note the summation runs up tp $$p$$ only and not $$n$$.  - -Here we have that $$\bm{X} = \bm{U}\bm{\Sigma}\bm{V}^T$$, with $$\Sigma$$ being an $$ n\times p$$ matrix and $$\bm{V}$$ being a $$ p\times p$$ matrix. We also have assumed here that $$ n > p$$.  +is a $3\times 3 $ matrix. The last row and column of this last matrix +contain only zeros. This will have important consequences for our SVD +decomposition of the design matrix. +The matrix that may cause problems for us is $\bm{X}^T\bm{X}$. Using the SVD we can rewrite this matrix as + +!bt +\[ +\bm{X}^T\bm{X}=\bm{V}\bm{\Sigma}^T\bm{U}^T\bm{U}\bm{\Sigma}\bm{V}^T, +\] +!et +and using the orthogonality of the matrix $\bm{U}$ we have + +!bt +\[ +\bm{X}^T\bm{X}=\bm{V}\bm{\Sigma}^T\bm{\Sigma}\bm{V}^T. +\] +!et +We define $\bm{\Sigma}^T\bm{\Sigma}=\tilde{\bm{\Sigma}}^2$ which is a diagonal matrix containing only the singular values squared. It has dimensionality $p \times p$. + +This means, using the orthogonality of $\bm{V}$, that we get + +!bt +\[ +\bm{X}^T\bm{X}=\tilde{\bm{\Sigma}}^2. +\] +!et + +We can now insert the result for the matrix $\bm{X}^T\bm{X}$ into our equation for ordinary least squares where + +!bt +\[ +\tilde{y}_{\mathrm{OLS}}=\bm{X}\left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\bm{y}, +\] +!et +and using our SVD decomposition of $\bm{X}$ we have + +!bt +\[ +\tilde{y}_{\mathrm{OLS}}=\bm{U}\bm{\Sigma}\bm{V}^T\tilde{\bm{\Sigma}}^{-2}\bm{V}\bm{\Sigma}^T\bm{U}^T\bm{y}, +\] +!et +which gives us, using the orthogonality of the matrices $\bm{U}$ and $\bm{V}$, + +!bt +\[ +\tilde{y}_{\mathrm{OLS}}=\bm{U}\bm{U}^T\bm{y}=\sum_{i=0}^{p-1}\bm{u}_i\bm{u}^T_j\bm{y}, +\] +!et + +Note here that when we perform the multiplication of the various matrices, the orthogonal vectors of the matrix $\bm{U}$ +!bt +\[ +\bm{U}=[\bm{u}_0,\bm{u}_1,\dots,\bm{u}_{n-1}], +\] +!et +that belong to $i>p-1$, result in only zeros when we perform the multiplications. This means that the sum above has non-zero elements only up to $i=p-1$. This corresponds also to the number of singular values (these are all non-zero). + +It means that the ordinary least square model (with the optimal parameters) $\bm{\tilde{y}}$, corresponds to an orthogonal transformation of the output (or target) vector $\bm{y}$ by the vectors of the matrix $\bm{U}$. +===== Further properties (important for our analyses later) ===== + +Let us study again $\bm{X}^T\bm{X}$ in terms of our SVD, +!bt +\[ +\bm{X}^T\bm{X}=\bm{V}\bm{\Sigma}^T\bm{U}^T\bm{U}\bm{\Sigma}\bm{V}^T=\bm{V}\bm{\Sigma}^T\bm{\Sigma}\bm{V}^T. +\] +!et + +If we now multiply from the right with $\bm{V}$ (using the orthogonality of $\bm{V}$) we get +!bt +\[ +\left(\bm{X}^T\bm{X}\right)\bm{V}=\bm{V}\bm{\Sigma}^T\bm{\Sigma}. +\] +!et +This means the vectors $\bm{v}_i$ of the orthogonal matrix $\bm{V}$ are the eigenvectors of the matrix $\bm{X}^T\bm{X}$ +with eigenvalues given by the singular values squared, that is +!bt +\[ +\left(\bm{X}^T\bm{X}\right)\bm{v}_i=\bm{v}_i\sigma_i^2. +\] +!et + +Similarly, if we use the SVD decomposition for the matrix $\bm{X}\bm{X}^T$, we have +!bt +\[ +\bm{X}\bm{X}^T=\bm{U}\bm{\Sigma}\bm{V}^T\bm{V}\bm{\Sigma}^T\bm{U}^T=\bm{U}\bm{\Sigma}\bm{\Sigma}^T\bm{U}^T. +\] +!et + +If we now multiply from the right with $\bm{U}$ (using the orthogonality of $\bm{U}$) we get +!bt +\[ +\left(\bm{X}\bm{X}^T\right)\bm{U}=\bm{U}\bm{\Sigma}\bm{\Sigma}^T. +\] +!et +This means the vectors $\bm{u}_i$ of the orthogonal matrix $\bm{U}$ are the eigenvectors of the matrix $\bm{X}\bm{X}^T$ +with eigenvalues given by the singular values squared, that is +!bt +\[ +\left(\bm{X}\bm{X}^T\right)\bm{u}_i=\bm{u}_i\sigma_i^2. +\] +!et + +_Important note_: we have defined our design matrix $\bm{X}$ to be an +$n\times p$ matrix. In most supervised learning cases we have that $n +\ge p$, and quite often we have $n >> p$. For linear algebra based methods like ordinary least squares or Ridge regression, this leads to a matrix $\bm{X}^T\bm{X}$ which is small and thereby easier to handle from a computational point of view (in terms of number of floating point operations). + +In our lectures, the number of columns will +always refer to the number of features in our data set, while the +number of rows represents the number of data inputs. Note that in +other texts you may find the opposite notation. This has consequences +for the definition of for example the covariance matrix and its relation to the SVD. + + +===== Meet the Covariance Matrix ===== + + +Before we move on to a discussion of Ridge and Lasso regression, we want to show an important example of the above. + +We have already noted that the matrix $\bm{X}^T\bm{X}$ in ordinary +least squares is proportional to the second derivative of the cost +function, that is we have + +!bt +\[ +\frac{\partial^2 C(\bm{\beta})}{\partial \bm{\beta}^T\partial \bm{\beta}} =\frac{2}{n}\bm{X}^T\bm{X}. +\] +!et +This quantity defines was what is called the Hessian matrix (the second derivative of a function we want to optimize). + +The Hessian matrix plays an important role and is defined in this course as + +!bt +\[ +\bm{H}=\bm{X}^T\bm{X}. +\] +!et + + +The Hessian matrix for ordinary least squares is also proportional to +the covariance matrix. This means also that we can use the SVD to find +the eigenvalues of the covariance matrix and the Hessian matrix in +terms of the singular values. Let us develop these arguments, as they will play an important role in our machine learning studies. + + + +Before we discuss the link between for example Ridge regression and the singular value decomposition, we need to remind ourselves about +the definition of the covariance and the correlation function. These are quantities that play a central role in machine learning methods. + +Suppose we have defined two vectors +$\hat{x}$ and $\hat{y}$ with $n$ elements each. The covariance matrix $\bm{C}$ is defined as +!bt +\[ +\bm{C}[\bm{x},\bm{y}] = \begin{bmatrix} \mathrm{cov}[\bm{x},\bm{x}] & \mathrm{cov}[\bm{x},\bm{y}] \\ + \mathrm{cov}[\bm{y},\bm{x}] & \mathrm{cov}[\bm{y},\bm{y}] \\ + \end{bmatrix}, +\] +!et +where for example +!bt +\[ +\mathrm{cov}[\bm{x},\bm{y}] =\frac{1}{n} \sum_{i=0}^{n-1}(x_i- \overline{x})(y_i- \overline{y}). +\] +!et +With this definition and recalling that the variance is defined as +!bt +\[ +\mathrm{var}[\bm{x}]=\frac{1}{n} \sum_{i=0}^{n-1}(x_i- \overline{x})^2, +\] +!et +we can rewrite the covariance matrix as +!bt +\[ +\bm{C}[\bm{x},\bm{y}] = \begin{bmatrix} \mathrm{var}[\bm{x}] & \mathrm{cov}[\bm{x},\bm{y}] \\ + \mathrm{cov}[\bm{x},\bm{y}] & \mathrm{var}[\bm{y}] \\ + \end{bmatrix}. +\] +!et + +_Note:_ we have used $1/n$ in the above definitions of the *sample* variance and covariance. We assume then that we can calculate the exact mean value. +What you will find in essentially all statistics texts are equations +with a factor $1/(n-1)$. This is called "Bessel's correction":"https://mathworld.wolfram.com/BesselsCorrection.html". This +method corrects the bias in the estimation of the population variance +and covariance. It also partially corrects the bias in the estimation +of the population standard deviation. If you use a library like +_Scikit-Learn_ or _nunmpy's_ function calculate the covariance, this +quantity will be computed with a factor $1/(n-1)$. + + +The covariance takes values between zero and infinity and may thus +lead to problems with loss of numerical precision for particularly +large values. It is common to scale the covariance matrix by +introducing instead the correlation matrix defined via the so-called +correlation function + +!bt +\[ +\mathrm{corr}[\bm{x},\bm{y}]=\frac{\mathrm{cov}[\bm{x},\bm{y}]}{\sqrt{\mathrm{var}[\bm{x}] \mathrm{var}[\bm{y}]}}. +\] +!et + +The correlation function is then given by values $\mathrm{corr}[\bm{x},\bm{y}] +\in [-1,1]$. This avoids eventual problems with too large values. We +can then define the correlation matrix for the two vectors $\bm{x}$ +and $\bm{y}$ as + +!bt +\[ +\bm{K}[\bm{x},\bm{y}] = \begin{bmatrix} 1 & \mathrm{corr}[\bm{x},\bm{y}] \\ + \mathrm{corr}[\bm{y},\bm{x}] & 1 \\ + \end{bmatrix}, +\] +!et + +In the above example this is the function we constructed using _pandas_. + + + +In our derivation of the various regression algorithms like _Ordinary Least Squares_ or _Ridge regression_ +we defined the design/feature matrix $\bm{X}$ as + +!bt +\[ +\bm{X}=\begin{bmatrix} +x_{0,0} & x_{0,1} & x_{0,2}& \dots & \dots x_{0,p-1}\\ +x_{1,0} & x_{1,1} & x_{1,2}& \dots & \dots x_{1,p-1}\\ +x_{2,0} & x_{2,1} & x_{2,2}& \dots & \dots x_{2,p-1}\\ +\dots & \dots & \dots & \dots \dots & \dots \\ +x_{n-2,0} & x_{n-2,1} & x_{n-2,2}& \dots & \dots x_{n-2,p-1}\\ +x_{n-1,0} & x_{n-1,1} & x_{n-1,2}& \dots & \dots x_{n-1,p-1}\\ +\end{bmatrix}, +\] +!et +with $\bm{X}\in {\mathbb{R}}^{n\times p}$, with the predictors/features $p$ refering to the column numbers and the +entries $n$ being the row elements. +We can rewrite the design/feature matrix in terms of its column vectors as +!bt +\[ +\bm{X}=\begin{bmatrix} \bm{x}_0 & \bm{x}_1 & \bm{x}_2 & \dots & \dots & \bm{x}_{p-1}\end{bmatrix}, +\] +!et +with a given vector +!bt +\[ +\bm{x}_i^T = \begin{bmatrix}x_{0,i} & x_{1,i} & x_{2,i}& \dots & \dots x_{n-1,i}\end{bmatrix}. +\] +!et + +With these definitions, we can now rewrite our $2\times 2$ +correlation/covariance matrix in terms of a moe general design/feature +matrix $\bm{X}\in {\mathbb{R}}^{n\times p}$. This leads to a $p\times p$ +covariance matrix for the vectors $\bm{x}_i$ with $i=0,1,\dots,p-1$ + +!bt +\[ +\bm{C}[\bm{x}] = \begin{bmatrix} +\mathrm{var}[\bm{x}_0] & \mathrm{cov}[\bm{x}_0,\bm{x}_1] & \mathrm{cov}[\bm{x}_0,\bm{x}_2] & \dots & \dots & \mathrm{cov}[\bm{x}_0,\bm{x}_{p-1}]\\ +\mathrm{cov}[\bm{x}_1,\bm{x}_0] & \mathrm{var}[\bm{x}_1] & \mathrm{cov}[\bm{x}_1,\bm{x}_2] & \dots & \dots & \mathrm{cov}[\bm{x}_1,\bm{x}_{p-1}]\\ +\mathrm{cov}[\bm{x}_2,\bm{x}_0] & \mathrm{cov}[\bm{x}_2,\bm{x}_1] & \mathrm{var}[\bm{x}_2] & \dots & \dots & \mathrm{cov}[\bm{x}_2,\bm{x}_{p-1}]\\ +\dots & \dots & \dots & \dots & \dots & \dots \\ +\dots & \dots & \dots & \dots & \dots & \dots \\ +\mathrm{cov}[\bm{x}_{p-1},\bm{x}_0] & \mathrm{cov}[\bm{x}_{p-1},\bm{x}_1] & \mathrm{cov}[\bm{x}_{p-1},\bm{x}_{2}] & \dots & \dots & \mathrm{var}[\bm{x}_{p-1}]\\ +\end{bmatrix}, +\] +!et +and the correlation matrix +!bt +\[ +\bm{K}[\bm{x}] = \begin{bmatrix} +1 & \mathrm{corr}[\bm{x}_0,\bm{x}_1] & \mathrm{corr}[\bm{x}_0,\bm{x}_2] & \dots & \dots & \mathrm{corr}[\bm{x}_0,\bm{x}_{p-1}]\\ +\mathrm{corr}[\bm{x}_1,\bm{x}_0] & 1 & \mathrm{corr}[\bm{x}_1,\bm{x}_2] & \dots & \dots & \mathrm{corr}[\bm{x}_1,\bm{x}_{p-1}]\\ +\mathrm{corr}[\bm{x}_2,\bm{x}_0] & \mathrm{corr}[\bm{x}_2,\bm{x}_1] & 1 & \dots & \dots & \mathrm{corr}[\bm{x}_2,\bm{x}_{p-1}]\\ +\dots & \dots & \dots & \dots & \dots & \dots \\ +\dots & \dots & \dots & \dots & \dots & \dots \\ +\mathrm{corr}[\bm{x}_{p-1},\bm{x}_0] & \mathrm{corr}[\bm{x}_{p-1},\bm{x}_1] & \mathrm{corr}[\bm{x}_{p-1},\bm{x}_{2}] & \dots & \dots & 1\\ +\end{bmatrix}, +\] +!et + + + +The Numpy function _np.cov_ calculates the covariance elements using +the factor $1/(n-1)$ instead of $1/n$ since it assumes we do not have +the exact mean values. The following simple function uses the +_np.vstack_ function which takes each vector of dimension $1\times n$ +and produces a $2\times n$ matrix $\bm{W}$ + +Note that this assumes you have the features as the rows, and the inputs as columns, that is +!bt +\[ +\bm{W} = \begin{bmatrix} x_0 & x_1 & x_2 & \dots & x_{n-2} & x_{n-1} \\ + y_0 & y_1 & y_2 & \dots & y_{n-2} & y_{n-1} \\ + \end{bmatrix}, +\] +!et + +which in turn is converted into into the $2\times 2$ covariance matrix +$\bm{C}$ via the Numpy function _np.cov()_. We note that we can also calculate +the mean value of each set of samples $\bm{x}$ etc using the Numpy +function _np.mean(x)_. We can also extract the eigenvalues of the +covariance matrix through the _np.linalg.eig()_ function. + +!bc pycod +# Importing various packages +import numpy as np +n = 100 +x = np.random.normal(size=n) +print(np.mean(x)) +y = 4+3*x+np.random.normal(size=n) +print(np.mean(y)) +W = np.vstack((x, y)) +C = np.cov(W) +print(C) +!ec + + + +The previous example can be converted into the correlation matrix by +simply scaling the matrix elements with the variances. We should also +subtract the mean values for each column. This leads to the following +code which sets up the correlations matrix for the previous example in +a more brute force way. Here we scale the mean values for each column of the design matrix, calculate the relevant mean values and variances and then finally set up the $2\times 2$ correlation matrix (since we have only two vectors). + +!bc pycod +import numpy as np +n = 100 +# define two vectors +x = np.random.random(size=n) +y = 4+3*x+np.random.normal(size=n) +#scaling the x and y vectors +x = x - np.mean(x) +y = y - np.mean(y) +variance_x = np.sum(x@x)/n +variance_y = np.sum(y@y)/n +print(variance_x) +print(variance_y) +cov_xy = np.sum(x@y)/n +cov_xx = np.sum(x@x)/n +cov_yy = np.sum(y@y)/n +C = np.zeros((2,2)) +C[0,0]= cov_xx/variance_x +C[1,1]= cov_yy/variance_y +C[0,1]= cov_xy/np.sqrt(variance_y*variance_x) +C[1,0]= C[0,1] +print(C) +!ec + +We see that the matrix elements along the diagonal are one as they +should be and that the matrix is symmetric. Furthermore, diagonalizing +this matrix we easily see that it is a positive definite matrix. + +The above procedure with _numpy_ can be made more compact if we use _pandas_. + + + +We whow here how we can set up the correlation matrix using _pandas_, as done in this simple code +!bc pycod +import numpy as np +import pandas as pd +n = 10 +x = np.random.normal(size=n) +x = x - np.mean(x) +y = 4+3*x+np.random.normal(size=n) +y = y - np.mean(y) +# Note that we transpose the matrix in order to stay with our ordering n x p +X = (np.vstack((x, y))).T +print(X) +Xpd = pd.DataFrame(X) +print(Xpd) +correlation_matrix = Xpd.corr() +print(correlation_matrix) +!ec + + +We expand this model to the Franke function discussed earlier. + + +!bc pycod +# Common imports +import numpy as np +import pandas as pd + + +def FrankeFunction(x,y): + term1 = 0.75*np.exp(-(0.25*(9*x-2)**2) - 0.25*((9*y-2)**2)) + term2 = 0.75*np.exp(-((9*x+1)**2)/49.0 - 0.1*(9*y+1)) + term3 = 0.5*np.exp(-(9*x-7)**2/4.0 - 0.25*((9*y-3)**2)) + term4 = -0.2*np.exp(-(9*x-4)**2 - (9*y-7)**2) + return term1 + term2 + term3 + term4 + + +def create_X(x, y, n ): + if len(x.shape) > 1: + x = np.ravel(x) + y = np.ravel(y) + + N = len(x) + l = int((n+1)*(n+2)/2) # Number of elements in beta + X = np.ones((N,l)) + + for i in range(1,n+1): + q = int((i)*(i+1)/2) + for k in range(i+1): + X[:,q+k] = (x**(i-k))*(y**k) + + return X + + +# Making meshgrid of datapoints and compute Franke's function +n = 4 +N = 100 +x = np.sort(np.random.uniform(0, 1, N)) +y = np.sort(np.random.uniform(0, 1, N)) +z = FrankeFunction(x, y) +X = create_X(x, y, n=n) + +Xpd = pd.DataFrame(X) +# subtract the mean values and set up the covariance matrix +Xpd = Xpd - Xpd.mean() +covariance_matrix = Xpd.cov() +print(covariance_matrix) +!ec + +We note here that the covariance is zero for the first rows and +columns since all matrix elements in the design matrix were set to one +(we are fitting the function in terms of a polynomial of degree $n$). + +This means that the variance for these elements will be zero and will +cause problems when we set up the correlation matrix. We can simply +drop these elements and construct a correlation +matrix without these elements. + + + +We can rewrite the covariance matrix in a more compact form in terms of the design/feature matrix $\bm{X}$ as +!bt +\[ +\bm{C}[\bm{x}] = \frac{1}{n}\bm{X}^T\bm{X}= \mathbb{E}[\bm{X}^T\bm{X}]. +\] +!et + +To see this let us simply look at a design matrix $\bm{X}\in {\mathbb{R}}^{2\times 2}$ +!bt +\[ +\bm{X}=\begin{bmatrix} +x_{00} & x_{01}\\ +x_{10} & x_{11}\\ +\end{bmatrix}=\begin{bmatrix} +\bm{x}_{0} & \bm{x}_{1}\\ +\end{bmatrix}. +\] +!et + +If we then compute the expectation value (note the $1/n$ factor instead of $1/(n-1)$) +!bt +\[ +\mathbb{E}[\bm{X}^T\bm{X}] = \frac{1}{n}\bm{X}^T\bm{X}=\frac{1}{n}\begin{bmatrix} +x_{00}^2+x_{10}^2 & x_{00}x_{01}+x_{10}x_{11}\\ +x_{01}x_{00}+x_{11}x_{10} & x_{01}^2+x_{11}^2\\ +\end{bmatrix}, +\] +!et +which is just +!bt +\[ +\bm{C}[\bm{x}_0,\bm{x}_1] = \bm{C}[\bm{x}]=\begin{bmatrix} \mathrm{var}[\bm{x}_0] & \mathrm{cov}[\bm{x}_0,\bm{x}_1] \\ + \mathrm{cov}[\bm{x}_1,\bm{x}_0] & \mathrm{var}[\bm{x}_1] \\ + \end{bmatrix}, +\] +!et +where we wrote $$\bm{C}[\bm{x}_0,\bm{x}_1] = \bm{C}[\bm{x}]$$ to indicate that this is the covariance of the vectors $\bm{x}$ of the design/feature matrix $\bm{X}$. + +It is easy to generalize this to a matrix $\bm{X}\in {\mathbb{R}}^{n\times p}$. + + + +===== Linking with the SVD ===== + +We saw earlier that +!bt +\[ +\bm{X}^T\bm{X}=\bm{V}\bm{\Sigma}^T\bm{U}^T\bm{U}\bm{\Sigma}\bm{V}^T=\bm{V}\bm{\Sigma}^T\bm{\Sigma}\bm{V}^T. +\] +!et +Since the matrices here have dimension $p\times p$, with $p$ corresponding to the singular values, we defined earlier the matrix +!bt +\[ +\bm{\Sigma}^T\bm{\Sigma} = \begin{bmatrix} \tilde{\bm{\Sigma}} & \bm{0}\\ \end{bmatrix}\begin{bmatrix} \tilde{\bm{\Sigma}} \\ \bm{0}\\ \end{bmatrix}, +\] +!et +where the tilde-matrix $\tilde{\bm{\Sigma}}$ is a matrix of dimension $p\times p$ containing only the singular values $\sigma_i$, that is + +!bt +\[ +\tilde{\bm{\Sigma}}=\begin{bmatrix} \sigma_0 & 0 & 0 & \dots & 0 & 0 \\ + 0 & \sigma_1 & 0 & \dots & 0 & 0 \\ + 0 & 0 & \sigma_2 & \dots & 0 & 0 \\ + 0 & 0 & 0 & \dots & \sigma_{p-2} & 0 \\ + 0 & 0 & 0 & \dots & 0 & \sigma_{p-1} \\ +\end{bmatrix}, +\] +!et +meaning we can write +!bt +\[ +\bm{X}^T\bm{X}=\bm{V}\tilde{\bm{\Sigma}}^2\bm{V}^T. +\] +!et +Multiplying from the right with $\bm{V}$ (using the orthogonality of $\bm{V}$) we get +!bt +\[ +\left(\bm{X}^T\bm{X}\right)\bm{V}=\bm{V}\tilde{\bm{\Sigma}}^2. +\] +!et + + +This means the vectors $\bm{v}_i$ of the orthogonal matrix $\bm{V}$ +are the eigenvectors of the matrix $\bm{X}^T\bm{X}$ with eigenvalues +given by the singular values squared, that is + +!bt +\[ +\left(\bm{X}^T\bm{X}\right)\bm{v}_i=\bm{v}_i\sigma_i^2. +\] +!et + +In other words, each non-zero singular value of $\bm{X}$ is a positive +square root of an eigenvalue of $\bm{X}^T\bm{X}$. It means also that +the columns of $\bm{V}$ are the eigenvectors of +$\bm{X}^T\bm{X}$. Since we have ordered the singular values of +$\bm{X}$ in a descending order, it means that the column vectors +$\bm{v}_i$ are hierarchically ordered by how much correlation they +encode from the columns of $\bm{X}$. + + +Note that these are also the eigenvectors and eigenvalues of the +Hessian matrix. + +If we now recall the definition of the covariance matrix (not using +Bessel's correction) we have + + +!bt +\[ +\bm{C}[\bm{X}]=\frac{1}{n}\bm{X}^T\bm{X}, +\] +!et + +meaning that every squared non-singular value of $\bm{X}$ divided by $n$ ( +the number of samples) are the eigenvalues of the covariance +matrix. Every singular value of $\bm{X}$ is thus a positive square +root of an eigenvalue of $\bm{X}^T\bm{X}$. If the matrix $\bm{X}$ is +self-adjoint, the singular values of $\bm{X}$ are equal to the +absolute value of the eigenvalues of $\bm{X}$. + + +For $\bm{X}\bm{X}^T$ we found + +!bt +\[ +\bm{X}\bm{X}^T=\bm{U}\bm{\Sigma}\bm{V}^T\bm{V}\bm{\Sigma}^T\bm{U}^T=\bm{U}\bm{\Sigma}^T\bm{\Sigma}\bm{U}^T. +\] +!et +Since the matrices here have dimension $n\times n$, we have +!bt +\[ +\bm{\Sigma}\bm{\Sigma}^T = \begin{bmatrix} \tilde{\bm{\Sigma}} \\ \bm{0}\\ \end{bmatrix}\begin{bmatrix} \tilde{\bm{\Sigma}} \bm{0}\\ \end{bmatrix}=\begin{bmatrix} \tilde{\bm{\Sigma}} & \bm{0} \\ \bm{0} & \bm{0}\\ \end{bmatrix}, +\] +!et +leading to +!bt +\[ +\bm{X}\bm{X}^T=\bm{U}\begin{bmatrix} \tilde{\bm{\Sigma}} & \bm{0} \\ \bm{0} & \bm{0}\\ \end{bmatrix}\bm{U}^T. +\] +!et + +Multiplying with $\bm{U}$ from the right gives us the eigenvalue problem +!bt +\[ +(\bm{X}\bm{X}^T)\bm{U}=\bm{U}\begin{bmatrix} \tilde{\bm{\Sigma}} & \bm{0} \\ \bm{0} & \bm{0}\\ \end{bmatrix}. +\] +!et + +It means that the eigenvalues of $\bm{X}\bm{X}^T$ are again given by +the non-zero singular values plus now a series of zeros. The column +vectors of $\bm{U}$ are the eigenvectors of $\bm{X}\bm{X}^T$ and +measure how much correlations are contained in the rows of $\bm{X}$. + +Since we will mainly be interested in the correlations among the features +of our data (the columns of $\bm{X}$, the quantity of interest for us are the non-zero singular +values and the column vectors of $\bm{V}$. ===== Ridge and LASSO Regression ===== -"Video of Lecture":"https://www.uio.no/studier/emner/matnat/fys/FYS-STK4155/h20/forelesningsvideoer/LectureSeptember11.mp4?vrtx=view-as-webpage" - Let us remind ourselves about the expression for the standard Mean Squared Error (MSE) which we used to define our cost function and the equations for the ordinary least squares (OLS) method, that is our optimization problem is !bt @@ -376,21 +1111,21 @@ Here we have defined the norm-1 as -Using the matrix-vector expression for Ridge regression, +Using the matrix-vector expression for Ridge regression and dropping the parameter $1/n$ in front of the standard means squared error equation, we have !bt \[ -C(\bm{X},\bm{\beta})=\frac{1}{n}\left\{(\bm{y}-\bm{X}\bm{\beta})^T(\bm{y}-\bm{X}\bm{\beta})\right\}+\lambda\bm{\beta}^T\bm{\beta}, +C(\bm{X},\bm{\beta})=\left\{(\bm{y}-\bm{X}\bm{\beta})^T(\bm{y}-\bm{X}\bm{\beta})\right\}+\lambda\bm{\beta}^T\bm{\beta}, \] !et - -by taking the derivatives with respect to $\bm{\beta}$ we obtain then +and +taking the derivatives with respect to $\bm{\beta}$ we obtain then a slightly modified matrix inversion problem which for finite values of $\lambda$ does not suffer from singularity problems. We obtain - +the optimal parameters !bt \[ -\bm{\beta}^{\mathrm{Ridge}} = \left(\bm{X}^T\bm{X}+\lambda\bm{I}\right)^{-1}\bm{X}^T\bm{y}, +\hat{\bm{\beta}}_{\mathrm{Ridge}} = \left(\bm{X}^T\bm{X}+\lambda\bm{I}\right)^{-1}\bm{X}^T\bm{y}, \] !et @@ -404,22 +1139,26 @@ with $\bm{I}$ being a $p\times p$ identity matrix with the constraint that with $t$ a finite positive number. -We see that Ridge regression is nothing but the standard -OLS with a modified diagonal term added to $\bm{X}^T\bm{X}$. The -consequences, in particular for our discussion of the bias-variance tradeoff -are rather interesting. - -Furthermore, if we use the result above in terms of the SVD decomposition (our analysis was done for the OLS method), we had +When we compare this with the ordinary least squares result we have !bt \[ -(\bm{X}\bm{X}^T)\bm{U} = \bm{U}\bm{D}. +\hat{\bm{\beta}}_{\mathrm{OLS}} = \left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\bm{y}, \] !et +which can lead to singular matrices. However, with the SVD, we can always compute the inverse of the matrix $\bm{X}^T\bm{X}$. -We can analyse the OLS solutions in terms of the eigenvectors (the columns) of the right singular value matrix $\bm{U}$ as + +We see that Ridge regression is nothing but the standard OLS with a +modified diagonal term added to $\bm{X}^T\bm{X}$. The consequences, in +particular for our discussion of the bias-variance tradeoff are rather +interesting. We will see that for specific values of $\lambda$, we may +even reduce the variance of the optimal parameters $\bm{\beta}$. These topics and other related ones, will be discussed after the more linear algebra oriented analysis here. + +Using our insights about the SVD of the design matrix $\bm{X}$ +We have already analyzed the OLS solutions in terms of the eigenvectors (the columns) of the right singular value matrix $\bm{U}$ as !bt \[ -\bm{X}\bm{\beta} = \bm{X}\left(\bm{V}\bm{D}\bm{V}^T \right)^{-1}\bm{X}^T\bm{y}=\bm{U\Sigma V^T}\left(\bm{V}\bm{D}\bm{V}^T \right)^{-1}(\bm{U\Sigma V^T})^T\bm{y}=\bm{U}\bm{U}^T\bm{y} +\tilde{\bm{y}}_{\mathrm{OLS}}=\bm{X}\bm{\beta} =\bm{U}\bm{U}^T\bm{y}. \] !et @@ -428,11 +1167,11 @@ For Ridge regression this becomes !bt \[ -\bm{X}\bm{\beta}^{\mathrm{Ridge}} = \bm{U\Sigma V^T}\left(\bm{V}\bm{D}\bm{V}^T+\lambda\bm{I} \right)^{-1}(\bm{U\Sigma V^T})^T\bm{y}=\sum_{j=0}^{p-1}\bm{u}_j\bm{u}_j^T\frac{\sigma_j^2}{\sigma_j^2+\lambda}\bm{y}, +\tilde{\bm{y}}_{\mathrm{Ridge}}=\bm{X}\bm{\beta}_{\mathrm{Ridge}} = \bm{U\Sigma V^T}\left(\bm{V}\bm{\Sigma}^2\bm{V}^T+\lambda\bm{I} \right)^{-1}(\bm{U\Sigma V^T})^T\bm{y}=\sum_{j=0}^{p-1}\bm{u}_j\bm{u}_j^T\frac{\sigma_j^2}{\sigma_j^2+\lambda}\bm{y}, \] !et -with the vectors $\bm{u}_j$ being the columns of $\bm{U}$. +with the vectors $\bm{u}_j$ being the columns of $\bm{U}$ from the SVD of the matrix $\bm{X}$. Since $\lambda \geq 0$, it means that compared to OLS, we have @@ -449,9 +1188,7 @@ $\frac{\sigma_j^2}{\sigma_j^2+\lambda}$. Recall that the SVD has eigenvalues ordered in a descending way, that is $\sigma_i \geq \sigma_{i+1}$. -For small eigenvalues $\sigma_i$ it means that their contributions become less important, a fact which can be used to reduce the number of degrees of freedom. -Actually, calculating the variance of $\bm{X}\bm{v}_j$ shows that this quantity is equal to $\sigma_j^2/n$. -With a parameter $\lambda$ we can thus shrink the role of specific parameters. +For small eigenvalues $\sigma_i$ it means that their contributions become less important, a fact which can be used to reduce the number of degrees of freedom. More about this when we have covered the material on a statistical interpretation of various linear regression methods. @@ -488,361 +1225,1356 @@ For more discussions of Ridge and Lasso regression, "Wessel van Wieringen's":"ht Similarly, "Mehta et al's article":"https://arxiv.org/abs/1803.08823" is also recommended. - -===== A better understanding of regularization ===== - -The parameter $\lambda$ that we have introduced in the Ridge (and -Lasso as well) regression is often called a regularization parameter -or shrinkage parameter. It is common to call it a hyperparameter. What does it mean mathemtically? - -Here we will first look at how to analyze the difference between the -standard OLS equations and the Ridge expressions in terms of a linear -algebra analysis using the SVD algorithm. Thereafter, we will link -(see the material on the bias-variance tradeoff below) these -observation to the statisical analysis of the results. In particular -we consider how the variance of the parameters $\bm{\beta}$ is -affected by changing the parameter $\lambda$. - - -We have our design matrix - $\bm{X}\in {\mathbb{R}}^{n\times p}$. With the SVD we decompose it as - -!bt -\[ -\bm{X} = \bm{U\Sigma V^T}, -\] -!et - -with $\bm{U}\in {\mathbb{R}}^{n\times n}$, $\bm{\Sigma}\in {\mathbb{R}}^{n\times p}$ -and $\bm{V}\in {\mathbb{R}}^{p\times p}$. - -The matrices $\bm{U}$ and $\bm{V}$ are unitary/orthonormal matrices, that is in case the matrices are real we have $\bm{U}^T\bm{U}=\bm{U}\bm{U}^T=\bm{I}$ and $\bm{V}^T\bm{V}=\bm{V}\bm{V}^T=\bm{I}$. - - - -===== Introducing the Covariance and Correlation functions ===== - -Before we discuss the link between for example Ridge regression and the singular value decomposition, we need to remind ourselves about -the definition of the covariance and the correlation function. These are quantities - -Suppose we have defined two vectors -$\bm{x}$ and $\bm{y}$ with $n$ elements each. The covariance matrix $\bm{C}$ is defined as -!bt -\[ -\bm{C}[\bm{x},\bm{y}] = \begin{bmatrix} \mathrm{cov}[\bm{x},\bm{x}] & \mathrm{cov}[\bm{x},\bm{y}] \\ - \mathrm{cov}[\bm{y},\bm{x}] & \mathrm{cov}[\bm{y},\bm{y}] \\ - \end{bmatrix}, -\] -!et -where for example -!bt -\[ -\mathrm{cov}[\bm{x},\bm{y}] =\frac{1}{n} \sum_{i=0}^{n-1}(x_i- \overline{x})(y_i- \overline{y}). -\] -!et -With this definition and recalling that the variance is defined as -!bt -\[ -\mathrm{var}[\bm{x}]=\frac{1}{n} \sum_{i=0}^{n-1}(x_i- \overline{x})^2, -\] -!et -we can rewrite the covariance matrix as -!bt -\[ -\bm{C}[\bm{x},\bm{y}] = \begin{bmatrix} \mathrm{var}[\bm{x}] & \mathrm{cov}[\bm{x},\bm{y}] \\ - \mathrm{cov}[\bm{x},\bm{y}] & \mathrm{var}[\bm{y}] \\ - \end{bmatrix}. -\] -!et - -The covariance takes values between zero and infinity and may thus -lead to problems with loss of numerical precision for particularly -large values. It is common to scale the covariance matrix by -introducing instead the correlation matrix defined via the so-called -correlation function +Using the matrix-vector expression for Lasso regression and dropping the parameter $1/n$ in front of the standard means squared error equation, we have the following _cost_ function !bt \[ -\mathrm{corr}[\bm{x},\bm{y}]=\frac{\mathrm{cov}[\bm{x},\bm{y}]}{\sqrt{\mathrm{var}[\bm{x}] \mathrm{var}[\bm{y}]}}. +C(\bm{X},\bm{\beta})=\left\{(\bm{y}-\bm{X}\bm{\beta})^T(\bm{y}-\bm{X}\bm{\beta})\right\}+\lambda\vert\vert\bm{\beta}\vert\vert_1, \] !et -The correlation function is then given by values $\mathrm{corr}[\bm{x},\bm{y}] -\in [-1,1]$. This avoids eventual problems with too large values. We -can then define the correlation matrix for the two vectors $\bm{x}$ -and $\bm{y}$ as +Taking the derivative with respect to $\bm{\beta}$ and recalling that the derivative of the absolute value is (we drop the boldfaced vector symbol for simplicty) +!bt +\[ +\frac{d \vert \beta\vert}{d \bm{\beta}}=\mathrm{sgn}(\bm{\beta})=\left\{\begin{array}{cc} 1 & \beta > 0 \\ 0 & \beta =0\\-1 & \beta < 0, \end{array}\right. +\] +!et +we have that the derivative of the cost function is !bt \[ -\bm{K}[\bm{x},\bm{y}] = \begin{bmatrix} 1 & \mathrm{corr}[\bm{x},\bm{y}] \\ - \mathrm{corr}[\bm{y},\bm{x}] & 1 \\ - \end{bmatrix}, +\frac{\partial C(\bm{X},\bm{\beta})}{\partial \bm{\beta}}=-2\bm{X}^T(\bm{y}-\bm{X}\bm{\beta})+\lambda sgn(\bm{\beta})=0, \] !et - -In the above example this is the function we constructed using _pandas_. - - - -In our derivation of the various regression algorithms like _Ordinary Least Squares_ or _Ridge regression_ -we defined the design/feature matrix $\bm{X}$ as - +and reordering we have !bt \[ -\bm{X}=\begin{bmatrix} -x_{0,0} & x_{0,1} & x_{0,2}& \dots & \dots x_{0,p-1}\\ -x_{1,0} & x_{1,1} & x_{1,2}& \dots & \dots x_{1,p-1}\\ -x_{2,0} & x_{2,1} & x_{2,2}& \dots & \dots x_{2,p-1}\\ -\dots & \dots & \dots & \dots \dots & \dots \\ -x_{n-2,0} & x_{n-2,1} & x_{n-2,2}& \dots & \dots x_{n-2,p-1}\\ -x_{n-1,0} & x_{n-1,1} & x_{n-1,2}& \dots & \dots x_{n-1,p-1}\\ -\end{bmatrix}, -\] -!et -with $\bm{X}\in {\mathbb{R}}^{n\times p}$, with the predictors/features $p$ refering to the column numbers and the -entries $n$ being the row elements. -We can rewrite the design/feature matrix in terms of its column vectors as -!bt -\[ -\bm{X}=\begin{bmatrix} \bm{x}_0 & \bm{x}_1 & \bm{x}_2 & \dots & \dots & \bm{x}_{p-1}\end{bmatrix}, -\] -!et -with a given vector -!bt -\[ -\bm{x}_i^T = \begin{bmatrix}x_{0,i} & x_{1,i} & x_{2,i}& \dots & \dots x_{n-1,i}\end{bmatrix}. +\bm{X}^T\bm{X}\bm{\beta})+\lambda sgn(\bm{\beta})=2\bm{X}^T(\bm{y}. \] !et +This equation does not lead to a nice analytical equation as in either Ridge regression or ordinary least squares. This equation can however be solved by using standard convex optimization algorithms using for example the Python package "CVXOPT":"https://cvxopt.org/". We will discuss this later. -With these definitions, we can now rewrite our $2\times 2$ -correaltion/covariance matrix in terms of a moe general design/feature -matrix $\bm{X}\in {\mathbb{R}}^{n\times p}$. This leads to a $p\times p$ -covariance matrix for the vectors $\bm{x}_i$ with $i=0,1,\dots,p-1$ - -!bt -\[ -\bm{C}[\bm{x}] = \begin{bmatrix} -\mathrm{var}[\bm{x}_0] & \mathrm{cov}[\bm{x}_0,\bm{x}_1] & \mathrm{cov}[\bm{x}_0,\bm{x}_2] & \dots & \dots & \mathrm{cov}[\bm{x}_0,\bm{x}_{p-1}]\\ -\mathrm{cov}[\bm{x}_1,\bm{x}_0] & \mathrm{var}[\bm{x}_1] & \mathrm{cov}[\bm{x}_1,\bm{x}_2] & \dots & \dots & \mathrm{cov}[\bm{x}_1,\bm{x}_{p-1}]\\ -\mathrm{cov}[\bm{x}_2,\bm{x}_0] & \mathrm{cov}[\bm{x}_2,\bm{x}_1] & \mathrm{var}[\bm{x}_2] & \dots & \dots & \mathrm{cov}[\bm{x}_2,\bm{x}_{p-1}]\\ -\dots & \dots & \dots & \dots & \dots & \dots \\ -\dots & \dots & \dots & \dots & \dots & \dots \\ -\mathrm{cov}[\bm{x}_{p-1},\bm{x}_0] & \mathrm{cov}[\bm{x}_{p-1},\bm{x}_1] & \mathrm{cov}[\bm{x}_{p-1},\bm{x}_{2}] & \dots & \dots & \mathrm{var}[\bm{x}_{p-1}]\\ -\end{bmatrix}, -\] -!et -and the correlation matrix -!bt -\[ -\bm{K}[\bm{x}] = \begin{bmatrix} -1 & \mathrm{corr}[\bm{x}_0,\bm{x}_1] & \mathrm{corr}[\bm{x}_0,\bm{x}_2] & \dots & \dots & \mathrm{corr}[\bm{x}_0,\bm{x}_{p-1}]\\ -\mathrm{corr}[\bm{x}_1,\bm{x}_0] & 1 & \mathrm{corr}[\bm{x}_1,\bm{x}_2] & \dots & \dots & \mathrm{corr}[\bm{x}_1,\bm{x}_{p-1}]\\ -\mathrm{corr}[\bm{x}_2,\bm{x}_0] & \mathrm{corr}[\bm{x}_2,\bm{x}_1] & 1 & \dots & \dots & \mathrm{corr}[\bm{x}_2,\bm{x}_{p-1}]\\ -\dots & \dots & \dots & \dots & \dots & \dots \\ -\dots & \dots & \dots & \dots & \dots & \dots \\ -\mathrm{corr}[\bm{x}_{p-1},\bm{x}_0] & \mathrm{corr}[\bm{x}_{p-1},\bm{x}_1] & \mathrm{corr}[\bm{x}_{p-1},\bm{x}_{2}] & \dots & \dots & 1\\ -\end{bmatrix}, -\] -!et - - - -The Numpy function _np.cov_ calculates the covariance elements using -the factor $1/(n-1)$ instead of $1/n$ since it assumes we do not have -the exact mean values. The following simple function uses the -_np.vstack_ function which takes each vector of dimension $1\times n$ -and produces a $2\times n$ matrix $\bm{W}$ - - -!bt -\[ -\bm{W} = \begin{bmatrix} x_0 & y_0 \\ - x_1 & y_1 \\ - x_2 & y_2\\ - \dots & \dots \\ - x_{n-2} & y_{n-2}\\ - x_{n-1} & y_{n-1} & - \end{bmatrix}, -\] -!et - -which in turn is converted into into the $2\times 2$ covariance matrix -$\bm{C}$ via the Numpy function _np.cov()_. We note that we can also calculate -the mean value of each set of samples $\bm{x}$ etc using the Numpy -function _np.mean(x)_. We can also extract the eigenvalues of the -covariance matrix through the _np.linalg.eig()_ function. +===== Code for SVD and Inversion of Matrices ===== +How do we use the SVD to invert a matrix $\bm{X}^\bm{X}$ which is singular or near singular? +The simple answer is to use the linear algebra function for pseudoinvers, that is !bc pycod -# Importing various packages -import numpy as np -n = 100 -x = np.random.normal(size=n) -print(np.mean(x)) -y = 4+3*x+np.random.normal(size=n) -print(np.mean(y)) -W = np.vstack((x, y)) -C = np.cov(W) -print(C) +Ainv = np.linlag.pinv(A) !ec - -The previous example can be converted into the correlation matrix by -simply scaling the matrix elements with the variances. We should also -subtract the mean values for each column. This leads to the following -code which sets up the correlations matrix for the previous example in -a more brute force way. Here we scale the mean values for each column of the design matrix, calculate the relevant mean values and variances and then finally set up the $2\times 2$ correlation matrix (since we have only two vectors). +Let us first look at a matrix which does not causes problems and write our own function where we just use the SVD. !bc pycod import numpy as np -n = 100 -# define two vectors -x = np.random.random(size=n) -y = 4+3*x+np.random.normal(size=n) -#scaling the x and y vectors -x = x - np.mean(x) -y = y - np.mean(y) -variance_x = np.sum(x@x)/n -variance_y = np.sum(y@y)/n -print(variance_x) -print(variance_y) -cov_xy = np.sum(x@y)/n -cov_xx = np.sum(x@x)/n -cov_yy = np.sum(y@y)/n -C = np.zeros((2,2)) -C[0,0]= cov_xx/variance_x -C[1,1]= cov_yy/variance_y -C[0,1]= cov_xy/np.sqrt(variance_y*variance_x) -C[1,0]= C[0,1] -print(C) -!ec - -We see that the matrix elements along the diagonal are one as they -should be and that the matrix is symmetric. Furthermore, diagonalizing -this matrix we easily see that it is a positive definite matrix. - -The above procedure with _numpy_ can be made more compact if we use _pandas_. +# SVD inversion +def SVDinv(A): + ''' Takes as input a numpy matrix A and returns inv(A) based on singular value decomposition (SVD). + SVD is numerically more stable than the inversion algorithms provided by + numpy and scipy.linalg at the cost of being slower. + ''' + U, s, VT = np.linalg.svd(A) + print('test U') + print( (np.transpose(U) @ U - U @np.transpose(U))) + print('test VT') + print( (np.transpose(VT) @ VT - VT @np.transpose(VT))) -We whow here how we can set up the correlation matrix using _pandas_, as done in this simple code -!bc pycod -import numpy as np -import pandas as pd -n = 10 -x = np.random.normal(size=n) -x = x - np.mean(x) -y = 4+3*x+np.random.normal(size=n) -y = y - np.mean(y) -X = (np.vstack((x, y))).T + D = np.zeros((len(U),len(VT))) + D = np.diag(s) + UT = np.transpose(U); V = np.transpose(VT); invD = np.linalg.inv(D) + return np.matmul(V,np.matmul(invD,UT)) + + +#X = np.array([ [1.0, -1.0, 2.0], [1.0, 0.0, 1.0], [1.0, 2.0, -1.0], [1.0, 1.0, 0.0] ]) +# Non-singular square matrix +X = np.array( [ [1,2,3],[2,4,5],[3,5,6]]) print(X) -Xpd = pd.DataFrame(X) -print(Xpd) -correlation_matrix = Xpd.corr() -print(correlation_matrix) +A = np.transpose(X) @ X +# Brute force inversion +B = np.linalg.inv(A) # here we could use np.linalg.pinv(A) +C = SVDinv(A) +print(np.abs(B-C)) + !ec -We expand this model to the Franke function discussed above. +Although our matrix to invert $\bm{X}^T\bm{X}$ is a square matrix, our matrix may be singular. + +The pseudoinverse is the generalization of the matrix inverse for square matrices to +rectangular matrices where the number of rows and columns are not equal. + +It is also called the the Moore-Penrose Inverse after two independent discoverers of the method or the Generalized Inverse. +It is used for the calculation of the inverse for singular or near singular matrices and for rectangular matrices. + +Using the SVD we can obtain the pseudoinverse of a matrix $\bm{A}$ (labeled here as $\bm{A}_{\mathrm{PI}}$ +!bt +\[ +\bm{A}_{\mathrm{PI}}= \bm{V}\bm{D}_{\mathrm{PI}}\bm{U}^T, +\] +!et +where $\bm{D}_{\mathrm{PI}}$ can be calculated by creating a diagonal matrix from $\bm{Sigma}$ where we only keep the singular values (the non-zero values). The following code computes the pseudoinvers of the matrix based on the SVD. + + +!bc pycod +import numpy as np +# SVD inversion +def SVDinv(A): + U, s, VT = np.linalg.svd(A) + # reciprocals of singular values of s + d = 1.0 / s + # create m x n D matrix + D = np.zeros(A.shape) + # populate D with n x n diagonal matrix + D[:A.shape[1], :A.shape[1]] = np.diag(d) + UT = np.transpose(U) + V = np.transpose(VT) + return np.matmul(V,np.matmul(D.T,UT)) + + +A = np.array([ [0.3, 0.4], [0.5, 0.6], [0.7, 0.8],[0.9, 1.0]]) +print(A) +# Brute force inversion of super-collinear matrix +B = np.linalg.pinv(A) +print(B) +# Compare our own algorithm with pinv +C = SVDinv(A) +print(np.abs(C-B)) + +!ec +As you can see from this example, our own decomposition based on the SVD agrees the pseudoinverse algorithm provided by _Numpy_. + + + +===== Deriving the Ridge Regression Equations ===== + +Let us remind ourselves about the expression for the standard Mean Squared Error (MSE) which we used to define our cost function and the equations for the ordinary least squares (OLS) method, that is +our optimization problem is +!bt +\[ +{\displaystyle \min_{\bm{\beta}\in {\mathbb{R}}^{p}}}\frac{1}{n}\left\{\left(\bm{y}-\bm{X}\bm{\beta}\right)^T\left(\bm{y}-\bm{X}\bm{\beta}\right)\right\}. +\] +!et +or we can state it as +!bt +\[ +{\displaystyle \min_{\bm{\beta}\in +{\mathbb{R}}^{p}}}\frac{1}{n}\sum_{i=0}^{n-1}\left(y_i-\tilde{y}_i\right)^2=\frac{1}{n}\vert\vert \bm{y}-\bm{X}\bm{\beta}\vert\vert_2^2, +\] +!et +where we have used the definition of a norm-2 vector, that is +!bt +\[ +\vert\vert \bm{x}\vert\vert_2 = \sqrt{\sum_i x_i^2}. +\] +!et + + + +By minimizing the above equation with respect to the parameters +$\bm{\beta}$ we could then obtain an analytical expression for the +parameters $\bm{\beta}$. We can add a regularization parameter $\lambda$ by +defining a new cost function to be optimized, that is + +!bt +\[ +{\displaystyle \min_{\bm{\beta}\in +{\mathbb{R}}^{p}}}\frac{1}{n}\vert\vert \bm{y}-\bm{X}\bm{\beta}\vert\vert_2^2+\lambda\vert\vert \bm{\beta}\vert\vert_2^2 +\] +!et + +which leads to the Ridge regression minimization problem where we +require that $\vert\vert \bm{\beta}\vert\vert_2^2\le t$, where $t$ is +a finite number larger than zero. By defining + +!bt +\[ +C(\bm{X},\bm{\beta})=\frac{1}{n}\vert\vert \bm{y}-\bm{X}\bm{\beta}\vert\vert_2^2+\lambda\vert\vert \bm{\beta}\vert\vert_1, +\] +!et + +we have a new optimization equation +!bt +\[ +{\displaystyle \min_{\bm{\beta}\in +{\mathbb{R}}^{p}}}\frac{1}{n}\vert\vert \bm{y}-\bm{X}\bm{\beta}\vert\vert_2^2+\lambda\vert\vert \bm{\beta}\vert\vert_1 +\] +!et +which leads to Lasso regression. Lasso stands for least absolute shrinkage and selection operator. + +Here we have defined the norm-1 as +!bt +\[ +\vert\vert \bm{x}\vert\vert_1 = \sum_i \vert x_i\vert. +\] +!et + + + + + +Using the matrix-vector expression for Ridge regression and dropping the parameter $1/n$ in front of the standard means squared error equation, we have + +!bt +\[ +C(\bm{X},\bm{\beta})=\left\{(\bm{y}-\bm{X}\bm{\beta})^T(\bm{y}-\bm{X}\bm{\beta})\right\}+\lambda\bm{\beta}^T\bm{\beta}, +\] +!et +and +taking the derivatives with respect to $\bm{\beta}$ we obtain then +a slightly modified matrix inversion problem which for finite values +of $\lambda$ does not suffer from singularity problems. We obtain +the optimal parameters +!bt +\[ +\hat{\bm{\beta}}_{\mathrm{Ridge}} = \left(\bm{X}^T\bm{X}+\lambda\bm{I}\right)^{-1}\bm{X}^T\bm{y}, +\] +!et + +with $\bm{I}$ being a $p\times p$ identity matrix with the constraint that + +!bt +\[ +\sum_{i=0}^{p-1} \beta_i^2 \leq t, +\] +!et + +with $t$ a finite positive number. + +When we compare this with the ordinary least squares result we have +!bt +\[ +\hat{\bm{\beta}}_{\mathrm{OLS}} = \left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\bm{y}, +\] +!et +which can lead to singular matrices. However, with the SVD, we can always compute the inverse of the matrix $\bm{X}^T\bm{X}$. + + +We see that Ridge regression is nothing but the standard OLS with a +modified diagonal term added to $\bm{X}^T\bm{X}$. The consequences, in +particular for our discussion of the bias-variance tradeoff are rather +interesting. We will see that for specific values of $\lambda$, we may +even reduce the variance of the optimal parameters $\bm{\beta}$. These topics and other related ones, will be discussed after the more linear algebra oriented analysis here. + + + +Using our insights about the SVD of the design matrix $\bm{X}$ +We have already analyzed the OLS solutions in terms of the eigenvectors (the columns) of the right singular value matrix $\bm{U}$ as +!bt +\[ +\tilde{\bm{y}}_{\mathrm{OLS}}=\bm{X}\bm{\beta} =\bm{U}\bm{U}^T\bm{y}. +\] +!et + + +For Ridge regression this becomes + +!bt +\[ +\tilde{\bm{y}}_{\mathrm{Ridge}}=\bm{X}\bm{\beta}_{\mathrm{Ridge}} = \bm{U\Sigma V^T}\left(\bm{V}\bm{\Sigma}^2\bm{V}^T+\lambda\bm{I} \right)^{-1}(\bm{U\Sigma V^T})^T\bm{y}=\sum_{j=0}^{p-1}\bm{u}_j\bm{u}_j^T\frac{\sigma_j^2}{\sigma_j^2+\lambda}\bm{y}, +\] +!et + +with the vectors $\bm{u}_j$ being the columns of $\bm{U}$ from the SVD of the matrix $\bm{X}$. + + + +Since $\lambda \geq 0$, it means that compared to OLS, we have + +!bt +\[ +\frac{\sigma_j^2}{\sigma_j^2+\lambda} \leq 1. +\] +!et + +Ridge regression finds the coordinates of $\bm{y}$ with respect to the +orthonormal basis $\bm{U}$, it then shrinks the coordinates by +$\frac{\sigma_j^2}{\sigma_j^2+\lambda}$. Recall that the SVD has +eigenvalues ordered in a descending way, that is $\sigma_i \geq +\sigma_{i+1}$. + +For small eigenvalues $\sigma_i$ it means that their contributions become less important, a fact which can be used to reduce the number of degrees of freedom. More about this when we have covered the material on a statistical interpretation of various linear regression methods. + + + +For the sake of simplicity, let us assume that the design matrix is orthonormal, that is + +!bt +\[ +\bm{X}^T\bm{X}=(\bm{X}^T\bm{X})^{-1} =\bm{I}. +\] +!et + +In this case the standard OLS results in +!bt +\[ +\bm{\beta}^{\mathrm{OLS}} = \bm{X}^T\bm{y}=\sum_{i=0}^{p-1}\bm{u}_j\bm{u}_j^T\bm{y}, +\] +!et + +and + +!bt +\[ +\bm{\beta}^{\mathrm{Ridge}} = \left(\bm{I}+\lambda\bm{I}\right)^{-1}\bm{X}^T\bm{y}=\left(1+\lambda\right)^{-1}\bm{\beta}^{\mathrm{OLS}}, +\] +!et + +that is the Ridge estimator scales the OLS estimator by the inverse of a factor $1+\lambda$, and +the Ridge estimator converges to zero when the hyperparameter goes to +infinity. + +We will come back to more interpreations after we have gone through some of the statistical analysis part. + + + +Using the matrix-vector expression for Lasso regression and dropping the parameter $1/n$ in front of the standard mean squared error equation, we have the following _cost_ function + +!bt +\[ +C(\bm{X},\bm{\beta})=\left\{(\bm{y}-\bm{X}\bm{\beta})^T(\bm{y}-\bm{X}\bm{\beta})\right\}+\lambda\vert\vert\bm{\beta}\vert\vert_1, +\] +!et + +Taking the derivative with respect to $\bm{\beta}$ and recalling that the derivative of the absolute value is (we drop the boldfaced vector symbol for simplicty) +!bt +\[ +\frac{d \vert \beta\vert}{d \bm{\beta}}=\mathrm{sgn}(\bm{\beta})=\left\{\begin{array}{cc} 1 & \beta > 0 \\ 0 & \beta =0\\-1 & \beta < 0, \end{array}\right. +\] +!et +we have that the derivative of the cost function is + +!bt +\[ +\frac{\partial C(\bm{X},\bm{\beta})}{\partial \bm{\beta}}=-2\bm{X}^T(\bm{y}-\bm{X}\bm{\beta})+\lambda sgn(\bm{\beta})=0, +\] +!et +and reordering we have +!bt +\[ +\bm{X}^T\bm{X}\bm{\beta}+\lambda sgn(\bm{\beta})=2\bm{X}^T\bm{y}. +\] +!et +This equation does not lead to a nice analytical equation as in Ridge regression or ordinary least squares. This equation can however be solved by using standard convex optimization algorithms using for example the Python package "CVXOPT":"https://cvxopt.org/". We will discuss this later. + + + + + +Let us assume that our design matrix is given by unit (identity) matrix, that is a square diagonal matrix with ones only along the +diagonal. In this case we have an equal number of rows and columns $n=p$. + +Our model approximation is just $\tilde{\bm{y}}=\bm{\beta}$ and the mean squared error and thereby the cost function for ordinary least sqquares (OLS) is then (we drop the term $1/n$) +!bt +\[ +C(\bm{\beta})=\sum_{i=0}^{p-1}(y_i-\beta_i)^2, +\] +!et +and minimizing we have that +!bt +\[ +\hat{\beta}_i^{\mathrm{OLS}} = y_i. +\] +!et + + +For Ridge regression our cost function is +!bt +\[ +C(\bm{\beta})=\sum_{i=0}^{p-1}(y_i-\beta_i)^2+\lambda\sum_{i=0}^{p-1}\beta_i^2, +\] +!et +and minimizing we have that +!bt +\[ +\hat{\beta}_i^{\mathrm{Ridge}} = \frac{y_i}{1+\lambda}. +\] +!et + + +For Lasso regression our cost function is +!bt +\[ +C(\bm{\beta})=\sum_{i=0}^{p-1}(y_i-\beta_i)^2+\lambda\sum_{i=0}^{p-1}\vert\beta_i\vert=\sum_{i=0}^{p-1}(y_i-\beta_i)^2+\lambda\sum_{i=0}^{p-1}\sqrt{\beta_i^2}, +\] +!et +and minimizing we have that +!bt +\[ +-2\sum_{i=0}^{p-1}(y_i-\beta_i)+\lambda \sum_{i=0}^{p-1}\frac{(\beta_i)}{\vert\beta_i\vert}=0, +\] +!et +which leads to +!bt +\[ +\hat{\bm{\beta}}_i^{\mathrm{Lasso}} = \left\{\begin{array}{ccc}y_i-\frac{\lambda}{2} &\mathrm{if} & y_i> \frac{\lambda}{2}\\ + y_i+\frac{\lambda}{2} &\mathrm{if} & y_i< -\frac{\lambda}{2}\\ + 0 &\mathrm{if} & \vert y_i\vert\le \frac{\lambda}{2}\end{array}\right.\\. +\] +!et + +Plotting these results ("figure in handwritten notes for week 36":"https://github.com/CompPhysics/MachineLearning/blob/master/doc/HandWrittenNotes/2021/NotesSeptember9.pdf") shows clearly that Lasso regression suppresses (sets to zero) values of $\beta_i$ for specific values of $\lambda$. Ridge regression reduces on the other hand the values of $\beta_i$ as function of $\lambda$. + + +As another examples, +let us assume we have a data set with outputs/targets given by the vector + +!bt +\[ +\bm{y}=\begin{bmatrix}4 \\ 2 \\3\end{bmatrix}, +\] +!et +and our inputs as a $3\times 2$ design matrix +!bt +\[ +\bm{X}=\begin{bmatrix}2 & 0\\ 0 & 1 \\ 0 & 0\end{bmatrix}, +\] +!et +meaning that we have two features and two unknown parameters $\beta_0$ and $\beta_1$ to be determined either by ordinary least squares, Ridge or Lasso regression. + + +For ordinary least squares (OLS) we know that the optimal solution is + +!bt +\[ +\hat{\bm{\beta}}^{\mathrm{OLS}}=\left( \bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\bm{y}. +\] +!et +Inserting the above values we obtain that + +!bt +\[ +\hat{\bm{\beta}}^{\mathrm{OLS}}=\begin{bmatrix}2 \\ 2\end{bmatrix}, +\] +!et + +The code which implements this simpler case is presented after the discussion of Ridge and Lasso. + + +For Ridge regression we have + +!bt +\[ +\hat{\bm{\beta}}^{\mathrm{Ridge}}=\left( \bm{X}^T\bm{X}+\lambda\bm{I}\right)^{-1}\bm{X}^T\bm{y}. +\] +!et +Inserting the above values we obtain that + +!bt +\[ +\hat{\bm{\beta}}^{\mathrm{Ridge}}=\begin{bmatrix}\frac{8}{4+\lambda} \\ \frac{2}{1+\lambda}\end{bmatrix}, +\] +!et + +There is normally a constraint on the value of $\vert\vert \bm{\beta}\vert\vert_2$ via the parameter $\lambda$. +Let us for simplicity assume that $\beta_0^2+\beta_1^2=1$ as constraint. This will allow us to find an expression for the optimal values of $\beta$ and $\lambda$. + +To see this, let us write the cost function for Ridge regression. + + + +We define the MSE without the $1/n$ factor and have then, using that +!bt +\[ +\bm{X}\bm{\beta}=\begin{bmatrix} 2\beta_0 \\ \beta_1 \\0 \end{bmatrix}, +\] +!et + +!bt +\[ +C(\bm{\beta})=(4-2\beta_0)^2+(2-\beta_1)^2+\lambda(\beta_0^2+\beta_1^2), +\] +!et +and taking the derivative with respect to $\beta_0$ we get +!bt +\[ +\beta_0=\frac{8}{4+\lambda}, +\] +!et +and for $\beta_1$ we obtain +!bt +\[ +\beta_1=\frac{2}{1+\lambda}, +\] +!et + +Using the constraint for $\beta_0^2+\beta_1^2=1$ we can constrain $\lambda$ by solving +!bt +\[ +\left(\frac{8}{4+\lambda}\right)^2+\left(\frac{2}{1+\lambda}\right)^2=1, +\] +!et +which gives $\lambda=4.571$ and $\beta_0=0.933$ and $\beta_1=0.359$. + + +For Lasso we need now, keeping a constraint on $\vert\beta_0\vert+\vert\beta_1\vert=1$, to take the derivative of the absolute values of $\beta_0$ +and $\beta_1$. This gives us the following derivatives of the cost function +!bt +\[ +C(\bm{\beta})=(4-2\beta_0)^2+(2-\beta_1)^2+\lambda(\vert\beta_0\vert+\vert\beta_1\vert), +\] +!et + +!bt +\[ +\frac{\partial C(\bm{\beta})}{\partial \beta_0}=-4(4-2\beta_0)+\lambda\mathrm{sgn}(\beta_0)=0, +\] +!et +and +!bt +\[ +\frac{\partial C(\bm{\beta})}{\partial \beta_1}=-2(2-\beta_1)+\lambda\mathrm{sgn}(\beta_1)=0. +\] +!et +We have now four cases to solve besides the trivial cases $\beta_0$ and/or $\beta_1$ are zero, namely +o $\beta_0 > 0$ and $\beta_1 > 0$, +o $\beta_0 > 0$ and $\beta_1 < 0$, +o $\beta_0 < 0$ and $\beta_1 > 0$, +o $\beta_0 < 0$ and $\beta_1 < 0$. + + +If we consider the first case, we have then +!bt +\[ +-4(4-2\beta_0)+\lambda=0, +\] +!et +and +!bt +\[ +-2(2-\beta_1)+\lambda=0. +\] +!et +which yields + +!bt +\[ +\beta_0=\frac{16+\lambda}{8}, +\] +!et +and +!bt +\[ +\beta_1=\frac{4+\lambda}{2}. +\] +!et + +Using the constraint on $\beta_0$ and $\beta_1$ we can then find the optimal value of $\lambda$ for the different cases. We leave this as an exercise to you. + + +Here we set up the OLS, Ridge and Lasso functionality in order to study the above example. Note that here we have opted for a set of values of $\lambda$, meaning that we need to perform a search in order to find the optimal values. + +First we study and compare the OLS and Ridge results. The next code compares all three methods. + + +!bc pycod +import os +import numpy as np +import pandas as pd +import matplotlib.pyplot as plt + +def R2(y_data, y_model): + return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2) +def MSE(y_data,y_model): + n = np.size(y_model) + return np.sum((y_data-y_model)**2)/n + + +# A seed just to ensure that the random numbers are the same for every run. +# Useful for eventual debugging. + +X = np.array( [ [ 2, 0], [0, 1], [0,0]]) +y = np.array( [4, 2, 3]) + + +# matrix inversion to find beta +OLSbeta = np.linalg.inv(X.T @ X) @ X.T @ y +print(OLSbeta) +# and then make the prediction +ytildeOLS = X @ OLSbeta +print("Training MSE for OLS") +print(MSE(y,ytildeOLS)) +ypredictOLS = X @ OLSbeta + +# Repeat now for Ridge regression and various values of the regularization parameter +I = np.eye(2,2) +# Decide which values of lambda to use +nlambdas = 100 +MSEPredict = np.zeros(nlambdas) +lambdas = np.logspace(-4, 4, nlambdas) +for i in range(nlambdas): + lmb = lambdas[i] + Ridgebeta = np.linalg.inv(X.T @ X+lmb*I) @ X.T @ y +# print(Ridgebeta) + # and then make the prediction + ypredictRidge = X @ Ridgebeta + MSEPredict[i] = MSE(y,ypredictRidge) +# print(MSEPredict[i]) + # Now plot the results +plt.figure() +plt.plot(np.log10(lambdas), MSEPredict, 'r--', label = 'MSE Ridge Train') +plt.xlabel('log10(lambda)') +plt.ylabel('MSE') +plt.legend() +plt.show() + +!ec + +We see here that we reach a plateau. What is actually happening? !bc pycod -# Common imports +import os import numpy as np import pandas as pd +import matplotlib.pyplot as plt +from sklearn import linear_model + +def R2(y_data, y_model): + return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2) +def MSE(y_data,y_model): + n = np.size(y_model) + return np.sum((y_data-y_model)**2)/n -def FrankeFunction(x,y): - term1 = 0.75*np.exp(-(0.25*(9*x-2)**2) - 0.25*((9*y-2)**2)) - term2 = 0.75*np.exp(-((9*x+1)**2)/49.0 - 0.1*(9*y+1)) - term3 = 0.5*np.exp(-(9*x-7)**2/4.0 - 0.25*((9*y-3)**2)) - term4 = -0.2*np.exp(-(9*x-4)**2 - (9*y-7)**2) - return term1 + term2 + term3 + term4 +# A seed just to ensure that the random numbers are the same for every run. +# Useful for eventual debugging. + +X = np.array( [ [ 2, 0], [0, 1], [0,0]]) +y = np.array( [4, 2, 3]) -def create_X(x, y, n ): - if len(x.shape) > 1: - x = np.ravel(x) - y = np.ravel(y) +# matrix inversion to find beta +OLSbeta = np.linalg.inv(X.T @ X) @ X.T @ y +print(OLSbeta) +# and then make the prediction +ytildeOLS = X @ OLSbeta +print("Training MSE for OLS") +print(MSE(y,ytildeOLS)) +ypredictOLS = X @ OLSbeta - N = len(x) - l = int((n+1)*(n+2)/2) # Number of elements in beta - X = np.ones((N,l)) +# Repeat now for Ridge regression and various values of the regularization parameter +I = np.eye(2,2) +# Decide which values of lambda to use +nlambdas = 100 +MSERidgePredict = np.zeros(nlambdas) +MSELassoPredict = np.zeros(nlambdas) +lambdas = np.logspace(-4, 4, nlambdas) +for i in range(nlambdas): + lmb = lambdas[i] + Ridgebeta = np.linalg.inv(X.T @ X+lmb*I) @ X.T @ y + print(Ridgebeta) + # and then make the prediction + ypredictRidge = X @ Ridgebeta + MSERidgePredict[i] = MSE(y,ypredictRidge) + RegLasso = linear_model.Lasso(lmb) + RegLasso.fit(X,y) + ypredictLasso = RegLasso.predict(X) + print(RegLasso.coef_) + MSELassoPredict[i] = MSE(y,ypredictLasso) +# Now plot the results +plt.figure() +plt.plot(np.log10(lambdas), MSERidgePredict, 'r--', label = 'MSE Ridge Train') +plt.plot(np.log10(lambdas), MSELassoPredict, 'r--', label = 'MSE Lasso Train') +plt.xlabel('log10(lambda)') +plt.ylabel('MSE') +plt.legend() +plt.show() - for i in range(1,n+1): - q = int((i)*(i+1)/2) - for k in range(i+1): - X[:,q+k] = (x**(i-k))*(y**k) - - return X - - -# Making meshgrid of datapoints and compute Franke's function -n = 4 -N = 100 -x = np.sort(np.random.uniform(0, 1, N)) -y = np.sort(np.random.uniform(0, 1, N)) -z = FrankeFunction(x, y) -X = create_X(x, y, n=n) - -Xpd = pd.DataFrame(X) -# subtract the mean values and set up the covariance matrix -Xpd = Xpd - Xpd.mean() -covariance_matrix = Xpd.cov() -print(covariance_matrix) !ec -We note here that the covariance is zero for the first rows and -columns since all matrix elements in the design matrix were set to one -(we are fitting the function in terms of a polynomial of degree $n$). -This means that the variance for these elements will be zero and will -cause problems when we set up the correlation matrix. We can simply -drop these elements and construct a correlation -matrix without these elements. +Another Example, now with a polynomial fit. + +!bc pycod +import os +import numpy as np +import pandas as pd +import matplotlib.pyplot as plt +from sklearn.model_selection import train_test_split +from sklearn import linear_model + +def R2(y_data, y_model): + return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2) +def MSE(y_data,y_model): + n = np.size(y_model) + return np.sum((y_data-y_model)**2)/n + + +# A seed just to ensure that the random numbers are the same for every run. +# Useful for eventual debugging. +np.random.seed(3155) + +x = np.random.rand(100) +y = 2.0+5*x*x+0.1*np.random.randn(100) + +# number of features p (here degree of polynomial +p = 3 +# The design matrix now as function of a given polynomial +X = np.zeros((len(x),p)) +X[:,0] = 1.0 +X[:,1] = x +X[:,2] = x*x +# We split the data in test and training data +X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2) + +# matrix inversion to find beta +OLSbeta = np.linalg.inv(X_train.T @ X_train) @ X_train.T @ y_train +print(OLSbeta) +# and then make the prediction +ytildeOLS = X_train @ OLSbeta +print("Training MSE for OLS") +print(MSE(y_train,ytildeOLS)) +ypredictOLS = X_test @ OLSbeta +print("Test MSE OLS") +print(MSE(y_test,ypredictOLS)) + +# Repeat now for Lasso and Ridge regression and various values of the regularization parameter +I = np.eye(p,p) +# Decide which values of lambda to use +nlambdas = 100 +MSEPredict = np.zeros(nlambdas) +MSETrain = np.zeros(nlambdas) +MSELassoPredict = np.zeros(nlambdas) +MSELassoTrain = np.zeros(nlambdas) +lambdas = np.logspace(-4, 4, nlambdas) +for i in range(nlambdas): + lmb = lambdas[i] + Ridgebeta = np.linalg.inv(X_train.T @ X_train+lmb*I) @ X_train.T @ y_train + # include lasso using Scikit-Learn + RegLasso = linear_model.Lasso(lmb) + RegLasso.fit(X_train,y_train) + # and then make the prediction + ytildeRidge = X_train @ Ridgebeta + ypredictRidge = X_test @ Ridgebeta + ytildeLasso = RegLasso.predict(X_train) + ypredictLasso = RegLasso.predict(X_test) + MSEPredict[i] = MSE(y_test,ypredictRidge) + MSETrain[i] = MSE(y_train,ytildeRidge) + MSELassoPredict[i] = MSE(y_test,ypredictLasso) + MSELassoTrain[i] = MSE(y_train,ytildeLasso) + +# Now plot the results +plt.figure() +plt.plot(np.log10(lambdas), MSETrain, label = 'MSE Ridge train') +plt.plot(np.log10(lambdas), MSEPredict, 'r--', label = 'MSE Ridge Test') +plt.plot(np.log10(lambdas), MSELassoTrain, label = 'MSE Lasso train') +plt.plot(np.log10(lambdas), MSELassoPredict, 'r--', label = 'MSE Lasso Test') + +plt.xlabel('log10(lambda)') +plt.ylabel('MSE') +plt.legend() +plt.show() + +!ec + + +===== Linking the regression analysis with a statistical interpretation ===== + +We will now couple the discussions of ordinary least squares, Ridge +and Lasso regression with a statistical interpretation, that is we +move from a linear algebra analysis to a statistical analysis. In +particular, we will focus on what the regularization terms can result +in. We will amongst other things show that the regularization +parameter can reduce considerably the variance of the parameters +$\beta$. + + +The +advantage of doing linear regression is that we actually end up with +analytical expressions for several statistical quantities. +Standard least squares and Ridge regression allow us to +derive quantities like the variance and other expectation values in a +rather straightforward way. + + +It is assumed that $\varepsilon_i +\sim \mathcal{N}(0, \sigma^2)$ and the $\varepsilon_{i}$ are +independent, i.e.: +!bt +\begin{align*} +\mbox{Cov}(\varepsilon_{i_1}, +\varepsilon_{i_2}) & = \left\{ \begin{array}{lcc} \sigma^2 & \mbox{if} +& i_1 = i_2, \\ 0 & \mbox{if} & i_1 \not= i_2. \end{array} \right. +\end{align*} +!et +The randomness of $\varepsilon_i$ implies that +$\mathbf{y}_i$ is also a random variable. In particular, +$\mathbf{y}_i$ is normally distributed, because $\varepsilon_i \sim +\mathcal{N}(0, \sigma^2)$ and $\mathbf{X}_{i,\ast} \, \bm{\beta}$ is a +non-random scalar. To specify the parameters of the distribution of +$\mathbf{y}_i$ we need to calculate its first two moments. + +Recall that $\bm{X}$ is a matrix of dimensionality $n\times p$. The +notation above $\mathbf{X}_{i,\ast}$ means that we are looking at the +row number $i$ and perform a sum over all values $p$. - -We can rewrite the covariance matrix in a more compact form in terms of the design/feature matrix $\bm{X}$ as +The assumption we have made here can be summarized as (and this is going to be useful when we discuss the bias-variance trade off) +that there exists a function $f(\bm{x})$ and a normal distributed error $\bm{\varepsilon}\sim \mathcal{N}(0, \sigma^2)$ +which describe our data !bt \[ -\bm{C}[\bm{x}] = \frac{1}{n}\bm{X}^T\bm{X}= \mathbb{E}[\bm{X}^T\bm{X}]. +\bm{y} = f(\bm{x})+\bm{\varepsilon} \] !et -To see this let us simply look at a design matrix $\bm{X}\in {\mathbb{R}}^{2\times 2}$ +We approximate this function with our model from the solution of the linear regression equations, that is our +function $f$ is approximated by $\bm{\tilde{y}}$ where we want to minimize $(\bm{y}-\bm{\tilde{y}})^2$, our MSE, with !bt \[ -\bm{X}=\begin{bmatrix} -x_{00} & x_{01}\\ -x_{10} & x_{11}\\ -\end{bmatrix}=\begin{bmatrix} -\bm{x}_{0} & \bm{x}_{1}\\ -\end{bmatrix}. +\bm{\tilde{y}} = \bm{X}\bm{\beta}. \] !et -If we then compute the expectation value + +We can calculate the expectation value of $\bm{y}$ for a given element $i$ +!bt +\begin{align*} +\mathbb{E}(y_i) & = +\mathbb{E}(\mathbf{X}_{i, \ast} \, \bm{\beta}) + \mathbb{E}(\varepsilon_i) +\, \, \, = \, \, \, \mathbf{X}_{i, \ast} \, \beta, +\end{align*} +!et +while +its variance is +!bt +\begin{align*} \mbox{Var}(y_i) & = \mathbb{E} \{ [y_i +- \mathbb{E}(y_i)]^2 \} \, \, \, = \, \, \, \mathbb{E} ( y_i^2 ) - +[\mathbb{E}(y_i)]^2 \\ & = \mathbb{E} [ ( \mathbf{X}_{i, \ast} \, +\beta + \varepsilon_i )^2] - ( \mathbf{X}_{i, \ast} \, \bm{\beta})^2 \\ & += \mathbb{E} [ ( \mathbf{X}_{i, \ast} \, \bm{\beta})^2 + 2 \varepsilon_i +\mathbf{X}_{i, \ast} \, \bm{\beta} + \varepsilon_i^2 ] - ( \mathbf{X}_{i, +\ast} \, \beta)^2 \\ & = ( \mathbf{X}_{i, \ast} \, \bm{\beta})^2 + 2 +\mathbb{E}(\varepsilon_i) \mathbf{X}_{i, \ast} \, \bm{\beta} + +\mathbb{E}(\varepsilon_i^2 ) - ( \mathbf{X}_{i, \ast} \, \bm{\beta})^2 +\\ & = \mathbb{E}(\varepsilon_i^2 ) \, \, \, = \, \, \, +\mbox{Var}(\varepsilon_i) \, \, \, = \, \, \, \sigma^2. +\end{align*} +!et +Hence, $y_i \sim \mathcal{N}( \mathbf{X}_{i, \ast} \, \bm{\beta}, \sigma^2)$, that is $\bm{y}$ follows a normal distribution with +mean value $\bm{X}\bm{\beta}$ and variance $\sigma^2$ (not be confused with the singular values of the SVD). + + +With the OLS expressions for the parameters $\bm{\beta}$ we can evaluate the expectation value !bt \[ -\mathbb{E}[\bm{X}^T\bm{X}] = \frac{1}{n}\bm{X}^T\bm{X}=\begin{bmatrix} -x_{00}^2+x_{01}^2 & x_{00}x_{10}+x_{01}x_{11}\\ -x_{10}x_{00}+x_{11}x_{01} & x_{10}^2+x_{11}^2\\ -\end{bmatrix}, +\mathbb{E}(\bm{\beta}) = \mathbb{E}[ (\mathbf{X}^{\top} \mathbf{X})^{-1}\mathbf{X}^{T} \mathbf{Y}]=(\mathbf{X}^{T} \mathbf{X})^{-1}\mathbf{X}^{T} \mathbb{E}[ \mathbf{Y}]=(\mathbf{X}^{T} \mathbf{X})^{-1} \mathbf{X}^{T}\mathbf{X}\bm{\beta}=\bm{\beta}. \] !et -which is just +This means that the estimator of the regression parameters is unbiased. + +We can also calculate the variance + +The variance of $\bm{\beta}$ is +!bt +\begin{eqnarray*} +\mbox{Var}(\bm{\beta}) & = & \mathbb{E} \{ [\bm{\beta} - \mathbb{E}(\bm{\beta})] [\bm{\beta} - \mathbb{E}(\bm{\beta})]^{T} \} +\\ +& = & \mathbb{E} \{ [(\mathbf{X}^{T} \mathbf{X})^{-1} \, \mathbf{X}^{T} \mathbf{Y} - \bm{\beta}] \, [(\mathbf{X}^{T} \mathbf{X})^{-1} \, \mathbf{X}^{T} \mathbf{Y} - \bm{\beta}]^{T} \} +\\ +% & = & \mathbb{E} \{ [(\mathbf{X}^{T} \mathbf{X})^{-1} \, \mathbf{X}^{T} \mathbf{Y}] \, [(\mathbf{X}^{T} \mathbf{X})^{-1} \, \mathbf{X}^{T} \mathbf{Y}]^{T} \} - \bm{\beta} \, \bm{\beta}^{T} +% \\ +% & = & \mathbb{E} \{ (\mathbf{X}^{T} \mathbf{X})^{-1} \, \mathbf{X}^{T} \mathbf{Y} \, \mathbf{Y}^{T} \, \mathbf{X} \, (\mathbf{X}^{T} \mathbf{X})^{-1} \} - \bm{\beta} \, \bm{\beta}^{T} +% \\ +& = & (\mathbf{X}^{T} \mathbf{X})^{-1} \, \mathbf{X}^{T} \, \mathbb{E} \{ \mathbf{Y} \, \mathbf{Y}^{T} \} \, \mathbf{X} \, (\mathbf{X}^{T} \mathbf{X})^{-1} - \bm{\beta} \, \bm{\beta}^{T} +\\ +& = & (\mathbf{X}^{T} \mathbf{X})^{-1} \, \mathbf{X}^{T} \, \{ \mathbf{X} \, \bm{\beta} \, \bm{\beta}^{T} \, \mathbf{X}^{T} + \sigma^2 \} \, \mathbf{X} \, (\mathbf{X}^{T} \mathbf{X})^{-1} - \bm{\beta} \, \bm{\beta}^{T} +% \\ +% & = & (\mathbf{X}^T \mathbf{X})^{-1} \, \mathbf{X}^T \, \mathbf{X} \, \bm{\beta} \, \bm{\beta}^T \, \mathbf{X}^T \, \mathbf{X} \, (\mathbf{X}^T % \mathbf{X})^{-1} +% \\ +% & & + \, \, \sigma^2 \, (\mathbf{X}^T \mathbf{X})^{-1} \, \mathbf{X}^T \, \mathbf{X} \, (\mathbf{X}^T \mathbf{X})^{-1} - \bm{\beta} \bm{\beta}^T +\\ +& = & \bm{\beta} \, \bm{\beta}^{T} + \sigma^2 \, (\mathbf{X}^{T} \mathbf{X})^{-1} - \bm{\beta} \, \bm{\beta}^{T} +\, \, \, = \, \, \, \sigma^2 \, (\mathbf{X}^{T} \mathbf{X})^{-1}, +\end{eqnarray*} +!et + +where we have used that $\mathbb{E} (\mathbf{Y} \mathbf{Y}^{T}) = +\mathbf{X} \, \bm{\beta} \, \bm{\beta}^{T} \, \mathbf{X}^{T} + +\sigma^2 \, \mathbf{I}_{nn}$. From $\mbox{Var}(\bm{\beta}) = \sigma^2 +\, (\mathbf{X}^{T} \mathbf{X})^{-1}$, one obtains an estimate of the +variance of the estimate of the $j$-th regression coefficient: +$\bm{\sigma}^2 (\bm{\beta}_j ) = \bm{\sigma}^2 [(\mathbf{X}^{T} \mathbf{X})^{-1}]_{jj} $. This may be used to +construct a confidence interval for the estimates. + + +In a similar way, we can obtain analytical expressions for say the +expectation values of the parameters $\bm{\beta}$ and their variance +when we employ Ridge regression, allowing us again to define a confidence interval. + +It is rather straightforward to show that !bt \[ -\bm{C}[\bm{x}_0,\bm{x}_1] = \bm{C}[\bm{x}]=\begin{bmatrix} \mathrm{var}[\bm{x}_0] & \mathrm{cov}[\bm{x}_0,\bm{x}_1] \\ - \mathrm{cov}[\bm{x}_1,\bm{x}_0] & \mathrm{var}[\bm{x}_1] \\ - \end{bmatrix}, +\mathbb{E} \big[ \bm{\beta}^{\mathrm{Ridge}} \big]=(\mathbf{X}^{T} \mathbf{X} + \lambda \mathbf{I}_{pp})^{-1} (\mathbf{X}^{\top} \mathbf{X})\bm{\beta}^{\mathrm{OLS}}. \] !et -where we wrote $$\bm{C}[\bm{x}_0,\bm{x}_1] = \bm{C}[\bm{x}]$$ to indicate that this the covariance of the vectors $\bm{x}$ of the design/feature matrix $\bm{X}$. +We see clearly that +$\mathbb{E} \big[ \bm{\beta}^{\mathrm{Ridge}} \big] \not= \bm{\beta}^{\mathrm{OLS}}$ for any $\lambda > 0$. We say then that the ridge estimator is biased. -It is easy to generalize this to a matrix $\bm{X}\in {\mathbb{R}}^{n\times p}$. +We can also compute the variance as + +!bt +\[ +\mbox{Var}[\bm{\beta}^{\mathrm{Ridge}}]=\sigma^2[ \mathbf{X}^{T} \mathbf{X} + \lambda \mathbf{I} ]^{-1} \mathbf{X}^{T} \mathbf{X} \{ [ \mathbf{X}^{\top} \mathbf{X} + \lambda \mathbf{I} ]^{-1}\}^{T}, +\] +!et +and it is easy to see that if the parameter $\lambda$ goes to infinity then the variance of Ridge parameters $\bm{\beta}$ goes to zero. + +With this, we can compute the difference + +!bt +\[ +\mbox{Var}[\bm{\beta}^{\mathrm{OLS}}]-\mbox{Var}(\bm{\beta}^{\mathrm{Ridge}})=\sigma^2 [ \mathbf{X}^{T} \mathbf{X} + \lambda \mathbf{I} ]^{-1}[ 2\lambda\mathbf{I} + \lambda^2 (\mathbf{X}^{T} \mathbf{X})^{-1} ] \{ [ \mathbf{X}^{T} \mathbf{X} + \lambda \mathbf{I} ]^{-1}\}^{T}. +\] +!et +The difference is non-negative definite since each component of the +matrix product is non-negative definite. +This means the variance we obtain with the standard OLS will always for $\lambda > 0$ be larger than the variance of $\bm{\beta}$ obtained with the Ridge estimator. This has interesting consequences when we discuss the so-called bias-variance trade-off below. + + + +===== Deriving OLS from a probability distribution ===== + +Our basic assumption when we derived the OLS equations was to assume +that our output is determined by a given continuous function +$f(\bm{x})$ and a random noise $\bm{\epsilon}$ given by the normal +distribution with zero mean value and an undetermined variance +$\sigma^2$. + +We found above that the outputs $\bm{y}$ have a mean value given by +$\bm{X}\hat{\bm{\beta}}$ and variance $\sigma^2$. Since the entries to +the design matrix are not stochastic variables, we can assume that the +probability distribution of our targets is also a normal distribution +but now with mean value $\bm{X}\hat{\bm{\beta}}$. This means that a +single output $y_i$ is given by the Gaussian distribution + +!bt +\[ +y_i\sim \mathcal{N}(\bm{X}_{i,*}\bm{\beta}, \sigma^2)=\frac{1}{\sqrt{2\pi\sigma^2}}\exp{\left[-\frac{(y_i-\bm{X}_{i,*}\bm{\beta})^2}{2\sigma^2}\right]}. +\] +!et + + +We assume now that the various $y_i$ values are stochastically distributed according to the above Gaussian distribution. +We define this distribution as +!bt +\[ +p(y_i, \bm{X}\vert\bm{\beta})=\frac{1}{\sqrt{2\pi\sigma^2}}\exp{\left[-\frac{(y_i-\bm{X}_{i,*}\bm{\beta})^2}{2\sigma^2}\right]}, +\] +!et +which reads as finding the likelihood of an event $y_i$ with the input variables $\bm{X}$ given the parameters (to be determined) $\bm{\beta}$. + +Since these events are assumed to be independent and identicall distributed we can build the probability distribution function (PDF) for all possible event $\bm{y}$ as the product of the single events, that is we have + +!bt +\[ +p(\bm{y},\bm{X}\vert\bm{\beta})=\prod_{i=0}^{n-1}\frac{1}{\sqrt{2\pi\sigma^2}}\exp{\left[-\frac{(y_i-\bm{X}_{i,*}\bm{\beta})^2}{2\sigma^2}\right]}=\prod_{i=0}^{n-1}p(y_i,\bm{X}\vert\bm{\beta}). +\] +!et + +We will write this in a more compact form reserving $\bm{D}$ for the domain of events, including the ouputs (targets) and the inputs. That is +in case we have a simple one-dimensional input and output case +!bt +\[ +\bm{D}=[(x_0,y_0), (x_1,y_1),\dots, (x_{n-1},y_{n-1})]. +\] +!et +In the more general case the various inputs should be replaced by the possible features represented by the input data set $\bm{X}$. +We can now rewrite the above probability as +!bt +\[ +p(\bm{D}\vert\bm{\beta})=\prod_{i=0}^{n-1}\frac{1}{\sqrt{2\pi\sigma^2}}\exp{\left[-\frac{(y_i-\bm{X}_{i,*}\bm{\beta})^2}{2\sigma^2}\right]}. +\] +!et + +It is a conditional probability (see below) and reads as the likelihood of a domain of events $\bm{D}$ given a set of parameters $\bm{\beta}$. + + +In statistics, maximum likelihood estimation (MLE) is a method of +estimating the parameters of an assumed probability distribution, +given some observed data. This is achieved by maximizing a likelihood +function so that, under the assumed statistical model, the observed +data is the most probable. + + +We will assume here that our events are given by the above Gaussian +distribution and we will determine the optimal parameters $\beta$ by +maximizing the above PDF. However, computing the derivatives of a +product function is cumbersome and can easily lead to overflow and/or +underflowproblems, with potentials for loss of numerical precision. + + +In practice, it is more convenient to maximize the logarithm of the +PDF because it is a monotonically increasing function of the argument. +Alternatively, and this will be our option, we will minimize the +negative of the logarithm since this is a monotonically decreasing +function. + +Note also that maximization/minimization of the logarithm of the PDF +is equivalent to the maximization/minimization of the function itself. + + + + +We could now define a new cost function to minimize, namely the negative logarithm of the above PDF + +!bt +\[ +C(\bm{\beta}=-\log{\prod_{i=0}^{n-1}p(y_i,\bm{X}\vert\bm{\beta})}=-\sum_{i=0}^{n-1}\log{p(y_i,\bm{X}\vert\bm{\beta})}, +\] +!et +which becomes +!bt +\[ +C(\bm{\beta}=\frac{n}{2}\log{2\pi\sigma^2}+\frac{\vert\vert (\bm{y}-\bm{X}\bm{\beta})\vert\vert_2^2}{2\sigma^2}. +\] +!et + +Taking the derivative of the *new* cost function with respect to the parameters $\beta$ we recognize our familiar OLS equation, namely + +!bt +\[ +\bm{X}^T\left(\bm{y}-\bm{X}\bm{\beta}\right) =0, +\] +!et +which leads to the well-known OLS equation for the optimal paramters $\beta$ +!bt +\[ +\hat{\bm{\beta}}^{\mathrm{OLS}}=\left(\bm{X}^T\bm{X}\right)^{-1}\bm{X}^T\bm{y}! +\] +!et + + +Before we make a similar analysis for Ridge and Lasso regression, we need a short reminder on statistics. + + +A central theorem in statistics is Bayes' theorem. This theorem plays a similar role as the good old Pythagoras' theorem in geometry. +Bayes' theorem is extremely simple to derive. But to do so we need some basic axioms from statistics. + +Assume we have two domains of events $X=[x_0,x_1,\dots,x_{n-1}]$ and $Y=[y_0,y_1,\dots,y_{n-1}]$. + +We define also the likelihood for $X$ and $Y$ as $p(X)$ and $p(Y)$ respectively. +The likelihood of a specific event $x_i$ (or $y_i$) is then written as $p(X=x_i)$ or just $p(x_i)=p_i$. + +!bblock Union of events is given by +!bt +\[ +p(X \cup Y)= p(X)+p(Y)-p(X \cap Y). +\] +!et +!eblock + + +!bblock The product rule (aka joint probability) is given by +!bt +\[ +p(X \cup Y)= p(X,Y)= p(X\vert Y)p(Y)=p(Y\vert X)p(X), +\] +!et +where we read $p(X\vert Y)$ as the likelihood of obtaining $X$ given $Y$. +!eblock + +If we have independent events then $p(X,Y)=p(X)p(Y)$. + + + +The marginal probability is defined in terms of only one of the set of variables $X,Y$. For a discrete probability we have +!bblock +!bt +\[ +p(X)=\sum_{i=0}^{n-1}p(X,Y=y_i)=\sum_{i=0}^{n-1}p(X\vert Y=y_i)p(Y=y_i)=\sum_{i=0}^{n-1}p(X\vert y_i)p(y_i). +\] +!et +!eblock + + + +The conditional probability, if $p(Y) > 0$, is +!bblock +!bt +\[ +p(X\vert Y)= \frac{p(X,Y)}{p(Y)}=\frac{p(X,Y)}{\sum_{i=0}^{n-1}p(Y\vert X=x_i)p(x_i)}. +\] +!et +!eblock + + + +If we combine the conditional probability with the marginal probability and the standard product rule, we have +!bt +\[ +p(X\vert Y)= \frac{p(X,Y)}{p(Y)}, +\] +!et +which we can rewrite as + +!bt +\[ +p(X\vert Y)= \frac{p(X,Y)}{\sum_{i=0}^{n-1}p(Y\vert X=x_i)p(x_i)}=\frac{p(Y\vert X)p(X)}{\sum_{i=0}^{n-1}p(Y\vert X=x_i)p(x_i)}, +\] +!et +which is Bayes' theorem. It allows us to evaluate the uncertainty in in $X$ after we have observed $Y$. We can easily interchange $X$ with $Y$. + + +The quantity $p(Y\vert X)$ on the right-hand side of the theorem is +evaluated for the observed data $Y$ and can be viewed as a function of +the parameter space represented by $X$. This function is not +necesseraly normalized and is normally called the likelihood function. + +The function $p(X)$ on the right hand side is called the prior while the function on the left hand side is the called the posterior probability. The denominator on the right hand side serves as a normalization factor for the posterior distribution. + +Let us try to illustrate Bayes' theorem through an example. + + +Let us suppose that you are undergoing a series of mammography scans in +order to rule out possible breast cancer cases. We define the +sensitivity for a positive event by the variable $X$. It takes binary +values with $X=1$ representing a positive event and $X=0$ being a +negative event. We reserve $Y$ as a classification parameter for +either a negative or a positive breast cancer confirmation. (Short note on wordings: positive here means having breast cancer, although none of us would consider this being a positive thing). + +We let $Y=1$ represent the the case of having breast cancer and $Y=0$ as not. + +Let us assume that if you have breast cancer, the test will be positive with a probability of $0.8$, that is we have + +!bt +\[ +p(X=1\vert Y=1) =0.8. +\] +!et + +This obviously sounds scary since many would conclude that if the test is positive, there is a likelihood of $80\%$ for having cancer. +It is however not correct, as the following Bayesian analysis shows. + + +If we look at various national surveys on breast cancer, the general likelihood of developing breast cancer is a very small number. +Let us assume that the prior probability in the population as a whole is + +!bt +\[ +p(Y=1) =0.004. +\] +!et + +We need also to account for the fact that the test may produce a false positive result (false alarm). Let us here assume that we have +!bt +\[ +p(X=1\vert Y=0) =0.1. +\] +!et + +Using Bayes' theorem we can then find the posterior probability that the person has breast cancer in case of a positive test, that is we can compute + +!bt +\[ +p(Y=1\vert X=1)=\frac{p(X=1\vert Y=1)p(Y=1)}{p(X=1\vert Y=1)p(Y=1)+p(X=1\vert Y=0)p(Y=0)}=\frac{0.8\times 0.004}{0.8\times 0.004+0.1\times 0.996}=0.031. +\] +!et +That is, in case of a positive test, there is only a $3\%$ chance of having breast cancer! + + + +===== Bayes' Theorem and Ridge and Lasso Regression ===== + +Hitherto we have discussed Ridge and Lasso regression in terms of a +linear analysis. This may to many of you feel rather technical and +perhaps not that intuitive. The question is whether we can develop a +more intuitive way of understanding what Ridge and Lasso express. + +Before we proceed let us perform a Ridge, Lasso and OLS analysis of a polynomial fit. + + +We will play around with a study of the values for the optimal +parameters $\bm{\beta}$ using OLS, Ridge and Lasso regression. For +OLS, you will notice as function of the noise and polynomial degree, +that the parameters $\beta$ will fluctuate from order to order in the +polynomial fit and that for larger and larger polynomial degrees of freedom, the parameters will tend to increase in value for OLS. + +For Ridge and Lasso regression, the higher order parameters will typically be reduced, providing thereby less fluctuations from one order to another one. + +!bc pycod +import numpy as np +import matplotlib.pyplot as plt +from sklearn.model_selection import train_test_split +from sklearn import linear_model + +def R2(y_data, y_model): + return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2) +def MSE(y_data,y_model): + n = np.size(y_model) + return np.sum((y_data-y_model)**2)/n + +# Make data set. +n = 10000 +x = np.random.rand(n) +y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2)+ np.random.randn(n) + +Maxpolydegree = 5 +X = np.zeros((len(x),Maxpolydegree)) +X[:,0] = 1.0 + +for polydegree in range(1, Maxpolydegree): + for degree in range(polydegree): + X[:,degree] = x**(degree) + + +# We split the data in test and training data +X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2) + +# matrix inversion to find beta +OLSbeta = np.linalg.pinv(X_train.T @ X_train) @ X_train.T @ y_train +print(OLSbeta) +ypredictOLS = X_test @ OLSbeta +print("Test MSE OLS") +print(MSE(y_test,ypredictOLS)) +# Repeat now for Lasso and Ridge regression and various values of the regularization parameter using Scikit-Learn +# Decide which values of lambda to use +nlambdas = 4 +MSERidgePredict = np.zeros(nlambdas) +MSELassoPredict = np.zeros(nlambdas) +lambdas = np.logspace(-3, 1, nlambdas) +for i in range(nlambdas): + lmb = lambdas[i] + # Make the fit using Ridge and Lasso + RegRidge = linear_model.Ridge(lmb,fit_intercept=False) + RegRidge.fit(X_train,y_train) + RegLasso = linear_model.Lasso(lmb,fit_intercept=False) + RegLasso.fit(X_train,y_train) + # and then make the prediction + ypredictRidge = RegRidge.predict(X_test) + ypredictLasso = RegLasso.predict(X_test) + # Compute the MSE and print it + MSERidgePredict[i] = MSE(y_test,ypredictRidge) + MSELassoPredict[i] = MSE(y_test,ypredictLasso) + print(lmb,RegRidge.coef_) + print(lmb,RegLasso.coef_) +# Now plot the results +plt.figure() +plt.plot(np.log10(lambdas), MSERidgePredict, 'b', label = 'MSE Ridge Test') +plt.plot(np.log10(lambdas), MSELassoPredict, 'r', label = 'MSE Lasso Test') +plt.xlabel('log10(lambda)') +plt.ylabel('MSE') +plt.legend() +plt.show() + + +!ec + +How can we understand this? + + + +Using Bayes' theorem we can gain a better intuition about Ridge and Lasso regression. + +For ordinary least squares we postulated that the maximum likelihood for the doamin of events $\bm{D}$ (one-dimensional case) +!bt +\[ +\bm{D}=[(x_0,y_0), (x_1,y_1),\dots, (x_{n-1},y_{n-1})], +\] +!et +is given by +!bt +\[ +p(\bm{D}\vert\bm{\beta})=\prod_{i=0}^{n-1}\frac{1}{\sqrt{2\pi\sigma^2}}\exp{\left[-\frac{(y_i-\bm{X}_{i,*}\bm{\beta})^2}{2\sigma^2}\right]}. +\] +!et + +In Bayes' theorem this function plays the role of the so-called likelihood. We could now ask the question what is the posterior probability of a parameter set $\bm{\beta}$ given a domain of events $\bm{D}$? That is, how can we define the posterior probability + +!bt +\[ +p(\bm{\beta}\vert\bm{D}). +\] +!et + +Bayes' theorem comes to our rescue here since (omitting the normalization constant) +!bt +\[ +p(\bm{\beta}\vert\bm{D})\propto p(\bm{D}\vert\bm{\beta})p(\bm{\beta}). +\] +!et + +We have a model for $p(\bm{D}\vert\bm{\beta})$ but need one for the _prior_ $p(\bm{\beta}$! + + + +With the posterior probability defined by a likelihood which we have +already modeled and an unknown prior, we are now ready to make +additional models for the prior. + +We can, based on our discussions of the variance of $\bm{\beta}$ and the mean value, assume that the prior for the values $\bm{\beta}$ is given by a Gaussian with mean value zero and variance $\tau^2$, that is + +!bt +\[ +p(\bm{\beta})=\prod_{j=0}^{p-1}\exp{\left(-\frac{\beta_j^2}{2\tau^2}\right)}. +\] +!et + +Our posterior probability becomes then (omitting the normalization factor which is just a constant) +!bt +\[ +p(\bm{\beta\vert\bm{D})}=\prod_{i=0}^{n-1}\frac{1}{\sqrt{2\pi\sigma^2}}\exp{\left[-\frac{(y_i-\bm{X}_{i,*}\bm{\beta})^2}{2\sigma^2}\right]}\prod_{j=0}^{p-1}\exp{\left(-\frac{\beta_j^2}{2\tau^2}\right)}. +\] +!et + + +We can now optimize this quantity with respect to $\bm{\beta}$. As we +did for OLS, this is most conveniently done by taking the negative +logarithm of the posterior probability. Doing so and leaving out the +constants terms that do not depend on $\beta$, we have + + +!bt +\[ +C(\bm{\beta})=\frac{\vert\vert (\bm{y}-\bm{X}\bm{\beta})\vert\vert_2^2}{2\sigma^2}+\frac{1}{2\tau^2}\vert\vert\bm{\beta}\vert\vert_2^2, +\] +!et +and replacing $1/2\tau^2$ with $\lambda$ we have + +!bt +\[ +C(\bm{\beta})=\frac{\vert\vert (\bm{y}-\bm{X}\bm{\beta})\vert\vert_2^2}{2\sigma^2}+\lambda\vert\vert\bm{\beta}\vert\vert_2^2, +\] +!et +which is our Ridge cost function! Nice, isn't it? + + +To derive the Lasso cost function, we simply replace the Gaussian prior with an exponential distribution ("Laplace in this case":"https://en.wikipedia.org/wiki/Laplace_distribution") with zero mean value, that is + +!bt +\[ +p(\bm{\beta})=\prod_{j=0}^{p-1}\exp{\left(-\frac{\vert\beta_j\vert}{\tau}\right)}. +\] +!et + +Our posterior probability becomes then (omitting the normalization factor which is just a constant) +!bt +\[ +p(\bm{\beta}\vert\bm{D})=\prod_{i=0}^{n-1}\frac{1}{\sqrt{2\pi\sigma^2}}\exp{\left[-\frac{(y_i-\bm{X}_{i,*}\bm{\beta})^2}{2\sigma^2}\right]}\prod_{j=0}^{p-1}\exp{\left(-\frac{\vert\beta_j\vert}{\tau}\right)}. +\] +!et + + +Taking the negative +logarithm of the posterior probability and leaving out the +constants terms that do not depend on $\beta$, we have + + +!bt +\[ +C(\bm{\beta}=\frac{\vert\vert (\bm{y}-\bm{X}\bm{\beta})\vert\vert_2^2}{2\sigma^2}+\frac{1}{\tau}\vert\vert\bm{\beta}\vert\vert_1, +\] +!et +and replacing $1/\tau$ with $\lambda$ we have + +!bt +\[ +C(\bm{\beta}=\frac{\vert\vert (\bm{y}-\bm{X}\bm{\beta})\vert\vert_2^2}{2\sigma^2}+\lambda\vert\vert\bm{\beta}\vert\vert_1, +\] +!et +which is our Lasso cost function! -===== Linking with SVD ===== diff --git a/doc/LectureNotes/_build/.doctrees/chapter2.doctree b/doc/LectureNotes/_build/.doctrees/chapter2.doctree index 545f752d2ff7ae68522ffe73f7dc8d99adc569fd..f7c32732c94af30ee476ba6809f244a6c97f9c59 100644 GIT binary patch literal 386730 zcmeFa3z%frQ6{KYzfv!&Wwm9sEniDzbycgXx-#q4Evsd>TGD3;sb#BMQhEF3tjgP! znVpqc%13vVdJ3=xjLjs25yfCI%&xV}@K`V)JTM>3$HTCg9UI2@<6-=Hyo-34=kl!w zW<0<*vwxgtoSP@_y;*r%l8yA)Qsuq(oD&fzB2Gk{IB~vt+xJ{~#g$jkKiwN!tK~|4 zZL(M@)f=U-wb|WSYAkhD!g_o2yEn()zqzqF+TGPGUTifw&82X&dj-B&DpzWyW?0`m zz1h8iK5tiQtx45>M=M-vR~mKGyu7Wvy}aY}=4g3WcU!yCu7&JX_qHc0rR6Xv)=R;o z#a62kJP|H8!&ZxWpjK#f&53Z0po#tVTQ>!)80_Zm_SGVwYj2is>MRz!xnjHBtSolg zz>cuFx>9NpXS;iF-(S*PD1*?~tvrA{+E z)&N)smdeG|cGxUTR#w;Ri<{-Wu9{% z4BPnKs0WR6!Q;(RrCw~V2N<)}4vs(50YzGppnJC3+LAaA2oHd^S&>T`snRN-F>gpj$gE z1?8|A(vxBU94(^7da<_N!gHW_q1dc6I<25-_$4UTmK)7VyS&m0MjM&}H9>)(B}p(I z^yjy+$>2npSWyjvaTbd$Km(c<>p^8@wb5)B>uozuP^kyR2*oBn3m2Qk@c`fkt;PiA zrG}=*G2fjU-al2Wb;96*aH)ZAS`{%-qsO0mU~E#)%0G27820M^Q>O&vbCb}Ww~*&4)!EjgOYINLy3pr-o|RXvI4b2 z!nzVdwX}kfQ;X0pBLTEXuw1zi)`P`$!MCI3J>3Vg7-7>+e>VMrh{re)X(1tH!Zpt} zftD6P^~(T)WovKwy}XZjh4(ZjVy~VEF*YV*PxpG4YNq?>izvWhtahbYH-n9M&o z5sGIQYmKGz9MM|t6z2WXsl`UE)LLJ`fABYEbYmkp9Gt3!=h~zE-NMG16YlR*&B}7Q zJ$B~OM1I44<9@lmF`3i!e0c{obQROqj+2`1_Il$YR-w%g;jhlhV%Xd~*4?$XQoE!f#sSDdmt{EhI*U;chcI0oc(g!%-g7>$#+Ra9N znKQ-J09ntK_}h@MD_`v`e;4m1p8LNOR4Q~7mBi?R`?pJyFc9^V9v~Nt&f48eKn@*Vwm|`{EG;|tfsgD z^S1<-s2N^_zXgYw9Q8fj=wl1aKLVJ)A85WFY2I|@6%hdJjGfI?-j6sY4L4yf`#6?F zn6K(iL}iAUvPYgf*h4cjX$yaZ&dFMUg$P-5jg%uBBXAO0!u+>>?rO8K8aCVO(rIw4 znj;%$3XXC`59B^$jlloNU=d4&^mE~@7vbDDsxmU9AehW4F2dLFu5}C}pjAhkMsnd9 z@hf+@Bk<5ec-UY>8#{n&Lhd?z^>Smm0cSqoV*?fkk#%6+sJ9z{P#Aw^i9;`h#!{o! zS*ZsX0D1$CP_+31p^X5HfO-kh0vWoXmi_1q`d};(j?k0{9zGXTLwP?gV^4R6! zw?_Jlw;ExAJ@Win&9w#?VLHAwktG>gDL#%z_AM?}J?yQqPyEg$$4qAAm>N{R7m$~l?v**)DH+>l!gQztd^eg_tZi2VwDFB;Id+dT*0!1IYgjvdrFb4+Ixr`tKHywZw3w}c2u}g>xnGxbG39E-4xSROt0Eiy( zBZ|i^q94i((f7%4{$*VE4CLL*KbD8oiLN(W=gQiHHP%`8ZP1z`OsidNG9j=ZQYm#{ z41~>Q1A7d{>rVN#AxZUzXd?GkUl?dU;dDRp5wkcOpsgAHbB^P5DqL+e%cfi<;hT)%X@G7n!?LCkBMms=6(-g)IGY zM3(v)&S_WI|0~j8vf=#VPw06wzzDCL~=%_j5{8Hh-p{mFJ?x>D<>J^_~8LI zS>@Xq@<`S>czrZSK1UILrC2Z>KNg$XL8o46)5bow@PxYw@gZ5Ng=^Rm#};#IO!YUe z_Zp0Z+~AJK(2KqSu74LHWIygsJ2C$w(qA%n|2xaw8W_Rd@5+oYMvHc{>(fKJWHzy= z8aAK5 z6rwI|3OETl=qE@N*;=Hm3zhytOU14IS~8L7{|#n%AMnaDW-=A&FIhM~_Yayf1{fh6 zI}NgCCc5^S2lQm-v_qLmu*|vYFlXkW^D&3HAKn-@o69f%z=oiLwI3dmwO_j9s%UuI zvi6%O9ZpC4#4^5kK_oj7t7~69{v!iz^&~OZ-s*b?;xRJ)zXBZlM&RG+O#Gmx|CHSm z8NMTfs+gGNAt&alXL_)<6LUaBxRK^}A%qcJL%JeD(8ZwB3eR_R+Al%b85Ms2;`SgBChU~LsiCzKOv zhB=3Q2H1=`ds1hVv}m46*tu!sn%J0S+a08Sz{-{7x;9iVmMcqTfdcY$;lg1gfX$q{ zQYXw|M}=B4V36e6EG|)g3&tlA5t}=c!Q+eVA`)HzJ2eoPV;e=fg*kU*xwQnF7-=%~ zpwy^`!G%hZwo^>P<)crI2k&_T&;&=z4a~v$b@ahl#HP+Xn8{QzlOdxHp{xIOMA%`o z^hDl0-|X&X8wQ^5t#2$FO~0KRj=hGbmbRqNjI7CEMFh8GTjw?_avEu2>pVOeWW@7~ zN*Q+QBW~TnpG9?C{1Fr>2TaTu(QW}u=NN||&w3_dqR z)TNPL9QBAO(q2VnEevfa@Dl-KR5D?v^;0eS*24PhBVyUSSgF;dfz=9WQ4njxxk?iT zmfG?j4|2l$TPd#Rkl7qk;$^)d*UUw^x>7s6olX`t)(LE>mx|4jUdrTZg9S2Y&JNg| z|5g#_Cwi6>*Wy4&>tgA|%4tj!WIe$43lPy4Xb=X*BoONw*0IH~*0^XFqp{RzGhP{> z5jf(nBZ}9zsCd5Fsj18cw$BFcm+83sho3eEQx?4qgAL44b^7Gxr9>j(p*vuE<)BIW=oYOPN?A!0tq`r2?}Ac7OsdhWaN|OmSIoABwQiI z0mHT2hL5(`=t$k*cT9rfD!Rcrt#RrmS1Xd8+A23I_47p>Ps1^Yas%dZt#Ur>IYDGk zASs8BVodjJ9e&2t!}Nk_dBfF_IF-lz@O*P*XaX`6GU#kzOqh~6wDqa9k~Ksp9@vwG zV_&>*EKtsth(v(<^>G}rLhj!mci;@?6U31-dw^{`hXg+yK9nhYD|E(S6>Djeq8aYN zHroan3*>5elg$nGSTrt2oim*wi5#b7Am4!g+HP*2j0Hr+Zhmc8$*5_h?({amT zu6424E(eVz62uz%p#yRdTddk`;eaw1PQ?FfPzEhEQjQI7m(*Ll6k?p&=L5{x!KmDP z*kqc&DUQI}BZ~jX@>TqI0OUvnka%YaM=&0_+p>XSj=WoOa-VxfNY=bee0*lf z!mmT~K1`7?I@ukP!0`7}AQ*1(=h-T@(Cvy*Vkl7qIR~pR_#)|cp$ju;|NgY9U!lblGhBKR# z$U*C2Nr&f_8WadD)|ZU79#ty08JYy>rf5V_M7dKvCe(7Jp2Gol>6n>L;N2jDSsV~W zf-^#c?e)pvVM7}cFy|+!o1hVbokGX2!q{4>tRieFbiGIpF=w%5{IU#VZlY8{bpi@% z;>%L84T1~Qa?P;RS;C^Cq6}Ds+Le|#Ade*pD1;a2?Dn~^NayaErS^^?=aY%V&|QIN zzbT^feQuiPoBM|2Du%?cJq?Tl)3Xm`!Q2d&Z2B7tBgKwGNgBr}lm3Rm=%H-Hp5c^L zk3(UVjTYiqWz^#^SREKtDcZ$!;HDlplh@n4HCMgs?O$WPeH;s|+ztxb>#L&TiE{bH z;uqGJ8XY=4Bv)AFwpgcpoEBl!GQd(GDskknmdF*SU*gp$?M~S(B`3f;M&3ts9YQRU zcJwS%wAA-q!sRlG6`u}tq&Z;};8ee`3M6h=&Pw5GSTDiQ7`OX|s8fS9VYvXpENFFL zhfm=6l58Ya;vgq{B6h@=oGV2JHAb^oKac*;RhB9gVIgxs9!)|m6y@L12{BaYAs-Lg zh-?XYPD^-dv?6!NTG0-qor%c+QBEw@YN;B>LXU;KgqgEo2p5V1D95s$b|#ov_YB7W zwG@lC=bP6>S&>26`_4Cx-K=wtZlul1`@IO<@%|+p*1FdUtVT%qm(wV@GpN)sY`4_h zM-Y#Xs^Jv5EP8|O(JTd)A(CysJ`9JP@~>nzVjqYM3&Zdbs~7xlnZ3A2lz z$X;(Vf?kf^9ZX~yBcCVZWtqpaT~W+Lbu;eRgJZJA!xSj9cx*=HhmlwpE?4T85H(n? z@88Is0VnQDg4OmAB8}? z*FW?0b1HWVhQy_!=p~ROvIMqvQW-2op@v z{mXMW_;;P^yvP_(PW7U)!X|@v!RA(RCNVHN9cPlpJ-~Tk9M=g}$41;>zmtXRE;z`y zM$Q$MJnSx$aJp&4I>g~re(6nU9SKIMt%`?GPIf56DLStfDPD~lN@>zpawWsYf-YAq zcu8zqix^S8QAb`qrEycB1iK*T%!!Uj`4@Bts7no?ObKk_6gZ+J3I%bFk5bXZ%BWy7 zyFns?q(lEAW2O|YAgY2LD4a$RZA?VvjeUvESU%<>FvCY8(#Mw0>-fZJId&f!Miutj z$0B_tFPjJLvZ(ErdlRk3^{MpP1{JUSD5^u=W{W?X^!*t2(5>p>+U9z4x z9Vv7@Z+31r!TZ+Ew|1^4;C1&p){}nE`sE+kFo@8^e-3#X#&f>^`m5DJLBHp`7Yja; zp+z3Fbbf{YA)j%vv398xwl^Z>hsO};SUYK`6?%R)Y&NVP`+6Udm@f9ehb;W}h(ct` z@|nv^W4+K{?qOVpy=q(9V5|1HpO`T$s);2`hh2t87@gU}c;a#!Aki$iB{QJ+6Q8Ez zVTRQpt$b*EObbm)W?D>$NOfAFVc-qe&T%IA+~3i??Ss`+YtDnvXwIa?VfnyQXHupl{=tC=*n6Nuv1GO>u3JaqKqQ_epYEP_s8!ctBinQDjqx)mV z9$7pI{k@l&7cM%t-dn0%2r8w+cbqMD+Kv1j_uYE{Pb}>HKX3uPG%TP?Q9#Sq!2GB- zFe&OpbjRinGco0j3<2%&M9iTxmriUrRa_P}F}ar{VbBe3F}jq; z$Yh>cK=eZXs)o^>t8Y)7tKMrKSb_3KLYgXZJrUz8cAWpWVYZSUH+vS*9SeO-UW91G zQ9p{`Aj?)9f56@cC9>k)DWN2liAkFv5mT|}EWb#)LHG%Yt<)i`QF#i2UC1(uQWLnO zg=!LyQGdA0<7@>6FKkvEHZAt_q5Zx;vUK@2)IHx^?QV&QpT6F#`IHon*;3Tz z$0N`uFTBm?jDTvi#KJo@sDQAU8N6*gsdgyY)B4l=c6HS+WrjSjOIQ7WNkt9H7;G@s+GR?oS=sP| zw)8=1CuB?J^ncBayvN9^&2EWcWXif{9~sk5_HE=a`4=t*aoktF(d{G}{iAfW`Rz)@ z?(Ks{Q2Ht3Tl~wc8Lr#s0}mR>o(%)SdN$T%>o$)BOXaY*8U*``xJ9zDwBH=;Chme6 zf&CO=w&223B*V0*?ybObRXr9buj5v(RtQ%Kxyf$nj_j+e4lMZQhD5m9_)t;~KhKshc zSSmVS@?wWCv0ld!AF#9jPMahRPSR7C5SE=t=GK)=;(jvoyVXtDnGs;&imGT=~6rZhu-d zv3AqK-@uQ2sM%Pt1+r9nle*TLl;?T6u}_#k(flPxebWwsI&7}(s>-uSqe9Gyc3VX- zN=AB6HN+mWJ1Og5DouZSwA^m5w(dD_AgoVbtemf`hUjdv(Of=2zYZJ|#WK%I^K8so zWfa(Qm)lb~{C7#_CNExkVgrkHU8R@RH%4+mOQc&x8?mS?rHMIJh<$luIG~>}^wG%B zM9~yOUpiGPE-!~o_f8G6IrIw`-4WWgHYscr;sV1{m6cW~>VAq%=+z<$sR=d{m5R1L z@mAk-?-`;OF!3iNs;b|znD$`Xrz8C(FN@!A#X|!lmc_f$aWf-D+7>>vJ#M6ihHbK5 z$0di2>^}GPzpJ}ToD-!4e(rHx?}(pPL6N6M^>iaIFw&o=CU|!{Am}tJo87wy5OTVS zx%y=qWbBcCQ+2(g2pC-=FMNcti|c+@qT&>Yrqduz3=zc={XbKaO=mLnL%!!Up5+@B z@Y|`?4x^5J7EhRn7Iev!s3bM5hU~>9-<};{2-J<%vaxkB-$5mVp~D$n%%ga+#7%xg z>uVYe(!@o0EHi|6nH7kk%pS%g{g^xZ?k~GIMJC(6a2sg4WZbJux_dJtoi7A$rLF&A zNBa$v$bD(oYlBTUbra7VT3fhZg;u6u$WBz};B5HgXl_)w8)x(5d>%U+XY*s@r%H`> zYaBb+(nUF2kA71hv$r^8(w8BO(5R;|&2i>%cYA!u;)VZa++&8m4Oz^n0!b{N50M50 z1e`*A+VoZStY+}7H8u!V8^ptVt1APsGL_wZ@%C%aXyBy`$}_XqT?OgMH?Z^={^s+Z+-_~gcjU<0zbuVte$_3J#wJpYTxJP&IX zZ$|n{UM@dZGvw322&)*eZcqR_>szJ`Lpy`c1|Zgx{>U00yPWsK*$^vP;W8R~W%I!t z*Rn`NcW-oha)ZAw92H7Y{3uOY%QjOFimglFB!aDQ2|FG6RH_!e8c1o(1h1n}8+nnK#sNET~GUN29- z=NNLkX#0`hiA!}L$(YdgL*-e@B}3sPWk?_y4Hc*n(?KB3?1CV=hTVt@=4PnN(6b?R z^~#;X1o@u>QJYMVzqRbf=wVHeqdqk!&f_e~INwH)%ik4Hg$t@~L8UJ6Uy;VBKQKjF zGU?0UEDVwBf%h~=_)y>hRW?&bOCQkR z>wu}K$%*k$ib8CL%i0v!BO}H_QLYkhFu>(Z84FeYgyck)%Csg5HxuuVZ-}W$HMz?v&XyS6)58R0*Eo-!v9E|aTGkP zFFQL-ww616zOL^`L6yNam4=Cky>Wx|-WP4=a8JmnEWJj-L(Wl!8jph{h7hF>#mV)P z$Ms3Pr|9z9-~qM0Ce)9tRSz7n-M*5vBcwYzEB5rxYFLFL8_Q8KU~wECIt~Sj!+J;+ znnzajR?vtBy&vw@&B<98um^FcwX(!vhMvQRre-k;G4g?PBAj4|MMaG@jogWV`zSWh zoH3r-7(w#6IQLI;EsF?Y*C*FApgt_QB732)Yekg%kA7%&$FP(1bSSr|@Nr#8BDt za35QGzPaAfeQdnQ3(pAsmlJ7!+!JqqXtaHLl-nZx__Ajk%F7FT{0f;N+V2a`Tr+E9 zm(l3ja$rx)$}FsaABoJ&)14yke&!qBD&?EGeW?~;%?aLjE>HY^W`w=jv+6Sxy|3d@V~ng)yV(;LjlakYjdaqy zH^zoxNXLE_kGvx$X#==d?s7fAtxNbeVRJ6yNV z2R@|IO8AWtbCQkL^U61lmE_!tu~@YL^G7bxrZOYio5f7`vyK@$2_MEIx64@B8aMXD zMeS&2sQIFrc5&{%Yi++_yVln^zJUR`>pu5Tp}%=T7B9sKnPtJeT^lESz!xWM)Jm;& zRFkP)a-;2iwnI#yFq_T{{=%{-VakSy6y7mq!aR%sHd1)s5yXgD6@B7X5&xyK{Z3#| zukOr8D9Xe?*rCIAW00<1ARgUYZ4bn%G}VQteVE#*{s+%gpTi~MIKO`BRO^{$`%+LK@h9-!iKx-msyng;C|(+OXt zVo?kN(aR_SKMqPEla#kqhj{GXvJQ#`QqyF=jm9;C4uP$)!8D2J&v74?L5Y zyyh|DdsY6=C}470lZ&`!Fxt}LQxWw}w2bus!0?^WgntsDS+aOPX~kO;Q;7F2 z!vu^x?4b{Bi_n!74LSaDLHufFAO^xFkKs)_ayR+gc!aJ7n`@NB-!4+u<_2{s`_X-y zkR=AWdf)@kqpR16Q(IW61l|+QLV%aV1K?AbV2n$xtO2?YO3> zMMfuFjK<21XunFSDjk>;TVWl1skWCytQ?2BNw4W9^^u(2uhI>j%@*vyV81LFS=IHa zDZ>c&g3GhxzRfdi&xrkW+zqCh{iDBz2Fa9^+rLkN>dlf};9s+!ao7;6ev4O|etM7O14ld;vJBo|fFNLQdD zctlVbAIr^4x*-A+MQt@xRB+=M`V&YzOcYTUkLg1VBddU?4tTKQpqeKk(>O<&o74eq zhXQ5*L3f1aQe4j_6ag7>69X|R6Y2pQLdYf}8ipBwP7o~ZL8!S%f5|Jw|6*4P4UAYR zZop_TeL zlN+tzIrhXw_A{CN{$i0_ck6?hmF(5axZ3v^fjcz83OWmJjlC@ z%Gb65d*aT{w`T?@_6T}b7Y4WYbvzml<Ndf{MyFjz!&AxXo0-wqZfpqiux~Rp%5bk{!kNOSVZwgFA zA^O-w_)D1~yf3A3#V}0W#D{q7TFEr?-DDf#F7q_T9D{A3WisBX$g9RYu>VPqHlboSh8#rcCi*t^~)vCo@)p7B>UNA}po)SYU-S<8O z)3VB)Y1}eHj&7>YJ@6!lE||3WLKod{hl|PY9E?T^g!8E?<`BEo!gFn=$FNO@(!Eqb zoG#Ih=?WnP(G`8utSpy%JF#b#dM-P(gz9+(qMVNKQ9oBRt&M&z(qFQx8Cq9U10!6` zw+}%*#;!wkGXR0on$qi;5eQ*U#5Ur1!cKkiw;oiJ1%%C=S3v&D!{Wj-v7!>FHe4j! zY#A`}MZ+l3*@-kD%#<^U+OlGsNL?POPas0Y?)~hM!9|MqA&FV$#^)-y7`2AtZ@AVT zK{5(hK|q%}DBp(DF5*TFc_Zt(pzcbi)~?X)TP10*gW5S6OG9I4C>_7ElDNAUdB&H% zx0r+HBkaNCF@-_#(MaoL=__05(?bjC+ub`s9C**$c;FqkGp#cDcxLF_7~v*{OV6u# zL~@o7^#aWw8Icolsb9$qfomDhGvJ-a@qk|qNzo9Czg9haLto$4;Pu8{ z(#K`4yKYcFs-N2P<_<*IDtTFCz5ABMh3`V8y%VtIz+?5s$~tNhK8tg_YF|q3>f^K% z4)bCce+}g%=o0W29mr1L_Mi7 za#-NP3Lf;FpQjx!w=c3!#p14(OS-4DfxQ>Q6Vz|Gwu&%C3#%-0W}YDQ)n!YOUvRD znGx<9l6(fZ{5=53X`Q4nGms|+QcMiD0UP>=kd`anK7=-85D(SOFz`P>ihEd%%n-?@ zzhN-iP0K}Oc`)X3*Z0;lTC$zM6qMIa_zu_!a3WQPg}7nrd>F3E`nd$6JnKt28hYKt zy6?E9-V?*xSB*GDEU5)cGz~0MDYUakS4go@>-|U70V`U9arYJW^1vYuT>U_>nK-hD z?MNLdhaz=@&ayWaFH{;GRF*@sM-$gw!A21Pbx=VCDYyi6-DDBb8)q4(Bwfn zKb08@+XQPdlB);tKo98*eIYaOdm z;XOOqo^M=nuYQbRwOWwoTas8lfYd?A4<5$s)^ZI?^prOuxStPEk>xdEl za_8x`%z$?V+Kf{D^%PWg1U#*EIi4BlyX77QU*#;By1uvZ^d3_5-;o(&J@Rd*<*!mq z3(H&6@@^J(OCTZd@5v12czHJ>>aohL#IvuiIRX2@0^60pcSSwm$#NUQ&0@qq* zxQ?YZi5Lb0H1eUDmT+e-vkhiw+P&N(d8m+V)H5Azje6Uxd&?qS_%VSvU3sE$ZUR>7 zMC(F{T{$8@pcGVdBZ&MUa?gmp%OlM_BR3swz??Oi*zArG&l^MH>PLxXvDD!|amQKd z-0qDy%(-q2(tjnIbgy4oZ?(_X7boj9{$_XQQCvcM41cqm2Ou0UCr7J4j3(Xd>4S&s z@Eg2e;kvZzYZVlcDAvv{)*4IaSw9PJzxs+R5H&>3BvQ>+RZNiiP4XtWvPJE;>^P!m(;CRaVz0k=c*0DRG}1pCwA(hcmbsQk1n-!|rEO0s&-2 z`zObPg~~esG`*lp4`Wu z1*7Og6h2->;CJ-NvEZG-lfeZ3|IWyZG2Tpe_0);DzMeWkodM1X`j^`s-Z}j}$vZ#J zf8fiUz~KRjuZTF0j@H6DfE}m**uLnrLWOpRQOJ2Y9Gx<+CASdAJaDoyUO9dE_{qv? z(W~SPLN|CoK%2|u7UW2{|E;(_dNMefpPU+>z`st9v%gP|!?O$U2f zSRtX!v4d5g7NxdcL~AU-KS}=)l}xpX>PCmUxg{){XT{LA z%<=9YQ~h-o<*IuFt-6nQ+WnSY`PJ*~SNC`7rCR7L(cPVAvG0Z+TAQagySLOAp-8cQ zV&!j#i;V{E4#TS7y$&Uh#ZTLIw0o^=c(#pO7B{=wsa|DqWwU!ty|^NOm+%38x3M3( zxv&dy(UT{G{3J>{OhN&hKTo4DBdtxjlP9MpgDLS&{-NGHb;9@Ryy@1B|pg2H5>Ff}tXH#I9hIi1_=Y;1OSorN{gxL6M_Zho+}Sj2Cv z10^g5&CTu(m^($}G0|5m2%46P?c!$j^I!l}!X54ILg=_wT!ksK`61jyi?Y9DjBI`o z-B$k)AECeUHff=i-?XtgTD~2;72yAj$GX?4`CDpq>g~;MxDxhY^|L)p_nU_4BFuZO zU|!irFZX_$n(eJ>mbE)-)~Y6ey4O%IZgXHqVjGFUNGJ<{T`2-dZivCi!ZyUKe&F z4WWU!AhS>1{;5}muQ>WfCpK3W0TDXWsA0F#Ag7^3g=$igXhVlAgK7stI8s2SFe(Je zy3%;1H=%ouv7&Yl$>0h09CmWORBV<2!iBI&ro1(fg=eE-H?QSk zT3!&&SECwv36PH#?ZXlUU}-Nmi^!|MJs&Wf=#JQ+gu=9RSlHV7axA+g;N06`Rsi>w z4{-67H)x*giMBbxth8r4bCLdB$>KsvJ{sNc+59hN70|$lO@rwzur!M681Py2HZU%FCC5I>5yiP%murSh2AvIq%RAM~Y+1uFREF(p@<2qK$Eo207c#xllq9!&1ApZf%vmdmA5&%sES7xbjKOM)=E6 zP;kn3MOr1>ARE>O(L)LweqX#|8XF+z7tZ> zj}cIPO7S$qfj#sA>`@v$th1+kdxDHuypq23z>us47{Wd^uy7k<8%J8fdZPnh3R?>y zvb=PXH+e*2r=L_rAnhv%I-D&CJaU)d6j8Dj;=%A#aQ%Z*ZiqZRcwsBWb#&Z;msTW4 z2d@4K?Rt>kBht{7BP#4sFjcP9ke8d_3L^TZ*+JqIxr54J)oNx*oS)J~o9Ij9IVz8n zwoNdmX$PqB_flDOYd)5#?n%runatX36UBo2~lOV+!>bBuy&ADfwF;Mjjc_5E%8kr~6LnH(B8_S@S8} z?sp=Ule8^DanMB#5Ok^5DanJiv`c6sKC=ATxcVCDqIFT5tdWCtODA|p>uJ3ylS;#O z&{>7ji-;2`+!Ed0r}UgC+?-R@(!?@L1;>sI4H%vECDN(~dFuB}lQTA%8)fnATQd>hBG`s_!Fi+FLz?|D?$+`InYJCq)zH zJT)IBQG*$SEDp%qQVm%M&7g)&C!G)hO!}cis9h*FDYM)`O@)+~$_VOH;&@X8s9Wt$ zsS>uNDFQKlC5E;%tVBuI9hW26(H9qMLuTuRt8da3=Xw9AygmFT5W{Mx>TM zYT`R}_;YJ#FHMb4Z3K4(;;+2zLmh$C+s-%w+4{@_JT++ERgjHiyi%KoA<$xK2pt{ zdk-e{ofof7hGelu(G>VK0<@=-UbVYk8}ulX^f0`mhdT8ha~)I%|trdFzNKuY^Ul zyG|u|_-=uF6G_j-^z^{}+?j)iH_lS2<#!>|#O+qR&`AlMI-*C4$09K53!c!6aeTH* zwAtdQpMc3eA7Qe7YkS%nGk+NAFL`Z$@jK0|X<)?KepkAAVQ8go5s$W6`RiJG*%Oyx z|28vZZ;bF1!>Z?1Jov|4_HuunIpMHd3U1Ui$hupXkUL&Ch`mh~VLz_fp`?cq&^(GK z-0L{0NZvH+y)RtgZ_5n$wPE?cRsM+&vjS?Y8O-yEroRrpVBaK3p8`rQ#Rdf4UGpfOaJ?E{?M?N*FntT)zb!N1 zQ)qKDbT`Gv@d)Rv-q5qmADNK^lHZ>hl0MZR6~|=N&$NbD^?&IhI-Y~1VaG5x6*91~ zOO-D49xaXuV3|O`vev;)thv|=N?Gmiwwsl;Xk`z5`WCe`^zol)=9KM89BKwY0nT!v z8rcP8;hvxk-9~*vY>23##my>BN;0P{XDXJlgp_AWmTk~e+Ng%JQIS3+srj86Pp0GT zGcdr5k%?oPZpf3-zYys;S=IlnRrMMyq3Um^jrRWY!B9*3G9KZby4=0ycl*HQ_TS13 zwKv7F5JN2fyLhyWYmywe{KL!;dt+awXIRC26pxaf7^Q^m19ztWHZz1C&sszcpxw;7 z_7E>wWishwD$@pr?$vioPT{gAB`JCPXMz4KHBb!DyuC#6Q2d-SG0^UCofwjdHRt-9 zhKt>O@@Gv@fgx-|L2o+(eXJDkVz}O*>_A`yb&kjj>1xu<)}r3s`#EEE-&;)6n}Gx0 zL}KdqYK)~7k@(xi{;o*NWcB*F|7`Hp!>SDu7a=oF_l78{y#Ock6&uz|<}*kuLTF9x z?T(YKZ{g6jyuIuk4oWpH(gHU!t!hyhM)bF4?^VUQylc52AuWY>r5lIMS=ttu$9F_# zgU#bE1Gt_|_QcRyaP+$(y(G`+@7g)lAc#4=wI7Wbdi}qNM`%d9;AA#PCNmzR4P!j3 z(2hAfW6JhBjEC<27_OW7y^=Y9I1fYkVX;+>;&UrFA%>KmW_S@r6j*}JS|3weZGe!3-r8?$ z&a{2M0n>g{gteFyn#Jp|Ip)D1xkUb8q@QFt{L0;itQrU*hpPIR>AtHTqyrYD)jC51 zOOH%%LTP+7GhpAAY8vhE-INXDksVTa`i@i1oaDxOk0#lu5_ zSo>9DX2>R3@>7_TVU*NW$Bi^G0$R&#o7k<= zqM?2n5UPJbEU~xx`vY+X?Tzk!);Dh76~mpA6f1|bVAv^&tQbRgYbYTm<4=a1j5|K& zBZ{4jcN^!tp{tcf)(_lr8&CxT7|pFlFiO!76cfEj)jugIUL0ax3}NSuiTH({*X%ns zgsJ{F$s&I@FpCs^!$%FvA}1ZeRPySE_xoBJGf_*U55HX2F$|3a^IW}qI7z<$Z+zsk z%rkd7zeEBe3+N;6@OM)$p z{cHawdzha0VbYg*RCnfPhh*Eu!)6{CNiEy{q-0p_*-aaUm0??PO%iHNh!~hUnvEn3 zq3Farxk}@djtFbY;?kl#mI?<7-B>Q-A_iGnjjm22zgV2ip>tkXMA#YE<)C z#EoHli*cxucB`^nS8Qj46x#&gi~-dHFy4a^Zs*3cMbt>b=4JDk@9?oK;R%)%U;6Il<^+_g!C&`F`$jTIa*ejIA zXT4hVp$20P?8HDYu!$b9Aqco0kuoN&Nk`6A$UNyYGpWK5crG$tvQ)2Gsn);>sh${& zwg!yufDJuFO6D>KG~+V6mVUrlOM4l|N!)O^*Uc)+S+6&{ioaD&_#?^{v7W=L1spR; zf>%BYUKz&yd+uMD^?*%+U48E-529n_(vgIiwi8@CRnj7$L0~{1S4@QD=@$N;z!qRW$11VI4?f%b$9+ zaRxgp#*^}#pj6h4$TsNX=?AT6ItUh*L?F?*Otgps!pOF;IVCI?EoTv7GRB{R5&v_9 z=a~#W#ARsf*lW`^tL|KG_|pjd$uj%m6}z-EsgV~l`@YLPOKcJ@|5));%QKFY-NGNa zB>wN2k=U1nq~|~z{K=Y-O`unRaY-GSkvJ!S>vdw*Ge^3Sn>rqdI2oz#<*;p*vVAGL zW7C_u31;c0oBKvpoJA~cD(G#I{*nda6ILKJFhU@1h!DhZMK}7!gGTZ+vSHaY+6C<$ zi3^&F=z4XoU8jcb$KWlNpJ~u{7%S|P`;7WwXxruIo1nGHC&B?KSbvg=+;w5r*5#`I8)`S}$1Q5pjgS7+e9F1@+ zTY{3DsV(_jk4DBzmXOaKGjpba6%sPN75W->>TapIhhWLF#t>jkXJu`TZX~Cju=S0z zmrlXRFE>{%J^twNjSa{1TG%*M3(vJjxna=Db*E6Jz1$uR-K4k zFgbKqqO@ntzcJEZvYdV82MqNzFzMVW{dIaHf(^wc%1Xq?(@BJT=1>{Qoax0Ol$eF; z(nP@#k}U)`xEy`0f$d7)_YNt2SN)pdA2z90`p!r{Y#E8*Em(%J)**!`MYMzV1ssv| zUPMXuqcIr|Zgm_cwOj84qWr@V(d#G5X(J;)73nWolz0E7nFTH~? zxWCVwI9ugUxH5SaLFDR*FAk|E?%18vApkZNR!_WNq*b7PJ!Mhg2%<0AJz`uGy6qHLVD z`xV)D?8@7&*AM6O-v2&BPevFkZ+|JIjB=G|Z?F-JRPLh_0pqIJGM&j1Nl@ZwfGV>c z5l6RrXG@>|p&*cyVOr1WdJ0jYP8=#Tr@%r~4n<{7$Rx#IQRYs7aF{?){VX+_DEzjH zvkJ(lp=>LBK^@v+pOM_GfXd%fWm0vfL60?Na|UjVAkE~i=M|*ljhKTz**Dt+xpbUW z{c>mUj!5fd8F=E`%$(_=#RC4%UddTuGNSY909y=l8mpdV|nN7$Omw`tOtli7e zyN7tm%9Zh>SBHEBsq!M`YsDRhH+#cexTmlb)`C%Sp9;xvW3^pb!JTreMckAU;--|= zm}~Ew&U%o7TWoEZw)z6iEd%o9_Q3ETq=PiDEnCa^F`M`s;<$lf5>^ewMt&;&k za~ZAH+5Jt&?dqL8XNzMC@z+!_;6VrJ6H2z*nqOyF8P*W%_-BPo_UFH(`jLwtH_i)V z3F~myP>>uBB<-;($8p`>O(C|gaE=C-mOBO-m9H8dAfI5YCzBxMs7y8NOWOpJ^Z!J| zm#GV9u}>R6{qsnF{inm+$M?I2>>3!M4&EF~H->J)hnE4#f6NTYoo2obFL&)T59rC7 zt!e4W*w_Y?TDbxCW4V3(l)JB+Lg^`eWcAN0GPa?t&=R-Y62I6dX^H3l(XcBcuhkO2 zXET39v`4#Tj#jvUkot%=tXQ1a=d_Uqp@;7~H#FjpT%Gk{!s} zNwlL?*M@d96s3{}d#f0|p$~pcAp3p-etsLs-zOsF6z?JmX|JRAg*&B_kv@}k&hvL( zt7G{ZAfa<^>pv$9zqqgBQQVSBJ(3xEsTheNn(q5}lrM|Xc_K5CT$!`@3jLt@LHl2* zg>c`HqGPyq=$<^JPF@fgvonol7lik2bwMB*bxc%xpzC&>DOk0C8AmX*6_fW2_#)1e zOH%GHJYw_$Bb8O|ORQ37MOcIK(6l_5chYC>41RlLykuSe;xlH>G_XRK@3Is%Lv-0g4|2(}#0Fyw zVr41nU`2`Ih)XITkoSo$sn!-3sKJ~uR6Lq2S2S7YeC7JD)j=+-|z>p`~I_ zPO=*Phd83_Ywchm#QQQMNsrsugUYMSZH&T~ydW@UXBx{c2!5w7Is@ul2Y*a5>MRNL zAidkjyXv##B#&U2Rq(|F;EQ40#;azHUSOm$%6;L}xcY7X{)bT*rrD>%Ird6m~Z3DS_^-@jU9gYhzQIx0C7H8QgX-C}Vh(wzUmGC0= zo7pa`&CNSkYv6mN7OJm7QF-I1&BiNlciHGfM7@;l74kQ@ldqSk=ws7gH~I$J@?@m@ z`1Oizm*0KL@TG=LtXCsxSkLOtZo2OQq8=q_4NH3(s4)=Abk9&fly?zR2+3i1v4=k3 zJ(Y%H5FDVi`v)>Z>)=*ppHX4!efWrGeWV>qy=Z1PzYUiQ<@Bz@*i&@W{+LC@LZ53kr#WN_=g z8ldq^XR@KmRJPZ8dIZ)JEE`IYs$uK10|P=HkgJ#Q6YpSt_=RK`U${T3oKcV!+oq`!xy&QctTGQzZMleTlY}I!p_k9S~=3 zM0$Ruo@91vJO^^ei%%Gw5t!OjzB%BSZ5O$7T4=hQZ~*OgNk2lTnAm;B?}$$eGp5m#2RZ z#>u*NkM#(wuC>j&)8}MD?u1Rqr5s`Dw@!dg6Hvp*9G3aG6CxjX)8-A&s^$ac^A>q_ zCS?)ZOxrYB#J4>bhO*$vQL73cE7C<^+C+%^#7tE6);EZJ;63ihl(rO%dy^}rqbGv-#C1360B2h9u9PjH1PT#4v(R{wVeAj0MhRxY z68_rTBjd%-EBWMi*m>2!iZH}=!Uj|4t?VdW_qh*6j}4)F*6ap3xPSP`Wl&|&+rYRm zE8>m)`OL^(H|8VH*jDlPOOt0)M=Gu-P5wJ`r_MEtOP5aJAY8jrteq(YN1aMPxWT7g z+!)(1Uj#gUE8l|QRCCYEjo`2xqOftPzQG&!COO(2!&e<#W{QLiodYf7R+ywbr91w) z3GA_Hv6}LNNYX_0u6mnFJ<7_IaF5_%T$Hy`qFh+5hUhKn&392m7Kaj*{-jgL@Q6Gr zuNY_^Bo(JuCvg_C@@%LAqY%7TYIsBB>KZZY-s**cbQP^Zg&&Kj>^Gd~CD>|>{7n$h zSV}>&0asGEVJ#EgufPwZkoOWyC_3dWZw3XqGVRmS-~*Bd-!d=_X1p}8J3mv-*_d~^ z`}=WHIe0^ZjS!pXfyyvqbN_G0PVT}9L>fHvOYVU-7$Vj0FrDIPf5d9YkqGtp<;u;M z2aaV$08uDJ*6!n(gs?j(S|GaNDci>E@Ok_+W<-<`i7*Gu=yfE^n=XS1yoW% z6$4d)V7Viz8z7=8F5X?2SHuvfdl(&@P0^W^;!>F^;F>)rIt+&+eKzKRDw{np4o+RR zC}-3mRK*JsF@aq6#3?-AJVaz2ex?~pS@k$DPR!Q0pRgK^@fb!~^fnAO-}0)E0i(*g zuMT)T6iv1VpZIFL2E7Ry)Ox9*zq$dRIulp578XHIwso6_^Svg z4`q`D{k`#m-u>Y54((!y0GGHNN%|NNsEZ9sq8fw^5Wf$hJm zpTq)Mebe=T06Fetp4Dw@LBuy?2HjohIMa^bP1_h3>SOZ2Rl?AbuYE)N@A-R;fbtHpEfCOfx=Gc3O4 zdYvcE7~O{FZW4Fqaw}Lb51uy$wCV{G^u5(529kFQYBeA7!D9rk+syT4U7yU!cx;~H zu>mg}O9duJ*UnZZf>YS?YErf+7XPu)b@$Qw#+VJ%z7j(lii*j8-;k62+=`F5cCzn( zx`Lu0BJ#(KR5FN~Aq8RO)plwN%fxkhZ5*t4S#)KPuQnw+tq#mi&u{uLw(RsC!%jda zs)SFgaDHm`Ia9DTOD{vuh8}_$zHvxqc;Od(q_NDf4{>w%@j_Mw`7xB4!;qHVQ~&I8+GQ4-6@2 zpWJmr+!DL+v8(9F1?A-3vwy$dkf$ro;fLlA!1WZnG1!G!r0fiFSYRh7^u}TD?Cz_zSC_zz> zRBoooy<`wU!5cR~u6F>CtzIfNDPiM6MU07~G3NxiX_KXhqbfMQLN^)V$VzVi{^LuP z^Og3*qd41A2eW{d`}fy7^_A82eJ%XfAweQ1n^nsS@+eErY`2Oz#aRP+>I57o;vJre z(g`BbgCsv5(cSDI$u_~#+FVq>jA(WBYn;%I^bsFXpwl9sn=&G$0T2;|8(i_Rf()+^ z{4SzDLa^wH1KrZ3Vb~bM)sQ<4xcJ+EEi}TX1_GF33;h6ot7gN#!p(3<@v#T3>g@I_ zt{8j&<^~SiZ|iQCx3Vg(3=duZ2B7*AGXtWgR2`DY|%HqQLJ$7P}*Pfp!sc>Pzc!-ZyYp$*H6f9 zl1l+ajMOs2VE4TAfM5MHE<`tbRw<3mE%Mz<-~4@i4PyiP8}F^&oEqQiR{>0SW-F`W zCK5ucUyhg5?UGy!Wc|cLn0RSm-1A^23o!#KqYj6{DHF4Ry3YaPBdGh8stM z$Q~pG#JXai?X8~44C2wWCMN?WeH$Ocz} z{h)JY?Q*9@dF&z=0*Ppg*i@yXaELnA8ZF__;>-|o*Rf6`y**s2(D{22eHLlApA=zC-mj8;?i(h+8Zk?_?FHfptW>o8Kf#>ba6e0J7b%TQfG;xnYe+rEx-|}Q8u?i zeXaLy;hT}?9JCq}(t^kdcTahV+UpV$NJ;efBOwFuXzy_=RAOA2MQ`BO?~ZVrZ{_xU zL%HNbP8Y`|gWd+lg=vL*hv6KC$8h}&gTVt?urI?ToBoEu==EM%vJ0;Ny=TPaZQU>0 zxB=5}CT`sQA+sGoFh%zRoSjjGTGjTz02@*`ThMx@*)~@Y_XKchzg73w^AbaDY?uh{ z*9fp?9)(l)>rg_&Y*)VYvmbWp%k$&*cA!@TaLJt=6p(P4P67o;!uW z;mL{oc>c5wUluPkDyR&DwB&lbBNi^cu(cZvTn56|tEa;pZLA1b^}u!Y8u%-@TyHP$wo-y*TKdAsHIE+hWm z5eVaBj%0g%MaqOO>qrbw-$!3{5=3-HkZx8wN>vz%Y`Z;ei6>|>Vm?jsM2Wm0W@>NI?jpduG@8-Aee%m%!y=OcG*i&kPteT+k#6GG zGf{EvHx2DI3}QX=#S-)fdhtkB47+Xb-kJSj%mN+6(g)SyxvRhH^x>jyJ^Ix^FYVfOgRq8X^)Ys*mmzQC~OBEu##*dEIQ8fL*@ zeWRTEE6rsLv)4tZRO8h9!eZ0=4tPA96&}$Da}V?$Bh2&7+fs2RW1y4`e4Nt9uu5Cv z@OuU#9ofwNSfG#n5hYKunqdPlHDm0Lh4)7j!4~KUu#<+JTRVGcYJ6$~c82&XZ~iK5 zAl0hWKy@npU-1F1KHflrHU7?2EKH^uhv({2T)&{cW4~!H_;u&HV<_Ym*^a>=m92qaTF@_i@PdFc#b$ ze`~A=CVRUK3g(GyWLYgv7S&Uw^QgXoI4zl@Q;&2Mas)|qi=oV3Mqyu6DAK37CUZ~A zG`MDX5f+BrHSik;fY}_*rHXZGOnt=}GZnT81enTJ51^8NF``0Q1)Tl-+y!pkiJ_5R z{03>_PWz`KaKx|Xq{<6>Z`4_g8VRwQza?S57#R{jjU`YOx7nHVRI9dI!Ny<644=`o z++`u?rf=iJ&|@cP3L8skPj{zgW;U*U=Iht2_OU0?{w_1h-P%va7{vX*@nH~485V(g zBts!Ka?;JRR}Xf{#tjoWrdy41)9pIJm0runDN(exadwLA70^79c^9o zw7MkL`LJHPv?v4B8#W5^>H^BlrqB|5_71n$-G9H)fowwTVt2Dp{KY_SFvyib>uT>i z1739$pn*y5qW=t3iSCJt4<^ebWrs;H<&`rhdc$nOu&o#qR{vEPulQ_WGW9AOj+JM( zrCz=P4fVw2&I~!Ziy!t8(oF8c?QkWYrc4D`CP>X@dHABj1I5zmzGZDlP;g_Upv;=W z2u~O|z)}O$Mh`bGaJ@hy3~+lY%J|nJk&2x9eh`C7?N89oJ2t@R`ht;FZEg`7*?iXDnhMeJZ|kcxpU9E_@HN{6_?$ey_T z^H`*pWRs}*bB1Fy2r_~eJwc-1vgQ0Cw%a!ZKQPK=)uWG~o`u-r#1`TmiiH?h=8>;o zW1@5iF=f@E`aznwQ@xVeRPXK;E{41BZ9Exv8Ob#KYM;1Bd~;?<^lWo^=k|_dO~Fu4 z^L0EaoI9~d?P!YhzHkZiy_pe4*Lg7gclDEa&~J=rMh$t-bJMX{!G0_oz>^J2rns0L zV{C?nKe;-ox`C&hfk~a|$y>qXO`RsI6565MT)6~Bif#m+opO?E&?0|27_>=24B`ar z1{_ovwxO14~uD#6e6jhU>6=lqcK4cTh>NzMRkL%_tDA*z@;NZ9+g7*!&kVn)5k%j9cWp8jt z9;(OSPToeX*0@NC11(&bK$rBY3v{SFj{pxfSpfJ2)Nxrl&kL~NhQ1|i6^P@JR54Z+ znx!Pi5;7g?;#}iMUd7?-@)QS7MB-c`I!1_I2d;K$P&Hr#$Qff}JF3&nX~ z!|?Y7Iw&^DU>X*dO!eu&wkGAe%;=_WpIPMN1K9yctaVGwcivD8z~up6L} z4`)wgTf@Yn_1981iefc3w)5E6yNz#~A{Q!nZGIb?3hCSZra|`qC@-TQG3jO^dA1cS z$6$7!#{->E2Ip;=0UJ;S^*AYI2qb^&Ln?Nj*$&2iG}A~lcdB5eR|gEvVS5?^i)dF>^c}dVkDyjScNtx52w|TXLI@!} zH4yr7LfW(QVrPo+S_N0 zFg$ia|3EgNC-0*$-OGXt#@6Ycq6%op7Z4RwabQJTAXH6H)FKnhioWGnUSC7$iMTXa z2TtUby=bZO4aI%J=&xd~WV*bA7|K?EfT+5+`uzhDmqIZA-Y)lyN+tx;{b?sdA2aP2?`EiFBp4vphoyi7UvbRf#LeOF^06KDDpcMIY;;k9DVyb<>CV%hQM7Z~aU0-Z5h2I!Z3nAuW_LXvlw&AQ+Rk zFoJK4(J!rET+qNa-RNosU6UhX_-aRDbPR{SsPH8WeIU4BXgJDKSbxd4CD6awS zy|>7dkApqaMrT>%9m$SShZ!fLCefIXG%Kh*;x?9==2mld2WSK}@b4pPU~4%yzY^&s z-glst^m89G9H&7LzQgWbmSMR0-ujU6Sc!TR;|*Ao!C9QrUV-rW%uv3yp9nC-`+ws@ z--gyOdE&dT@K814M`Q|}=$$rB1dY`sq*!ti5a7#<^T_(`NhG7qV zeOvC$S?#O&mp`%`%%7smk%1@{$HU`-hg0f&hT>rDd{jtF;oEzbSQx5yphIvs)0@@L%O|7NFW?VUdT!%x`jyS<7uBy4t|Hv5eu;jaoS2%N$`|re2lF$B4oy$x z4^2(Y=cXqQ9-Nz>nVX+3OixYY@7dhRlT(w2@-zAQ!u-LYfcH}~b2D>=)4AZJ{S_RV zJalkw>fqFLaQbv^v$L^T{X>lM!Pa82`V#)A{t^A_kLh0q#6QKa4^_X6e}9mDU*0CA zsQe~c=WYja0{ov5s(T%fSnagW;_Bjhd-EHvB(i@Ny||R?7|KN`|F`(Ghw`7M_Is!K*4J^`sV6wG#tIJQDPXs3$;p0L4MVWd}40|4puAZh--W~4*gG7g%g|;M?ItgpMy3*C%nOFrLEAvlSp?Ak_sY75S6!Z+h%wH zcat;oPo6I|q|%`pl&K`Y3|9e=>!=WOecEUaOaSdnVQ)Yz!aY8#oQt?0* zyucRqZ2E&xe8lK7S!UE%R?_p$L)ow;!zimB2gXS&17QAOCQ`zX%BaI(aKgEgEM%4; zl~s?!VD+P4Gb)4;?rR8W-`rTomL0-U`=RWKYh?YO5&hz>*L>-x>e>_{`pVxJ14%0$ z5h9x9%Zy%Sk~Odar@O@tJfv{#hA0vgG-pU?GXYlK7Tk%2?|>l@<22l<>LT%Vhh2@7 z^`8+ZMfxhnNlD?7+(~P@He}Ys;=8VI@y!}o^e5n53ns|1QUP7zIIXis>ti`>4V+az z817mcU3=%+*nzrzMaZESdbR$}b$TUzGTTBA5T46t^Z~E1Y}#E3n_ZlFmJ&+gA)?lrNkGwv?ZSvvRK|47btXi@{P zxllxN2rhR6!9VhyOO@hs1Ab*d7wR?YbdeuDhhHz9bA$q9u7F4~Fg;EhoYQfMYymEIOI)I;zF?6XjR%3d;g#w z$Zk5`KRiy%)Xkzd7+!mCN92ap)9`txo^Kw?hPVu$ta=<6C#`~j`8$W6Yoj1D=*xqN zD{(%vc=vrqJ6f~YM$NkKp)iTOOAiTCOJS))0U@f|fh~ConTz~l5kOlh!mSlyB)a^N zcH}GPC=x^WF8b=mzOirDY?@;}0>1Y~xzTQuY!lGw%@Os>l3TytTYWInhpXbEG^0JL zJ(gw~0O1cI%R+_{<0!#!OZR;|nxcq%<-ydwwMgw@X~JLYhJH#kkwY>w(rd%x1#lMAm=8XLoxm(oV)gk$wl$oiHX ztB)8Zp{*KMO~g7@cZ9}t_#V|yO2=x{?n)+YoG#ptXxqt?!PMkzVea63ejbNtu|YaN zS18QQ&(W^vL}7Az7MrK@`I%s1ZgT1nUQXu^iC1Vf3wLa4ZZ??6PtN9N=jRSi&8t_3 z4o>H1=4bJ$FgZIjb!cw(pzy@7Q#&&^J3BWsJr~g5)3Y;&rV0nCRWLnSK&vS<4X_70 zmB+x?zZI|Gz|CO`cPfupg~_>jz;h@sT2Uv5<_om>OJiX>cka-%91Ff)VJd%cCQq%f z8$2~tn46oP)esg6)A<56c_%P#;Sex8I0KhZJCLA+`7@ux--<{DL!$Xyo<@}PvDC>G z2r)q#yw`-uVH}W_s3PDLG?~kRs+u5{9JyHnmuQj4xQY_BSt zTfd6!tuyKRNh4hm>5Ox~wMf1!?)QB#p29U+L#2VWf*r0JEmpLKVU4MuXD9timDW-R zm(rKu8#il}uqj<$*kHqUW3*!R4~S%YtG{pbo7_uv=@+%_X`7(XHA-zrdxL5|-5DH} zmncdr!<%g6GeB}VR6|sRdq|y-L~79b*gd&jR5Lk`6&!*#OIgvN`{=~z)MR0H|LCFp zYZC>eFc-!UO_z`GY+XGYlZ^{Kjj7$;dC~5`41`%U&Qo{mc&wUDi)L&{8f=~#9hgx~ z2m~?SwCGDUoIyjVkb(u4TF%fX7)X3Cy20noP~@~r6z>-0p$mch@3i{wOimJK38^;i z@a%%fm>P%qL$razSqqUPKG`Z4SHrR3z95gMyHr@eS-cR|kU)+nDxxo+U{fHs>lmOE zZSlH>zbUzEv`$pPzYAjr3S+x=!Bp$4EW!+8JaJgNSbWx#iAOy?dXnvf!B$%GjV^lCg1rIR-9@F>d?f3M8zTUNP@}BW$?mkbo zGe+0;qs7GeF*JnxeV&F;9iHhRUC)eo}g0 z>FwWzU)goV6~e_}j)wS6|AL#L{(w>ZGm1Coko~P%%pIJj`N*kuqVXJ} z1ajorL$ewhcALY3>km&1Kv9*=c--4&~SK;nXzZ5d;@#t&o~KG@Dm& z&F2fC65h_u%qW>bOk-Zo^4u)I5gkg9R5u5wB&Q+fLI_Y}k~sO->@-3x;#uLKmJh^Z zWCwH8$afbV%0Xp^^V8D`G@eT^ZA2nMrRKloKj@S&#Uid5q?1nn4|cY`iDp$|Dmau|InPNzlh}G zAJRzbFXBA$55c8Xp$TDZT?=X@IA*kXCtI7OfB&?ze1f`HeA(m|?B#tT4}6DYW8a z`Q9?D;WWh}TFuQ{ZD7Ti$)6P*#_@(#1&?V3r_>2?v(y7pj4c0?&_1%S0g_y51EDY#ENZf58V~wv3I;BIeWmk$$jz99C(v%`@|btOC+WTyiKPkh1nu6njbromO6ZtpNHhk^5Uoy^*Y=d8pged&QBS(=}+%EBwn9V~GqQ2L%QT4LF%t$@eMsSc>=#UB`*=D?W}8H z#1hfxqHFz4`s7140Anj#L~Y$EqINWTzm6zke-3r0F6B2a)i-!CtA&j-C*0qtzXmoe z<8Iyu-F|vMJ#Fv(dj%mdA}s>kAH(d$1-MbXwsEmpT;2Q-{t_Fco5!eB1DzjiV!2Eg3VDgZ5oNrVzRzw&Dd;P!TP8p zSiP65itFR2Q~|;%b2Getk{3^$`hh(c&~xddir%7a^kHv5R`g!gFuL>lTSE%xbB~)@ zX47Sb^T~%r5$S|-cU^A`+-^{`?oyV*k_hMM^>uSF zoNe*K4;tZO%wyHp^{R4bE2wr_ZM}>}o*Iyx%O7rldx#gp-GKJ4H{M)6u2RTnUMAhHGlleMtOTLAXf0A4G3V0R;W3 z|LT1#Gor6U{}n9yE=V7Yo)Mk3-rS4+8b#%GCC;R7k)nqGg}I*}QY1h5mp)OjBKbu` z%IFXw{@0{Z!Xu6`-^1ful8ccMilvHdL)8Zye<_biFed& zDq*4zlI~AG0GsAPT7fR#5}6Vv9f=_V3$M+u65F)4gpa4BHdX_Y*cmJRzrhv#3j7%CDm9g!#%=5H06m`MvqnbxK>6uOpig z*j(!t4jnDOPCw|r{?STZWapa_k;k8UK+l8!rJ;EBMWXiJ>QCW6aq&2cyWI%LK5t3= z6QT**1G^bv>sIliK7u1wNDYSforU6;B^19%{~5?e{(=jSB9^g{yT9oe$i1;q7`xUM ze#(ito;qGxUMWTbuTS>;<{hXe{LxcrFz6tCy0NjOuQRL+ABd&lGYPDi6dHc%kXh=9 zMHNd}Tk)HZi);!q(1iTaU2d`(0M7F8i{DnYDjpe^hoeVU>Cy}Azv3`8%s?vsB9EgX zKV!L5D>miz6uABchA2*3RqFOYnh<>@?^>8YDQroR}GCZ^DL8QiphvM26z z{7IyjWOe+N_n8UMAP9B5Ly?i8V;;qVTm8oz=22FoxN_At7wq!Y%;0+t@rR zhcb5Y(aQ@fL0uM=3IBig-UcwT>naoUPi&{lv7NN-PGZ@~b6a*xZAmSuZO4CYyW8y~ z9c;(6)waB?Zc&m-Qk6?pa#g9jWl;?ABtW2m#dHV>1KBk*16jxb5(b8QiM(?z{KgbI;#B=iGDc5(pl! zV)1!LEP5qf_>jC`bB-e`09%w73L8?&g^kHIB_EGBXJ!ItuiZ^w^sSK2?VXv8d+Usu zkD(r>?blu#ua%QT;d$R>I8l&+6@@>bHk2d^c}+vJ1sCabUgAMjYf6bSP7^sNi*SvS>(ijeFxAi_jhgrmI;74X-Np#HxM&9 zEe&JaxN9^V87WylZvCiP6%8iK$E!MHR?IrCRs6(-h!2ISc;Zg#&derteJV;2^Go?b z{8V49DN8S?ec(>?otaH^i=|;RL`yvM0Guqx1*r%IHgbIWrgP6ZCl^D{?Y>;aapMrw z`u}Fa3((c?MBl7((o*9P$8w3v&v>I!d*YQ?4HM!3at5iuAHsnTm? zqM#DMa+T|B78~nic{t9rN1B7fL?2596_O((B1jre=$+)YAfg|N5Rot|oFukKnwmPJ zk6nC!DAHfD@o?~)42Cr@Y&={OizzYBgoc|i$!9a09`zo`d0YbgG3!gSw*=$wSpzU4I_#P#huAzH);~?ubi1b4w_pivle0 z<$Lxl^(WRa=z=x&v@_@R9p)!kuVWKX?iV6VA|#6w#UKo6+0y>PUD7W_`b?HCwGWs@ z)BuHBlQ5*&z9wRRS83FHTE$N>Dka1HN%XNhy}!?FdToaV^yGDv0J`M56tpIAk*aw- zQr;xRNjv3gDoASPBJI-c?#8%xns{9s=ZNWhUiv2MIj3P!FU~cLcE^)u%B?Ox^uU;` zLIl$Y$!Ar_W4)>n;&n%f&;z}*JvwQ1#wLznP{~SS9Msc~q5sq`8TlemWt7D9U!Hr; zIR{Xf6q2_V97iEi_|o~N=SsCQ%15PKA5xnYNGBu8;{ z$59SM`b(CpPk-6)f(C|l?WHaOi-|_x_@?2JsJeHd%z`AY5Thoy^}%6NYm)R+sOyuO zxq_&W8M?3ZGPsz3hX%e$$0A>-v&)E`1z(8K+Ftp_vB-63HSMnRU6~>84V?s?m{I38 zzNw`{p+!Iv+4MwRKb#qY#<~;e0&U%XnFTT(YDz2lKAIV_ZtYcl3AFXzM-~Wd-;ss% z*Z#tlXTOpm5_?qK4ibCqqjw~3YYoI$4g$E?X1?*Qu;_`tU(9T2eEDcm<($0T5O#yl zhHgD%YyU&dpa=l1WoWrZJS9{Wz*@uFbCP>|pGmPvO&>DKF9FNAO5 zJZ;{j=KSKff51O$yN*}KW2YU0<{ph!ynbQ9-l(w-tS@yS-EeH!fW zR(>azpr5V$GnZZ&7wVb*S#0HX*p7Fdg=2*p?%h`YQ`AMOjHcMjFBFdz7u1duRfvKi z-gv76;lw2MJSv_P>cbH;G+$mrQePVrg_Tamg8LLG;3Au~=kW!wE1|KBqvO_}5KbW1 zhd%)oOHMb`O5*UKj)MGqfCF5DiK3w`SDdn5fN@5-OO*^spchIi$!L1w5SMKMqJ zdF&KoD;_$vd#aY%uxT@vA~t;V$SXF z;-}ivCgsDKP33$jAOSu9^Z}ffF0N0d%*2Q(Kk&h1>7^$m{&HqWd>tDkQW=X0dS3b_ zlN!OP)Vvt~`g9-oVCoaWf1DYDeOu|M{z^9Kg|heV(?;Kl!hI0~DH@bT0s$&(R@W*E zX4Ca5`b;2P{RTe27MZ^YIz$9qbd(Ok-nM40jep*tyUj{Ae}2)LKN?szf410Jnju=^ zp=WZ*=ofj zhcCiMN2j_xWR!R?sGCzp31^JJ{=J`mLgsm-`@{oM#`kj;gJmkR))NK|nKLIn(5Fm# z@qaUXB}m=Mq+Gd>4^M+?u9lAsFr`^y>4DObt~i^I^Zk|&0>f;rk2;)&vH~KToRUo1 zbl52+X$g(13SV(>o3&)Zdc04>}^ok^YkP+ty&4_Bd-`SikM+ z77GTDR@a|;5Rt4a1>iz}NcN4SmrITz{&f<|54nluWcQv@cD9!6M{}<*xXr>d`~GO3 z?7RJKh91ST8up#Oo01vZ67MWma)iR+=yu6HsG_$^I7%Dn99R_t@h3#$uK6<9pCXHS z6u_+&RUCv;C+kRbnu1tRc}F>2oGKbgAgMwTV=F;yT75FGxU>RMgZdif4tg>K5lO+D z@N6)`I+zuWQ>z~LAw$F>u1!Rw6)&w6jlstsi3lJe&^Bc={&SJ>k_Fym#S&QfF$=uQ zJwzdfy`zrNHD`rL6F-c1mw%o@wB-*4*LSw_;$YW`(%ilBJ)Ys zz;Ce{SWlES@Es~EqbH&f80f1TAA&p*Ps43*Ji{_xn@G3<$`p-#uyk0gv`Oj@Wwuy8 z>1DC<;PUW;Y3?8pq+qRmEA(1dlvNeJQQD|;Il%g{1yKM{zgMT`NLr}(k3((HMy;@dV!0%T5dkK*M1C&3UWy9+hftcE@9GUqB41kw9>7Vf;NdV!?7mtJ zp|qg~9=;E$jW~t0OipWDkp*#E4J)j%pr5be+B|cmofgLwf2Fj@x)}urn2MD=($L_t z!xt(UtsV@$^Ztj2aY7391?St!<5%lY+sW4&BJsq|uH z)~&@hS7_utm1S3(&8AF2rLqPy8|~E%)|;cQ|4IIWuZcQW_2NEP~QmLGM?=wCDlDuuzEw6;UgpB0t0CANHjAz_*q{J0yzr$MtV(F)- z&wLA zIL~*@IJMmCbyPzzv}K&Ta!j%9WP74%U(8NY2)+J9t+6pf>`}zcGR32lLbmqXjlmL= z#^?Jaji)AjlQyI=eI;Dy`_=>KHZs1bSQHt|Fd$K(S6g+;kcJ&emqzJIysPiRKk45|Ie4#8+6RwW1Qw}uWmM2*sHyPHNUU`daV`s zT!FC~HB9)poL`w+$PeNKeNK@%rUn8p9EXQOny@f$;rIxRPhYv2yZc0su=o1z3UvRc z5xV!;S#53X4smO{jiL81zE>_W{!L`;cx6SmK|DQe$WH^s+xlBrb#_f30++q^&@~E$ z`|@Hzo&pr-v9JG((0|zt-MSe&p?^3vBZ+Bt@liYyE()1b6Q23)Qrq^-rh7i5fS3sX z^nvJc>S(HUoH{r6CQ;1vT0M5)fjN1jBWS>@_I^1#%gWep{aJlChV)^zuG3$*Gctpb zp_tRObcW2vkO~_C`@sou&Z4BP%rpPSNMS(&#t3MALV0{By9x;{s?xslcR|5w|50cn zxc(V!SmtUl7K-e>hsikD#mZq*5i}@uly3$YZ1AzXe1MYvs647qM4{sU66zGe9#2D?4 z^v$$dU4H06U9u_>t0d%z-9i0y?%qhAl5;1a65PX^;V9@xIAd!EA}}Q?Gb? zX2MuAXT)60nls7%LZ2l2;=mg`UK~rZa}gup{(K#!1g#x27N{p222=4W6{0d{_3Fzt z1Q_#Sv=1RQcs;mO$SO+oq3*59EPy6I6+;>1l|G{w=F?p>%uD;?F}D5f;fK3^4N#Rh7x)5_zxQ=>Axd` z4JQ6S?UVS=E5$G6`wvm24_-S}^kP&c;6+_+ZN@zXau;gV)m8nu@pOdu!NYln4EPFH z_T-Sdjv`a(in=K_Qs6MMRt@6h6Yi9vDmf2t0)W=G+nnw}qF;@WsK{VVxN-hpBVQ() z!drj9tg#-JP2syKhqs?KFr?V(yDJY$lC4KEF=1?2uKjdM>rsVM9YZrkU}^a1RM(&A zz^Sn=#c3a9%tlV6a?IA6mS@n64DqlWd&7?Y91`0q*QA$gQ*VSq<9EPS4T zjc7zajD)o*F6U#~LYnbUu-Xu?P2uOb&7`Nzj+FQlBc}eu2bFa^_#z2mc}CwWm$q(? z%r;qKPJYo)lSTte%*!HFAST-O$~Pg8J6QMcxP$j+L0tm4Z2IeGM(2an1wj1M*PmT- zip@_ z5UReW+Z$DBC6u^=F_cl_i3{>aG6Q)yNWC-$gjN?Hd8V8!7X*I2a$zvXsV!mV*DAOc z@i$~6QlblqfhU57Wz=+y&E%MKex*;&nVT{MA|_zX$L)%95KA)N^wnw|1z(ZWqH65f z(;+dO@c9TCSWYNy(6%nTCpj8i_+sR za>Fixn6uTD8!2=pa@$jDN}V>@jZQqRFc=&&2VXGMpYD6=8AI^`-IjyDS9x(Mxt5~R z6qMF`E46P!Iij)P?bYK{>lSV%oCIO7*TawOXQvZ=m@gkk?lx55$|{v+C3UFwda%Lb z3d6d4dgt<#@~H$%D7jNRE*R)atgo}>w0bmhXf=v09S%xr=F-!fBI6~?%%?wXC`bd# zGShbkNjFF@0!8mW`keklq)lR5UoQ|{A>*OVp$dTr=fEhQUus(%63I29|DMu`+lF1bu@3_hV* ztk19Uc_mH#bH#jp^cb8Kd3+bZN?a&Z7Z>>qCgL1O$H?j9nV1E8G5EBonKSiFDWUMD z%&Wr3VQGOd^^zHJC69ZG=$1d+t+YnN01;-)kPX{+L>-bpr?|>~qqHoPgI%&NzJW_5EyF!N}g z>XALmk-V1^!p~>Ov_7W-vSc9?D|HHy$m7E>r?s_!s}74x`lcFJKhu>6IcQ1FAIO($ zFxc0XHhq$;7-)R5c=(0{J|j%Eh+yTIdm~h#rm*;tEFv+i2Uj)M%nm@^vJm>Z921Fa zD%pU_ExpZ7Fix*MV6mQw(71IUv>ZoT+A1SI73nWo^Zkg`d>R;KBj@Z4c{``yY6BU@ z#QJGlPz&4X1fq)tOk0-dxy%;ue9FnOl8AqL08SPUf5`m&as(x|s$kD0r5V9l}e|hmqx5?2de{3p{jyNYlL=KAN5!u~33PbYQ z=n|ieCJ(uMz1Ey9MSr6MzLYAwRJw#Cqc}iXTw2M`;%^O`(~Ss+okjO4Lbu@@X8N!7 z$@I_NFOL=B<%FlMR~}3I?$nAho3rgMkrjiCJyy&?0_nj=h#v-Cv*Cw63;w zciWd&OfJ4%7gJ1YlHQux6n$=6y|mgYO*Ur)U3j(ZT@M$@*Qv9(f|(@*GskiI47EE{ zA}f1yDP(}S7Ka^R-|(j11g$8I^+MH;K)rqfBtH~EievXH-)K0nW{^w61CRQ#%N~zK z`b%by-?r?bfnoL-NSi7<7@63!@^4Ea# ze$2fWTSh>MX&K2seLc*lHfs;rhIIatCA|uwHdIkzM=Pvjx6N`}q(I`ET(yRxT9mPm z+`_p$`LUhPpd@(p(X`|-1WY}A?1R-V+f|)~mR_s4Chh|Ler5~gGozy1ovf6F5b|oTZO~riuc$-Upo~v( zsZa^aoElkD6^GDLW}lSz;eGZu@4nL~0A0B%CdP&cp!# zj_Aa58#!42$#R>(j@|e?8o6o8^*~NH_c+eV_SB%^qm)|cy4??m zGIg8QzrhV}q_zVw{cNPp`+~8D1)9u8sx@?gE;a!n%;zZvOw=UPtW?q|)JsJZMfwlS zL`pZQMV{<>k++^V5a&g2eTTEi;gLdf_JTtzd}Cj=yii|X!3Ja_y3ocIt;%$!bVWN` z8Jo-faskI+o=NDQK1pc%ux}A838`atDw&)AHp7<=s)c{3>xG|u$Tz0t?q7^u_%Lqb zJ#=%Rse=VF#L&$ln?33z&xGkGtl%0=MfQ@TC6-t66wC@UfgSCW!1f*YEw&}FkFiq` zGK$2La%13*jUp^hvY}B46Sgb8qAUsfVs4!uij-w#7~`8kvv%00;>;+YD~)yxTN_sH z67^l>qFKrYrh%5%QOW`yPF27&SfZn>jVjVT`Mm48wPGL28ggO(X5TlgluCqCh2^}( zAWf?R@x&#F(fJosaV1T+Y2J72)-BW4{w@PX>_9O%A;W9B{|5p})R0-}sM z?0QDV7qYFj#ZsPG2>H;{ce42@mc(m0l#t-Uxxy4(hsSjOabgtC5Y{_C-uS@?<@{kJ z_VMNsY1(9H)T(Ps%SdX%w_zHy+&h|FV#@YZ`~;`ksT|TEvh?qXnvssw6;YFk`iLcJ zF9yF%20SAy%(doSJ+Prf5uM?WR^J&34nKQ`(xaGECWTsZ8c+MgdUb<#Df%8?4ux3WQ_#YvhLZ3u>aYJ?^h9RXnCN1 zSY`@e4wNpvu^SK5_s8IEi={$4j(F&SHknbyA_+#d8{W^n{EItbx1{bYksE8Z3ATlF zXGP`EGipwT6nINK1ZwNYZ8!JJWGQQ(e!aOd zKi>={f*VxHj^M6fJeZlmfAoVr<1;g(_Whl~_((8=9n^;UT%|+XJgQe1)P`tSiv3T0 zO0lOdzuM!zw^D4k_6fuYA@{Z!dzn&C-r`?7F#+kVlXZjU81+&6Tz$f}7;Air_ z#kK^zP3cl38?qxNTAZcRYXfBIyA>IJSJ!0t?05Mfvt+pD1W2M$FW(`O;Y1QiqCzY6 zPSfZHue|s_)aT+q_fa2;&Eik*KxV@fg-&(3URzO5*IdDcSw-Ya%R9Tmn_dx_r|nmv z2-B+;I{ZXF3><_0GC*`%R}M*qT9#EA7i8wsA<<(n$PoKjqtl)?n9CmS6Z)Pmm63xA z4k+HxSjI_G)p`-b7Ea`mMW8~#53N&5EGlizb2;zB_dYWH&WEO~8*u*E3DlloUn4Fz z(*EGknF$*afKp|Nu;Mp)0KeiwZ%PoJnFtfM>^IoNp<4fAM5ei3y$cmB>216IX*js0 zpP;9YMtbUOgewo~<=TTP=u>*;UiiFWYz-uv=-0&4u!Sw5p=a{R=C1(Cn!on5*7?PS z342NRGA`q8T~#x8YL_Eb`qA=+BQ)pb9BdYQ3AVbbyM^n9P;-~+-7K8^rgJg*i?ufe zl9Nk~zg9nJ-EePpp}?Cu%1|eTcfeHqMXch1JTekdH%G5z+U5qErQfCHMV++-ajkFk z{+wOC&+;eYM(_WEidK-qq=%95$h%Ym8gVHO10$TFs}?&uW2i@IcF}o!l|2aoW)96m zHgeq?{owB06n4$L(Ip9AKMpyL_83bK9VwJ!Zv7@PyIL=-EmT!-+D*J7F*%%i9zw)) z@e$Ddr3h1r9rHCVG9tLq3!Tu)tS{^0uS7=c%);7h`FXp{8dPS|R7)eUlCHfEA)XkA zhD5|TzBzj;FsN&7Lg${DS}D`%vTv~%#B-FXw>DS$@Fg~g7Rrs%e`!~|<^0kZu1q*Kv{(6wK>D2<7_=}&T{#l(VOxIp@_S0pVd&DQ@E=fB=~?`X z*>A;%D%DU&&|P9IJ&$(zXz3&L@$frd{AZ&&E(`ksB7O}owY*e_DE*ds zRQeqLJaV%1yXwhM>G$zR>jJ*%;Uxa8AdBQ=>(adqmDydmkFJ0?*}Aa6UbmC2A=Efq zgF&_f3EQjdJLrrMN}~mN-9Ff%5V_-IYYU2y%@-&Xe-hV4v>q8aJbuUSiIvgp{)Zk{ zPMVHgnCV>*^S>z#T!1Oz3R(CdQ8)~Vhsc44{%Q=LZ2c`mJh^gbag|Na(P9O)2S;xi zy?JtBa{lIt`Fwt1;w~Nt#xpm*W#vwVAbNbq?weNVZI1t*=#TzY zU*EK{NB>xP?_z@3H9JdJ{mssft*+Auw5#C0 zZdsX~U83asMs0SMpWL)EM86m&U}%EIqxG7cnB*^`YsVi=t{{VdtybX{^q(oDSQTpY z7r$2scmJe$iQacpW2bX&KDkmT*9-J6{Q7qBcl)1WQSSoCH}OYU)ad_Etr@D{CC#Dj zAroy}TWhv+&~~C1Kp|khnVv+u_W#~aoo*k4R)@cFXm*wudUh6xON8rT7ZtZ~w+y;L z+)D0b>t22|vEqVFjc=zaa_RWLu+}_T`eR6!@2bz`OE2P&(x1?OzC`~q;^$BC>%FBf z+a9IFP)B|jn*tZN=q|PI%M?UgUiDY#s#U!6eE}COM};FH?GF4SNkU^|LISi zf6h7Tpc0jlUPX~BsIt}Eb$s>}(p23eLidf+6J;0No+GZ?v13Po_z_lu{U)G8teENp zOjj$O2=?;QC|O0W6|yPl951{faA9bpUDeq{tc#AQb4hEw9KvA3V>}M+7GT7qXE^jo zGtqq~I0=Q^v^jQ)z}-T@G6O7?!PHI^+*oo9<;uzZ!kvY4#Ez*x4~0es4_XtoQ5Wpk z#s*52U#}z60ge(qS^oFXNPv2rk4zbJ315%Zk1b$k{C*Y5UyY$1ION<24(*W7f+5&f zFa|1hOtLU^XgIhhI24TH|L%#rfPfdQVvA9v6iggq$4j?tp;SN$kD zAS)B(v9eYkdSt}@O&^XN0;~Y_x@pxnM{kA>2Ztxd5YQRr|4xpLA3-i0|2Zw>#2AfOe(!9)8-?;X~r`dM~9%g$%nxp?9g&(6j~;Ei<=_CcIg&~anEXbg)U zHrD6eZ)}YDu%9RpnOcFBy=BBUC*^4*cH3AJJt?s||pvv7~L_sI3SAcGIF&Vo9DNjV2UGt9Yx7>E`s075j+@v4MHoa?U+%-kuo-EyZQmr)OTtlz4?@A}=NWw*w7k zCpvdQdlu|Kh*s$T9;jmXGWt-V0xP@_25u0oPzC*uQ&?o7uuA7Y;E1EREf;pEnaaW| z1qexOpwv0@w`sb@00(%tRv62vv9a4-;204N3K;0_1YPxk9ywGW3PtMHiKtkDC%UF6 ziEk|}X>Xjyc?%9Wtzdwl{;w2_;%QSm4J&6^>U50m!BsNzy*`2Yp0p<@$az3pEBFZP z-Kh~30m>Q?{h~)Hb_tQ^#=edeLb7R;G1f zrFy)UUp@I={Kb~l$p>kBL)L2zCgAoD8tYY{%VdDHzNQQ_hfAY~7-V^X)GVzP!QM#E znn#uY24!fWuAjcTD6|myCS<42hpD0;CnX?hgG5ZV0>|Xzg@Q`NH(sW&h!kG|P=Wi2 zoNwXHLdegWf*!Uo*!+mY|~g5`;K(w5an078(AAC=lc%vl|Lp+bS+C;bFG^m^c5 zR&^2k6Nf#bIP>yQTO)U^gUDFP;$rfXW_2~7EG};8ZN&r%dhH<|WzIncMG_iOzE>`K zc4vm3?+LdfFAFj>lWe`L!163)vTzpkXr+xO$s#e#GJRgJVV0zb!*yhl7ZK-xFyl=^ zRP?~Ssk8fk0X}3n#DiVo@9UJr!!|fL5mey%SCXYYRIqofzMNkzC^!Cf!D@Atwh{$= z!9`mu{CPxVs$LG?9)5dx0zP^1F-@1Dx)U7Z?lpT#3sm>dL zg9%n#M~Cz~jn3=AA-(U9I#f;R3_4Pcv-J;BEPm%sYt)@MU9bon>h!??DL3Lk%4N^LAe(5E3sO_!3!6yE`RF!UwEX(q@bt&z^q&8M`^VNN{-cLE zva}FzGH5XLz{B?qhbieWyV==_SQYYQU;wZ>cTY)@`;_|B2b1c?HS0fA6bzws+HhEe z*JPsyIZkm}MWr)0qIlX2#4WwynpSKx z&*)a%XdxnUtU1?g+GQ-2X})YdRG-Uj%pg#)TE^Anjdi4C&49^p|CMk|sS~X;$b(gt zK`qHbZe!fbEaCoo7lezZP@c=32$%2jQuS&pbafh4F&J8(EslnF4X!t5i<&|w_ehdAC0ZO$ zZW@9&U(QY*owUx}Gi+9d4wzKG*e9tz^==;qWDIj*M5WfDwpp(ib@-GLU6EQo zIvJK(G5T5Cp#64ZCf(|{Cos-mb#2tb5NP55B7%VYq{7avt@yrXpNgL9bz7i)w_96EeM>}AAY1xSll;(};aR{VRI1aFo#%z-5VcsHUg0nC*|H6Vx^pr?- zcc17H_Fmszf$lFIi-bBn*(z;qY=qQt;47?Z_V&GUiE$t@cD%Bpl5o#{&5)l4Dhz$} zL>~f|xAaC~C%Zul`6c7{PpFR*{SxL~r&Amw!Grd-i9e7|)-slJx6n3mtd%v8Wy=ZJVM}2l} z_38RBR_i+bh1)JO7#WH=O-pCUYz(Qe5l{vv#5s$SwldEJZ`S@kK?24IXnjJRMWfm% zTvvefyDAMWD#e5*g37kj{uympBAxV!wIXr`xWLw67b}NNMbJQX{4m3zK^f0E6ws%$ zrX~#)naxYcMn&fpu8=<#Kq+e`lo9 z2v*sQce@OliMs#LrPuF^%sSalc;Rh^LNz+rPI$E@41ojtEOz>(jT>MosoO%%ZP@Rb zqyE>-AUvOZlxF%Z{^^6uqg(V$#p%&)t`Ofi&z2C zg6w1AT^Ae&QvoX&K5z+`D#Ys2<@^#=Tf&iQBucAu_f=%W&{aSxehpQADuy!1E4`!` z=D&B%Fk8PAkFo7<53@a))7h*-?kE|7><^p}ZtXNp4aBW9tsw&brRy18;hm8c0r#YG zpbx)K| z1-Fr#rNZCF)qzW_c2!`N_f^8**yw5RIp_vJVSa5&_aM=0ux?UIi3H<>YZPvXe3@(u zPfnUO*2A(be0RTVU`VmmcUK;iBwLSSV#3(4T>I&i)}tz>?GzVI;bR!?p_s9boEq!0 z&C%`N_NiPGHfnVS&BzcB%dxxrlw!*Cef`-bH%|O;oy~7oaC}E*i+giV94IE$V+TGo zq$QMXWK?_j-{7d#sfB0MWQ8mELP%MwaDOm2vz$jDyG^T!Gj?od8&?AJ{Vj@8qNyRJy&6! z)4_UDI-ySEFNxSt-LZ~xR;b^_u6bjJU%)K{H-ryBXCIHSsIYaNgR}?y=WFrUMbjrE z{Uyuu+HV-dXkb{LZ!vSXL$t)hc;L4fd})uBc;bTmxy(SuMU`on#(>c3;v>(LljVZI zuOK`t7Y1{j+p=M=Dn|eg6+S7`g~Y%ULBld?y2fU5%sF2He*1A-KJ|BoK*R(r=WJJ; zgJ6>JrmG@+$ZApNZ|xa`7*6=-2pL#Thz%}WIDU?^SxhGQr?0+NZ|n7#Oz>C5z;7_x zifaY>&^@Nl;1}R{(R=Tsl+(i*94oM5De8wZMMmay$o+=JzE*C~XXIznJeWye1{bA( za6eFbQ&&qsX_Y7K5{Nllp4dpCE0NruT2t!0$>?S7QJuQpw5)boVK6vm4juu5`{Cec z?llxI&}}*RdzBZLQoZz*9eQtN&U=gns9s+{9sq)bv?U~chcn~&73PSQk0W_opFQW- zx;zZbTWTF@OGm{<7XU@LtgtAbO0a~IJGJA2f$oejkQIHcq*7izRs6ayGG4OGe70mL zNCV3<(|3qTH%Ko6MejcPoc=@PO+JdlG&n%VDGzP_N-FMJgcPAH1a z=TLK5IU~$TW7ND}q4Y*_!AE=>KGNiB3uNUX97p$Tppa{^LV1+9f}1MBu^WR9S=g(; zbQC%(0tD0oMFkCOS0-fBZ z`nxoJzAGL%o#BM>JS;;+3{N$7!_&+-rC6A&Lqv^_omJ(}YzdTTbkDWJ@%$9`sYb5Ei|OrpmQd@x%AG)|~^r_{;JNQ!ck$gGg* zruLZ+*tBG`y9XgE(A(4JK6ov1`*QMrEHji>PO(}rc5v%dkL+2F+VP(&qD6{yD5&txHlwMK{a;57m)T3p{}y&r;uEIfrrDWSLYHao#Mz4m~` z`gDZGg$?aE(x&~6G(0x6#(S<8BK;+6zE4=qr-4y6axT)feya^+plz*dt&2 zE`1FGr^%tF{DA8A$=~bZINj+3z@V3z@4Sir93Id8fZ47JL|cc)wQt34s%;m^jtb@24QTaf4a)DeBt9hcnx7p&tn6eNE>1B$XR+Hb>Lh*ggITIF2YSB zDs^av%g_an9GwbJAxm;`3q-1>&7+fUlcQ7q*i;}LaZXN&92ChTvb%NM`Ob%-zcp-5H^TLI7Tu=^-G+0R>4QF*{>3l) zn8-5yG2^$?){oB8+gV4?w1Tlz3U7{Qj9)wT{T;-}`=YiZT}{h3Yc z>bT_C4Vo!Uhi%q$_8IgaCJDBiJx zdPr2D7T0D`xmvhE*#isvhBx&lXhr*q3spY?_4)~rd^~~_!6KK2>0{x*nn9wEUH16) zNPo%f@m0$n8W?7eq0|#K5VX>Nq5Lgw5RU`a3gYmi!+8 z&ijdPoi}C#l$e&0{L|ONd}_1ykZni@FnRy0f~dH1txejmQ-NlRcZn28e3PrzaEAhA z>?5}jwff-4c9aQ}1g}1t;+nc;Txwt+>X}rzxPea<8jm@X+aAK zx3!&|#Av>^zOk&guqO@r8=0Xm743@&rfct;ax8jH5dn*s>r?TY))XmQyHxmJGehGW zJF>mNT}-3i5w@*0(Y0U^F!k`U4_3QuS9KOzdadG`xC?adWH;M$Dy-5;O!&;GD0e3- zWzoA=du@aEB7a34x~3e+buqFWIf;%*1r1TGQ97c!eVqNk%CUh2k2-w9xF)rR8>t$& z&p24jBeUP8S|FIKOHqm_vP$G4^|(MaI+dne#2*XQl`&jMgh;P0gh|;+VagKwsMYmD z$~BEm63Tu;XW{?=^0-mTt%!g(R2!5Q-k^RaJ;F;2M1kw-T3ttwWpxC;z^HDc#@qb( z5hU5E1?cXL5qc16=+&C;G?m#0E=_HZ^pUK3-e6Ua27p!1SHD4*(%`f8jfw#eDJBaK zK}J5|(V8aCAcL`vdzOi->frryaUSW*Baj7jqcz;w@b`qNHPqA%K7pNubz%%j%@Lb7 zfT4)e9^$Tn(j8qf8RZ#XZJA79$L@C?b#BIK&-mHn_$b@o4u?sJPA6#lxuIPcL zjuE&|W%xqA@evGnI$`?Zpt_P5@=Gr{+9c#x@)TSGdrzMPHur|>v=iDZqdvyIM93)8 zV9I+zxs)(C$#jN=36qsxk-)MqaAy}i6q(A(9>zC=X6>*&g|y@2q|uIHVk0GbiTbW` zu`Ff!QlHD~s9*udrYf-+ELFJ?vOM{i>$){wAIchXVfJRPLO%5Loos%JCGm1)33)A?B1}PbI7;UqCr07KV7=kv{T_@^zP%Rte7t8|LUu7Y zv&MIM*Xi3ZF-mS3O$sq3c`AN_FYQzgX%JcZ3{f+3Lb@VqGEt9NqV{6&=Ta6KiB{g> zayq>i83}JeUkD1d8ib)PKV^b5EH>@EgFAOpq2HZ5O{rgIe+u5DEfUfV{DQGIrF$&o z??e_-$hd?WB!3k7GFh%YX-Pm2%W~}j^5i4bjN_!1`jy#D;j=E6NFXiaj(zB|SL?ir zC_`%l^~11DD||Un`kSt>M)&G;!rB%~gLWM8&;xC7fhkM;)kF?cY4F01Z>=~b#8MW{448})-8N|WE&(#LrCN8|f zpf*IqQta+NrPwq7yWs_~q*jXU*48+0Q2j#4z270cK@4VJPv4s9mA;u68?~6a;%_pi zpZ$VwPL@pJP*Itov}d3|RGJ#PNFLSAeS|#fWWSOx$RX!6<yB$O z>OS;kZ6{Jl8xcxUl}Y}mWo&~}UighZ7yiYEeCRcjYdS#4e2M}Vdf#fxSLp%=sIgo` za-zH;C%kbI@i5wWwPiqI8|*K(L1*IRSX4)0Srtn_{wp2DItD8YuEsU0s$lPgWQWoT zx6ZS<&9xr3UZmaki9CXKD)REsIwhW=p56T8R5bVSy^l=4^P#CDL(7fEYW?^{mEg{o12iC>k4ESnlJeZ>Nls6j zdox%bfs9PL^UcO4*PRby&=P?EHY~=v`jZhnbmn_7_cEo+{e$IfjUeW1U%H%bpo1^T zEGl~Uvgq^g#OZ3(-6)iU{3?pfo}d^YrIdjyOKT`SKj=SX>71KWX18+2(8kB(ZzbCj zuWE%bhUo5uNNu-S3(V+n(;xz1zc6qv4#vG3-TFOxv~>4G4BF%tq6f0x+;oI7lBQF=|l zTX(%e=^0xruV8GuXSy}wW7k{bX!%5SX|5`vI4rNV?Y#q+axb~5KkxB*A2ODYn5fyk zv<67Dh)Y7XW+yj{X1mxn2Het{0V;^(8v3WJ6UkeD#RsEZjO%rUJ|yhoV&e9ED%@Ob z-E1ja8@O5V+}J0Yw|~Vq1&iikN{wvaU!d%PQV z2_EZ>AG9MO$~MeSRCLsOnl^C+gCAb%1AQ*_zB_!VvP&JyEn&H$*fs{-(qXlnk9EDA z2j_e++U2~h6Gt(Ls#2Hi_XB4&H%y+5$Tsbx2Qxojj-@`AWA44asoLdWK57g2(>^Me z^U{4`rczp0OLe^KrK)|*2ftma4`4xGAa`+pywAmb=K32v8qzNArS9!y+IEUQHb9kr zRxRPrbiIVn-tU9NEaCLST)?GM{eNLTv5d2IjoYK2^G(SA(J+Wr&accZPj-E-?qd?euG390$wTF8gDT*XYXxUb^wE-`!;8hGH5@WT zUky9^}7!eNPH*{JC zyU%ZRZi5ZyZ$%`i8+O={axt~QPTk(nYb*690QUDIz;^aTsmR8%j%;i;iOF!u3m-Jh zqmj$buXkiehGKEE?A1dK!sB>RNS1o7&2O`oEPMVc^%`j}bSH$pp%asd>343EG#SN8 zb~52_cQWVQ+>JYiTvI@ z)OR)VIQIm7W+I)WeN?I`uQjC>T;Ur?tcU+S*5sZDMt#9IPn!eTO~H_7E5lAbGfNJ5 z{kE0-Vl~a)qIIj2OGIZ?Rl?+)3M4mgq6|q~B{Z{}6Cw3u>*njd1A`=%(bHJ8evTo( z_(`MU#6*pK*cv6HhP*_@3Q-{OIWFef9bU{eiCZFN6y6e{?=wk+-uGClCX%vGzhHfFO5vljMIv~@c^GpXJS}^eoJTj9XgwCqq9kD zJCS|M$+#0bD|fsD&1KV>!2r|WclSwu=e>4EtUKWuiUO;>36k=)d~6)A28)G!1G^KI zWI+$sDvwvH$07jUT9cHasgqylpy0_KG6hr#^0%)opwW2!KG(#pDL58{#~jaVHaX{?~Xk0Nt^ z;t!K2zs5T{d;^kzS!!E2G{F4okm9>pW2U&90W4lGCrWR4L|dCG3+r z1cakI>a-3Wen5Z~WskMXjO$gXqY*>Su?kNTafg}%(Uvkf_;i9`FwETa2S9H>*2MOs zMg$0CTOu1ifNPv^20;0msCpHSR)y{oke9j7+Q!_w_`*!3^jC^lzS1?ZOuoklza^Fj z(i4ko50WVuOm@)A8TV@Nz)Sk|K9_XgPy0|}moz_xEyz4lzru26RO+a(g8QZ@)e8Am zeC!RXmCM-RH#z3Q+o<^TISCT?<}Rga$v|XPYYv&8f{_gBN|)Ti^5$atr>i86gP)DZ z*VWz(h|sXn;xoRHg>pba`NpoHJmiJa68h6A2tACEr<031TqX}lbaQXAi957jj-Z(p zVV2v0<>*I>&i!LN33VY8!)R(3Uzn+sZd1hdmad7bcI}YIrnkg}!!RA9a#rOU;&SDv ziiO?U+_*^-RFfpDdW;JPY>Gw)S$kT>HaKPSxUWz0c+~DfLa+VcbF;V&*u7IjQd0H_8%HAwp^~iw*y=VjhycV7FO_a_C@2E=+3YkcugK z2d9B8b{B5K#*a?ksJzeus6O6FnHM)jkyo50~5j_**0 zF%2b+(P;2RZ~ZigEMmz|whM}@8ywkZ? z-idILCXWtpT~cUehR26Dfq4bCHl_P`^j^T|)#wa=x#;^)X6TFYkF-%5c|+egU z|5NA5QnJmnnZX;+HoE#%vPVKl7VlHJ~;QHcW4J z4jJ@h7Qggsgvf!?uXcq`@cB9_diN5NvJqAzXu+^kApvm{jh=?oY+-CvH}W6 zW2&?};-XzpeU*{$*s94@C-wHG_}&D6CAGw4e>XB&p}Z0fJp6Iw%VdS~0gEO*EGwLA zljm+0sgqfH#a zppVVef5gi5vx|A=hm7IiMb*I$3B5x%QEdly+v6n3jYE^8Ay(*DXlaJom5%xww!yW{ z=-Ne2?k)Wx=h;vAkYjB4*6qaLjkE=g!Wajf2#5|F19xZoK7=&r<}0w!RX~JvkO;|O z0t@DDVzsJvFs8HXB0VHai08g!kf(=d32_m{hX?~^ty<=h2h?P47Xx`o_)Xw;#{C}8 zzSNRqQZoZCsE9o6ME;Badk(#>NH>vu7s-M<)_+n)7Z^#A+H$3ux89X<72n&-t9b_z_Z;q-zKt%Un6@H ziU64PWs{K)zsD$7-XT zRHYMX`X&>9d@v_iY66%1aUmwfeB@(>W7}3(wmown^wRM<7_B$n?Mww{cKjGoNx*IRDapfk7M)XQ25VL% z+tzv&k*%1x`kiVbNrw2HnN8%bKH14oS*zckJcvn_XM#wDJhNuYTwflGWYH!(7^h+= zgKai*4uJ~#araDq)#!6C@|NR^fU^E>(rH;+^^>>O%{`+xNtcjz0qNYVu#&Cv7s-RQ zr*1$Ok%c}Hx$l~tvHN$v$tT?L@ZVqp4~^E;FFaaMUVBQTT;$pdxZH~)+gz{`Ny&9o zty5+QO4cFNUgpH9NG9_x$9sePWWEMxB&gutoASD`N^b9cIH76!=>^32gArmBCU8nc z`|lz>BwHJ`r_DO(;n~`FHSMPed189@St?+Yl<7w^1NL=6+rk=ZZFydLz)x0r0#ib2 zZ)sgtz~!Tb8j6-K%$9Lo=*b^EsS8+wQ*fo&(DIhn7J4&_c-%_c>t##yX8%fs!`)o$i44mWf3T1y1ynZW~d?dQ8jdEL^-3*pB}dr#fYm}G6>PI$mo&s=c-JTq|5 z9kFy=`t8eE_DA7NCINwr-!#aG<+0MQQ@i1Jh%bNDd|CPp{OQt4N@76W_`$x3;nLgO zjZy4GxN_o}C5Bx1aS}1;c5%dj*+gh}BA{n3FWW?f76NC7& zdt#uam%c9Mn>b=<$L_cXyKn6pyT>gt>@)L6G(E;ErQ5|3L%SgJNruNV1J_3kQ8<%{ zK_KI9gN#(fAim6k7>GRdF{?JYs}?>qh>eka64~BNZ`-FD)^|4p{ns+7yhiPONEh!^#kAu?3fPfM^Y&x`N_<(DL{c*sQP%*>e%SEE zANK)m5%r_qFgu4(RLILUrv`PXn$iVT7Ci+saA^e};1uTo!Zdl#2%shl#l=OW$>Tai z5~+2*CjhmVaBPoHcTqV2O2;qM=8JSqc{NzCu4z@ht@VaZU|KUcrVZrnXk@v&_a595 z=^<8S@rK}~Up2Vb!zXPBbUTmQ51kxIeuD#sg`*yxh2uN3rU}cNnRo3$T{5$ZiF=v#Ti(hW58_tlIpR*# zK}0l5WhsDh*~6g^Db&}>4X9J(A5dz<3FuckLmhqrty(UFJ!=KJ1_PH*EreWx-RI^H zWKduF0MW-l>HS@i35mA9w`5|mRr>HHQP*JUKea#l8S!X(@q%;CxgJH8R#Bs}T%3bE z!4<8ATn>i|t2HEz)b(HRSFhrfBThW7>PM?s12Rx>=zKvxvt5m?u2ZM{y4=X+aP%TL zIEkvyRC;R!#a#J5li}OBdTXtKS~C?~f;o!*$8ef)C~Sxax@CZ?xF?5$UF|LK36+Kk zKS2>oZpkC!l!qQt_oGIv1beun;*$k5P_Rf)Trfs;lbt&!hj&$Sx!iTZUOGLqpzdFR zXf9OhRLqlQJ_+F(uv1+LZ!7|qLOQJ@hQtb>fPnRSP+O~vp|3;r!s42`#}>~k4Z7=S zp)j|$gj+(F#&Wr71ufqfIusnn|C<~M#*d5yhjAC^g!*^<$dTdPy4w)>8)F9>2) zJPT`#q3d+G6JWE_Ae%M^4x)cm2cQC6+ct)#L(^kZ!9BtBF#U)BT+gl6aML|q`9dEI zqi5nqOuB+0!mJ@2AYCZ3*37Lpisgj@G3cIP8oh+yg}rQ_s^yDZf{0G!kZQ#H?Ze?) zUcV93!!TwT_T1hd;5b-VMcE=sgW{gFFj%5$r8HrJ^H{!CtRff5Dqdc$!qQq9Z=O^a z>zE=(xdRFzh4sSFd$r=G7w*L30x$yLaE-%t<+g-o1B26E z!|@=NnB|LFJQnx4)pBD@)nOe10pSO=7*ZIW7#|8TGdw~=hRZP$?5K^7?!W=K{2Z=V z+7s-+yYQ$RQ|1oU(+Pe*v;%8ndKwPjt%vXMW%#6ASiejOoH%8(bLz|teKLsm0&S$v%?&bHCo`Z2*`V{^{ zw|YK{e_@{gq%qHRp1He^D?N{P`Q`0LPA(7P|86+KHLgEG9}mCdyqAo(>pz73M1d%M zJ^FoX%Y30+o^7nJ7EZQaMLQSn@+TEM+Tvf{so@bB0QVp%33jP+JFqc|EmN(43h{6n ztkN~P`89YM$uoiSB{=O2QxoM&mT|9Ofvm8*wRfrijtu%spQf1)l%6+;d~kXA!6+Ic z2xJ$|);Er{M+17<=e!#iv}V4iS**dpuRl(;@^KZT+A-1gDPL0?inE)Zvzwl8@J$bE zv)G*vjAr(-#x{CcZIA5EWRrBYL|V)iiQqU`SW-S}?E8e|8RLgT*x4y7LN~+is4+A> zvaX)$t(xw^v+o7Rv*EwKBDypBh^(jK-*b; z?aMmuk$=~0?ew0si#_u8d(1BHx5Iv-KxDc{zHx7OQOtcO z@>EV49(H(>`6d|bk*nqPN_B;f2EkZT!E=NKyZXi;we&Tb&p_$#4SLer%8J$fhHpt#N~uA6Jj)>n}^kvqFx-pm*wq8uvZI7VT~ zq1_WV-;Ai=38lZnH}uaC!ci(tI5{?c^yPf_}Iiw`#rU)sAe$R5%|URfTW?# zjUcPR5NEY46cAWLn%kman%pWz+)d$|DN1jXx7RS2AzG}{Y3Rdzc-NBUIvwj&5wf9j zp)z!0cw`lkzv;ubkBn2mXku)fe@xJi6a42S|GD!71||m>(HmP7e9sf&WkiN5N~xob z^d>hw%TziN;19H*uyptUf6ym;f+!hd`xLB?aEG&X#4?a3i>M&R?J>Hl22?Rt^*4v& z#N!aAexk0bx1fjEtNJo70;>?!-Zh~Q##DPaSD{)P4~XMpZGpc?>{e~Q$ob9Yg}fe; z9`+u^T?H{=xXp;-V!BgAUmzQ>Q#8h#%CgjrV){8P#;2gikZDBRSiIE4O53~Z5UHLo zuOU`mMu}>Qi&IY9!}G<*i;YpftyD#*d+}jtx>Wxv<1l?JEG>cX55(~)IG)(GiJOe5;omsTx*PB+$y1CLU>eMwqejrYo->bEsf}+@~rWfDuwT?@uzoB zVXEL+~8F9%4{Lb8_qM8%%y z6X|7;pV+*vTmzE6r=>GRb!xYd;du2`R6<2B$YpZ^Bb@W>t44pqA$yL8Fefio^l zXFFcVt}k%25h$GXSt`uc@^Jr!_(qC8j^7Dv>o;S;fl7`G#KtJ<1g;IDDjWl3%G-mf%28*VE%K*X~Dxs zaD8=tbOSBDtU;o!43QGf8O@@1Qlp{uU@A{c2kLgoTz=tLzS79UB!O&SsFL}h5-OyL z0^32Sc$-XaoI9e!>||3wpF-m)gTh|vhyWZ;k=5z^Aq)+v24N#r8pTGD>QDr^hZ~Tw z`Pu@m2FpWt)$ta(je}^)iz;+9ou`F1<69(g?h>Un3xVwokcX!Njlv@Ft+XKkL)=)M zx(g4}A%K$4p*SLfjDQbb-=*aSU_MU39M7-Y1MTNeEf)k)@=ws!(~&iYgl*F)o;Lfl zz_|b?oBq0=a&eeilcbU?(=C?6ac@y)I$dYzu zk}?FAZta!Q1&(^}!+}a=hs4vXfc(BpSWQeLqYnF- z(?A^K8=`2%HuH?1ESZm3x$l$AttSqsBQt#2E**EqP5?J5Kq#)(i{)x%wwRm2ZR`P8 z&c+^Y=Shfo|VjNQ)LKDuo1 za?j9W)x58PgWroVjVNG&iyu-0u6LhZePdRN+4sc=B%Rrpwwt7d3wAa1G*}C7QCS?o zqCkLn7(eaH}_$sU8|?6>OkH&QfJ(Gsw-X%vDcp+*>`?9CC3!JAwLWkw=rw;ot@&P4JyW zGaI<2S#?&c<=2}V<@tHsLLRaa+NrLKi_P2(L2-5h-xX(3P zd0jt)EylTWfm}0mCpxTIcFlM`G8KZ&aI)=(g;pk&*xE)Ap!-_(+Y?bV|NtQ z2DIts>_%~9239c0281?OMeV_L5O{e*-K(JB&Q+?FQI%;I)X{6chWk2DBMSCyaZx#J z%nrPi(Gu;IBJPUCnrSgEc+Wr#9QTVWMPmOw}x z-&@Fp9Uu+m>|y zp}KD)LhUqPBPmhO(tYSo@@<(-a%XzF7Z~W~tFF;wtjsuq;F+o zC4nJzILR{*;R2#ey6b&DmY!WP78dh%AG*u*?=xE_4x;G#g^4=MK+)>%I}ehQty-aT zgjH*NajoYM!gk<7alF+NYJVDgHljYA^i4jxBGfPynNn3E2P-ou{t7E+l`p|VL8xlz z zkCxD=@xF7B^mmyd>Doj-5tB^O*f;H1(vEWECs`J>_zd>v1A8|k{l*s26Z5PZp zuiN8V<-PNb%8ieg6?X7es^;o3R|8qEew6?N>xcrl-4T-}}LnNZPmN)dp6320{mqRn` zNvY)HajKe#zOWCZJP9-{1arlFebj_X5CFjl)y2i(9Qz#60(zlv0-IdYK;|^n;Np-J z%_o|n#}RFmSi-TU0Z-tBUV%i+tzx0C&o2kb#CH8 zX0l)vD=h@8bsX=3ufGQBI%Yr&wSXx5vf z&H|Y(hL29-E^(R*Qsc3mLq>v85G$t?2|{X|;(@_5tq70%#J;D^7PD{ydhyWLvlZv( zE^0Z2zg+tMu?RfL;`-@tHWaM^WpRB4@5LhYWJhcH-^T;K%}+~uHl1F(Q~b}FO>rQG z4a7`io5fFfI5jhA9CY!8iF%`pJ4jkem>rR&U(t=nc49P+^?J z76lQ7LYZ#LUn*E*?;Pr{6EkJj8h-%X_M4H<#!(M`2X{|KL~sXXn0g3}OT+1xSw32?oaWdj-$H zrRS?b6a5H~=YGXdw^(W`K(2)8Uq+S@oCe0VP*gYQk!$z@el3VTd;lUJiBPN0fbq1s zEIO2#Z>#Ni}?F+e{Om{2w>Zm7s%oIr@q10eaPkrOh7ZWmFI zGuFDDF`#v1mjryc6Vg314{q$(4WPqfcfA%lS`4yP%wjlMQi_I*V6-w4a8Ozm)337* zn2r{swzWx`qI7Pb^gPQVu$00ap0g|hl^>-kCeL)tea5kfQCDo=@9$GRzj(!%&TsOm z=jqE3VR(B1XZc2gK`0SUIZ@&P7C)sDcOkDJ2~5(lbp|=Uezh&2LmL!Bh{gvvz5#bl zkfX9GDwOOxihLU@6^@3GRc8_hH4uZr5Mq!N^S}YdMZ`UDii0|5w-yezP(GgySBKuM zhacHLY{S+Ug@_T>iFpLeVJd2$SU1QwWr#|>{m!&cm&lGpW|F+8dFc*ARvHbwr^(rM z7g&=|;}PeC^V4q0Rx<f@0$ z7fzt9?VdVKLB3aJ=~z2|GSY9d;QXo;oEj(=oHtO!BL(Wr_^q^Gc&49BDFRGEDRz&0 zIm`yf@)EAUaO>x6GqBsVo6VyeGmYwMQ&<+mM>j?%nzF@|ef?PT$R6iw@ou^q^C|6f z51UcabYmJ%H;-;i34q#(WKa7e1ziG_5-hier|h$$>6gAm@Q%=$BEDE%b~kb%q*9!Qdu z1pBItYeDrE{(P)SK(|f#2z_#R6Z#cXxt=|8ZD{Rl&Qb!=sp5o@YJSP+f2unWpP$vGv?-yGA)(Aw zWoLD%B{M}jhU!8~r%NNsDA4S5sc|r{XJ`mJ>V7;!+y8T{cVznN^UgWP~F zX%GY)89geqMq`fbb)(-1iNgW1{|z4feCmIyxz~QJn3u{pamgnBEbRIKYJgNKO&sQZ zE8Y4H*lZ$3o1p`kj15JpZjudrHVvi8S8$AKu7Mj)5RirAUU|p3`X9VyIq8oP-ZT9^ z7%UBrBBUyOXmm^OVsXBRWY61CRYbzb(`zDi#p4s0Eg_)=(0kh_?!b@CZj?&RfR8+r z%P+qk9(BVRxN45-*EVWv^SFtNL%~JVx+OX{qSZ`r9n<>Q@Z!e zH(6W=gnPxsu&Pwsp@uIQ(cF5Wbxapu7=)C*NR%>A`h%_rhQjrCTY?ern|N&N<06>` zo1o$n@>b+lh~*OUW@uMfTiIaggHwmpGA=oWeCq1jR6B^50GsCwMh28+<%D{+`$uL|T+A|X=>wK@l zJ716Rj!&($wXuSJPHdSs2~%1^oQk1b;(PTyZh}g(B06}(E}h=5k;aN>i#l71)fP)4 z9{Lu-BKcxLAsQRbGZ*ZE%)p-Lo*WG*tsXx1pdnco37mUb{5nuR8LBGvs=Bg@g1~&} zK--e2P^7V%s;!w~=@!EDKAsJurnsJGIM_5|j_RI~b2Bu-T5BH&q93g__ka;2f;_C&`hMCF z75N?lT*`vo6$~mUF;*AFMJ8^ur84?u5Ov3>+;$b7R_ua`4c?WJl5z9=)K_!ibdptoSQ#(B421_9ign|*m=}s*p}4q+ zB1Z^9Xqrj?ftg9^y@aiS(sy=+G*Si)OIHGVqYS2ZsN{YfXo}SbybU-q8tVmb(;mY{ zdqm~Dle8BneJs+rWoD;;CDKW9-E#@>DV%~0VR zlo<+U)%8A*Z$GN*sUI;yQV_FIUDNt*2+MP{nW1{ymBJFP|H6%7?4&EgNUP)OXq;Ed z&o3iRxU!1aC@R*dV*)u)Q>}O+K>ak_iOHJK+s9atb50!yRd-xRTE#I`eb*VCx8fT= z^JVxt)m3TEK8@m;@Psa*$}+TWyAt*4Oyw$-=U$brHT$~IKfR2Cp&SjR7w}+`3mIkI zNI>D1SWl(UdUcd4RHJ84&CpTQ3ASvzbl#sW6OkI%R{=1Fe?>G@fNkwgUx4S>Q$7#MuY>p70;G%>B3giMS{H%`j-+iF%-O z`Fe5QsSmAn8($qt1+xo0HB-|Rkw@Oaa!u)iDuhjyMXPHKxOK>qSfJaoQKFP|;W`3+ zORy+VF0YCkO)G0v!~%6a&0MEK+2+ovO0~!rM#wfwZ* z;UkZ#vIWPZU@olTem?`J_Cvw#9A=z}yBhXqfhZv`v*{0naKT>JIqK8Zo;G)~lcL8p z6Z7b=pRVCII^F6=PeJT(XYF}o_=t_{fe7xBb>#;wJ87h{uDn7~l)ffSk*q+I|GjVe zc4AjL{vJ*7T7GnR>rQYi!wGsA&6%L@y>Eh^Ag)HG6U4o%KQ0!q_1jbLv#^V4%Wj0k zX&<;t_F!g9=DUl*Vp`oRXO(iN8?pt(lLBeGWbhN`o^uX7`-@e`(m-9NW5Q)h9Yj2r zRO^Uyi*a3#EoY>u$IXpJZ5D*yP!h}*C0A!W$q*T$EX2t0a8fiWji1aT9ApioLMt(y140HU;aI z0IFF{7GQ4y*YqR6o_mYoA+dN?fPF~ah*m4)7r;;O5*I5<1VR3ki;ow|#pP;sfp**2 z#TMXF#?>iUY+R3phyhEfVud`=yceOJyqh&e7X>TTO#)5iRt-VMA(U*r!Ncx{VV$)x zwlGMJO?D5cVCi1I2D7{^BD2JXI>G#TDDq{pw0q&GSt&g%OS`K&qgqTbu2uX*9M3@7 z3ytS9o8EA0`Vh12;-mP<_Z0>`mKhR!oUjJj`s6%*%d0DAYWx&u8 zbz(^ffWj(D3=ykyRwMmYq%;d_V^FwOB^S@F;p!=t108p%I`9+>J+%L=!zv*hovl{k z8iT~pQbno?a#>Qqi)2Qa=n_`R3^y+ddRych(2$GMNQ-~>a-OOnb2El2Ogv(v!%eCy5ioh!j<^x1!|3JdzA?f!+#gtJDiMPP%ZSCi@|( z>4H6Wy;fJ~yfH+zmd}U`mDh|xSzUvvh&#cB9`e7# zM@-ImD}$a4u2^XOMV~_Jyw4fh6;roD>*EJh-Z9Ilr9!1pgCt;iL9&E)qU3s0GKCIY zufalvVOuM#mh^t;~u(t0efFpso~fv`Qhl4 z9l8JhM|)o%B-e4=2NDDbEItT+NivUAJp!Py2i)x)j)X)}K8pAtM2f`Of z@*$;MWu>AhkrU_FJ#S|Ey_?&&d;0(a5n15g?!0+3-96nsJv}`=Enllq?Yxslv2e;g z|JGq3#PzL&0y6QFm{QwFN%p%Yz3F7sHJPj=Z~KX1Gz|7p`?z=(s4>YGog$#;};}_8S@8v#hAGl)sAEsD%YP7|YIT))QP!?E^~_1x6shAlKOtmj6043MBv&uYC9 z9Lm4;;nWayDRfN0WL~Gle)f!hPWyo5|0=W!c<8q{X%q|%?X8nyD>whfGD_;&jT#;FqD33b8M0u) zKm!Vun=h5IMB`9#2C@7+?K>6(oEhV`YtwFIp)J&N?&=|3#;gc>)pGQntObwR$;7Dz&p``nze^YzQNkf} z)*&3SD|Q|fmxWP1(Qt?8nG*8wEQPKrvuCJuO_T1?!ghkyldvt2KJOsT!Qiwk^siEG zq=Qr!*oMe?k2RJ6NNbFpTwOkHN;Qgf0*8;|Dt$`<$b8V&Fb~w(e780Sg-i;T0ORZO zaHI$E9LT1``zQ@Gy?~Ra^n9Yx%FwwNE+7S1^=lOHOdF`pMu&D+5W38MnJSi~M{Me3_hGR%4z_fx429(`XKy^c#I>O-G%F;gQ&kC&grwcsCgrwVv9O*bdH2(`|QfO=#TqtUF zcu5raq}1RrIGs#GFBoPFQfbbCPx7Q77}_~0yi1wJO@uUJFBzA7t0X?*E<+u0C6uV0 zcA!I!Rhg=)jYW9#I;9#ZMX2WtR5zBV^Eg(4O#?pnNLv*+Rnn;Q7WE3;e)Cwg(l)U< z@fg00aIr<`)p{qFIbMZ9U1v34MMhUr;=J|2TOn{2@-aP3ER8znP2pmkt)!`h0n3=2 z4GJ#L0*aoIyFqQFz|f9CSM)V>#=aJc9j5TG6cYS>GL7cI4R6NOo68(_)H$8bSP6vE zYH?tkgkk*1u&g8S8NRJyFgYX5$X&6p*4_I6QSOKjAUR?;+!|E&T6Ovd9|zz*NvOf_(Bb~{py0% zBB#;-N)R!f_CWtTPeuLnEYw;(bnu$>C4c)GC>S5QW=l&L2q-J5{3P| zlV*0W;)|J+k?0xaPo5sX01~_~RCLNJ8fkZHk@y;FbdU&_RU3bN?E`8?i&r-9$50Kk zA912-9M4V#x<>`|!lJ`k+9V^5l^T#LXA}cHF)#z2{WTXHmVsV&GmzTHs^hTCDzj4L z49*etRE4=ytb6o2p_SFxX&kw8tQd6EzMG$lp2@KrTGt|IW<;1t&JW2XbHC>r9J^`t z@pA>rUBliU>z>h5>S1Wc!!gy!t`+R$H+=*zK~K_z>hKT2(E#sCW3f(FJ(>Iq1zht` z#yt;|Rz~Mu(aP0C72VSl9x-z!RD>!l$2hriZ2OiiqrbGax|S_%3$_9^t*ZIEp?mmf zq|%Bt&{LOI9zg3*r>*Z9f@=WS`;Z%qi~`d^-*liZcE$Q|xqN&Oyh~5_Kzf4wii5C$ z9fW~jb)cPWFo@9-I@Ic}vynic+0|#y@wvdrgxH5NQl|iM_t~VKuC7GWhJ36$errhG z@#5~Oo*UjzstJbNvYbDOG{KTzt&U%UbybhZxe1JGNRKjayoC;BqX8aGrBxw6DK!ZG z`uj1#7)-3b6MMU-I$^PT`F=A1y6f&-GES%S>4BOGF~k;U@vLICokrxlFVR>eOHE02o>p zhQZUYgxG%abKVIY*`uGxpWdJekcW>qw8GqU%jHH5ds1}Qr`hBe_fdYTU!>ps>z_{t zZP8E!aiK+D>KCXhIuewO<@+%%bGbSkbryLLBbZ*9VKib9_*aQ<*3%?;lK6IlmWogF+s{S2a}DO@^y9>z#t z6xj&x>#Hlli+#QTUb*qnm|M*5J^svwpzCEpj~Zr-+0fb*>m_++|Bj`;29Z|@+n8zs z)vzD|l?|zEP}#Uf6qR?UhKegJOyk;rSePJ`bAtU2JbK!XSLI-;NGK&ut_No|FY>v^ zgU#&hXjszBp2yd4F^eQ9Rp|P2uwvuEn6%g}Sh}C&_3!_y6`Tdhzh2gc*nYw_a|c@_@STLV3zm9hEZ6mH_U3Lz_;k&e<1c& zG9Ul0N0?IUc!eTQTUcpgKuwCTx>tcn-&oynyS~0wIjB|QRhG(GAKIktGWvs zOTeuVOg+B*Jxab;QX}6sRvQBNupj|Es2KwueUF0omDIqy)2YjBcfke~dV{}1>q3o# zEr=rWk5fZrr_s6scv09JU>wiTnp%S_i=sfko*K}uDKjn}$(Eha$<8U$JAC-5I+m8? zK=irOz5~>fOCs)FkX($@CTUu7{EPK@5=I^VDas z&ito#p3+#*Jhd@~TFEApTQn`mZC!}>fpccP3-jHkcYbu*qnYFgsq1l7T%cmRBhhDV zLoBvGx1JtuC+W4X^)x{b*Tewv4Dh=eG597``IXtV6K3M5?KupPZ zjS*m3>DZ>a(mb}ww+%gmO*R0oyeo!NGFQIwhlcK&ATF-d&usKzGFOVGom~0ebzC_X zawqSbfhUPar}3eF&*Jy&sP$fN`h7!b=G>_vIrq&U843zCt^e(DTx_G$Bcb-oeph@(Yisg^1<`MUf&ySQcN%LC*X+_F`f{{?k*5i!=kx2QWmAu6S0J8sH0bhK{(M%0K*SxNWL~Fogkrw0Wc!qf(C~r!8I4%Z4X5Kz z!?94Hyio{yMW~!?IphPTC?$CNaOyA!R=5I=)18aafGQTTX)GC?kHYzfpFR3gr;Q7(jFzcx{7?=Pj5_Bfb!3C`DdStARV1$G(?PWI z;~i;}4-mY5wYxP$t?d0EyGD1@AF-J1&DFH+JoURSN?MjXkjQd&CDd1412Z$iT>y9( zwRPgpT;N+qc&7@Xfe}EbCw1Z+dm;UX&kdNBF-6+L1C#dbjtBIrLolf&?Tfug+n?kb zao1waYg5YQ9-sSk1u6G-03YgfX&v^raCMMR$qOFR^ghAWH#P(QB6zu%lbCvty*lWF&69-d%)C{8T zlc(Hwc?CDc1;!iK>5W0Jb?|&@7~I{9F$5O9>-EN@m&c)-8YbJ-33CCnF6j+jFFJoB zHRxRHTFpxRuWMVD4}~T-%4Bvgj-8U3`&_qxQ}$2|WD6@hjW*b^!9co$qXWkw`$a@b z70sF!k5n{QJEK)i(FTdi#43m(QM>h|P;h+oa@k*^a5#$UGUs&~3w$S98k>05ZIQLW5ySE8Mxt6a3OD!J|mR5q&Ng1%pBo=!=z7)cM( zYSDpJ@={$W4A+zp{FwBfp)lry_(TBjw4Mks7DAmikyjMPWT}j;MPez_NH~pD{e@2S zWvV3`!1+z2bwMLyol9d*@nQ7_Vx|inJe0GNXpa+lVMd`zMeBccxOf3c74RMfl2MOH ztRHqGQ>(-@zX4uw7i)g|0ObFx7;g*Bk9eNm@kToy8)V5#R^{_n*Xxd1*MDy#lKlTQ zK30H!N)UE1Sh9QzCUMI5`=7*C1T7F-xS_n^m8(_6HMVG(7>ji7lv<7MVhM8_BIOH| zU0jI>CYb5oZHT2G1a5sRW*{pENCrkK_YNcqr|j`_6XB^>AfLk;$n5% z!D*AW2R~q;wUP<1NK?!1+3BMc@){;%R!GDeB^`~(?nz|%^0|Ud$-J#))Y+}S{)ECOIxhdB}&dYv;55B-o$MOL| zw(26c_CuByyva{j54UOilR%ENha@yrWPl`wtcUw*VB#fC1OV?otxHI|L*s?`dbVj4 z*B3{vg8yJjoFS%$)S84eOvI!C0=F)`qNC2k!||y=X4sYn#zEMwM+X)c0r)0fcEQ@8 zUHhTfFeR_me$gr|J$^iY-^va$DeeL%$3qv)J$XdXcehj|qMK;Bs|Q1sU@P>GUd-}$ zqtMv{>ZeAS1AQntfkR)_6H%KKs7>0|8MWoqP}`yPlwfk#LKw>$woVD)VO*ji|U&Ap$9yw$`YtnH4G|5vFYzr&1}Aulws z8O8M@l+0;@&Q4D2ga#;#Z91RHE0gj9FHSi0FJ}1?^L3E#THQni|GBaCc{zXug$PIk zgC3mBJ&0Hq)hvwU*xi56UfJI5Km}L2CvedBV|*aR2V^kfL*LE#G6((l*qh1X^GPc{ zx?5$xt*5o=D!6t1LkHN&JS938JY_fK-$|SD(?@kU*ip(qSjuoQ25wAzM4LL~>S73wQ?X-5~NSs5|1fR&yW z1EMg6h@(hm=qFu$@WIIo_o)lmLba{d>bVRS*r;DpS*}TABhaRWJU7VW580<~785f_GZf9pobWjCdoR3|=I}AYGkJz+2l?uBUS_J8|=fEdfkqCmiCG>HQ zL9aF%mppjP^mSpB4VbSKYaUAoMzHUtHtwIcoSc+5|&2?TKC9+5k2hpeP zSxW4V%<;L5V~Qe?R9g&kx}%_L_USjfRpqqe4S=N*B?%GHoWFbxU?te|ng9pv^TC)r zx_nKJI*+9`K2{{sYtw;OvRHi1>KP#xc7EN5`4u)ePpgxY57>!y{R4v&t!XVfqK z3!?x9V0K1*3F`}$U5Jw>G;nzh@}uHRpWg4H?Js2vlBBR9Su3oB0inpGgS38CtZejb zinTzyTSc};Ra~eRTD8%f7mhejw9;;s)+M;-8iB?PLFGB(@R3R*#^}8#9?om@Ll@mG zL&OZKN#=~BmM=DZZeU~fSRIl*Ui+D2j$lp89&1l=uJ_pH4n~dQ6~GX6ZviKbLM5s< zMx}=3Wd!S3y3(VL;}O@mSoZmX(kEfC6%>mJiH%tCO6gFLyrcL?q;!&wgH2DGSbCWM z7jX9r_K+rX&{(T4#0ri~=8l>Q?|a{SRG`b0Ok0N z7z1;m4EDNz{k4fu!)Jq#NoqX+G>cLCB!p#TfMU-c0DK>OMqf4;<* zq>wK+)AU=VLX%y&%638ke3y6aRY1~nUAlk{(;=JzI8DwigtJz-*zpP(zP`o0=q&*N zbj+~_d@hI9LrWy}@d5IeX>VUR7*3`@7NIIqX%2(_pJL+gT0S`HoEUz91Ttx~HZU$? zOZ8M5ydv;Pr@dh?IzBw(8vPKY(3k@ktCqEzEeW+r_WO^ciYC;YM%e@(wRv5k!{;eK zYgL6tVLY*Rs==6Lxf}~Ky7C?mWj@z>g@l<5-s%bkC*olELOI;`fgD_^<_%#hw|$5e z?>_o7(9ya7)0;B0pBFb2Qu0+qOp%vXotHqkRHs{HMFyn@_fQp@(5yAX+|U^lIfN{F zGNZ6c?0*meXr%i<%&~R4&uVpqQk_QJ5!WJZ&DTu9Q;Q3-$VY1;F)<7TO1)9WGM45$ zF(gHr>ijVrEr6P(T2aXO9zS}^%)EDJu%7}(B*4!62OiOL7lNTvG z3jK#)MQsHJ$Cxbu9%SKUr?rHJp+M$Az8^8Xr3)^sx*{=C7?iO4iVr^>-uJk9wQgb&f}t)@o{T}AY`t#zjImxdI&8h-^56bBT3|ZZ zdoEHq{MQ;Xn`{WfaViZl5|F3U-Y^*5;gV?qq5HY3N6SuqT&?g_YD{xjX|#Sck3egX zw_M2f%P_wz)Yn_4?96NzTod3p=$UMY2%SMIo^^)E=P}9km<82DQ9_1(%r0s+5?WKu z8Y|84c1HvUw0xZN_lslX;JsWf(mYG66CYv5RjesI&2Ct{go{y*r`18u1x&EqQ{BdU zU&9a@2C1x&T#i(h1`R|<%C#nC_{Tn0 z6Lu5UkIhV2giz>awb7}T=W@*z`bLkN)lNnwk-vmHI9l}_-x8n4jdj?G=H;bo4-xw1 zdY)XW`F68fj=toDJ*ZVxo}0*I5Q6TVoyxA{=^E@YZ$*`lK9uqBAF>T~TXpZKHx3AM zh(gJR6;YsTBFUsTHR?^QuYp%6QagNQbX3*k9?yK_QQf6(NA+0urnw;;%0vZ*aa4j5 z1!G)SIed6(bfTWg9PrN2!=wR?^w= zWopGc;vLN$^9~afT$)`TpBkknN2o}=UZ?jnX9~-t0hQ&3#*SrXRg=&AtwuYW#chPy z<@yFIO4!jsYLhemE>tJ?zj_wXcVjX#A)b zRgt;^ep&SkaD!B^44F&V;8nMvlYayeL}Z;ZFOgcHCz;ti{~q)3g+2Bwx&UA3m1*^Y zU_PY$@^CAx;zo=o{Kix0_yAlhaDOesX2p&!-F!jr7T#T;`^L$Rr@xAb;MGEPF^4VT z%h?cw+&S+Nf`V9m)PCjS5GdR>4tGj6Yzc!5H%YNP-$4PIRT$vS@OfB!|2aYfj7jDD zN5fLZsEo2`1p|1%JL@-ntQP2gK^hQsp9fJ+xoPYIg~_Qm$itOTxEMhtY)H4t&&N+v zC_C{Z^W{tB&iIog^XTyua+4#-MddoM4OI)ZxnhB+i2Hmqb@j6iOdrSqe1_&16af@b z6=&*tqg083?^(&V3Ms(deSGXXJAVI|2PU;`5hcpB98nBx9w_Oq*5&|0*wi!Si!9lp z%+jih3?zDFZk3*3q4R9#2ErusBB{j7w~07O_) z^${FX3{j#0vg~N+et+9?fUN>Ty=^(XZ8^McIlOH-cyC({WaMjO;BCu+?25N72W7y7 zmV8}Mh%{PiZMLJZzrr^;Y7~#9N zTXrLl!Ca&;GVHY5U36H#<@N`3Bty?ShG>jYJ+-RkBwlP7fc44ivG$@$Aubmb*Yz$t`WhJC8GGkO<6t@rHmu@6 zEZN;I01*Oe122z9?t?zHI{geT3Zm-`C$XZ$*Q0dP;b?f(Ar-t(A3wT^LjF5?(Iy{F zp(R5Eruz3l^%8?ubD~nW+00LsMgHg=CP@bM#eU^!@ z@fQEG}JY|?B}7g zIia7l-53uufY}p6D#a+Lb|D{Zp?!%pz6rVGkU2EX&Nh?GO9WzufjNa%0hj+`qNUpx zBGZEoLs7zj3mEuTRC+DEX(Lh_lgS4>1V)D8x$xX*BgCfp;puB#@-h}Onr!~ArjDGn z$!@u3=p*K<-_pREY`Y-!wFD{@)9v7B8TBM4yrDuu?vAyaJn@}fF|wh7;)(CBP}MrP zOVGMkt=?$HC-Cr&o_KLo5lp0p-g`GI5(c1P(@i)ClWZ4=aT1fGotTcqCMKmL)=f^Q zR>jpB1HEGqXO;ZekSclZi-zq4Iz}Z2ABmm#!O0ug+1N^IbX(+UpYI|q0G(IBas}~p zSwt{)I$^K?w!SD^uHL+&{93q1prhT@!BZw$94eS|0H@NrAyDOG#HJ&a*@3u~tdG_o zxTspPrKxplb)7VYbV8Ootbh3wBL$<-UL#HJhY$0CU&JBAS_kZfZr>~ zeFIo@J(DF*R-$pIcK`CzI40A>0M>VsA?PcT5<^88z}rHynkiK2O2ri=v0<)sc-Ol1 zOR&4^w3FOu@m(?S(Qr6~st&D4o86g0(Ojy;G7n=m6kLAOhAN**16o1VblStf{C;fI zVX3c6wdknx@Nk3^m<-#}z&L0xFEI5I$IpmJA9Wp&B(wSFtR8c+`JX|p!{0mR&B1k7 zq?8k6z0h@eI1vV?9tYIZOhG|7`j};8?H0}yD)0#vDQ-5^Kcl3 z<7^F!A?-(je0{J$(2!f2gwpolQ9O=`5n}KTUg#9M&raFwOlF1nz-CYtoV2<3F>3!l zE(2Dp4z-f{ud#NMXSFX_ZqPvStoG36M^6xFm{zVJnf@|GGHseIBV^iqE4|6IUGcu2 zmGw`fWOyFF<;m!}e)C+j(y()bf@>L!p1|F$AI1nGx()C;OE}B`^`fo1QTDPEr zdjfYUzU7Yd5Q3rk{ih3Q!$qtLPY)@Culi3I;@5Ob2s%YMC#Yn+htuSjcr%6eb8 zWE@UmO8E>zDPhWWN;SPf;M5X1?-b|mZ!7Z(d&!(Jo;J~8$Yrz+fWM0`Waj)F~w}=Z77V7#uSEdL=0tyQoy1EAUCDypHkL%=#r&=);APw#|A!Jhmc37)~^gXwZ8esMn#ID zHB)OaNkLq=pru-vry1_x(TR}U2bGWD;01Mv0Y78OnfFHD6zmv(0-pSxm;i`5W2fm- zueU@=lo-DsYbAMx_~Bm}^fd@PL+A@MP5Xf^=?(17AvrXt=C^5x4Wc(v19XR>yXgTr zzs*>zr);vc3z`U)u+sk3w?x_%n^`&TU&gN+c+ChhkNjXr$-eQ>gL-F045O9oDYM=r zPo#?2oF@xc$GP0=c{4~*f-G+B`XS_)?wH8b2L^c+aU$wvgI=(yu16|A8Axh4#C4`O z4gSr!2F&Od-C#v-Qx&WlAp%dQZ5&I6wXf8ms%ku?yg{IJA(kJA+`^IoH_#%7j?9JT zWuJMnKuVPJpzwl%VmL2mOPx-${m{gOU(YS!AY~JWKnuA>YjJ{pO@!~{Wm7n$%qtmo z$yyifmv|OyQi zMO2m?7Pk2ct9=AZ!kOrBC0^N13=LT;=P>lc_!IYcduybt;^PYgtgcF5hJ2MrNNPqZ z5BDuR6b#IPxWD0|nPsxSa59-P73Lb%Vtb{AKQF+cc%AqY`{w+gLd*?6u{b_Cq&S}V zu8Xy-k@V8JO?&out1o4L-t7)>#MJA243WDK6FFCKfTPYs{kec#hzg*FX=Py8g#)W! z=Z#^gpx-xKPz~hnS&EIv#`XiLKnl@0`+dWwdZ5?@5S|^2hbVM_nmnnC&YY9_H=GN= zFzdHnpqH((ZoiD~X zUif#mtNyf6u75^p@b%dH$r96g&|s}QPxkESn#QYd#oBmsLgUH&jsp5mQUla_aZC?U z&rTfJWWg3RaSHaA-wMGV$gv|N`uYIYj2(;e9}OwWFXjzXivhIe%DoZCjKiIw;*2r> z_fgY;-cMyrG~XMD^~tb*`Qr|BEE@-7bA=VZJr36lh31o<8gG@0i#~s=BIvC#Zci4A zH1*^Bo;~x!3XWb>rV70XXAaWoa_Aji6bY9pPrc3TuJhCjpzi7i1ZuJJFOSfHbDRJE z%x#DGF!)GmYYAzND{tWW6F2l;P2yI$);w+*IYO4e4Z+^|F0OW~BX^!Ep9yyB63REV zHWTc?5ivUb&|V8}EjH$n!N1zhAu(T_67sGE+ds-_j@MpU3-j#XG861nS6y`)Exf-I zxzvzjs8DO-$1c@P9&KO3&rJBU+p6N%o=#&vKUbK)L{HJ(Ho(^rQ6g*yh`W*~Sx!%UsCqjwAw?w1j+9!iut-_M| z35na+Ua5Bq%X!MdTE+ih)0?Ud;_%(LwGM*xTo-cN#+$eEZ}l@@ZQx|9qToHa1g3>+ zxcruqCyW>=o;=>Z)TQIxd!ckX+SP#V_p%m zxPrb)zTZJ>cg|NEg-dzARw!5Vi1H?t&G2pY>zCJ%<|5dkQ~*Q|T!j0d%5?K(zC$U@ zp;9pBx1u9(MThS)0f#KK*H)pVBBga4ujOL2wqSm2C+;tD`OQ?QzGnk91GwjsnaZ!+ zh}^_kI&M_>@E0siax$@2R?p{KK8v6AA9KI?|Jz6Dt*-M!$*Za z{?<4?UZ#(+_v2%fKK|kneEd0myn#Htl|Q79|8)i*Kf*^h*h$b*S`vaiTPZ@HD7a=A zrWuB3hGCguIA$1z8Sa0E`<~%`XSmN9?r(r7?x-rwMaL z^_zq_qx!i$_{OL{LzpwFe}^zSZNaGjP$>zpN#ackK-F7JwY^J zr0I4WM!G`wP&e2k#e_$0&wLr`pTq*AsY*zd>3WJqWQnQ=#(}Vq-_S@NSG^-vXln0_ zw766E$}im(X&=*3t3&hOo$EQh{A%%st{z`44DKjGuifYqh6Ii(a8w|m!PUjCD&1b4MG1@1x*6d z=kk)!ZsQ?7KO+lu?bGvxPSg656Y@1hEK-@y;5k(&(W|TSD}$#2pm??W+S`L?4N7c! zkK3Zs_SVZ)QErQ}_ec~#8M)-$Wq-vTQBY+14ib5HK$VUnrWydtn=cDZRaE>BD$Tx} zyDGm~ezB7)zo3!ZqSvd&gTaeivZ^!+9gVV#K5q;?v$ zxr?7K0k!f%`IYkG?(1)t@0C3$y@cNH4DNu8LP-&tWp047KlEKsJi(1oT^l1eDDD06*YikYXlLKPcZTSMp^S^#Kq& z5+f;^Z|l%JaHl&UB!*UKHkAeuwJ!ACf+RJ1?oOLp&?xHS$*7hE)!l1!q=H*+sO}ti zqbpP-#uRKsiMlj+)Gu)dhEJCIu7;c!(W>#Lp;Ss08X^;YjV&H9k+4vHV-UU_D_)ti zd#Unb3KQmy!ILhlUC6l60;_YF0ah1-xiseh=5=^LHY{#G!BG9m ztn-jVWA?Ughr`-jL;;7$oEp3xHi>zNBo3MRw0ApP*5@M`Ic(E4v*D2tX3Q%b7}5&m@G`aW?F0B^mT?|62~f$??Q=u!&D+^b;M%v zo~gC29`zceWf=NBuRAu1P)M-!L*;^YrfbY@LuH2kAxM2F>r0w3@Wx;+ZJ87)|9K$# zll*c%URx$aKR=A@zrlAl zo@l=UqP=AhjR8rjMEO~>2c|RGpr6ccW`lo4W4G}j{2UL$&uTTwKW{LoHb(p)kfm|& z-m21Qx9?{JsRHdAN<2RZRDvG__8o)pJ3L*=UpKlKygJ;NN%@f%CS9B=y;=Upd=KN% zCd%J6D9<2sqPz{{$&@!6{O_lwyjer1{P;e8h99dXeXJ~D@)x%(BaX}nvOn?D7Q2{$ zFem7dK55$SHnU-1tzgO|Vbj;-N|Ef<0(-I|HS#sGIdp;azHZ zS`M&{=S-6RUoxiC2xn&h+EX?UiD5UxnE|7pY~g&P-t3SsgxnACd59O}F{yOnTF8lc z0gE89Wgix`<{sgVWh|axa>J1VM%Q@OT_@8W-U&C{5$K88&@RrQ(8QAF|;Qb+Jh zjI8t}QKs1moN2C-YXCllawP{>Ojms1#w1b870^lZhmoTMIA~K)h3=q3UvI$0gTCwJ zGthK~(Y}_Zn5GZhE07b$v}Z6?>dl6t3d}dsklGjnhG|m~;A_i+-WW~^ADFiY@YDsl zZyOIu_wu=bSzau_#|Lkh&3!b&&^lW%<%c{toJ+|C_n_()6$Sn$cq<$E3Mm&5P5@hQ zmq0byv3G+lY_2LutPZ)V$h*@N73THA_%6XYMx)*qB{(G+x{PO=aAu*j1lEvTK(#1| z7Z@t?ZZZEIjUBjyF_oybP5hzz<9_=G|8-k0?n>KLlN&uq?Y8dnVeZ#9@e4+pBsks> zTXF4bFd62ay}t7+s?)_fS`QI}MpZ?y>|miuNk-KWThq3GBq7#l5$l z!JO=!PkRtm3sZ~!()a*uX!9A^J#AujAFN5fH^c~Xk-@H z*XE)EaCpqA!C7#M&#aJe_{^cPS#VjiT;?;VMjSqKYH${u5_Yxdc8VH@(tO&R1*7#L zRqmErBZt$xTAT%|_{>TyhtM1vn+2EeF&7uoylv{VWs#35zSzoZjk zQq&Fkqs>acXjU5Ik}e;?K!(;0caO=Y`sRr479i#u@e)xaPMi1`p(k2g26>sZiez0| zObr(Ya|#)Z@a^l+9JT826D8iP{v(|rMu^2&Rw|QM?p=eAzG>2Od?gwHv(i)p@U=Me zhrx-(5v|Q)ddR0GH5$y7Of#Q|n%De%2n~`t@T8GC4kw`L;=yWNMj(xl&v$6sh$IK| zjUmYBf%sqv&NhS%Q7DxbWrlbtYM0zWZOvB!FY0#?MAi^KjW96`;djv=E=p$nXwVS; zfH8#s{02j4R};+6RchRtdu82=YgHP&h+r}+#7;0`=0=`#F?24pXvWaJsP9;e ziQ;?XP((l$#ib!IEN%F7^?1iO2G_l|h`gu~`EC4}BxxwVFK&?bE~`-e1rWj5m@@V! zhZe~NZZ~XS<9uyr#S$3cedYvZTc6BD%1;b;SwMgvIdAoFOY+-k4E&BEV&>nlNut60 z+Xh#E`NmwGFi0QOt9EkJke{ReYbJw0LTdyx=;!pxq(JqMdVI6Ge`A=}4VZULn8#0F z5~gOQq*-aqYWB%=zm1J>XkFx5w`1k_&O)oAp;fvuTAK!11rx%_XqlBPv@BU+$ObN+ z)(|izIjnIXTdzzsG?^u2LO6zoo1=_jY&03mOhJ#S#J-VS5ESfsGIfAOV&a(|lxwil z{2H`IYoLwRpSgFQUM zG%%gfQ2QA@^Q8A9@LUxoARb zrVwmRhce;>O!kNTX?3vghpkB3v2(jHt+dI49X*VB8*kA9V}ip<0f2EqeSAE$3ky2- z<+#=Wd5x)dT7WpkIFlY|Eu=$AB3zz=3+f<6Fi`MMrBqg-_w{Jz_JqF1RTTaF6ez{n zhwLjv{a+tq0H>XHhcXGakuW38IdJCF-i`6$wu;`lJp*uf%+iVz^mhhN;gADwi9h%K zImPXL&t*tp^Se2>DKx73_lL&ydO>>78~{pd&la(@YSR zu1E(zs=rB%@;t-QFM8WKz)|n^ZP=i?Hprgib`J8jxlBS1jX5)o{u{=0Q>_KZwB?lPXvWR`8fGQmQxcd-CVZ>&;A~odmit8bKYwm~O$1>Es zN2$jP%S&!NE7gS${fl>*FodwP*LqZWj5msi2#f-b2jLfm36NE+*$pKBKIzakH)f8n zL4oHGpu-!bbheCu|WlJfb-<_tqQt?5efvFl6j%DE5q zD(8O8!H4c;{w+S!+lL6uVkMvkJ;cm=B(PT94{;o;tUhpQ&or>jHS3QIJ|<(ZiMa)? z9_L#bJd2nn#Ajc94WByooTyx-s^7$#TKzrzqRG0UP1d(k+TqG7#~fxfYqqbcy>11H zVWTeVQB`&^de@EMGzr=%ld-P5OrYk9kNS_#D|iPHEVUbML2pApj3{Ygb=LO8l0!wA zlm&{)L+FEkR<>ZpBHE!KwyJ|y#|d*2wCv;aN0p_A(4WDM;I~{uDzy9HbLkNnRuv%P z32v9%knd}#yW3bI1O=Xd1f(&;OWRJNv#7AgaKP4x0yJTzW0eRuG&|Mk0Y|qi(t1Ru zm_&iQdgNQNqClM|k5s+Ec5y6y`Zeg&LqotxA*Z*H6Q@IR&n`?~;^%F}5T!#;?JSoY zYH+Hxz~9l?%K(S11uxlHhQnp(g##K+qSa{I5UqApU*s9mz|{WGj%a^=h~Ar?|2Zn$ zq}Gi|WN4!^66r_hN2IriNaN=^N1SO&I}pW=u3aS>FFOpDxltWENBz|Ni1iFpqd0o# z4<@3#XiS5N!p}hX1~u&H{=z)bB|&UMmpyPmcf4dU*dC=;=OETOi00DVt?{w*wOypP!oHCHr z6#?udLI1d5K0gYvAb%b7W295KD?ijuHZ<>2RDcMTLEl+L$_9Ab%+;Tpb$1bOA;8~f z`UtuGSs1A>Ib8}iUp2MOeHTg;x#jf8c(;I4Lv=UWMqD|7);DnPqJK7T$^LwiN5~rR zq359F|2j1Kc4m5+*Nd{Iy*2#U97)Dd|8%IyskDTcp(PjqF)iWy*y4FT?K#XQ7M+Of z9djTJ@y9)}qxizpb~}9r6rW*C!y%$SZ~)gyycy&&6d#m%WrzW}wntt$^kV0LPa2Yg z<6eV2j_>S*dV79^`uxN>!y!6FVF%R56PQ~+Uf^aY*Q@QZL;H5pK4~i5_+%&B>io#| zg(*ab)%#$o;*(Kp8a(o3(`uYahs^v?d-8$R_5fcTz?!@;n1aV?VaR?#w|xWWj;H0)HyUK6m)>VE{Hxc!a&CCb$DYJR6jI?+EfeSd&XLCAkEhL&oeAwqav*mm1KZXZ*gdIJ65nfuEKHeEyF|lV$)L+J^%*C_1@@K|)RtNv=1fr5s zmt7cn+OSfXQk@;7CHbl)A!897unQ1wDItp?b1agb;1GL&!_Hc;I30z?x`9^Fj>~NM zZc+1XT3r|1IoL5aA|p{^L4*Sr<_|jn%ffTD!^duf23G1==iGN~3s3*?edi_?KlI)tj`TEdgcUlG<%G@yrj)R_i=+LrVygykq zWEMWzIsMm$K$=Q?AO43rR~x`G@%=h8)rNS=>Tcltej@O1IJ1<2(RHuwX#Vc}(0p^u zbl|WZTWliIi&M`lgAO;SVJFT1Ge6S2GCar4o(3bY97r&EEioDIy0zr{ZEFeKGP(?- z-AHbc$v)=4Y1=&y%%xb6QDq|MR$&@_zH^ao&j zVTgI1lpTjMuMBr(B0d;-<==yyNVA`F~am}ZZA!Hvo&x#+&{dS7F0b5>Cc6b_@s)KG8(nR3l!eJN> zfaHXRi<2+FUWc4f?OH-z53Nm(@qjO0M|6j_+@5Qj(FXg*W8tE~AZ^AR3|l~!#zUr% zwB#k=pa?F;zqWAzI)+HKN}KUn6m0G!Nk5(<&?fabp^v8smj7X%V(dBH;s3(4xr+SOpZ>d;`G+kzmF^TTUbg(}8mB z(_X~zJ_Grum;=j2``p?NwcYe^vca@nZb;h-CHF&l9f-T`1xm=5qqKfCk@viCbv8P0yiVL zUTu#ZTDSA0P1$goN(Q4%E@7_X8r-@G2a-&-Zn$~uXwMZ-;Cp8Ra&IS14kFvhLlT@^G_y_K8$r=M&C{f3)zr=o zjyRf3199ml{c-$pvw9%a?+*>TeY(6h>hCl7$mx|idTa&%zlNHgN}&FNB~T5}m_Yp! z?W2&ZZUO;K5C+rMa3I2De&N8h_{DAwe-e6yO-JJ#sk)J9Ge}^UT4w2oj~=Rx=3`Fv zSp4wOecxlg#F6#-^zjGp+G=y}vX949C2RS8vzKX_F$-rOfB5K#189_0-W`2pdW*9k zlgF7nCIhoM^vbjI@q;J7@$06dVlk|x1rIh@)+;W!k~zY)w8e0A>)IiAKAMwv*eC7C z6oMlbG}RF+`rO(x=~4YWXo1Q4ee~xh`Dc><)ju1L`&+uFo*lNaZv_}@up#xPDQZFN z)gZoqV~Br!0>p10VZ||E8`+&OmK@IE`08*4Zp|2d2P%Jg2Hbzn^pyF~xWbC!QoY{~2h-Mz;)7mU0ipf1rctNEb%Q5o%El*B9X|#xJJ^>m&5>S~^UR zkJnO05lw=9yp|eEAtlBzrJA#3bbe|yz*YZvEhVFbwi}6L_NDCOwbWuWjde_}(>0wN zDpBSFI={8l^fWME(Fd@r=MjCM{Oz~C%LwMPOkvAcl%z$B>igmr#uOk=CIHj61E70W)ws_9K{Az6tmKgRjub-HvOuvyU@ zBN`82GL~*iF>ZoPoF$ z9$Uw3Y}JMfTgb>H)4_FO0^3f;6im~*Rk;(cwN#B)!QDI8TNmvtbw(`LIdeB5Tc&AH6aYGWsWhhvhMqw~eXec0#k zlT~A=@X1czzcf$szBxwRTKx{j7IQ#mJW-8Pgm#p>&cgazE!+({e^lMu2lsExb8tW9 zxNdR7dQE{_4=9G+e~VSoB*Cp}J3u>mbAyxBP8!|dcW_NBlB3{oB1MEDAu&rVL)-0| zb_3-Gm$hG$b{T2{B!p`un88fz#%&eaRT@2CoOa+}tWYeP7Q%+(^4cMPTyi5d`tITE z%u8B!W=bL5f#y{b=t{W;j@K6}(8wJ16Dz1~Wp-parkY1<7}MVxnh8!K#i7g>r=mIs z?vxcAAhL@ur|=K`JdV>VljoVG^1lrsJC(li2bR8J5Q6C&pJc&O;6RRlID{QvJD@k7 z;D!uGsr0vkH%4-cuw_wlT)+)^ zD+s39OO|M}sfXg&P0Nu;pK%}{{Os{#Gm7R9F#_fQGl}5F=+4D=@m(#4LAQJt zgI__cM_WWF8C~kl?sdaKe?ddIcu8G z3~o``ff$q5D30=uYt$Do3rLOCLc1FEW=Fe`&D1oJbIBm=RAo&Rt2H9_o7KuqXimBJ zlb^D<#e&(sF8vx8ROApVG_oRn@UG$ge19ZXz;cv2E=z9gvmvl_Tr~<?KOY3GJB{AA3xpW^|eL+h|}!H?rEg6qSZ$V=dhTFitq$ ztRAM{pBS2ccKP|7EM{i4BjtsYNVN zx1X9Pptp6--R3 zf0GFIX7z8}gl=q+2wL1_L2p|mvTth#42&JEvFijg8$P%{*1JBksw|qT%CP*mg$a%m z{_nf}`V=&lp{>VOdA6Bl?gBdRvVOpF1lX6Ksk_(K9@AXe_woXxJIom2QyOGq`1)p&GqbzDm|XDia6nx}NNHQ2NRbq_c0{nqwf=>>eCQH83T4vxtp1#hF;o_W$oAY8m4)Xc6>42GCzp~k)`Z8&IW)~v=WN7%N(z6bOrob?U zmg!mUNmGm?$>g#VQJqO|dj9zvI4||Pz>?P?{#AWb=A)Do=C}^N6QFSzyvh0@M_xI34jH>*qdGj5^A{Z(b$9G=Wt(`u1bvDV}Giys2&3A?bhtq=R zP-cBTBf#M@uNH5N6Sr6<=D`pgPV;GR7K|3A=1y~-52ml<0GTD<9Bw#ghUb}GF3^@6 zmRs{$yTLE*QOu*}Te5CfrqlT>5>(eZwN(BBg%Z&8#kt~khjQ>MN(0xuRoY0*FS2VX z?rWDY7xeV{3rKXlxP*I4Dl#@_Sm+_e6&5QhQ*_ZUbX|PxG&*fFF*ELVjw8=u-zT<2s5`r+yr4ykYwioS&uH)}+o;2QFd6py zCZNNy)Wo6~ke?bJ^sgI)9Jnk*43{te$Qozs4MFiWok{;S^sOk<)q_)dVvVfZG`e~!F= zP9L60=G@QOS?b?3tBsKoS#v6DGGa&!&|0F)feO5>526UMR#5OCSM`8&E7A6oZR+M6} zI^UgYUR$ftbmbi&8owY=q+7*WKb;nYLFTB}a2JI-Ideu`vTgxFj1-J}_bPHhY(nPK z{%)?(P$9jACX5$aGhol4OjXF&YI3D0-n(ZCt%1vGpBqX3DbVsw!G;cH-W&rk*V))& zPQ6?9$fq2!Hk6)g-df{&O#$?|I)w3fg@6o}hBc4|DVQSk3>yIsUH!p$#9p!un1RsH zQwx!y7ijxrZV2!VNM+oJvX(^8Rf_hX!uSP0GqsZK`j&*Qt z9;RVo$t{aLefd)nFxBor;Xq5;kA{@F_Pr%&gTzTj4{_9CSQQ}S|>*nZ&JVw*ycX4s-BROqTr$T=+G*qU*{q^Puu6%r&g zK>EhE=G86=6$uxnoQf)XQ|Z)LM?#Gr;!c^7bj>2exnFe({O)~sK(|L5MYKNP-9VLE?ERU zKsZY^X~OKXLjTg%7kw>@Eo+aZQ;f+bJFO|F?`2?Hn!L- z{io*3+Z@RAZh00g*Qeo)$y1KQZeA_Ug4K(rjS3BngU$Zjp$EHn@D7%Pqap}D*; zZ{$B1nxJEs5yKnVwN?^i^0Ji#nTn6dndQvIcCu2T1YX_|>=2i3!R&C_; zZ8Ria>cD4bizdFHtH2j7&V5T4=l-RK`2y_arR=%9NHFeT<8G+*dF3uNCalt$wXOBS zxR^GK-<^q09J|ff5cuE^hGva@623Y-B*sJ>ePOa4n~cx6?0%@JCgZs#G;3es&cnS0-iqPNJvMUDJ@O@+WI5=3Ay8%U!XTcD}66-eC-qC`0+5Q-_N;|BByAJ_8-H=+jYgu8Rz79if0$pDQyjK|Fe*5xc zyRPlR`L1m|whwQ8sL8389_6d%P#PeyrDv+4u>crMSKa|}r}fK#gj?gD)471_(tPC5 zs*Rju@Av-NJgK%gHHUI|+@O*JrsL^n$afn(2Ct3I4nt}?y|S~}PtKEIuRBdjjyBHk z=R}54T~0rBH2T6$f?t>?30@r*I2`(;?;KFKkL?{(Tp2^kJ+Y(lpUe{tr_GPyc|3W6 z<;0P-vJ76T!@N0{a}Q)hMzpU6&##J-l)~q$AHOmp?y$m9EMxT_0;$1ERA5U+f)2-0 z~V0$J`o&Ip9z$D%wc)b+Rj zAA^~EoE6|kWMgP)gdk|t_bVR&K_bsWL6k&Q)Cg8tbT7Izgn<&02)42I|6%yYV8))B ztS-ED*ntbYF23XbVhQ;*@^87n=w8r<^1iyfh~d`DSzh)uDK~I6=iBag-qHqKFVj#e zr3wha(SQXMvF~lQ@IX5WVXySXXvzIWUyy!o-L{}EdS$qE z5b2g-I24#?ot=q-H{m<+ADfI8(i-FG zC^6It17PZ^cQ8pQ6F9ihx4gXM_Jv&ZuGzp)(wxM@!Zd?Ke^6S;Py7Lj7v+v@F!M?*$aVcU8Q=pU0+Vwfw*rhy^1d(yv_3dX#HQ)yd_K z#U6wszMwJG^fhdKMOVRCI2>_Zbsk?0?wn)$rO`up)76i(a{|6A6lkcxlQwt`7J$%^ z0O*}_ge)MMTotaWuf6cZ6EI;G26yreNfMg4_7?89=W*yt6%Yw=^&@Du`X&mYz49}f zkyHN6V;tK090t>kA8t?wFX{x#H=tx*Z9hq@;zDKnC_hI}*iqaeZh3)mi`K>{yF5eH z-mDrt!m{BmZiAKWX5HXvYQ4 z6RCkHY#uH~(vO(74z(OP@i6$vq=T3^M4q%eIjHd}oQrMU=x1I_7Vg0g6(AB-3wA+W zGd>1RQ9*JczX9w~JrIUP-u3ad0jq${!GW)ExYZ6PvKELq9}QTUFP9?oghCggE08Dc zcNp<#Pj1Ct>o(YN9*cRj1}58~(c=;{J9)Vr%6w&3GIN;B-qwxrFoZa;P0VAwIc(QZ3%m3`{!Cxvcs$aSCgMstQ#q50kFP)4wlD3gnb z?gzli+bOZ^BnZ@^IJ7p-8nJL&cH~Ff4M4mZg`eqn6=4wP->^xy>L1hO+rKz8QS1`k ziCll$B3ECpJV`*(F)prJ*Q_??OyF;vY?(_wo&dDQ?@M_ z(ZDjP2^7p=7DiwkJ6+V);^w#^qkM~yz+Hq<=;y!kc{+7OvCFyy)^nNB?hiA!^%XmhmGzSJu`b!p?*Ct@J4Iqr{A5rWq_WB8py?*@0?DcP0?DeB2 zpN!{9VlS@RRP6QDEtZC_iNm86=t;EjVi5+n(9l_PnO~2=0TpBzGL!X~e8qxG*~&po zL5b=pVFEkq2i*-x0+-x4JBPf_ZDYwLzBGB^I{_4H;C@;gxPSM?1NUdFf%~^_FmPP8 zsRr(mHgJk4LHEIl#J-kJVB84m2Nv19y-#W~LYHW#xC!fs4o~XG2k0D+TA{dL7Ob0> zI*5tFaRYrOw-?P3`$%ChhidSVf`O&>>o?|+KWp*G-@E~jaMdgx8Naa85nyh~A)S2W z2=F$d64ESd=g4+HoR-6ToVLrbvX2*8Gy!r^bYzX2;JDTtw^kVXl2dpD~Vn=D+LZxoR2wH*+ zN(rt_Gy~2ZD$|}12|r_IA=FPxw-JYLv-~JEgNuCE_&>Khsj#4+Rd1In+cI5Y7 zFMv3R#+7pD-98+j7!hO!M?1W+^XsQyw43=e@vD21_~a0tT-E{Y@tn#L{f;T8xh}bf z4sFkkq``TT^s{3Z6%M%x1sxEcj+l0`+^o_R3*vf9`LpZ#|V10dv7wt@b z>-F{T4K+KJ9{1Ch-C=;m?2e~tU^z^*?+(B_v9!^WVL718#+-PB18Hte-WV%R%lyi$ zJj)?8dt0+$^19RH;h=MV@6e;2ou9(=Ggejh*_39?SpKK;WZLgq;?GXew~63AO=7`- zPy1pA@P(IdVI5sJtEQ4a9L=XI?||g^S;_J5-Km6~Ns_^IS0?_U>v0;Jy%d~X}hafFk%zI54aJfo%7qaKR5AQ9x zv*&*LqaP2$SNX$xa1%17Ay3t3$9Bt&=7fSET40FT>{DqXuYUhf^{G~Xzih1lM)zz5 z0Ls&nio@|HwI(9`*|9@l%-RX1Ox|VkW^bM(ayo8d(9l@>Ci6Wv0Lwab)9eLv)$W_s z#_R=`jx0+9N)Kj$K0Vlt9tc)KiWbt-=ss0S>&y2Y$6gPC&fOzXG{yH zSN6Fum?t7mbHTuL`nkZ7sctg$SOT;3wp=x9E{vafw711gA#TO7ZpQen6_znVWcg*u zNWt>3;M20fF8JB47INR%y}*77UXM%(I?75@i`}Kc7F**^IOZvJAzDHpA3rw9bu-9m z@5ZTROg7hoxoyO46ahfkSumcA%t%yw#6Qf<)VtH*$ua13<-xrF{t$;bsU;3&UNRtO zB;`6Ddg0K+oaXp9h5#SSg2o=sU$y4AffSqLpBv8t9Db8ZIv_lrq@1R=I5nqn0NtRH z18nxea1uzm`^M>&T~__pJO^ZCtIHTJF8KA0!Q#}DiznFhl_nBw26xv#nJc**65Cl6 zOO+Q>!{NtHA#dF5a1yrJ{~8Xbm5%D_$k>`@N3swH1i^?rHWc-T7%~>JPBAA!7ZH9G znT`8^5GYMP9Ev={U71u*P+eNkASJbf_s54+IegX}(-}mq!%4447@}k55@KRmVF|aF z-0!c!c0jr~+3kx(VjnD&RkhiE$LmFJRRq9@oxD^jJZLB-ul`YJw7ouGBpe6^Lm~g7 z8=|-dFaV(o*Lgx9H{^HRCwc}vm>{HQ(RRLOom{`u0cmBOxAQc%axgyFWa^Uv~-qhW2iVg<<8L7sJr%K}MQ_@xz(g+PB? zTKWTsyui4~?H(>~0)hKTBxssSPho($$-=&38oczf-Nts3X%1yp=fEl)G;?Y0#@KKY znqylIEdHrO>q9bjl-*5z(BYL`#x4vE!&HmjU$+)LV~E(I=je+uN*D^E9r%g%?U&~X z;LG;u&ry8%jRV!kb0{~auRBQM3gbwLr=|t9x482 z^>k{g4xR-B9i?(L@ZL}mvXdq!)X`${I*xgP6P6r>Y>%A?;}E)H@fkN1pB*cJxgIAJ zbb#T8e0(uA#p&$Ot51z3+xK3-XmB`+@EKptlYC1z zSwK0=ZdT6$<*7-`uI`(0)#d=7OLMc}6S$2AVF|EXRd;}QynBGQNI5~}q_GZuc}qrc zGxifP2Xu{-yw9YjnL(T8oiN4#A~lH>5jw1PX)4{4yGn7bOrxX5w3Lu8!y&Etqpd8E zUCwZPM0b$pEs+`a!ewKHrJ2}2%g6u%7<(zWx?B^!7SILy*3dk5nh_3V zK0B6z9AFa)IzVtEG4!iL;7_G4{cTHKGEigc(i_f$&S7(12?sRB6Vg}`?Z|$w?rV48 zE<>jnSHzs3%*+1Gd6MSy6PcT%(iDZ~L@--=xU6$}I6Sr!=AX}#FitL4gQ*M+d$N?{ zIMPwd-6MOBi`d`}_Gl?~rAm#$H!AvZRxsa9s+jb-Q7w$&cfVpc8plpQc1H0(wdNj& z=?yj*McU~b<;J`6U1KlB6!%;{U!_8>ifK~%QtC-gFu&p4oyAgv>q>w;OGD(b&-N!} zV^ZUjIRtF(hK4GRrK_Qw{%00xjgFaEn~E?N0LWly?%CoPAT3`Ggrr@4qZfnE?dVO; z3rnOnNHAq-JDE1;NhYV6JdEMwnamBsq7L0O8;M-CFPYWGY$W~*39*Pv6|hO@oKO_| z5^#9qgu8Zmv8BQ2S1iIYq`9kPePf>2OfGoM|?DAH9OUm_%Ey}VSvS^#Qhr)hr{@W6(^Fzwt!8W-}Hy)NeU;nH)v%{?8$7;5xQvd z@7N(?dxl)Kso4Hc8L4iekTaEfIP1E`_u2;f$TlFo#Mv;Bba@<*gqdI#acc?Z@4At; z1wKjbF9qhyfOxBX=-I zG(vLda1SS<;k2PN^-dzz z?D{ejQ5==U`nZk0up{}+c_Qf~nG6n{UNUj){Zl%0(=5nbwW%c2=MHg|A~M^s*kofL z>~0OYwvpnJ+kJW6sT?X&2?e8LCKR4C z@G<)sn2#KQoV;*w9X+c9I?eEK)vVze-x~#+aB3E3eVD-}*<~E0KA{k;K28L)90-U^ zTw>oSvj+1937lg|cf1;YCF`UyZ50kLF0^Q1V~#dFu_f2&AoVO4970QuEsWl{6^u4p zu`{XCsc2)RK?7V_D=`R_CC~w^84`niK%^Ehaxv+fx{V@^5K*cSoEop-c4byeMsf$m zba}Zf|Jk)@I!4R2mzj1h#gu5vn(CIRE%7h|Ga->8m^rMVKivM72#!ROn(*xG#!a3IL9n7gg%*)7-3~+KzIh1({VH3a5VqUtv+QDvaOMAg0NCmV<3O=>xiVmx6DuOCXi#3x_ipkN!0r{l0h6@Z&=X*?Wsxo6;rI&fskOK~OCNqsD zeQ7qd*pcUUnf9~uWG`&$IH?016|O5W5j}3j(^U!sL5DYX6u&V~6kn#$W=oObP#b>Z zfYNkx$v&>8@US!`19PWWcGUlyd7|!QMH+g-^j0LNWH=fQPa!_!2r6t5Nx2&A{1fGN zC5=|WF({U9O>l1@4Pd)Mb_B26vzP3~0Jg^rB@-F+-$g$CyDWQ`smR{dw91eW%YAG=Vod#4Z4*)$+#{Srn*oU#+hE{Fa!G^|C^AOlVp59hzr?nZXu8swf9pQ@3H9|-CRl~CFGK3X_k;)O+kKP7Fo*Gfgw@vXak5#owdOSBgh3x+Efs`6-FzJGZP8k zhwYZ4K9V0JBo-+bVb{=B77Z&#PTPpFQ=6sj!&cTpMMf+s3hGD0S)xYl2n^RW^E(fZ zgC5jiM755BNKo`BOco<4UNqrwwIUjb1V{<$mMZm%N-?bsMXXys(eX!OESi64Su_S1%%XYOE)Y2448L(e(vH9# zQ4dPI0Iv+GLE8T(3rZ41D4YbCrTyep_6hz&!@dvFj~>K zKW0#nIeg~P+AP>SZ|dsiBpO)H99kZ~t41-}oW5!q$JO7#ohHUzCGhUEJ1M_8@~ry% z+@tJ&jw>g>h~1bbvWG~O9QJi2L^-**D<_S+Bxk*bQooYY>gz!rry0q5qQ9=u*Udfw zMFpA?Zu=X(?9W=y4GYbUO&WZPT(tR@bxeH~?E=?jjT?1$IPKCHTGZ}0Q*7qqlH8uUTNP z^^|kJ!qFNU!)rt?3r#Z@>a?jm#XojanAwtXts<^3H!qi@+ajr9%gv+9W3yHht}d6&?_X3wRnrUP!vNLoB@OTf$W+c@fF_8_K(H zBMJZ8bc;%}EWEq?AQA!_e!(pi;7D@6orC|&U96~Y!>5ACPPeO%R!JD)f-t3y;4{kC%dK6<5AaTmN=e%H6?B4{trwkR#UovxFU@@?&5 zUw^o7W%SeE2p5(1!uz=OD}>uWmzN)em)t-z@L(B}iJB`ZmBPZ2(h-3aeJ5*R!HDnu zShCN`cjM}REZIMn?DM>w*OaX0e!$0){bR{KEZI%_fyM6pGK|}Ck$culb+bl4%;_2n1@lq$WqkbL zYQemBvidq6m{)67-_XCYi#4mCrf)xNUaRSQ5Q+L?+O3)^jtb!Pw`$T-x*Q3(-M-+1 zSRiCxucf~GD2)o`nuXFrafR5J6w+iby^?meS2F32g*NWlPwdWkCDu z->=^ud!Jned*6RQ67lC^%Rxbm<#X?`z7R~v3Ww|8UvCsTl1Pug90=Cwt?SMAeP0gv zHHZQ}R)K!0#wRNHuJHv2eUSzefOsoy%>46HGHrqb36OC{#& zEpnenKMsNGrxF@+zWUT!^=PvOG4O`_NS)!kpBUpkcObyN`81?tt`Q3(LrryjsjJrX zP6L^zD-=ww(gXc-ofL5Hxk+jMq1pYH1L1mTnJaF-scWpyy<#JZ?^K5kI{VCzj;ZB4 z)(X~{?$5omI%DPl_lEC_j0Eo0ni($ zPn(nNk9iwS)r+75Z1Wd{fEO+uuYP&+gQyo-!bO<+`5Ilr>a{#EC_+ZegJz!rZ%s#i zblDub(5$c}x^$|95N$niGUd^vOOlW~Dc`AgBy6?Qt#!GEsy6CKJP!V#yLZV3tCV2L z!MOop!8YX46f=)tDK$!{P8J(JlZ`}XHsBNsnq9i&zIU&NE0{`cHXfWv@Q0(s_LjV& zFI*oS@vKn>Zy@d(UKBxkn=4>3hz1w;%Bt(Hrx2mey|QWn3+_2zWgP(x&UF~l*VJrww7myN37X(NmTA9JSBoVHc4L)R}BlH-hS#5tEH=(mf^vh^RJCx&n>zVWZVmbp=p(Nn$N~canEd7lXF}X{1WsI_k8pt&t^b=WDXJ# z6$^g@R1F5aVi+0UhM=9?Ge!rR$a_$$gT&ybxG)%&(qQmH5oC$d6Jx}=Vut#FA~9Bk zBN-H01ibMT8A~zR!M%8nkT$&~g4Wc_AU|0pyrbtgA?pxj=0%OG>{l(L;FfxdZ~?vL zoPLkW2wqpA%kh@nAC<;pE}}Fr-~wZK!%?4ISD|5M17w?)ObzG8bn?vOI!iq z<>4q$!_yAX*yW%B4nx33cqu1Qd*+bX#3Akw=U?7fI&x!VU;Yhv#*zmiX6Hx-Ae{7ayFTlaK5C z{PW6V!-4hI&=QB9uIFvOJKN{tTf>g9M>TZv)*>f5(XzI9+G^@wh;q;>I0Bkt1;Hv?j^BTr)hq`OjPt{UfH;U>%={$aX4Hfp^?D@&1XO$5+?*8(+jZ24qg|pOfl# zHFzE|_5%B8`XvXi%A#0kpOf#f#A4;)orL9GR^e4FRwU-AY+pUbHypw(iQcAMx*FuX z$8Ax8OQ2k(Y{s(ph^`>R$zJa+`z!8IG^Q`D*a_?_aN!&;hPzzZBiU zfd9fDjcQT-K6f08|9dv*v;XR+pLn8@S=l@6EpKm>8gcwfrH{*N$0dBq=J6{LT#cX7 z^X##3wn-oMvWM#@n}Eco4etieoW=d?$l%bv%Ysriip%%d^NkWb&}o1r}hzk?X30I;`L^a066rm zNoxn0!=StuC=^4hg^Vw-87+#NzDDvmnM!eM>tkf zsiWg$a@W5d5?Y0oqeCU&&96oLYXR}H5Xg4BxmrY2LbXUNAn)Zvp~$62O6>=_{{6kY zryg#u*3@)18TR?({ljF?F9y@T?ajnyAsKEa$~(1MVOQ-*t>cue$ft?;ZZHyw^o9DF zbQU=|+ge6Ik)m`vo{rc$sd|g;qvOL!b@y`Db6M;LJidB=J=qK$)Dr#J^5sVDEG@PU zg6U9l^JpiZ6r@C1Y1az*a!(2$>}`nQv~P7Ykv-cApY4=)jvM*i!m`|2PAb82tFgRu zv>VyKEO$Nm^+IO3A4(RIwY}_iwiyqG@=fuiUx==%$y54VOEi{`BQ^OXnXCEw2dQMF z=Ixg%M{;tfR_&kes~)kg=9=5lRKC8F+|SoK*-Afq7DtULSV&e%2eFJV-#L=w$IlB8PJLEPc70O7EztQ*}>H?nkRfrE-2X6<^Q# zBtZ$UDe;s)wbzOqY;Wnxs7VB9$ZNrc=E+uJyYC@*7uV8ouf$7ldJnwPXc3?^^3>(MD(b$ zQVBMMmbe<|pY;xpcD>DBs(Qddf<1|9D4S6{MrgPE9#T z7i+0Zt=g=0*3@*lcM+I^zr2^pa5%KLyjIw0UWQh0#*4MRwNCnQxgS_PX&%Hvo`Ym7 zT|NmX^I+TcOsZ2k4sKT2eA(LzY#(1l!)MY-sh#f}8}I>WaC&HCHGSDnhxVefCnKNj z)vBHJehRMBSY*5ANvr9DV6BrbCNIwR+ojc`X1MQ@Li>?Q3xm|E=W^a!sFd|(3afh; zil?`ljUS5si(aHume+il=GJn(nc408dx@BGr0(ZeGY6jIfG;1HOPiTwsud{}(}&6Q zikM{aR@UqUt16I`ADAa`}8Qek3eMjsx+Auzs0{i2cTLxf*IWj)iQvTJClO z8TI5anTl=)lAE=XxRJUHqUykbVgZAr*`|9>`86^Fq#OI z^3lyeb=k9dxFcRhPFm&YiVF7XD)o$9tOyo=#)@5UPfRDbJ(sPmYOH@K$Co{=mK;<3 z{pfnJ)IDAG^-_@yWnYbCj$);qY*MM6b>fG?;zl)mC^b%+K2NQAC`l*v(?oP9SiA6a zy+S4v+up6orA#NCi|56aR;U#_iEi$c@_X^MXk59FBCUQVnT%u_o%LeoAi8oHs>t3g zWyL3Vw^o(1v=hc$>wC5W8RCJU5J_%kxAIBIoU+`hsR!kr&!67w92CQ`RUs%h{lZaC z8~=-bC>`$Z?uYu2xQUu2TlY3P{X<`WbCqP-S){phyp>NCrsZo<-0cacfquE36jqOm z77X>YCCk;s7Fw=VSJTC#?)Hi*$5y~|N1JQaex!0JtHmu@^)4qO#p-T3)#zZ{;>WdI zN9kodo3WNRA(t;RN6SZI{PHx=#vBcLe9@{H5S!bz?ZZYhkW95#TETcgjrik{-dblT zlkp#<^8TC?xZ5iRYw2`0z8qcYmQI43QY9PO?fLiA=@z?Z)QF5Ky`g1)u^X4je0k{)=D1+`jX;JZ|Bc)@sswkE?Z{fmy_t3a@tyt zG@=!gH>Z=Gqigf_c3^Y4+F##GRC~!(&YS5d;i?FNC-RA8ZzmAXMluV2(F8t_`0FZPGVbC{A#4Ix0hS?r}Iad z)0&bF*2G-C7U~~{HX@~s&G=?Co-L()S)VVHlXiDjo4J$dYNE8U3`gE&eWwwM9%aDR z_2SvSHy=p#xA!XRNsrX128!E(RyUaItX7kIot0Q`Q|!dH{EAQ&dmH{0e?d7r@yJR# zd=f5)FWQ?0-||K1?5weqsiuWyz2zzI^p3^&dT*yuy9h*sxwx>W?k$5Ag?OQR(M+s{ z+v(P~7S`H;D*9u&vzXtzn#zRo<$SGm){r*p zXVv_wnB2(sJR9r1v@a9e+LdCxU0*U#I*e{8l?z`kdg$5Pt*r!CyzxvB3&|NoQK+(< zUG27Hj8Qanb*HZ;g$z1uUep)_(Twm|Rt5B20ey7zT9d0kW5h|@DO37@dfI&D&<`cf& z-hO-|+G#aBsWZ7Q#G3Vj9O|iO?UHbiu2xfh?`rp=51E(itfYg~XdNnULx zPuhoUE!emyt$9MRV;{7xsIb4;^mT=3Wc{RAIy&8zkHR78w4Od|rH?bYot2%^VQ0tF zD%QP?Wk4y^SF&Oxq_*}ig(RlB)LY$8EC-6|^+t7FQbGkoA4;E%5WP35bE|;RIvrxEP z=v^Ktx#Y1V#B-kVwrQK}RWEmBCAD{`uCxx1>iyI-dLSpuiqSPS)x2DdwuGaIxRcx3 zpGwa9dfVG4wOZ2G4u>yyl4@Q&9J`KRoE3J?_G_E@_&!vRR#;I5Ke)3KTssS{uJoWo z#iYtnJVxY%eb5SbTgRbPvs24SiTrkLIT~$jdGp@56!IUa(%$KMER#K`wgqoHF2O8O z+xflVR_+1{b6QP!gi8jX*bk6x`_Ugfju(VP+-UtMqe?+6MXw zr^>?4hMbBXyVM8S{Qm2#f2xl;XNXP3pqVbbpu9X81XTxHvAQdyY^=wL!z>-Zl zRa-quokiq;q}Cwt18t%02_()k#k%JZCJ!_-v6yQ{3z^-s?Y#~EaWk~jKFub2v7M+? z4kq%a<^6_bKZvcsuCKHqo+eg~+tuvRb|O`49j;e*l0ry2-q}nw!bh>?RYj7T4d`*( zo?V+Bw;ww#3nx3#yt?1YiwBmjf1S+Xb*$z}@wD1l7mI~W>}OINhJC8(bV5P$RafO~ zAEW14>j-&YZ$}PA6Z`nEvJq}>u3uhC&>d}UYBqSZvE6DWviq5%!<|sH4BZezu^xb4 z&_49$w{~L}nO-s1s;MW93h8-gB;i)%xF7bOuYV*ShIZ=hSb8NBj8?t5jZHDMby-S8 zv_x_p{SB+JLuSUg$Y>@fS(+u1A~t9wfFu(lFeg&G%%)Y_g@`(h)MYxcVrvK-$J zdVTAeLa`d~ukLrdnbVM`bQuV$o#Uu-x!vrZc&hQ1uh?`Vq!J9lCSL@sKI1z zB@pjKtEAidw+j;KooOMs?rrXXSIU7*DkEQbmtiTLZ6B>f)#KAxtW=Fed?#9e%300R z6q+ZUohv@h^R&-=fm|pVNM_~j%u3g*p7=tCp=32J1`FHOwhZ$ixmmy5 zKk|E_1Mi>>F^x5&7A$4NXh2rG(T$Z%)q51K#UkFwrhhvx9o1lRdyl%&Tr!#I6tbJi zL|ADQif4P?et7wEyIc&!1e3Mh zOjnH-!`;i>Xgs%mS@tHptCzWAyM3DSwPOCdZK<~`2cKn6jW=8b{c1k#OfWdV_ED)HbWWT;by5oI$9&RTJ;q(E1dT+Csm9pKsuTss_OJ{QI~|9Fb!hV{*s_=Kv<0P( zx$iB(F%r1+$E1e0wwyl5#S6-1J9Fyk*O$9h<)~kaWzG`mZgV*RgW&*eRs2Un=b*1_ z9~Qyw_1eWnZ8wp<+&r#%QtIYOwSFoUi;YSt7F!LdU4J0DyO#ItEhoD9S|HXEFT;gG zXQkE>FLrtYM6WEDMd+8Sn`=s6Sr?Y20~zklQbh#zq@w2b$FWC3~mKt@KDCOiL=YhajL!FQj)^i#g50D>+O01a?vOkMMu2p+6Mi{{TftBK)7B z`fpZ^uzu@uSo^W$YG}Cf;7(qYq;uLbyc#@B*|^yKcfXBe2WZbYr|i_;;Eox!eI*!3 z+8^o|1HrNj*!`H5uxIgkwEtxJDgHLr!Bdrj&uWV3HFyo_Z|RUE<*U_lQ?*e7R5aSm z28}ZfGKrh%2H!PH2H69E;pAnQwqtiy*s@P<=kmi*}yL}%y zwJO-_LYiPBwZar7&2t`8HH&LOUK@WBgfM&sRQtKlJ^ciu|C`lCR;6quV!lLB086J! z2aj;2mZ&0#s*621P)ud1`}IShv~!0`PjMG2lENUOl;VL4jk?rdav8_4>q6g+OIUIB zvaCu-|Br-SohGFW7H~8Z2L|dwmCiW#Da{sj$NC_mxkQ|NrrQ9pA5Ghhh!%EZlToGq z9=Ow;eA&(S!EP5vcDIh46C}Ftwcx^qxl%`@t6!0rS#J$z3PcH6H?U8sx7oz8&`O?0 z#k`xKAtSdLl8$v7m4cS#3%SJaBfDI|Jv@>aW2M8kK()+Y8bu5`u@q@0DOgJDN*AP{ znS1tkT4pXodsn5DkEndqddrpBgCrqR=mhdoi-bgP7c&) zvux6oI?la-d||X*tC4XLh@){v*tY0uYo&2mR_JTcDh-?y)(LOWmhLFQQyPnoOjOa{ zV*=FmfiT*k^l{(}Z1HNXnImP55V*sjg$ps;U=L)Q6WqoS5p!WG8bRRHl?J_bf*D+b zsMWH?0z?KA&IaYnwpa!{p;jb`Jt=_7ZGxSVnaU8Ub-2M7-G2y#+VpK;(+g0W|c`CDzmpW3npuG5sn->b82uFoStFHZ#bCr2M%r8 z(+0gxc>?vcLBkg~l!v(9t~T)+7%5z@V&%l*`d6&Q)tC`1hhXg1iwK9+42?KYV*D)T zc>jBhc|5X=aj=akYG}&m7>KUKY)&DsvEhW#+bK!Q_sqvvVME4;|XJjppDfsQQN4&OV!lIZMFsyYn2- zux^6f(4^onyKM^&WSE*+zUO+2#-!C?Od*H9?QW(aWsBWt%V}EV#?YKU)n9mWIQhiF znCm=4<|Ui#+$dS0up5yKoKiw*Y02FP9Ty~cDfHxMqN15;AkHmon4;80m-=@KE@?aqKZS8aFSK-vc%db;;y(KQX+P`n+jp& zaBxU{%Nkyp9Sm-Q%%e37+82ig%`P)OGY)M-n2axEvI&zi4~DuM%Oi#{@^>sYF~DWU z$TN)Y98L5G6VZB3A1VU_^Sd3`_&kAqWtc6@z6K+&91xf+NH{9JWzLGR^ktKYt2WhS z`nB~6T~jEsgm7>bDdd2{y%g|O>8{B>yUd_XQV2QSN=W_>CmZrJP!T4Mn1}4{LrJLT z3IZ-GkXd__01kJ((X6B9&8dlbhI|Y9H3{~M-}Ht}4k?Bq(isZ_yD2gR%X=9R_&d%J~xwG@- zxijRB>1~?;DPmxP2Jsq5iuOl?2K|*5Fp?BWel#B_njZ<;CQkY*D53)WR|Ifk*AAMZ z&-IXQayZ2noG&?>X;1?>X-|=RNPoa~=t7;GNu~#c=1{RbPHRjoF%ySPpzF zg|APEIZGy|MiN3%hzX=SS)Y(R8L1XMY#PH;uo@#WR7BJi{6jMZRU>!`e(C)iJ=5&o z`}viT-FnKt+j@W$sV*O@te*Hh9RGNl!|_p;X8nPl_?^Jw=;g#3@qf67<;1FHmXo1h ztNaFZ9d}o^6rnG`9;N+Kf10|t5p0I_M-0DmW(Pm53BG~+F)_dO?DjqbSWD0M>~iZ| z2AesYH#_e>y5mxD-g;-TF8+3G^>ugD#s@sGYAyJ{ zzw6G^KZte8SQ^5gRP~%xoyr=*OT&fL8rM-JM-JDei3MK`z!WICUHa$K?9xk49w6SpU?i5y!?CFIm7k_b@sQa{kpC;d$3Z^V$p{z(FUU^kgCAe;CpTMdtJ(`2c)%HR`@iK##j#<=dn)%?|ofs9%eXA zFktV+HL0eOVThs{<<+3j>=9JOTRz!-UKm`=Qc{MM!V>+tnDjgPWMx>G#%r;fLsw~K zmihK?Yu445?Z{CTeX2riX%nRzcdTkwkNsP9&c^W2bvr|L)fc03r&N+bb`&uPBb^SN z)LY|-Qd%4;_lftDmAiZC0%qiI4FBu0@-UH7N`zJIi@MqncIR$W3?T1ridh~0NVqi3 z$Q*c{A5hkkp@Buv2d!8ij4wcsVl~GSpzoRvR9|MT{jjI_(xcQf&l1`>bm8T(vOd+& zoj$aYtczIH#u}^VXd1IJhv3gIcLKr4MWxvfdTrPoR02%@i@kI)GyOf&zrVZ(rmbp* z>ET`cYna!TTwC*6heh{R@)_?+K%vYOBMZ%!2bqF9ag!+pc+xb6AggL&TYWYoZk|9r-^eBqD%bbjT=G4H3x0Q(Z1>$p8k{I=|Aq7 zr~fm8r`HM@kGv3h=}uAhCKW_ZLqy&X#^MLcpog-mj8v@^i_;)wIQ}!i@t^LQ0lyGFY#W{M~{i=n7;VmqA$L)=f3!e>5Fg6%HwRq zR<*wxvl^{(RyC{V%_{fPcOWE`vE%W5=vdk!?-n~EEnnrs5MlZK@g4|Y_sD&(a%)KT zbn3+Ax5?YpXcZ}Jzd@I6VV07oKP-g>ui2<}>y28NuNr0GttmIfQX-~K8Y}eEC)~5! z_{zs8Vl{{E>q>h)Xv9W+nU#+v5oA1mcWV*u?YU|K*TeT&(x0t{8wpIfv9dDi!pd(P z0oY%y*=V&rI6Rt2G{Pk+&5_qfmRgOP7i}ROqgBuF`T%(7Dn*=N(UkPwSc7X!+f-FKOS@Gh!{s6Ubsj_tjm3 zmI32Q1&Kj4ivZC`=!k5CqlHkUu~2uw|AQTz-@#r7xK0r~08>-fYjx@w&;rmS(p%K? zI;9sOBW9zs2`AxZCRJ}{1i1`-(m%IyL0p;ldH}=%+B@lkq!^&6iuA#uet9{yjl;dE zO+@OxDw5`__0FByK67Rj9>T%JQm0ONmt%=@v{&~nMk4BgM-1<)UFs&Or>Xp&y0yN@ z#V1884%*q@&AzOa^*+m21UfpOIsHo4rcnPwyYEYKy3)wm9=FD_;8boJ^6+dRt83rf|3MX!I?~ zBqAbyB=Fw6eKp0x7v;ovc#yslppSiDwP^uVL6*!j%PCT3t2Md_7FTglxJh)8ujxdr z3CxvQF%&*up@Ls1Dek?jaAiVdWo?*rFTnX15&A`bKmLC&Wj)k2FLl**MVe$IgB>b|2lWVC)O^vZ zyB9Hh%?!}i=|)CezDO;i|F}!2iZ6&P$aeNs&^6X&I}^W!#`V<{A3_I^y%s!(PfFu0 zK8rdSIaSIY>AT@V4eU)OBy$n79M1|8|7f1ij#+4$0?@hVoK!f zLPx~iJt8%iHUiy751-(he>{kT+FY>dP_r}4`zhQLgd5K=B3PcNF8x0>iWK&McPQ}* zTVDj$Hw~})jB+~AH$;$uQ1$r(s*sRKIf{2fIR#iO7u_=4r;>Fg*w}w=@~zX*VhfEL zJSn235o0K0^C*TTP6}^(4>_Y2_qWNlIKB>xOIb?{W$fcKbVV!Q6)Sd!m1SRT2@9G- zr}6SGB#ioeY}n-mvExzW8DlP`rR$Z5BtHfr=Vn^$TDo27*afxdbyd6?Y$6~>G3DMn zJ5$hR3K}%FnSw?d#7sexs>w`2Q_yA#+Dt(cr>74_d@SfQM>@95W4@LosNSO3FzytcV`R z-mp?I)7~F3#N^y3T&Uwm4k}!zFL4zU3bMY2pzn9!{3Mtiaw&Bp0sNEPd@}LS!H&*} zxX}ftv=se`q(6!xF)?TGn^G7dY`4b2knz6Ict|I~1>o@16*v@-d)gfw>VZ4NPCR&G zQA@T2CJ}a6;Cj^t5O`WRaSDVW{K8Gt5qTLnizZWzniPLQRv${xk`G$t7Ml&@}pN@T%ibb z9$E^U`FoS}r{&L>j1J_Zs^{>Ha{2~45*|yL5AZUPQ0A2hhtzzbH!-O_bD>r%j050n zrXX4tH&Y@w2~RH!7Idqj!%8K5-EnI5p0p-_TCSXDdVOL6`h}Q~x!Xi6zgzjaPM8%* z2_TE-^8+TR#oNFl35-Dqh6ub86_@=>%>E=xf$Fp=P;$Ha-%PWsAIq3dt(0-OZ$kf# z_WM}_Nn4A^J2Kl#@73!t@nLJgV%>qeO8c~cuqXUX1TzR@6FZ-Z!YZ6cfN>ZhXO?jN zRA)|3NcUys_o$^OEB|3H-N~^_Cym$|ZYxeg-bE(^ue*~i`F8r#_D-5o=&XdOd%%+n zVgKGqDOM*Tp_$~l`N!Zeu6Wrqa_oT8xn)O#=o{uQ0YeX#)YFO?q%gy6O9^9yw1?fi z-3m7VDhRMWiZWokFxlRD%O}TJkwRID!GlmFMV}U_Uhl42+v*|l4I{NZ^#o)27qPK) z=k#IKF4e{6f!ksKGe%~t#ccH*-8rfmyqLW*VJBFePE2ZyF2YU2wfwuQri;`Aw~M|% z%`Qq>gj63YOv2HNkTn2iTAD>@{YB`w*Wifgv>;-w@PUvqssAB(C9LP6St51-Zbaci z0aRqrE;k^qSfylc1N7c{iaaGv`1Q9{`o8pbs5C$CbV;P|2d$b;@X+}h5fn{(>T|}U zz{()4x)`9#0UD6UY}v+SvWl)lcNGDO0dn_?(1XDYFOUmBGezDA=9^RD9)L58!K3cZ zPS&Mk{}QQ=)*M@#PB&SSJ1vS3;Afw6V{wvp_k=Q^8aZZGbH^y0&=P00sr(sjrV@Iv zWN7n>d@9DnSPRT~v%o0+c!4>|$FXEdGvDnEEtbH|@P19!nvVC2m0C!WUb#!k=cd^y z&-0$rKb@=&8CWEtGn}FA9kbb7-%%{aAG_>bpC)^s7_$`(dp5|aAZC`4Jj=z0b(>rPV>h0Vi3SC4j+; zuwS#U#MXYfuOJ=1(L@|a_!Y8u(3Bv>3$_`Vt1dFvp>y%OsIf?QRYONBG_Vn>9gX{+ z%o?Z0Xoe*kV-<(g{FB&#xKfj}c*wOi>6JUyUyG3*Yq9;DS!`9)c(Gk0bb%>!r*2|z zS`-sHakS24v1x?PJ<9x2>aufoS>IW3<}gcH+RNTEiGVT>FuM#G5tzkxU_A>L^<>Y5 z>33JN;(WdF=<3eBYEWw5b-vNvS#-XkwHVaA*P?r_?`QNu>BHMVJ;=Q2{|e-AD#x(b z{*gXum_aj&Ztpo*9t%)+TERo$@6&Oc;-_?A{GivmwUu9|8FRAo&Am((vk0zw9qe+d~t%Q5vXJVlF|b?IvW?*(6>Z%ALQgg$q43;0;^hRSj2yKS|Yyj zM+t&tM11`m&T`m@AligkfGrWnEPdmE*vEKxQ|5j0W2nD5IviVJN*wMMq$))-2Dbv> zyw}0{LWNON|SoaL5 zOiR`Y@6|~=&)VWAr-ilVzr@y>Bz-iY%-VFu(BfuV6!*-NI#Gf1OB0Kf#n2RpO~T8X zC80c>_9xsHL(`%-30Kx!vsz|9O`z`Tv?rVmO3hJq&KdC5U2gv_HfhGvY+HY=msT~Q zShGz!#i#<~pJFWPNxI2;hZgRJFu+O8gs#S+)e{SGfCytOvaqJL0y>32U|`gubS;F0G&L2ed&x3wK7dcK9(>U zOvm*SUyo$+u=3HUmCHPES-CPzRz5CtDtGEyyd=LL$;^N;*~^H%Gfg%>Kf$tN^~OYG zMs?ayLw9AGy^$84v@w=Zi}yWL8pUbvIcJa2tFw~)L9g9;@YQK{Nz$gR7B97FC#lj2 zWnP_lhtYiYCa0A!7Nf0M)(UQv57+$g&!=F1h#49j%T;OTtRo~!uN!I4TF~~a4|5as z5cBTzFCofPv1t9w3y18`#J<3Se?S^uzQ`9l(x13~2%(fn>xMyF2JMY$_<{cv$TxvN zJ0W}a$swezWn^eE2wR3V+|Th1^UHHdK?r(tO7ludQE?$ zrynISKYFHG9~v}Mzx&~usb}|OU)!IvbD z3z7XRWi8@H@{DD%x5n`m3l`!GXBgLTlPS(wIGpyKtRgnH!*nR@?QK}@jIn)MR^JVgB^83G;AS~82`GyJuAmfY>eA}qadrDIw4?VHnXo}~&*pEjoR-^Hf0t3M1nS;&Lwpx3T!9QuT7 zXBkT)_>;fTa-f>X8o`Ogaj|-7K!K60PT>gtW7A|b>4c?vLY=Ti>pNCAnq6l%z?9yN4umb#mLP@fLlWd%gOcLDDb%sE?rSB|S5C|{}-gWpQ8vDaE zay~i$Jc(gha*Wu*a51qjh0TCktALYgz%@|i>HuhgZ9Jrn&98w6 z7MHe=m$VAdEi+~dZDfT;wNtBm4`6t20HLd!qf9tZBB&$=UWKrU+Q6pNyozFS_-oB} z7a%^|wPGmmF5ic|7&%4bh+arzhA!O<02`%+SVApr=V;JCQq2QjkEt9>a7dZzr#$Bt z5?~+6K>@S_am3(aMsk=5M3Myp>_xPk0BJbAm&b&0lEnAZ83kY@1PL+^V3;c5iSYOa z7rm>-OMwU#h=khY;TOlq*1d;i;Q+-h!>`r=d4gJtyu#(!Vg8CY81o91|x4GDh@uDs+#;Hh#LV$Ksv8rO<=ei z4iZ=*C1*+T0GjY&6*^S{P$K*o(P9DUPl^(n%MHMnrN{@~>O~eja`nKIvlRr*Vpxl^ zcPLQ?E-10S<-wICpuRvpAXMNu2aa1nVKktIiA-#WNCrnhNi1uCy=^s`O_Feq66%Hl zArLW8Pp2-9I%quPs8el6nUsiy;H8Re?>?}f>tVl36;gN7vXQ+SkZJ+51G7DP1#qYD44(5ag4%)tZ@gkt) zE@IvT?MeMvB}AX>dBO6|SLhpMH!{#S`>`K=^U%zGG#&fV`6TmE zEx&CnNas`IScG5>n$#jRj{0St+yvaMZmNA6>wBe6DB^_G_nL5SHN!Yh^cB#C2kVp~ ztV??}CXv-ceoC7@3=aam`u#Qwk?(WeBUEB+ENyL2kHUa6zve$V^#O*%*?k=*CmpGYd{Od^XW&b_Z2~ES}o_U}QrY zMYKVHZ6(qoz^KG_Q5s%dl70*-sM@9rqazp|ZM3anwtG#>)-c<>0vPXRyVq!M1Fes< z-D|dc1@cM^xd+a6FKHzoWA}2;r9U;)wt?J$tX}EjBzGfw3~NBr;Cx@@TNHje%0vT6B#iO% zR0uz$cRM6UBm4K^U~2%31NY|uS_2+FctLR&5l1DX2(CcW1>nr1%b41Yl*r(!;x?#7 z*(li<#zUhZ19%CABBi|ay1fr6DHxWtF3ubcaG#PlQZTSAzV#43XL3ps&JohWh>|!C zZ6KA7J}jC9c&iYv&=_Wmy{^|K3(gquqQ-&vz2`kWOa$1N<>gY)|7$Y^I%qtU$rp3m@ zr1s2(GHW3S{_0ewh{es62u{M&9i=(NKn}nb1(_B0(#->Ym5)NOPa7DA2nwZoi ze7rj8%4#t(Iju=JS=sv%uXUZ?J}M`)b#!dyhg@~KNRJJ)Z zjsOYf0HqZ>Z9SzUe`?s*fR-f!igXMNhw8{+4n+N^M0Ih$Bz8mKm$nI091%HM4^jA$ z{0U%&Ac!Vk4*-%5wS|-#MBqgpBFyw231mrVF?c|mV}_#OcuQ~V0vrTX$L0<#iHINr zysmHMLLxn~6x!VdCZq7Zh!j<0_;jl{kk~0~iqr0K4W#G?(ufqxDP|dW3vz;k2p6n| zNT&~|g{PtT`YJ&_eOknJhb_d6bP6G|+C@N(+4BhrOy1Tua11QLAFDXz7Bg3;LvRwF)}}KBET*PKaT2bs5?2$?NQktfnMxY5@+`?+`dju|c_+41^%DsnmIkk9NHH^Qkv!W=jaHS2*TW*J}m1 z`w;u0xWO?m&c`4wkcTzoFixBuM3@841X0LdSVB9@g`srX6qm!{4i0^pqH{>3h+72e z@`;+Z9rZHB$7_n$g~rPVaKvcyQ9X$Txy8ayqrM^zwsb^QarluZZZ;8NtaMJd8-<`r zzT`CHy@udkx_N}q%F!at4ck8r--v%C#&O7|Z5c%y4X;KQooJ(jJPW75A$D z5>>y7+g1>>oGOtWgf?fpD@BXY9J;qt8X=T0nEm^;$;HiD5~e{76YKboxj9WqSO*DZ z-V!WNP3|qmrcQd#Tw40U6(!q9@!0o#w3wR?y-7HFWx~b5VrF7elko8ccS_SjvA;#i zVrY6aC*kZ>C3E{-H7$-Nr!@&Dm#46NTg*&_+$8*5w|Ch|w-Sr7>C&Bq!_|H4Z$^dN zPwj-(j#lnY7(Fvdx$EVAs?kB}4vzP9;~8u)3{tQ#9A?8gZ1}H8K3E;$L@+{AhHi4oo6s;?ZHBikX(m!Oq~j0jIdC%hxNS6lM(saQvOzD11tThvARF_{PHI1_bBxJ!{zY^kf{vCEvN zB-hm8sDS??j7}WU&YZCY;LMo}@}{kCQG02m1Mhsw^oSHAz5>j2T(w5G4v-@NS+v!z zb$Fr}6nQw2JoC{=_&E9E$}?xA*qu4Uz3-@4aL;Cf45`8FMix>cyqjXw4V$E5GT>%F z$e9p$B!RPG6$V};uy(<(CExhiQeO`cRwy5TQ}HWEweA zT&~zCJa5S{H%D zQKQxN4GkiNylz<^(U}AfV6_Qprf%W7RT?c~FaiqbEQOm`MUmvb$!Yoi3ch=xKZU#+ z)O|Ur(vso)Ha^MOo}CSj^+coXVwg_^Q6Pg}DJwK+H~l<-0Jh-+*^0705=p!2Pjm;z z+3Hcv=>pvKks-0qxBlDL`>SqE{Y^;qZ+YbpKc~aOD zXrTPlzw6JLbxpG{hk%rR#?nKY?9cTz1Vs9trB%q4{5~hwuT#u7Mjy%glv+kv!m@W` z+59ZW})1HPKK3tqyVj5JHM`EU!Zt+PZGgC~1>`XD`vrBHKn3D1_Q%vcU zuaBTJ#kB2DsF-RCE(eEv9meH&I=&qeG6EUk7qo3!xmsQ8^iX7g<6qIyia#&u#GCT} z2N~c#tjVW50QSMoD-AZ0vH&&oUkSFLCX5vbX2Ab7i>ktS_91!TcJ1{q-nyE*cEx(Sw8lo8HL5+A zx^n5xCHeje?2`O+3AQ@Kl90u=5oMbBb{W8th&_$`_{XF%2c>FT#jw@?eh?wuFpC1v z^FSl=&AUOhWup`7syD*ShPazepe2C;GEwEiqO2jUZHl=HFhk5&7pSMHte`<%ElA+6 z;Uwh85i2B03Ia5MIgoUlz^7Wgp%?wlgz0Mz9=A=HGhmm7v}fn>3kl4ruuj8{;cPU? zsHPh?ceQalQ-~hSr5EN~RPdB{E658s0bU7-!5s2X1`L7($r1c{`ML^4CSv5oLtNHF zctu*Rd>3gyVY`geI_2)bUx+F}J!ox)5Imv^6J8NeqxoVEWPQ;#SdWlo1q0pu6;Ta# zi}|Zmt2>Y5JgVJQKM5581lo-p=6!%U;X7|-et49fFEj{16Ksi(;@?aWz=HKW&>opI z8U$KS?Uekydahb?A6>&PonnA1HE|7M9cL(pGL{|2WCTS|j`A13^ z^@S)%RAiT(IU`N8OXo6V!#jmw^+wYpcL)>~Zat{#*lHaLLhGXlD`!6jMy?9$nsB^$ zuu5^$D4di#GRDC&27_9pTo%L15PQn(uK5!!vv>m-$(|u@VeeCt4CM?>%^9RyY90M2 zcCrMMGF)jE$}E`{(`?Mu4bix)f)MaM$he7)XOcFODm7df1*s@3?A0PIH+|*MLQ^cc zYtN!u-`*zSIM{d((iROF)!5(t1L=rPW>(Uku=pmoWQp7xBt9bs+ASwik(GfH(qtyV zMeoz+igTZ~p4dVqjjD_QI`<~JK!;|FiA;_+$t^F;pq6>LH0OO4O}|>;=&J<0p56=`$Xr=H$@lrQa zG&i{)hUk!HzZg#TiXna<--F`)0y_s2k zXI9@2xz!gI5Y7fJ=4w%plLz%7y7X8I_m-EvklMm+Qe@HN6^P<>o7E6me_3w}GwKJy z+N(^HZ(S$HLflaYOaD}@!R|m%-%(%1LsiihM5)@QSqdJY0Mz;908}_T5P-^Kfd4>Zskbxom)qK-~%?o&G!GAvBD*53NcY*F!!0)ceek}yuLro z#<;}A85_?ar|oS2mnodH{U1>zq@{eg_kY(m^4})2jeKho+sNu4YTL+v{ZQFPc0Q`_ z$Vmuy8!xnNKxkTm^&u$;?pBDjqJ0@D923a6nUzr7F9D4S@doN{zH z4UyaEp*uDR8j3Gd#bZQTAnpwz7j%_y*K2j^xDeURggm!$;R2luUZ=Pu%B3Z86v>2= zSXPnc)qhFy2XrOQDMYmtfcK>0Vc_+*R&$X6&36Q#oj0`uT;-$6Kp5r$Q(hAjIprMS z!WrMyd~Kshx5!fFd#Wye(ou#kpf@9pxeuFjSishC)DYTFCa!2QaFpBd?=&JNLhu*adZXZ`Y1D2q_1(1gct#Y zS4fU=B1`<3%jD1i+6CzkcP*az-s(=ZEN{o(_m@PzzW}GcVjKnZoh-M2B zZW*wxk{`fAvv_%8n(|ZAW$|AuB=xZw$5q4J$8l}>1 zzUm4g}01Q$`D64pWqxY10LTc&mjox9vIuLYFwA*_Yuppc~k%5v)5L3n7-l4ZCkT=@> z`mO|ediqB1h(I1`H(IEF1gai(QE-MIPm0gvKzj>6Q}So0RmHEPZJ>^9pJ8UfG*`e<$&`e$tyPmTedC~W3%l>uEL5`pAN@gx9D z5k1LKtbDFe%|{WMj4#Rx`oU8`A^{Lbt_pRwy8FiCy;M10)jtpRo~27fas-{(iBzG3 zy@SPIqq7Nm#~$Web@UZVAmqNbd!zE+vj-0RT<=&|Z+6-_fNeL5c)i;@(rK3#U&h55 z`1_OYOM#M*1Ey*bcW0o3sf~s9Ztv+vr|nWX$W(TFFUH=)NL1Ed06x|+w%J&1P_;kl zzKB)sJwu%yp@+)on`$1i(>q!P;A@8xH^2{mKOWR~dmjV748p#1#QBIqx^tz%jyUY2AQY% z3FcTmqH#Bmno-axHgelFlBH)5YmVDeM98(Q$>LFH=WtU@C}i{L9DtYd0I>oivXxJ$ znNU94dkW0J8C2(pbr3x&iy>D8nK`?d{l}U?6DgZO%OxOnYRgmfWFwDHlTi0O2bHYb zE;s57(N+u|ETLqywA(vDHHaeBK++PH0L+-(-eEjn{Pgm9bjz_;sSx`NJu#p8r1}hy zXsb~s4B93BOu1dF;uA;O`3=Z^v0dJM<8bdq2viN03OT8C^Wl%8;r&|gIc^P37XdEW zY1APz)JMhLpX)u@%0JXUG2@L}QL&(P115InTcaA!!tl$bz9(6aP3Z z1yN_iE%!`-vuY7@v5Rk&gP;v+CkoX@ek&K$@?kXxL@zR3ar-_J)F15L=xp>3izNV4 z4^jl+y^wH|a&5xc#gc+Ce-%M#@;v_O^o|hK zcDD(RfVo%sSv(YUZZM4-T>l2wy}|WvbjmML$sb3_@>Be^@`Cu(Y5MXUeJV{~=8t~< zN&LkhP16hdXoV2$I=!Q|I5CGu3nATyfGz^p;t5T8RZeuJ{X~>Q2Scc88;z=#P%irM z*h5|Vh(qy+`YKmC?$F1w-D=Z5aUxDjzB$lKVL>X;ZBVrGJ_%TtDh3}sU^jZ=vV8t^ z^ljx1SbyWO=x29t(ISw?#Y=#?i6X3t;=_7$qh$fFyQjrJ7rpB+z{x|No!={IBz$bAIrdpLqU>C!ZkyCa=idx*(1o zaFvSKsqpgUpyh)_;PJ>N8*NZr!STH%gGZcQLYQEio}bTA6`yg zCdCz@B|p&WKPU5LMd*k|_4+gQXY0>>c)3=;GkHc4lorptn!J|dWv<d6gD*enaQ(V4$vr<^-uRp+{D2tiX@c!3a}y2KP8|^K>A#{ z#mO=r;`1{i*H%A0U+H(vFD0(rl=vzs)1N%2a5eJkvi{2CX#mJy?!Wf-y1MDt(o*ls>OdJv0g8MSE^gqW*cHU;iR#>BP^Q__>Rp zuK>0BTK$#!`u=C%uHUP>P{QVnsL0ETvm-hQ@wHY62ptI^ z03b)Fq@XD$7+fH1$q@jn9jOh_P>U;d`ifJj^G?z{Us2nB;N0#=PJToflixrEhu)kM zy$PrbTv2DhNdi|AT7ohr;BZdDC7c9cYXD0o9iZ6_=a6@nIngnNwzDEstAJlrtk{#5 zb^M(bPT@94D@N;R#%NvXsCbL~P-|m@QVUIhB7h(8P)IS8NIxh)tPAD3gY*Fq`z=aR zG%st=JaFdwAS8yC>vp9MA!?f&JGoY?Gj#T4(t=7+2TMk!&MD4er{AhL#g5`Efj0)6 z(4tI1N0d;P3?Av1a0iA@Y>gcqvCN}Y{Y^&_Y62M|1AUb(9#E06R)2l6c{5hLG-k(* zTfj8=f%=p6r|S1I_4N!U%#|L{n~Bk zA%n*4+qxMJiIs=~29Xstcr$F`s}M;HGOKCtX1HvxMlv$ktg6ME;S*bdh-Q#kNpm;D zBzk*A!634V)^3JJYz5kiL1ZP(-3*hprFEvM^OmnO4HG}thW9e%>rAtlow~^k`-5wZVXSYc&cN%Fm9%A0r2glD=ufih ze7?0z5dG3LqIV{*@FH9#iI}qIEm*pY-E8_icgUM_LE+mouNhi>?-4Acd-qD6jv~YQ z={i+n-MeR)K2MVp3=gW`fyXbhc)*T-77cX78q?e4)#-M1vd+FRXk=IEjry;$oy{lO zuYhQ8>O`YJ5>ul7tkDCtnJmyRW;dh3e_v&{`5^op3&PK;HR?aFGpIU7>>vL!4QiV+<~p@( zV4KgGMEZY4pH4HJS^R5HSt2C5-;7`eoPOd9mpkolpTt5)_yI8wencWB!T_O#5?|(^ z1PNP?;ZdvM5!P9T@&uFXffO*h%CpWkaorJ}a3UOmo~RG)U;+yL5a0+F`O-YpwS}0)8@pn zWjtD1l+OXo%6tVeK191L;iDOb*4Tm?KO};~gp?cz4=PSxk`RAFw6aqch;aeo1h6@0 z4OA0td)L{*5~_m4>XT3viSBfHiAKFJz8eURkx`fV7J`x#UCOgv1hY`O1=eUefNHhH zk1$jux<%u6WbD8ll&N^NZNeW~JnnaX@L#v|;uK^@Q|t^OwPh{jL&L8!;TMcFk>Gek z*otXag-MSG;RWD!P>2XKFc3L`jovl7a!z%nwbKzPSoSOGI=+@g`& zz@Au%3Bcg7q6Tk+Q{>hL34_lH8oLcH2{UAV3)6_fXGIO(2B)~yEV`MY#-OyC_HKjG z_LM1iL#vU&X;m%W2CK-ejaUYu6*P7mT>hA$T!`guF{e$Bd`=;oz85>-_of~2JChem z{Z@-tt_rgyt=M7(tgPBy&Udt`b6W&Ah8 zLvSUiZ_L4sCr-(J2U!Wu7$>zlx~FNxaNk_qF*D4|lm;z-dD=s`GkKnGck7%i$ZQb! zvvw%y;Yjmla2p~lwRL|R~t+NcDl&CbyM=1VBWY18#*rLNdt{v z(ulAq>xRUmjY_|0RGJf#t{=fchSiO5kHMze;)oU&Aj~%tB_f$PGT~#So~U^lB+8^# zB;K{j)Ch6Vppec8-?VZ~AlQbqA(Bd^W|<)$inL3@L9!aFKos@62qJR`pGKM(hVWD550fP` ze>BJt{(wG&|NI(5XjC$XaPDkv{8iGpIrr*X6xXaYc@fEEW{MrB=giGKXL9HqXwk@_ zdr@1ln3Ki#dX7gz7RgIPVpv{}>1z3ouTQReZ4!B1CGy+&vq;jA{Jw}z+Pkzu;}<{# zePK#ppPW*XYs_j`R^@zkWyKU2;C&hdrAwbQM9NMKXPrZW9|_)S>6RpJr!w$6x`Pg8?B^{R>gpDFrPp^-4KP*L(6+5Q`(@LEzSkc3n%Xo_xC==v_3IJo0`q+GE z2NXKi<(Sq0d6SxUYJxb)aVB=4sYs`cM1(v!2h2f|!9bFKgj!vJ-8UpNcgT%Zt|Hmb zPk~a5e@MSV)c^G<2C!Rcw-iH)j9_kK43j2mPJNQ`qFd zdg9N0wIn&+?>lq}Ybz&-Fipva%9WS z^JFIQ(tsx$KN`P98fAHgp@iIq%328|UpcpIGFm?shp zPMORtX4C&%p-sK&16@7XN$g2)S0Mo~gk_QYND`{B_2ceCY=z;wve4>?=Yr!QVr$Na z;Kw@5yhoYGYn}}!p4HmiN51vDR2V|oS!+EK9^;L~BLky??LqiO(gcWCtojW^{(Z)# zYi7)BUxNbAAwh?AO3B_b0vtOfUDv=spSIVkV+jZdRN-4mR=!lI60(9xTDZbjkCt3%;wGVl!a>USH!?KGQC3_WUu zGOyY2kO92yTbsTX&l6)jn0az%;vlSbULrY$EQ9?W$HNkj-A#{>MpzT?J$5=Cwo9GS zqgZF~c+ENj=ibK~j;Tk!$Lr3oINx(VZ1Gj);UlNsm?UxI$B$a&@?&F$p`6;ZP<`z9 zic>iEqMmT>!yJ6*^ssO7nY?|7#4K6@X3#^-yhj{u)%g(HvFgeLhx$wf+t68mWbiQ< zgHFs{aP_>{%H&z(G$B9x@*DWnZQNHbDl(`+8w%zW7^ZN!JeKP0!9kiy@i}OosxT2Vfqp~Zv|bH zPCd1ud$a74%G!OSy+a_W$J|u8g`;pZ(A3wR#abP8B)j8`p}B#cy);0 zTb}!D^ zGt`V?=%GDWi1NBV4HgPN9pP)#u%i15t3;OwVhg(TfepIzC42|QSZ5$wNpm;G z$I91Mv8EruppQJ!KqlbSj`*$B4HaE$Tw1po95cCIJsUzTwtx*SWM|||{!R|N8?bJw zxrmH0P}B?otR%ty7}1y?NwFaDI@rfJPT{WjP~F+ky-TtJc$f^@$|{a*K(x)!{>-eq zi+l?X@jfF)$gI!8NrlVlkg)iwnr+UzFrr9UPRopUa@aN0cA{=yP0rxKYr}LKh zpD(fqnFBuc9F+WDr$*n(OfR!`QPJ?XrXL$4Ng3*&PBpodl@Qjg1RWr1C44_so>$YJ z!E9mCg~;A922vM)%o8h$FFbAa({F*|Gn8onrG?Q?0J!5FAx2pfl`rl96D=Ijen<9)mqho(?lN)f)V>v|n& zs_VZ*1=T#JWl&zC@IthMH<|-FX>M5CO1{h0k#G8FB!=r4#q~W`O<)7A$(2QH2)bCj z8e?sW*G3Wsq7l=757A~b_BMWu2=EL$y4WJDv@&A6w`|40o~o$7f>BvXWHtI{=0sK} z|Lg>!k{n$&($8swrZA*B-AGI1t9l3-&ESAvfON|iPBEl`MdByeAC9WV<%Drg*Nn@^R7klj33{( zZ({u;-(76w1upyf1bjUK3tH+qi?2`G-%%nk668DFF(%J9rzX3d8n7vI#~3&Udgh@` z%U1FJWL1}0_+;huU!MYLDe;~A4>hjVfu-X6v(#0a;wiJciT(S9z`t(KQaVOgy|$wH z4_Alg8*`=ugYDd63z1%5dS2;txJC^tY5t$pk>-`@Id1ecnR#VHg2lSTV7#kz$yY79 z1YsFXhLP1sM#&T(v)|O^o(G01xm_a$&Qz1U_RNYjN$G!{r%7@UqQnU?my?KQm`U;{ z!7GcDA49s6w0-@&1{||M)}2Ve$q>-@mT#Nk|LfEOFT4plv3UVYK;V$e&i5goY6TQ1bBaC7%ZGxEaF#9 zuK&O$EdWccrP8Cs8=dKCo`{XdRffqKXz_|vBe`Peh=J}X;R0^DAvO2@D zPNcbffGOa(&pf1a;=_-8&WCD-fjtY8+2dSuqB2UZJMTL_P+8lURip)y4x{GOkmLqB zNt_>`))ljW0IzUlPO%fo2{Zgd=l!dzS#+eT6;Xxs{S^nM-cns((T2;3c35CEIZ=J2 zhLz_DhiNG0??%qsUs@#+Z^3z6#Hb8*OBJ_4+s?w( ziOHG3i}{5C)8rScH~bmc6&4$f38ZRHqQxPBUuwFg zA3b`gbh?ij(_{UkNB6yt*%C+Q>(j>{zGtb;yemGQQQ3^{c;O7%C>inpW^+hn{-HBv;ZvxO!|c0^OQ* z$n1}1*Y`yxrf;VY`?2#vn7_6&M7z64revVK4LbDi^NQvcOIn~(dOTBM$Cwy`b+ z=sH-Jddn0wA$F?}-@i7*zp((~w~wH4bl7HACv=s=1RP(TuE6Mw*>|AwyHhZ)P%p%% znqEpT{FX@(9W<&Jp2F%WgA4s?1O8%(&U9c-5UWK0+H+=nlkbUi3*EiPmJpGRj3;3y zvR%&zK$4i}tYk!h(JW(G#?+L>hc~N5gft?l2!LUupbaF8)CP@n8DR;vHSO!^V*>OH z${&&{AAB3yWl;Gtjpoge^;Vs(0PYVp5N+u~DLF$eQp53O1dH*@Zh&ru5<7UOR9~}C zieQWltJPs+Hz0^^KhBHrQL(uR{0O61ri*U%fZ<5g)nGrJ+RVcxakAsvIrtcp=Z4r| zGp{j)?7Ojlsv@|7Auy`bM_8fILOl8+iSeE^v=GW`qHkeOw(%ndFxASWco@KZgaYP( zsbe!MFs{Iz)@3@dYs?A^;552c!7*pnSIBY*V8MTbbXH0&fy^v6Rsg2Ezd{bo3V|a= zKF_?pf<8pB6Qr&{hsymaa$ErqXfo3&l}j4IHi)C5((Y>V+4YA#?qofgQI?t^Rs2Mk zYT{TMp-*(_G(A4irIaG71p7pn>Z*_&jA2MMd&y}3RBwQ({)sLnP6=6VBqXz{vQKoW z$!03+7+j}WI@dI!3b(zEAzmo1fB?`Ak>Xj1?8hLnF7HZt0>+ zi)zxmwrf{S&(TRp40l7(5o)eGvGKqlsQrYsf2vPov$i^m$%$0-^eI|RYkC)lm5AbF z>@VIXm(Bw=Gn-?^;sH#CF-3Cc*!f^*+>q3K+`X<|IgQ0!>lx69pE=kF4HHkJ2OyH~ zcN=%_V_AWTs+Bu@73We4NG5#;$Dgn;QuH1p|HURaaNa-)6ri^)|4{Bp$|J`@kNm^) zM~%i~C!v-a48*1ISURR-t8^S#LdHoleOxET(dA@Zu|*b}ai%g3p2Ja#Bp;SVQajC> zY^wfaS8@vzx|vf50iE_#(8wB(`f-&TzN?r{4;g+}!e*5mgDK)J6_NWtb`2?^4-SpU zJ*Q1JW@wE^3kPz4r886?f)%%FCEhnyNj&EwnZi(YaakL3+by>1!^bSPTY}5%tkzco zSU47mIkLZax)1C8eX^ks6+T(X` z=Z~v<>)`&4RSxdwZ1om1tXCAc@ql93eK*jG1_^Fd+XmXjiyMrrwzKFazl&>HaX1P# zCz6aX97s$LmLbdSs&xb72A8#8aqKe81V{+SOfrLUtQ)gbXfD`NRpZE&avf~1uL`ipZ0!>>sV#bYWErMfMQa$- z-=3NYb|S^5%$JvK1~iZ8qL4{bk=-7ACVsi*S4O(DCKz3~U8y`d9=+8dvt z$x`4zhJP4@ZC~4T;Cqk6A6!Wh$0Cimcw zoz%M0xke3xAdSyr)fMo+M*duD+5ZV#>@c(W&$6OB`D;vq4!kF!hFlodhoS-sxj4j~ zl-iG|7oezi))uEoZ zb>4X2>4C3J08&*bxtCl$uEr_R>j<>VKHyj*#fD9=p(kbAV8Y5hyVsaUo~e0cC-HQiBnzhcapfngrn42PA}FEFg4 z)5P-33Ve2zz4aUX ztbt;qNr?SML%0sj$=Um<&zam}!fe$`zs@8T+2jh%XrvF{)1#js%;XA~fl^zwZGS-H1Ou!#W+zhs$+H44(Scx`!^KTh~#bgymoBeCVbrR@F zHMr3Rei)1{C^z-=8g)aD;d~i-=PpiFBPWh`5W9uHM2_Nw^-PqHHK$N@x{UfV8kn(- z%(gCgsbl(B8`lAh5sufZhw1kxrly}&emu{Iqf?D6CG>s&&=?yX2rBeL zHzhAahMTvskR*2A+0u^NPpy(rFB^nXdB+%&$@Ci=q!z0NW_)bt&YHHxLQrq|q{o0T z3PQgH4A<*usf$7XrDm}RU2+OM*HNY4ncs-LC1S9Oo!E`35W zZMEOdKh+EYgJcF1QEs44f6>w zi{4x>OCe;uut8m#(UV4L?we zaO2)@b={S`Kn#=wp>cQ}S&zka&|2t}Js(x>+$YC$qh*_uQt#uWRDg>e$)^5}9Rb^0 z4gsUjR?-~g=-;1`qjt`#O_{Z2nSlX$`8wBziwPzsSH*k`Jp%RUJ2nr;6sZTBlV^9X$CzscEd< z>wtSDEvtX}8L2e1RlBoID2e{5vYDA~4!54N=#kNj?Gb>>C_7sgx)%X7G zkY}XMZCk==d3&neEk#0E5e_TD&$+jIxZcf*}~3R@2^XFj`xhJB@ihS-y@9 zWTt$xx#65To@Z9MK$hH~ZjEd0Cckt*avs&#l6ku_*_}@_K{cyWJ<6XWsRU&DVqdY` zCui_WQU}+)2{I1m=jpW+_ti_7E86k;YdGk5eFOKF2qG3|XzC%!E366%HFVK0Y+Zcp zclxq%Ff;CUj^Lada<_81-VsPrBDo<3a;roSeb)Llr+8u|I53>Fq6RTwl_e&;O_|sV z=*i%-lIE_B4Kvj}`q|A(kF7aDu3y&%(!~?ye8EJSAkBn~iZ&ylxUhytyexVmIPo2; zoiel=YzI;dj8BymGFcFEMXC)woJsX?F}bJ?m0=dpOOEK>5yS=TI2HJSv?94xTqITl zxmRMtfjW!_NMl%J)$sAh3Khd*A2T2r@*iGes@arzd5W?o<4wP@>0>clm2KJT-_?)( zM=%Db-mcYu-ui$M(0?0e(^LfYh7&4poe-c%?dsCiZr*wC9%UK&>fSw)6R##WBqZtl z(Gj=_N7ut_qZhR3QXQA32qVaJgU4iEV>)oI*_Rk~1z`Cu^Y_b)()VX1{hF(5xRJ?P)m2|00?i0C0-_K`Wx>{B%P(^E~( z^=j+C0^6H6$5@Aly0lNS>%{nC1FzNpRxgr5W(qTSI_$RZ3?yh!?^mt^x$c%;1^m~) z3z)`0Z}Qy$jm_{ap8pJa|C}~Fi`==Nv$E8`X;hmdC5pyWR%OJL7$CYtlLG>xtGYdf zoAbCD0-GJUZS)#FqPdKg$P71)tXGWZY7fjrop}XH{mv9GS{ePbRw<=|r*pdfOM@3E ztN){^=I2gQoz-jRJk`OY^VCmR{kn89;F;X0x($gIGZTZre`j#TT-57?nV4!OGtKYq zXRJI(LJHHaL-A*^U=^Wvs%Uq!lz4>g5wdP~;2V(e0sTNi`7M3~FMvGOTn&Sns2WkQ ztDMFKsEa^i1`HdvwQMT*0bGUa!eAozLZd0#uu#UW(G`Si$W|u!BqWlq+G&J)&7Duw z*Hj}9d|873Lbf{5f+U1aV+)!&M;w%L2RDxKBN9~L)nEhCsd0*W9V-u_R$aqH&v8~& zphbT^aBQP3q%ZT5LQ^&fgbD^0 z1`sq?ni9-mkW`(Yv=NX4fO8-Wy$Q#d&BZT%GIkiMd1GhFw@-*g=gC}RL7csM#~Kv3 zi*4DIX?_Rih&iT{?`XHzrVise-(6~6o7!l(@-`67R|q82O)&MRokExtj)om)m1~n= z&TL55$w7z_1LNL3L9Fmy$b7QCTk3QaNN=tS=Y{AD_%kTe;L6RWC{+1-_Y9#mahUBh zBgsAmTHYnt(5B2Aa{y*Kn_JATchevFoGsS6(R0OHb6l?|fIeeW7|%Bdh{Mt`2T~^m zHH4m_Bfy}mJ(!Q!OO^rC5t@2xA~N*?ZJ(?R0rn=;MxER#Gs_T*`J5q-Eua4rVxJfs zN~~!p*)Creux+|bEDOyvupRIR&OGj8YLNq_*+zyiLdZ?3j&7$*Lq%Olfbl>gLMV4d zOA*W$)FUOdYQ&`IRB1TYwhpe%!!)dHI7NP_sXqk?Q*s{$2U=1mpY7x{r{M?RM)Vop z`?huizUWSIot?h2DHC7C05NE;roC(9!)Tb$l^nK!TNo^E-i96IrqKKz0-Fs#>Qd&) z_olqLvIu(qQ&T*!SaeFJ=+v1*jrA~hFzb>>FQ9M4UMzW-*6k!uaRjrS%)XSa9;v{# zpXtMn)Fe)cgL%E-B*#3^jh_e~B1ng%suFVOD^3Zz7e{JPBd^rrW=0ylF^BIM(B>AqP5+tI@-_qVs$0GdmfOql#^Nc*V7ICkZ-do~hK~vh zjDgMi+@=R>bn-=3cIcYM`p{4>G#dH$rzYrJHKIo&2c{;`Cok0`IH_oPVZ|VMy?Qo8 zm@ihCDf&HENl1e#lPinZ^t)IsGNiIqizJ$570N{UVSRQCo4QG2W^E3;_9Pw)u8{h= zeXc1FNcy`Ehfs`AO*p5&j$6~np-D(2W({;|<$So|4yDoUM*swm*2pre!Ij=mzl=5a6V(>_wWn3zKxxyAl=qer4NiOdXo%H z*2v#eO$h8FK?Vl((KKx{r7Z56dsFyPneP%ePxaAMokUfZLj{FghfQ3h7GH%{>njhO z$228GsZ+m6p=CGJ?L0irV3<;=L@yzn1xFAn)@kV8*@AcJ`WW>}`?Q0*4*@*6Ayv3* zdSTyt6^6_Ny1EQ_uQJ8`R`p}Ku5Dz0*ESwohqpb|W~m25DbPd{D0Tj())ZFY9( zQrqs8mCb%~l?3~&-K1n_WB-0dWSF((v|UHDFRUc^g;kQ^)oFplpg;T026gM$-Z8|L zKBUYOD;odFD$%f8{Ft7{ixn&*j!exmd8rNe=3Fd25Rn-nUrwHn@vT+{pD%y>QqQ=9 zh9kL*jeh{7CNGf!yCM$guq{=;GkFQgugE`YotIjja+7JN_$AylNAnCJak^tCaveL8 z;=JcDpFPmRmD(%v4cW6BG>R#z{67sB7_!h75D#3(x z=ek2h7%1ToK^eOL55qqSGuG5ZW$n#eA0hBI|Bmy^HJqlw0o7% zV9E83HSxZ8{T{ixZB1EsiwNt8_Yl{@mvtPCj<=jS`UNY91Pk7vW_4LZoXZU;k2<|H0^ zJdP1Qwfi`VfR??diU%qs)CsK?Uk9o5Ny;M}L@20Q#|*)~+sNf0qR4=H4T*GwZtI$E z`9xTL`^W1OVfl%${PuI%)jfP7EU%``)SIh>rPb{IUtpom3&WTpm&x-j*hYP1$;0Lq zx?`o@5&f4W5c7|T>HbFJ_Y4bOcl4}I|HM&-A$%?nOBj32-~8~hZtf;;{7Es|P{()yRs1G&$8Z^G5t3Wsu4md9Rk1r>8&awQ`86v&u z@<-$nhwl+^(fa|va=$&(d&Z7PW|(bv1#jz7)&RAm_ePqs1dB(fsuK+_atEz2P#`f z`8o20ZpEGAmKP|usBO%$%QK|f8x5UD=xMm?dtha&TQ_-{v|_Ce>L=R zJ1Q6Jo}Sra{e>yFuKue2U~(s_=WH4duKC26X^pR`(7um9^Cp{qg29jdm&PP`msVlI znZIGQPf{^Rh=(I*2x*7eNkZAlb#XKhNt;KAk=RGnT8CMVGx0F^I7tUNamYN8`z4t1 z3WAHW=JeC3B~ACBn+lMLswTUju8|*upeWaJ;Cuu4qgo;i&Ac1qYX@Ed*#`%{!sb>h zoH(_B$Np%*N@KYsGmonbkh%hSBELh4N7m$`)>=2gj)_>TqBSsCnv5QEK(k$x%cjiN zZcAncliRm-Z9H@#4s7GA7;grf)wFjTj9y@w&zPqZ%VV4Nt-^(sc4X?3#PCb&)YWzh zU1O7LmaL7Ibg4q-cdt)Q1gr5P2@#R|0ib#NHF`P;617MknvA_hG~JeN`B7H`kZ(rP z&$PRWFo>&f*q~eEkE`R)46wttAs8rw^Owp~8?bQ6Za~>4|5glp4T*OMgLA^JD^y zx&VZc{UeH<$zDI9ve%Dao4x)Glf8b_;FI}WN!W|2wiJ7PeU~1?*Tv>h0d^8myimg6 z7BY0^TxRt#I6%M&L&jk}24B(SQmQ!!Q;>t|$bkuTs~>DP91^(U#NIia`z-4!m++;* z3*QZ(m;?9I>cIUw*B-b(V-DQEeT{)*sx38ekJN#a_!ev*>_{A|#|g|EL2bh#owxUi znT*sWvQpfIcSJT%YTF0MJ|0CNdBHSUx7_L@CkopQw3#fg8zc6y!e9*5Z^2p!329Ge+Odgr9*vS@PM&%Hjd}a&q9dWw^Q|i4y*Mfb=>#~2!kWBJ_QT>N7N|X(tm)vK-AZ)> zmIAa4O;s@ZyW6!uqyQqimDb4#Z9PZO6l5?;aBZTIaBfqXtoab(r_U^;`l-iw(mgpd z6hddGojyI!9&m|GwM%0C%h(4^{2b1S)C#3jleji=1j|Sy+isB$CRXPxl=vkGi80%Sof=Tn=PE8u?>Z^a6>y}_d-Hp9b zT|=7C44?mT3b?s?S5F20bLOPhk)tUfZ>gTH!LW7{grU(=#cc=(g3lzV>2T-?AXXyJ zF3&HyZvO|XB+mmd=rtq(L#gZ5yf)DoKl1yo7C;O{^GezDZXJ$K&j>P|qix<;`Sp8W zw7U7X;#cP)@yQ^(xU3D@^Es6v`W-_~GhH$dZQ5QLNdv1S=@;fI6$ZHl1#J*sj+j=m z+<4;et&%7k*U_8|jjmVk#v}t_U!7Lh3>35PY@uY3VsnoH@>N6oe}YJ>NtVA#AD83&2xyPG zAoVi>~aB?jx8Q@m(p@*C^dzdP0JQg+-=n|_B57WF%xCIic0 zqJFml-j1d9mUPbnWp-A?BMe9@Yx3GyF;?c+Zp*U_Lbq@0Hkf?YZt^hD*}u2x(aO$G zVfyJ>m3}s)8FiNb=_;A_Qyc8wDe`S0cuy0tpu?wru>$zQOE>V2u9{U#$sdO1%ayl5 za{jDj`1kHo!pL3C{#X(qQ`g*amyd*VEp!DS z_q$lI!1>E$=@0=yqOxf8nw)^kRJyxXJokQdZ^KzU_mMx^_Aq=EKe~r7A!Qm8srtg) zZkf?sP!L4(PcfTyDlO#IuTE88N(1~AQv>MTQw;!=mn9X0<8^8+MEDDHhd`gT3rZQh zOXbbMDoJFw-9o3KuKO1AJu?6v4Z3C4f|+XfjcRk&f@?>nrvak}GeDaj^hOUPE8&P1 zVyBV&RLQZqW!*@#&v0)X(d;5_Lk zBazxO@nL4B-dzSyhC!Dr59a;%rZ~*bEU_u`k`6f~Dbw-P3!5HRG{=8+3h=ossITGt zRdbH(NYOd|#rZ72;J2ux4Z`zD%2;~qOLH0n&^0RAz-Ao`JAtHyZ|q)KWz}!5azJL5 zy7b{#eSb{BIX(7RG5$^gYDU8G$cgDvP2Ku-f(`9fbW3g;zXx6ycPa%t*$6t z`5m_#y)}>k!}rTAq4J<3)!f=gt|Pm>-mOi4AP@}t)}0W=O@ILi9k|XD0=Xl;<2=z$ zz=I1y>@2dJuX-m}uk<(|!wH(qnG6Is;VyQjR*5fDf$zhpFu=@Ypl{eQMMCl#HEacf%gE zd1aNcYg5Cpl+yd_rqa`gh$=nXSd3mmHwdl3FZ6HUT_u1oTc{Rmf!QiQdC4N8^wFMrY7F#D@i!W$OH+07EFkDh!sWz$O+iR^ znw*f1)>Bt;%nOXLWGG~LY)2TI)D@G@n4$Q>Tmj7VxS*g74AY5y{P1PsAM1EKU-ACT5zEv}xQ4 zqYogCCNVQYr_CNFV^)VuUYib_b%?O(^Uzkfl2CxMMZ6LUo82Ys- z@Ru@|{8Me2>2>=-XRx`dgbf<=38||@E3)6G#oBGSOSdWJ6*1-~jk14hm8AL7 zLgr?uv_#<*5zKNtT+#k`I6Srz=AW;UFm@qVovCySd$E*bIMP`{-{ zZ3#`1z9DGaS;2hQsbbLQTD35S-}8#qX`DO#=pM!Y)SP<^rq@_ttSv{8z50%HiRUr`g$)qpIgyed@d{@wN8R1OIyj5TqT+8 zX7V(Ki)S)32o3oJkFU0vOE>*xHq5XlPSeHP+8#~<9%Zp75M!RAW zfgv?qC29-vtYtD{Et6NLdtx|c_8quFm>Lu-S4YgSxH4vPX?_I%SHUL`5)*j}fVKCu_GJwxcK!M}5dh^`qj)s|xWKcyda z3xk}R)YGS~t9-96pwBD=l9$*U#uHl}8zkW-7)6}wf%A8rIJN~bQ&Z^Cb17!@23j(0 z_fO9N#W0M`OEAU1H8p}Onj=3u)$H5>(ACDTnR7%3i_Vcdm?J778FZM33(>G!P+EGe z=~q{Y$}3aD&LA}NY9U&$=&2YQ&*&O#=DAgV{pKnW`rfPfl)>!kG7C|hmBre)&AzZA z`K?tVX(yR<4qaX{G3@%T&0MUZD?+?z7BS`iL#ob z%&6JF$B5l|)oN;6MaGj&oelBHIwr48Ra{Ca{JJR=^p2@ecuvR1=wo6$vH^0j;$S*@ zRs(dI;bE$o!!y4(l5E15S&a8#B%2gH*hqasQnbd{5lqiOKxX0w{YFmKpwS?X2`p)W zS3Ry|?ldM#h11G~C=D#kkp)jI$#wcTdX`BJAu7j`Mz7xrMiyJKGO3VV(YmHV158=- zU=UK4fDT}dlo+f7;%EW=EGBJHw^PLyB63s+c8v?TU76MrakztIguEPP{On3JZL@7C zo?1N1L7>rdYBY4Qp8~2yLIe`~5pZBIy-Jy&ZvaV})ps&KaBk!BH0=^-?1ipUP|4Wn zC9t%Mg;1?=J^067L1YYsL(}ru6k!~Z!7DPkx(uF zEp|X+C7ff<-pPs@#Jt>^k^y$XDVs7+VH_BE=vSN8tfJ`CQ~J>~@onB1VuZTAyHj8; zC8~bY6jeG3R8-wtezGw*UZ<7~DdrPakNTn1OYEU5ERm;P*z{o~Hx_J-Q)nmZ7b{Wu zRTB07wPX-O*K1a^L3?S^e$5c8H16Tvo=qmHGZBSIKmD zh_0fmJPe}DLmO0AH96>0O2)dsnqe-}46H2%P8}cHs$NX!Tr6 zI>zKwKL>1XY8I10HxEzJ?~0)Ll{U|j3aK8(&(Sl+9ArBdhs$~;1e$9&q)gP728e-f zw%Y09bV&6;)-`0k(@P%l7kP_xD=$4|P&@fwv&rZq(l}z&xVl2!DWC<4i?@`=Q*EltfvRVqU0Box4y#apPO}?y zk!*ao3goj@3gpi_=h!F=cJs^GpthV4wi4i#DU(Pi#LROmL3*ns$n&}x#vpG#vq98? zLSu`pG2#9_g8p&E_|rLe^lyiTG>F6xwaD?v{2q~=CtcO%?mqo zxWUnSnJ0#G;r*TDKAHQ>g)&B$1`+M9fzx{@g_t`tDQpzh56IcnSTJ1kY=|4;`iHi+ zXWry;%BXQ$M&4XvUD@T7wii^ISmE>o+-<2|mAXOiYgE=Z$P-*rsa}t%-Q`HGr(F3J zj^@zlQ6mzvP%U$=O%|1x_(yLFGg{KGRmAn>#^sXawn);j8RpUCu~DmwP?y^85*^;Q zhy&-|{Hy>H-*ZKaHm5e~P8RCqu@T*K2K&V?kmcJP(=yc@U*rOe~7{*LtC+c<>( zZE}lBx6Zxid9W1(8@}b_DhMPw-!38k<*W+I+lZ+kv(xDqqg5h|a6y>V#^LE}OuzbI z)A7e>JFpvAg@H(^H50(`hVyOd{(baHTE$)PO8q_Wx`RMFLfd?6?d^P<1S#KEAC9$$ zS@T3c?F}~)?{0Ex5^UH8<=Vk7hmw7h+049Iq|HUt| zvs$~r^Op?YSdY(I|(7kB=J|J%5;@E5gqaB=6es9|+L8ZQ`+8ZYDHhnH){ zy_1d4;(>9sX5)438@*Vw@xA2R4;$BN`W^&4pVP&y%+T5h@waW;yZjok~+9~^I4ku zjvGT=Z|AU@gDX{A{M*>wLyl1)XU)QBA$f&Z&cpe=Z>tu}+qk9^D?Met#Fd-4xO8n& zc;f@lyMAx`{_6grMOFT=~b}zefL4sQrHvV_;9)OKJ5$1gtYKx`>X9vrQhPo<9GdmHhJrK;{)%z zexC}F-%BfyUyA;T6nszrf{ng71{37#k|+2fZ`ZWX?Gf{EgM23awh?Bajo~vXZN4x~ zVy50Y^Lh5;6u3T8LPgHoUfQajZB{1+-Y_3YXZY?TjPbtH@2B6qDpDfTh>4MIrrN&L zOl$H^1(~HQ3{0ld1MPF07~srvgVO9nqx*OLo9&>7DQ>)JtE|twq9cm$qz)Z)`k5Ua z!^*d<6=+l2pLu6?M%@AC4cixS5|~$uN1JdN!=M3DStp;?&=gb9_D!a+^+p&F=6-BD zE{i|-v@zNKxVzI;+(aaEx^xbWR4;6UTsl=linexeGC4<+T#|&dlgj;ezlEiCa%)|wqbQv=4ju=8kh^z@ z4<^*$$sxD_VL=z<(G+!$;3;)#s7^dKd?r2;akBv@Us3(i4d=akO`q~*}s57t3TEK#N&Q{q*LW6xB ziu4t=>^eeGMgTA$SsnvXR5sM5H>K%&q&NHOEeH| zPz!O?%G}zz>VcEO%rroSP4YzVp78n=vX=-XwKBy^Ct7>zxk+ToeRegbUzk-iPPMBv z`^v1Q@wHvG*;lk0iZUa@e4HAbEz+iiIOf!`>(2JA38*^P>?+Q@F)Qg4)2^D$yG8h2 z7C(P$DRhq8;sxdWd{zz#BCf*)q=ckv93&CZ%-~%j5w4aEUYtfp(4&;5wS8^egiark zUwW%EW&&qxCy>tXk$U8Z^sId*&rP}#$e0&8LlZ4+H=lJ)anER3m2*rJtO|OEc|QA* zWiuc@GY1I}f{DKlstN;MQH=C&Q_wE%8KVPBA$KJ&Fz=|O;}Vu4&* z!C+z-5KD|f+uq2NIdBoK&OMjaBWLUd@6-UYL^cMKj`(r|!=RvjB!j^UMUW*#p6Daa z6w}QI6baKJ49Q^7BH@j#NLh-~4&lXfq_k-*5ois&4Dyp!!aMT(I%J)q%&MqyS^T=` z6x`5G;YP4q&dKjt8Nu2r+jG$wSk6&{*Z54h}`YLikpxMcOll#3BxHhdBH4+R~93Bdhw?;h9Sw zq?nykBaT7XppXVPMJUi_B^gs%`$+tS!`sh87|*hezhI0al{xAxB;k!2v)vgE+jFW; z1zj!7GHi{9_n;7KU`B6~4w>f`$yI%m(C|_7@tgJ~X4LZ{I-2tu$e4BpJDeIaR<%pM zG0fB^w+fJ>au~3Tk=3bycZ8xWNQ&+<@hn}wHZMHkh=jxl&fv`tSbn@mpBRbKtsyr<4IIk1^5yo8WIy+KYh7TrhW3Nq~Mb??)^e46JZk$kUo%I-9Rmwk!PbQGeE zOMRhLaX0!1Gw{+mKjO;>f4a+cu8Z&fb6@b>_keUFGiXhoo`Tw;@FT?y)CBQz@};kC z3pI3r>)9`OXTa|p`9dKztKaL4K>5FKfxh^czwe1BghKQnH}vf7)H)IT%jA#iiQ^hR zo$lgSd@~j~#ow6hPQ-Hf5IHF3woj6|qmu8;Q}Jz&&km!R(_(H|+6j9~J1t>1dDbe6 znQqA!xJWnl`}^ZzjZ5Y{<>dZmdK^~Rvgvksd^UFPwzl{(X**Vo?w%C)@ku_yuXJLV zh_t&y0>BY>+)5l4aslzcU#V_hR4RUdHN^AjdM1{yG-~dW;BEB%$DVAgdo1L0YNDPD zy0hVG++E#rw?ft3t?Z^h=oVXtg=R138l3F44#v^cNvpY2%jdioLhP`+A2^Gq(#Hp< znMkwI6%&biKIl5l)P(%t$ekW~4l<>DWwRR0>^8&WO0d)LRy|5b9P{2(LpTkJ2S>f} zVL0BDa;GQdx;L6=_9KZvq%_>_M@qq5q1Zp#iX{3yu9HornhdbnGS zBu^ui@M-Nd7u=PFtyI0&+2py+LP=?l>t}5cvEVOuQ=6@R{;bT6#7?=q>#q&U-m)as zx3IE|cFD9=ivQ=#z_bx(s6NG{|koZ8m=WA689`CU? zdvxLrZlhceeB7)Z`uFSp%219bBRQWkNF4++n{`)r!1<1|rCMfxQ1Oo}sJJ+}>X!zU z@}QjXiQe+AV)Dpv7|Zj$@?k!j5|8$GQ+w8Sb`JA-Z@e8pOzmz4gT?JcD>#zUo59@N z@?v&JNd-3xBQbL7y~v&gbKUI0_Q}v}E92cgOl`M|!Bn8x7?*?1eqPDvgPF4E%BRB8 zMT+w(O=ZjncZB@V)9#D?;bAJ#O7HWXli`U!a<)0>)dLBCq{&CJCpX*8d>3(f|(vK*^LhPll0f zq%RznM#^ZAuk4*R(y8roZC5VCssvy|vd#?X>rE zwRS8JijR6?Z+KL3$9JOwf3THJcQ1TZZji}FQvGC0aUXBCHih2ctl%x?3P;D`%u(Lw za|idDsk4qhwkP#Y_~>a<;r+e7KXMw1Mo)Km$u|_szECGwJJWeF6YmEj%{({Q?`@Y) z+@p&j=fPa>24bc5>EW(e7JY}up-A}R(5D2F#fV&v7J_mqUr6=Bx!uD;v=AR=kIJD7 zF59e@BJJSWiBxXp%Y*H`fZXa8vwS5HlzdXX54q;Oh|~ zzFi;tW3haDD9n~A294>nJCYvW2LHRwvsK>qMT;mc7v@07;vt-5#`iF&1ABpDAMXML4S6`CmqIVYTi8bYpHYeG)fc3mx3zMe`e zC4aToJ5a>Ei(y(i@i!agol(cfA1GVGNq#F47&m=6aL<`9QScR0yZ(4D${)K6^@4cZ z7)L_!a6T8Pimg_m#T}l6)GjeJ@vC_;mq5)*yJNe z!^|Ms4Q$DwzL-4=_b$K!?Lhg&A3o}(5^c$o9z~l6M?xwSc6V#zP|ROT97Gy&Y2WLM z40vCtnXGlilFt(_)xw!bKa~*kdyOo(GU*-e@kip0=-%`ey}o>|8tDfQgHJDZM%8-q@)RBxrX#<^6&RjuSUj|;)( zc2hda#}D`VdrGi>((1bXJKa5Pd=G=Q8NL96CEAt!VXfIK?$6hqHgeHj-;62=DOkHG zaOrj+XY!lc?#@MXx7ivW24hMps~mu6jqzz}uaQ66%mw#SC+^LTuUb0F_%HVA1Bz#) zelk27L;`{Rqe^J6x|i=2Ydj>=s248vBimjnobz_J@|E3QrT}@FX(o!1N=Qj~l6<5x zJn|{yNLp~UioA!bNTDsx7f$Uo3p?UTI*{Tc#bMl43ie&`Y`tA5`oyDLD4CH;<6J*- zdYDq&ed(l_+VjRj!?S3!8;TsYiiJa0CKSl$x0<10lM1PvU+f8mRO}+Yw=M5vBMny} zxFgmA!;vpm@$5(mWgP76d5+4lRG|@wmLg}JkT(?1Cf&Y#Pw5rCg-jt_^msEz$IaSl zJzwaB_|t=0Puv{!8jxkV5;S03>_J&ZyrBpVkoM{_%Xg6jki68BOC0AB^S;!7on zjl^BmU`&Xg4&%`3URNLu+Pbq5u~+aOpY3|`hy6{jH(IFXl7Uk}c1KI2V54#7jz}Xh zp7b51VxG7(9-nmggTb(OM-h_Q%1I%c4~Yk9qUTgORNjv?#U2c)TK>#)VJ|~89_#ak zQDv7aZ*EF**Uj@`&p7Nk5@TEC8GXv1jv@(Hp_1zr3m4-hWMjG&tc~NT@c1a`&ga~i zgSk{REQbqNojZ!BJb4JmWGdJ5hYRhCEiTx0orR*cX8u?nj_akUdzj>p3xz>+56ZIZ zZSMFZQYf|4d&hj>0V=pYa^mqsQ9?cd=C{M!Nk-X1MPjWDbi*((cyyc$}xgjXUWdb@x2^h`h-W zwO4C}BE_0S+bTa7ma8<0Yq4XfS9~cUe!z=jg^bCBqv+Es)!->prH__a_i0n3`zO>oMq>{CLm)Jjw z54ZVrBSM!@YPS>p!nUedKUtnS2Q*T5Z3HnJzlj+j5| z1ge2>qKFg`8*Hk-89}&qwjqmQ9My}A8)iXXHOz)g2fg1Gb zQK1U%7;IIC(e2vqRwRCqiE+upSij^tt_)KiNQ&4nEw^{d#Y(x^IOJm&-JRynVY(bG z4tLWrSFgG0J1K`^n_eZj>yOG@I@y4Jmn*#YV85Gb!ua=9dP#N6%5|dKwrZJB#NP@R z{G%QZNwV!tr1<`xKzUA+sIHrHXR17ENv{y~b9d*9{rEGo0rm z7sm(bk`EKEmn(3o{6)Q%mZO2-v9}bew#DN^Uq;+J2yAarC!t-=mJTxqahEsN6!OY` zFI(nZ^<=FSN>}5>)Ns?^7l)axT8a2zn35;KPRJFAOSO}Oh!Bcp0x%a-N+8Nq--x-izRzVMkw#q zGqB9!r5#_^Uyf7)u68@M)5-^HzF2S2g(0Gd1*qM)bTp3e@y$-Pv&Fe0(bH{TK7Nwz z^~Skwq<*#~C+lI@OL7o~b{L{9aa8kp4}yVSaK9-PQt52F-|5wQoqB$=c$VbzZP=9Z z*1<*I<=cUspWCj>iHo5BELb_MX|kA+ZyM$YCC*v$2%Ch zqCNf~*)9xS{YEC?5-y0(L2;L)Q8Inty9n?2YTNx2pU_Hq2IUOuST_(mkuOQZaP32^>F8X!` zxoyNVJE!rLF7IME+rkw2&Z{&l&ePDft`9Gdw6mfJOD5DW1-k^&mGz;UL3mI(f!kA%@?VacY+;P zTpG0^y-+-z9cIG&N@-K6#N2LIc7Gf_DTf8wchGL+i>L8^c+gCat3h9@QLK*TNNbpZ zOx^NIz4!%}zo_xs+(pROl=pX&BjvyaVJH7H4;h`9b_~IV#fD?}g$A#in zE$KPpvp#ooC*SV%PDNKvN(YNWE_NaCUVaqXsmTGcwY?u09Ocr(?NZY_&IMy>VtYkn zrSSpm#{H2L+&r?u zy_uKBrQii@o6X!sT7uJm6ig?ZqfsiPoVB*97v*X}+T*jq?ulzNmr9mfuCpMXk8AN! zI9(Q`)UGGvZH>8LHq<=Ys7BIpvw;L3$pxat{fh>S09Vv|kqDf)+5_d{%pG?(4iC;w-3au^d)`n&+U`pM z-}W$62~;DByVUK6cB<{u?a=_!cSouroluoy_-Wh8mAl|1nK z+!vm3w<>!}Nl$pIlpMJ?FS7oFa>pws`r!=cmi@Its9NlYp)1|PLp~mts>8iNcF%jz z-SQ=i>E1=O!Sx4Q-a*!TdeNwij(4g&-$^^!P!~(s5%fX z620uH=b~{?+%JSTi%P^DISXuiq|9zWIrIBY2g5U&J2=h^GZoHt#z%Ktm0rf1_eYBL z5SQ)l1X9)Frr2noWGj&6;cCyfA05=(fg&Htq?7xHM?1C9C=g4x{BpTDs%1loZmlKn zY@gMVuEbV!YtYz~M+I-ZF^sy?*5o_oLb17^-yhwCm++&67}OR37)U zgQy!eb}x{up1R{nFV`CiS%eS{$FV@Hv*RDOleL1YT-s`Sw}*$3Lg~caQ-a5ZlTf@^ zi$OS@WDDVwtzN&IiD$u*M`99p-A4oP_fJ!OSKX5sN_(|dvi93Y3Y`NCYC3=1rCa0q8@%zEkk$afiE`~k5!_5P35AB@549MrZ zBT-HcI#RwA2zV-62c@yt;Los0_H1e5<~n z3N*&ytii1v7=$q+t`V?FB-|3D?SL1d+yUps2}&b zDuVAI$c?-uUovT#o;s!|Wct0g6rss|#~;z73II;|?QpF2G)*DIM;$UR7>PMZxV z46&TapQU$3<15xT>|!*-@MgA~I6TXFq~jr0d?L|Q?l_o`nyFf?_TGDz-2}{v7~l9j zc04q`Kz@CZ{CW+)u$N-3;lzh;G`@u2Kf;u+KcnvOu7CdV;-nA-jE07YkZe>_9#ztPaQe3%yp zTeqw?g42~JcglRLbxxL(FDFlvliKLrh`)m^DQHjM!*18!lc$7=*KCT=Yw{Y7MkX6*$yvtgxn(j+fQovX#elxwrT!vm zaDoeAwOc7GmwQj*u&5WT8(-Gyuj&sbUn+2t(CN#_Y3951hT5{!k>&e1Z%x2DD2|ZU zkKI_Jq_GERsb+Cy%xm*^2@wom0o8u)i%&m6>HkJ!omQ!vhjd>cVT2yFOg5$Ax;0)w zg53b?v!IwluXWHi2$NM^?9stJxi~Ng*~TPSywYj6#v2ZOi+-CMJ8?lTuH_b$7OsZC zVQ&2{IZm3xwq0x{X>$#-|9wo3U?bhpJ_ykqJa)yCn<9{_K$fDBN$$h~v_krO;LP{S zbtl^gy?Gud|MkTZ*CKZTR~)!Zxz*>%wZJ&ETWbybP52g0WWgG?)@B!5hX4QezBfj$ z>$;DUOo|+dlti17En4dHk}_w=-Pv7IR3y3+ks`UWDvD$&TH2VTrn56|ciwRRdEN}U zV|tsWMT!`hph3I_(xUy)pg}*S1q8=M(+_Q({>g_HZDS|>6ckZ`d@BMtiE9T<(cd}u z|C={|cHfgK+ao0O&U^Qsch9-!-h1x3=lpI^re4waRvZ~e`3y%%za^wuDakdej-R?y1=OOB56g&1>S9K>0$A=)8I zBas@$0t>s-LJqkUypk>5UxTOA7riD)MZCuVXvmIGbO>4ynt|hgK~49R=^`{lX$f@4|AlS^5tF2Z@ z>T~>Vp{XF}0jYot10+Or1YRIW@SFklA^=I`e%1ZbJ%0gRvVf^NGo(q`E7z`Fd?#lh z{$5Qu1}#jK#H47}#xy~5p~Ccx1FVTDb3v*9u4e*^j}(aQm=l#Q34YHfos%q9lG94U z$>mfgM~j`52qxiaF9Rc4ZITaSXu6P6pCSxN2`Lr5+@l)Nde>~SEif{;p2W(D#r0ce zaaALN@g-l`^&(<%m4HZ$B*u?oOZPvc#_`ZHX0>fhp_p$^-wS^y&0aV;{i18Jwv$>h zyiP6W^GVlvtIf%2CE=u?424}892Of12_@m-d{VQ=Vk0@NB%G|IV}Duvq(w0aS1;|( z9JILDErpm?Pd}f1C(Ze6zp`vCuFSKTc1}MRB{h|;7M)K_D+wnDw9Rfc$$A(=+v&~0 zBQW*Vww?dh8*>Kd_~SG?^d-3k+2NML;%v7RV#F}DvV3Orjz-IBFs4wI+!03Ebe_pt|`=-*k+$f>Iq`3JIL&cf>Xg!r5hQ zEt1-kpG3Ql)(+ACSlg?yh9>j=?~IlCn5;YwABH?X@54B?s_oa+#)xO@68kK~##%dk z$bX?X{MeUk-wa=B*}?W3`(tG?9>4tnFm1Q%6<~D$xb5~9E&%hpNXUhgED*OapokZE zw+W=5?kz*g0UR9lzS#}Gmb@9(07-)yI_-r>r@3>+XUDOvCX?}nw3_fNlaG9Etd6M7 z$bT?uqMFN_k-ZFdZ^=YHn8?pGM*cs#>CGLq{L z1a9Pp|q&rw2l{^`(77{j%;UQR$ z5E-i?Y6$+W8G@=2JOsb|;q{(r_Ta<(%0#gqv+q40p+!pMQNpS$Dd)9j8ym3!~O z!t$8fMBAy?7p=?O#u<`kL8;D9ByU<1S=Iju^k|%YH`v!~-3Jib_Sf-O4>=8;?W+b8 zki3(x3-9E2E;~nmyRn&9zYMLrEUtMMXGPXA8qn=<(-SVKqLVjy_#{?0tZHJl(z|wC zBZZ}`wQ>8wm0SH{0KKwwlC+5)k*a;cc>_fr(pIm%-1H5Yv3-*w07??i+$m4)zobv-7PP}xFwe!Q|;{W_`S z#O}I~Sn*W{q(I3P=^vyi(hJFlr*7RK1!6HBGj_%2y}zX||3V69+}fb_{#Lbb>1t#4 z{;M|-{ehSQn$OmQ4x%r*RXQ*ikuC5$BGjNu7ueay_7mLwEvyULd-CCZK=)DYFNo8l zwIA+8iCD=*)A*l+g@9Iy|YTrbd zMxF875Tzmlh5U5@#((0-g>WzErMvPV!AFZtyA zd3JO$%Sahl3RCne5$$*E$=bLujn^VI$IjBqE%W`~)~u^9+mWLx`c#G3(jrQ?F?mRoPC6Yrsh7qHrL;QK?hx-sYqxeH0%qjT4F9XL z@;H@JMub)EOS;+^cIV!v7(ia#6tg<~kuZzeq1o^}Goq}eLnDho2AzlurdOZ`k(yH} z&<~6N)tA|7-|s2DbT19evzT^{op`ygtWUMH(8o5CZ4s;5RDJa{4P!Ru5d8U-o-Y_V zr!4zXuML}{N`UEqxDydG(?2xw{rfv$+Nx%l9xvkG#JINf+8Wn7EPAk9%6pf53T37k zSy;Z@$rRj)TW%@9lZG)oAL1yCR9%T}7d5p+YyXlsM-cvwrS}&`da?YRS;IMV>8`Ll zO`MBRUE-%?juAv$v)@%5?W(Tf=|2jd{{4=5`actRdaa!I=oF$Pk5iPtNd=Kp7tv`5 z-_rmDN)KgK8EIN87SkYQIR1UX@ppI3@&BE`@r#wbcLUxqc@88QqthbcR3dHxBUh%o z(P;<4=Dgx@ca;rS|5I@FM?2mO);p-k9->cjj(mkCzaq%5G?P_%@6t>@@i`Xzq>7+kc z56WJ?>4>h@##p-vFp0BUiTWcQD0``V^IVd zPcLq*!h;=Gjp2IyI!pGm)o`PMF}Io4CS7Lw%>w{}Y_waQu7?AUHWH0+!A^VP)uO;+ zX?WpXq+@iNd7d8t9bTu16HJ)90v83>l9!2fzD5BCw-6%0~A$}KG@VREoC;bxi__mNHeR7nqTDPlc5<0?Hm?!R@N$bFY)z}j?HIw zzw&5Pn17k3_(>O4o`nR=FE9uXM~G`!{OrORTwRF(DEXGDzd`8rIFZFlR`LWBxFZ8s zN0t4|U80t`%b8~d@iN;i$`rYRcb5rV7sqYf8$(kvsR)v^;8yXyx8A;-VdV>p;yc_) zU-cp5Y*w{t9#lb=+%roVGG^-yx+NIbv{1N7c#f}dMXU+jl?BliS-xHezfe-#iCW{z zgx1T}Fxg(X>Y;+rFFN<*KZzvsm1l0UoAP#BsA4|UB;U3FEFCf&$mg(~7fGXxintZ3D(bLhTy9!UIjTPH5&q!!VC zEE1}c6-4G`JBKRh8mqFMvEM@DhH8orK>*~h1rOqr(s_%|q7Hgam9l&KRxn??gBoZ# zoNw8zps;`@#(W3kGPg)2p^~DcMYZOg!Vu?=1me$31~gc~D#b?V+p5KPsM_s7d=fi+m)F+iT1B3M@w1*~g;fVb^hrDMU<(oPF4cxYtRf=F&o-+vwpFd@Ga( zbx?~779DDKo_RlpJEU+M9(n}R6V;{vr$&*%?(+&IK4II7z=5akRi9CZ4)hHXWFSm^ z{(veZG*b5Btw0U|R?7vq49irqt`r;V&vm|$99C?()xfcaXlcm!+E_d)!8#{}cfI?Z zQH#6%kM<9#b@aHUcN_ItPaadS+yk0YYv^p%X_lW>n9@JE-w$Bjv9{` zb73)Ey+tJXF$g)g7Gu@Y?aDk?dnfVCK${t8u-Ik>8d(rC15KJH zGXsqUVH-v>18ruY%?z}efhKlOAAy0UeSREF@Dluw<6O=rj5zjc@iW?esqg|^2j8-o)OABDDYy)d@Ie8a{^#0N&QsA z2vV}j7j8eu_KP()3Vm~{Sj)|OwZf7}e)O6P%M^jmT}xpze>I6bt@Dgzbf6z~ zJ%+DVb65Ew;h~KA08bM!WnN9#rREER#H4o2g_^C<4}h;pLA5MyQX-gyr)Nhiy4BEe zrDDGB9BK_7vj%{guAFCjeqsgsm57qL%S0r z$1WW;YHPTyISF~^oD97FR$)DBr$23Olax93UZvHYb^x#Q7u9!gzGmdR3VT_RWu$p%}0WNyOdd^OM_6w8motJz% z7^_eyOU1tz@Ny19xD&ZidhfKgtnL%vFj_lMPtcct80kxQOz&6iQX)1FT!H;@gv?Zv z+39z+a8xsRGJ7?l5G+m;lbS+AQsPEL>VYewAEhaxxJgLKP+<~Io`kFpFvHSJLaWcg z#(e_^5xovntP|W5IwtKu1g`|m5-dx^4&WG39H9Uz((hJVP*==SGPePCZ!<$DC2gGR zZ_?=)#TLlZ4wdHT9bXse`+ldP6FhYCLADIY0wS7%iI^16I*h z*sdZ#(MRrn1$Ho);R$jcXr{;;!FY2j+y-!F#edM>+A6qo>|Y|)(Hdhb>4?eF+_We{ zfuDNXjm3#u-DAppZepKV&7GofOiP^EruO@^m`doubwitH~5*RdHy|-->jIt2J?x zhn!pEUb%h!^$6*yCfircWUHFSlkEzj3#1@U-NZp!6k~)q*=DlXG)m`gWqvJl(b>DK zZp}Mmn6)hD6>ghEK$!m21h`;hj$^JZp(hP78C*e~rvF zarS6TnU!?<(BdX7iaX{>?Wn-{g~TdlF_Z$aB)qIx8p^|Icgk%slorJ#Tv=nyYMK2s zhPrFh9&r{ZHAdAwXT)1~y8X+@pqa|D?fj{pTGfDJ%QkKoqY6yFi?OK3*(R$!nz&oS z0VgdJx*CUOPfWxuwLzn&t6e6{A623t4gL76~ zw^goU1`o<|?p~{-JPxZH98c|jU7Nkf^BLH5oQsTA0UUAAav8}{t*&rD(uq8;333VX zHwkE0ykp+<2JU=P@mmU?oEC=3k!M_oo;yq&r%FHG*Mi6Hz<54Fa;kx`X$FRB5)TXs zo~yqwkPjv{eZ&}+8`lwU^=H_iT27OZPsR)eBe+5A>xoS6S7$V8<}wdlRxYK<%BO@) zL*X}s@TACt>TeQ{Wr55ctQ#z*1`NS)X=5vsoR!m<^_GVc#xG_Fl_rpI( z!Tk_%G&r8C^{rEmk|?`wqCab1`?EgIP1Ie?tJ6P%DyQPn`rFU$vqKYy0t@~+S$L%i zU+hSK;`$+kQX;Jz4s98KkT=chov@derm`LmCXA#F_~V~asqe={DH*ieY~8NVPshBlVj{zPX406Fu(^*&lqo zhU}>wIU0A?hsM2arh}hW_O+_`}2f9okui>}-eYQ25)s@Z1?^ds^hQG-`iD1N&(0f9zy@vvdCazZb)~JJi1SArCb= z*NLp2&T6SmD&wY?e~D4oX*_tR)R8AfV{4vL+Y&R7elnTUiowI=f2B1{zVq!EWwD0I zH&qw_jS!*uv=~R-5au+QJn+IXV!Lvvwt!t3<@wNY9CkIgu(Gi%|MvB?n`fB<>C?t= z{>#X4cI}5zI}5on9rfDPjeVbX{VY>i1i$x(S`Snc*&;X++b@=sMiiLHY6@HM&!ov{ z+zv}gLhZ07+dGyR&8o8-V5GmhUjrjyA|+^mda#yn_vtS>umb#mLP@fLlWd%gd>q`- z6^1~%q3BM_EPv$%%)zR`v@Lzm!*1_)Yy+4BgK=_^P} z0;C0E4g@?dQhp>r69FOs9|=L~1emjwUnabgw+MAnK`Q1IToQPYFhRI14M;)FTpmrV zmf8Rg!V_So5MB`wBVb%)7YILz;=`BoXT6j9X?AnrbWXlONr~SiqN}q@^VEQOZ!^zS z!QwIGS>aZD+(+((EsD7ZDu!s7ni`vwg+)%~3QyY-M-go%Xq*7IA%z#LHz@CQ*T z2=GX&*Rq=^B{6^qT&A#;Kh15p*lMg%|7}tg0ki%cDD}@9~Q0X%3Di!pf5&G(Kwfkkx%E`w|>drus3@xrGGSN3v5Wq!}DBxR}u#W&)99z5sg>Ehj)4PVePD zVVorK{ajuF7zss!&I1^xPIw~Rzy3MzvN@$dgbGwbE%G=QN6$9B`}t13o44RtST*U? z{g@tQFe?y~jT>pG#e_msSk8NI_trw3&_G#av>QXbFwGKYg>q@l8psiTC}gTp3|niA zyosndoUzo^;3q{~^U(wH@Cx1phP&Y)fkiTM78MVmi8HKnuMUK+3gO3y77IXsGL+C< zZUDY4Ro?ebpJT5%1@07T#`mTQdV9Wd2f`@-k(LeOpi9E@- z)Xg$oL1td-xA=WZ)4`a~z(Je0&Yc64+&PSUpgpNS>xAf2II#{qHHp{*;MXpu5gOZS zn&$tNB`+bP6*yF2G8|DMUeuT*C57t{pscE)fT)!&641;dnOP(@*yGG1F(&HFBAHnv zGmC_RkA-xc;u6fg5Pt>Es0Hn-{egNkwM54zsb)Hy?cBQFWlXEa^m> zvQy|ACx!}W$Ah&?5#FVpI+MujAwQ*EABG2kUj1Rag~(?jHkLvj z{#5=Nszt3I>$9Ok)A((u9Q`Mnu^ZL?&>pzGs@{a3Eh%Gb8 zub?Uke}efH6^#2{`yEsT@_1_hgV7D?6wwX=_LWGF0HYGyMX7srN%}FWplX{g3_&nF z+GJnDZ1qaZ*DzbXd^qoBtJmby2AUsdtJiGx^5vBnat)lVUeZfG#p>nmOMfoezVw|W z`_k{9()-f4KeT z^|9w@f%}ZSk%EC`@vZwfbEZQ{!Z|`(7*P`2p*5t^(T7Eo0B;rG6&k~A@u@2{25J_yQgHLryY&fQ3V6so9WV-|#7A@8t|O zDyIx5(FrTiC^;>}B=z*58jX<}Q|8r#s%f#2nADEBP;M;*!Cy{gh*;dDL@)_Y7gHFp z7DuU&OTy2UG$#*>v2^Js;qcXjGn&OzVp2)?IG=Q8wHQfGD+wpdJD=jUtuxp~<(Rfk zj;(z7ZEe#iA2~u)^|hy~UzJ!P;-)Z_Z4QgWM}j#(X~jz0%;?CU2G%v8Wr=_y9RtIm zIx?68Q9mkCUED8;)e!ilUBVPcM2@yY6n-Rs0+=BPqA4|ffTY80A)^Knc%g>~GrdLv zSrS$Z9?;^LrzkjH(!06<2LUy)xWh^!BFF%5>RY*xNRKRqZhxN1D10v>Mb#KS-6{?w zb_$!~w0m3wDda#FkzzT+EaPrLPH+(6g7pCD^ggxlI1JycN|4VT7qQ(z2QeePa)7LM z5l~~+d_n?~x3!Jz155FzDh_@5oherCm@+?`thcR(CZ)7v9_)2H6{WM7xttEcBs{I8 zGXyNA(xRAztINby;t^>vl@h@uJUusdez4j)pA03P?6T{x*Ma^nT?4sslWBo3Hqf}ayo5?^3 z5}Qixw|HyElRxiz<3_fGz;>y+hq*A6cAMgIINZUZFH>|ji4<{*KwaKZ)3T#pW_Wu|@w%{hc>|6ZZQiQKu^^XN zoYSbUh>b06QB@p%=!u(6L>MdW)9pqfXp%2E&3msQxR-7oA+&O|NOQyfPs2CjABk~n zvT0dH(N@cA&_yTO=^*#Q8E}YITwizs8NvG?Af*8Uqp}L*b zq7fVkY(I*~C05`Bf%ru)Pz9Ehh{g8aXi8N5I&ND*%yMR({2;VA+oBXLLUZWePU(bD z%3#*-*OIH7H6^4$4Fl`&XWX2oIIM%1GS>vlsp-ANSn8yA%%x=?TvED?6pvkxM~k_1 z=q2Ik)r6CS#Y|#SN%;7pJEUo%*xe*$F_a$7B%GaBI=9D_MUD$gAayI zDzJkGC>|v=-Qv@ax_>8I?RMMYxy8l%_wVQ1O?V7iosC7hw+qDHXcra{h8= z&z`xtxlCcqf0-{eaoGtBXvWI92W#{ilDp*Z@ij9yN$32{5}lqQ45|TuTdZ2x^s$MF z>rY@vit9~qZl{UzwuA2HQy<07H-l7J+NO}@N^We*=`D4j&l@nw`IwInz$hN0*=hvv zpso8Q+(}QL!tFr%sudsUwoO@C;VXiro7g>Y0yJeNiPovNXeu^I`1E~BnsbTGXT*+% zd}Dm1NWD&TB#`gvyiw7}lO0XyLjt9eO7Qs@TE_=sc#r`yKN{U@0+R@bmbBTYVy5MI z$^gWAmm&`5@MY|Ca5GZ7Uh4Y-DOe=8N^?9;Bxt1}Bf`@lgm;B_wI{EXi3rNeTEtl1 zqAt>p$vsHhnXtExyA&zKmP94DU1mQexh8?50{)LMI3%v&RI#>p2~o;)el?&L|9zGGtH zcsB3n$qeRWWT7SEbW`-YVUtWu2Hf-sITH$xBye`D!oiCK);{>P^cx>r9FhQGh4S_{ z6TN~|c9hHu<#zJsUHOJYoNg9gSIpUBGly0LXcJV3Hk85_AtWLG=HuIXaF?1!S|>yz zu2ZYSkBxq6!7oelGz#koC!e8tM5aU*izX+|&uF3?aj*sc6N#U=U9I`qyza1b$e-)y_3z?CR0a(c{(W9c8 zB?{gdg)Bfg1GkV7`y#Ub&)&&oRz)Cj*y?n%h6a&BUbn1|=uCnKu-b$)Q@3!_DvcH~ z7y$)zt_K^KMUmvb!D;!~WqkMSa0+?dZ)WA7%1MSxoA@MWd-m2i))S4ki(xzwM1c%? zrL0iD+s>8%1h9!Skh@_ai$v1C`V->dI9uJTMLoe6yy3o2N&QSfs*Sbq6ow%IBu@%^0u7XZW^ZNZ%)F*qm_tCyFk`tfP0r2@H3US4 zp5;`?mHa*@*RN8{H+mn*`jlEmS;A7fk!*fe_)vP`Sk0}8grq30sYf?Q#z0n$+j%eM zV`JD-MB#fY%;8k3NHbee&TK`V*}!J`USXNW2bEq`h!S83>TcusELhuNXu519;zuxK; zPOKqVJS?0>>qTVP+}mt9g;w27ev_Tsw4U|lv%d9g6EQ_u0`*wNSXDCU^TP$C)t|PW z%FOI~t6Z2{gK=+B!BJq{&(2*EYwv@t+f6#lLvs4L{AqtHdunk({+XLo$?E(u`k*_>e zW|-dPok)IWnEHj8Vaj`#;><85<6~x+(k@?bL1%_(H=EEf)gD|94*3S0%h7avJ0xTR zGQh8B-?Tbvb-mMLkpT{WRYxoSvZNDj%Ksl^fIILeAM*g%2S2ZL*o4Xh)Y5;&_=4JS zRv?%G|JSal3e)+A^;1EL(UaBh}nZoQo^hxg`k^Cvn~@R)bQFNtFU zyb>CNG322P7z7E@Bb?`znkp2Th|wV);^^x`ybgS5{Q|=DV3sJ>y`kjpc zibqu8!m9vkv{WgAY*w@l-XkPg!9jQ8lBfp1#fi&QtA7I9c~rZleiAAG2y|OTjC&tr zBI~@B`Qc&VM7c!(nqW(O6#wQc02XYPfcD6w(IC)rYG>r<)pOOFI}i;Y=~R4NsflY4 zOBjs+-^39T*Ag+koL}PTXW@-!ph8jKt)b5hCY3Y(K@f+pE0!3j;pj^t(b9Q`#R>wu1l%WF zV{Rh^^o9AtEmMp8Pm6=sP$Da(qe+?ya{Q4IMzRnEiHa22$&=DGyLcu~KD=WHR&TXE zIu3!s!mS5Y9b2tKL1=yyVdZ>|fu5_wyCx1^Jb0zJX%tS%f{bvmgwCKAsUwSVWr#iH zcGvugmRY<3jAX|UxA6BVO@?uXrWOs-EwzsR6DwJaOBqLL7RoHS7IW;()eX_Otb!2m zJ;=EU!81u4NtGHdoPtyo9`<^LrkkO1XrU<x=~QI|(7CrD0v(zy z1~MJINp5*!2DSXl>vP@<`tgturXh(giIR&`d5kOV^EMo@)4$%@SYFDiws9l0$NI!g z)#S^B-XhU7G){*&ShuODZ(9_og?4S}us(5JpKr*?LsFN{>l56rTNuc9xaet2Z;R@67A_G57ky1H#$Bm0~0Gi*lnr#+IJS z;J)h>&Svi7HYxJx@eD-qy6t*^tiOVH7bEJ&!P~1`lh>}$!9w()4xav0y}@orknBiS z(NI;i1yQQDYnFlsC;;_Dd;lsAI}m`%eSro?Vn*30c0VjNz%dTZ#YGElVQ%F__nliu ze&8c^!p+wIhVjD1TM7|XV=(vGsqbw4pPl;tBs=3`Cub}?qYiCn>%UCloUQ+eA|Wf~ zAn8+#T02j{qu9q5X6}m;1GT$>z@sqYPbOE*b zMG0`N4S7p61b`brRap|>8-Q9yd<2DpmBbDbkzfFE0)S%%yGw8U_HyE)Wy0&nlafsoPMr=ZCQ7h^W=r*UwS-?NDZ(Gz?~K~BF%jg6asu5>wrjKjbw8nYXM6!M zL`dN*+4xNvRYuAxRF0!75Z6bUu_AqqgCs-`AiP3yj2&6*$7FsV_&yQYBFNYW6*M7& zH3T(vX{!pDK&ZszNQv1*glNXuM8rr8vx#Un5#g2r+bj7IOhm4=_@iXj;t!Hoi?98O zwif^NL$ekQc+cQj*eMGHAE2+TSU}ia#c!>zZaZpel77r9OX$ z0Eem>pbZ^9uy+sN-gvb7c=e&`BfT~2dxx=&qI_|7l`)au2{DO@y+F=T`@ht0!cZZeJbj z2do1@2Zh^%rvMAW$rE`PnFKLa*&ghBhXQ%S?Qd*Lpr~-q+b+8N6k+o9!F1^L)_M%;#{`TPTdaKn%ssq3r^vgFN8XOD( zXaak*xC#5Sv5hB(fKC*&i@3^wt`G@9@~C*?1Ez?c6e(7|Sgx1C5KYDxWd;4kBXA;tc%#S@)$tNhktSwSv1dAYf`^xw}1h zqSfoVRQ58J?ZI=AHxUxGm1lvEb%=d7RvT39&$=%nl?P9f&_hV53fa_4(4E1-IsjjL zl(+$Y@cUuExjpzK@MRG8U99*>d#Hd_1pGrJ`v67;OACJ;2r5PFN7jSQ?drb4p;8Y? z1?JJ<;Q-onu+nR^abzns4ie=Dj9b=3a4^U`!A~&8nj!VOdDIU5UZqvsY>+NJiCA;o zmLfu~WldI(a<_<^VgjL?PZR;XR04<<7?G`fRE>n{slnr528TgSj#vlLgR&TMMUa`Z zjnRLo?YEJ#3A9`SQm3{&PEXcK_%tc?z;jT^`rT@)$q;Q7|K1`>hKt*SBUFPZQVk?6 zVG6*A*&gi2^Mx0dUW8ZG7?$P)oS1$rl}z8t-0l%^s!g1U@Z3Wt*Y;LLG4Jn z-YVTK`i)XhF9OkvTvyz_NBri!?W?`D!G19XVCX@M0K69vZc?#J7`vEK(C1I#L(qyY zWw3KcC-^ ze~!^V&tZnIJxl+*dj$X7q<@~p=&n73e|m!hM77&*gCk(>)qW8V1)Zx*<0{v`%5|@D zy{o)J+&- nP81*3^ON)VG5wg;3qVttGUe<-EBN5a^+wTFB$8WiE&u-jrDujW literal 144165 zcmeIb4V+}xRUas6G+(9BXf(3Mw#Js9rMA>P>W`}GZ`mVTGb6?N8rw6YQN#31^Q!B0 z*Q=?nD%Hnywc2B+c?#DUjo^$TG=bn4+H|_nz`)<1VCi*Y9qus3d z^^I}2T&_3DUVA$@P;M-D*SvaX`{Uaq-@LuGJscctx$Eslx3%nT2REU_a>cKeTV8$p z@^)~Tig)~4dpxYazwIq|{6<|?uk5YttL(qLJzO~$?CtoSnx}mV?m6d|S3SqAmz}5G zcDv!6^Hy74yG<=nEmXSog114?B$oZwZ3ZhkyDQk&bOBvwyK-l@yZ9jAL z!C;@D%=;&vZF{Zu#9F25)!SZu;)3UbQuWn|XV|~q)1KR^(=$jm@ieH^ZFy%K0Bd5o z;x;>8YjWIgZq`fNmE)B|-4ZZA2t?e~mfNi8B>U*4i+u-EjQMhjkeFkkO|ST6a^*qD<1^3i6kaS?*OE47PvhHb{!Ky zE&LLc3&G`WxNA*tmb30T75AFw)EbSeUfFRw4g`G#07FilWfwx|tXIG~RIuJ?t+}<@ zCf?U`e*K!)>Np)V1_o~V8_v*TsZlGpH`nmb^@Xh~7tH6OapzeghvPcUMs2g+So7T) z0BO2)QYns0z~st)*(o(T6$h*zHcpy=X(8%s#qV^e5l9$4de3)Vq9r}IJ8s7t&DA`& z+;%z*r`1?@u0fU?t+pr*HR`X{1;FbSf4RaCg;s-B0z9?NT%*;gG*%mR09VG4p&{x> z0~soz;u4xM^Jb0x7?_E&Nbf!W!jCg zWk7+Ec>38<=R@ZlP~mi?fswkpX>!jv6V~C%vEZ=_M2OuE=(c3CtQrKXF6w##px&HQ z-C*j87dRScD^(+~eT_AOSqThjsO5W2PKud2bsh<19Rm4QA&`tF z5XxggDv8k0Pgg!hkltj6@*8>TCI-u+yB0hR&X4H?A zhTv-l=IEGsJxvuc<4du9DxC4$b{b2I7+h=C7PvTWz%bPG!w0VbU!-n9|zrX5U$Wx_5}_X`T|s2CNIO zJ?=b*N!zd0oVKS;4{Y89*d?#lSXXn%0fCDq0qPyd_QSfivuW~Zfm6FDiUvy-tqp*M zrWj$ky(S~0#Ot+!AWEIFHtblKhFGpT zZWGO5nK#Ossli5UIqgczuV2Lq$yxJY?ZIBG`ByzBy5Mce1#g>+3K;)u9}&q}m0!XT z|DrC~$z}|#fZo+}h!+mCwFQO^|6BDjicSgR3)}R>iSuF^bdfEC&gjda6DJ%gVxvye zYhlIR&QZO!28OW--P&5|)-XbKtkS8hS8Bml7GgQ>V6EM8x)?*OVQ2;8VimE%*1H{H z7pp}KDNMHF37HG44j;=6>Mx?5`4We(O;l%$k6qa9Em{(lfhTw|TqKa)DGdJe7te5> zArt*>re33T(ezu70vMlP*T)Brhkfl%t5ILo*YR&lBCjxRlM6|n2$IVIpntCel*}-{ z1BQ7}FbqS4*_wB$!IJ~7(Zc#UMhS~mYm(|%aB^2nq(QXHh6aFLn|L0}go!mQGHP&V z*gPst9X0sl&OpMXcr=5?qFD5w+$1B%Cbxw@f#&-F*6^WIqO;lbv5FVd7jv?}_txmv znbsh66Dl(`!Hklz$Y#Q2<}b>@>r!W0$?jbla)!zEp!@}fYh#2>w3r~r%03*%q{H0W zsFNe7j;Z&UP8EhDc^l+!*6%VIk{Bgtxl!w`)pdVL#N9LG3V#fZ^Gbea6Y4z2jZqJdAy5DcoyjqGGKGD#-1=3tzv3_Z zWG#?&?RN-iSkFXz^zM_Rt?k2rpuTeWKl9VD#>#HT#f(9|n%GE;JCDL>sEe6n6sUuM zW$1eahV;Fh&34!|Y0bLj%JJ%5U{hUrTg-S{nIlnF)S!%iv-Q&u{>R|3>4_1OQ}neI zb@H@S-xYy7dD0rlf@6Q%N9favuzd~&nC&~2rBbc2d{t-0@6Iijyj8z`-K}A# z<-}HQk;;`;up#6;;GA@v#hSO$xg<-qTJGl7^;WC3l`EjY82u^c78lu59uEcaP;}UL z@mQe8d~OjI#&wsq;w-kvC2%=>7xpit;`IlZ9AY-fy$DH4+JX%B)f?;BZ{Ge6{OZ!i z@Albh6_u)2sU~Fcn@AQ%p1JRAxT`6~N_s38z6&LkF~@erVpbf@IdKb)c@xQz$ow)M zj4W7Ku%DLcjR)%re^&e!*6X362vdySVGnL>-N!aqySpaLW9;scF}2##Gq4qq1ho(=IA&gIUxY@IJI1hHOze z2=2ImJ~)hQSTsc!`veL87!9?yS+y;*l zIc<&;vyJ}B)bsyGMxyrS9x6&ht!EJ%I*H<r(O{HQU4;e+%W`3i3qdvy#k@IBSd16II31J75?W%~L z7}VtkP^PU<=2nO2Bt&79s?jDUn-D|TgnNm5mBOeMhwTlOy)}4RIxXzb(9G_)nJ|(2 z{H;BSu5o)pA@IQ;N5oE>F%RhjCj{7hDS4EcYF~-8)ql2}6SJiNgUy!56PQFpEU{QJ zYPuQW{-f}8%x&=d*!~^T@N`5WYE$x+SC+G)T}X^>hrq%CHJ zAf#qij9nmqOi3Ujx;Vs4|=4=Rxgcn*M?urrGr=_)E>BJ$%mZ_ zQx%cv@*CSbXwwC>evW1&Io_<+H}W+p>%E*nD7j^Dw4k~D(Zb`r(*qE+nVAhZ-a zHWUn+99sozpc09mf*&m0+F|=SJlaULtm3=iBlA1qsWg6cj%{P9P%oV{k{W`37?6-6 zu;t~X^r6g$R-4dXfyOZ#{7Gc;vTdYW%IpElX|SgR>ok+bHj5$O9)y-&98 zy!ockS{G=s$v4k}(*_U_4g10CCX;G^D0@PO%4btw9o;jaBd{m(H;-%B;K2r-#Yz_h zWb_o#P{V1ph1O;IIyT4@k3E=D0SUsUE^iWkJTt=Y4>h4i3;D{1YT7{<7mKBIidE}= z(3&s<|^R6n7Lmd~bC ztYkK9ciU%K*4MeQZ9{l*B%aqi@Rx7LIef?YW+gTy`#yij}MQ4v(UL7N|mw3#@iR$rphBTsIq zSyjNqW>uX3d8Nsvka!h3v(UUhhbiI+4l}n0d}Gyyj12MBSr{{i06HW~FimPp>4&gH zTPu}aqvR7G!!xry940cIgyr)}YJ^A9CFyjPGHL3kq+@3dr^&zra~4Pcb=h;I&n-A{nY3Pq*`0-<49?` zK)eA{{*Mu%?d8&XVoR`qF*D<}IZi(pX)jR;P~L3tK1&cF zWi1=}zbp6N_Og)_Scgv%*+6_gUj5a9P{xtDo+v+_4cBPo$f`vfsq}fCv#B7~{*Y}I zAWVk;<3NN;;*Cifvo+-+m^1M+rq?D4+6eUcXickZAC$lA574OXj4|&XynR)213Fk z>@9aFc#Q3_HeG~IGYO%Hr-yew@Jgz7)e89eZz2NOOZhL@l|NofnPLLI@76*63g54k zzW|0Q{|C}>v+6%cTf>I7WxXVz(e@D!>5`-MY`(X(KPe}b+YNye`ZDrX5;cf?K->4F zCUNC-@Q_HtmO`FI(zGXg4ax0>z-#zNKG+DLriv4$EF(Ws-|B@-s1YD_ZqRfd9AyKKcI-`UK_x1SCkLsx5bk*|`;k~H`c z?Jj6ANEH)dH#39}%9%z(S$mm`^fTt@n@?BdBorBJ^}(zl=#p`(Ch0nvkxq9hSBGeZ zvP@Ko8e5ad2h+~W5}P1(6$@Pb4ML?|g+XX8=}+f|L*sd=FshGZcWbFIGP+o9blRiX zmE{KaQaxIxKB5-unY1Md!!+tAFwB`O!$19PV$~<;pe@6v$Y!NQoC;3E>KTh%BkPPX zbVKV^u=&m^OEjxLLY#cO`VR(TXk^ZL@-sgkMadl6_vQ5QTs-fuuDP%fS*hx98YE;U+iEiERPzorVBB-}{yar_lH5z<&Yltxe+1a;gy=to1c#YBig~({{ z))M}eNPGR=AfNv$K|2WyvxMQxd&&0)tB$PCEU&yw9sU=$x>!Tgi6Qs z+35P5yri)4lB?J)7gSZw%Dt>-#UMfW0&KTuuerL^WOU4g&3uX&&&rcIU@dbX4n?5p zFX3N)LQq_y!X*4wBAkXXe@;et+CO9f-cy)FlQj;z670GLY7^bE>ZPRottwV{s_qLo|;Q@!zHBhPs%G-c{S)`sQAkC3X z+LAaki{vpNoQauv%kx6!1RXRj_j_<6Q%IXR{z%lt_EmLn&n3jF(bWn#V9CkT&sBOx zlo#GoM3=EvaqNQa`tno@*ajl@LISEX%NUJermsgc!G z(Eyderq4#$w4(f8N1_B2;uHTMIU$IDLnl`vo%GhbaDa^`JHVo&Bz<5-u#wNQ$c>R$dDaYFKQQZv@z`Z6a`2cKucsa>;eYEz_@lJp!@^G$XUo0< z+gA%g`_Cb&d!a5=oq$AjOq_8UV@IYC!>Zr+;EMY&SXp%*h99qrmJRRBAk=e+E0-5K zq_}$GURu>40Vz`6I*+^c4$gA<%g&=BiK!UOe#ImOt3OC1b-emX{F9`2307P_@#LG8 ze0)EvqO|J5Hz2a|{XAbb&&Vsbze&^K^tV@EHIk^RbdgkiQzX=;^h1_QC*)F5P?I*f z^wpx&=3)|uFCj;{Xe^6J)&E>Hdk_FvvYZEP&1SwSMYfG_=G< zeo4T}bo@w;-D5#}L{R^(z}FdC6I*0M0`$miAaPeq!JJwq#}GGahwcU#=_@EGQ$|uS zgVu45IbI~O=!y(Mqo`>=#5NX?vP6;Q4;Pf<7sbRUZ`ZkhS=1c*p5p4WGI+dWon6`!u zDrE?b2-V>9(=n3Ak0(^o;7cq9pnfwl+BTlFl)2qdd|H2z50)O(+$rWoaZeOXvxk#S zGl8>BgGw{47dysw>#Qtr%&vzu6nmAh4Y88NgHn-;d02ZRr(9+r{nyBt>|6p5h&e+8 zU%g8Pct^_P&_2@}vvbgo3gw}uH4O>dR~tHM1^;-$jHz{-Sj^VH8vna=Z%jDv3Qn+o zGkIb-Gs50wnd~(bt)G)o(-=8)e`s$^G~S&V8tJ6@c!KGoA)Qz(8F@oY()zZ~Wk!a* z%;3^c3118V^hLWv9xDPqu!PBQY+u2C>GKw{H`V>q??w~ZT1#a3K6SeKkP_wyu)#TheBd;o>ZSEg3mIM;y zzVCvjn?=%xnoVPp1kAYj=NPr5#eCX? zvrpcKlk?%pM@0;^;tw8q6n=CqpFVLe^N~{mf5UAmW_oRz;PRMASfjgbMq*$6CF0lP z)n6QlZE4txe_+AX9QMDm4EqYMi^NIx>x=E@Tb=90E%3Z^<+!Nr1TM0ScM`bHu8N~i`p+1VwKl>$Xfd)^@Pp#aY&0T=kw0e_!_>Dj=GG?gyqF+aaHGH$6+sjt)7s5TQ>_ zR7C&yC!26RV&2K=t;Zpt7&0@t+5QlCHR^$U1!_6_%~h_=X<{i;7?>1V|2wEWFr?Co zQd04jUPB>dq;~o*{R@iL!mO5 z>m292Nw0}2^&$P%a@)=rVjgKTaHuIVR8u&Xyyx6j1G_bByT=8L;i+?5F}ZQXL&91z zV0F!}Zw=Q+kqSE((e&6V(zH4%~xI87Kr7(^N@?Le-)OP%DF zI;wYV*@d%Ce#B~gphqWqG2=x&~T2W-GKV` zNPGQfimz8Qg#d=l6o+xFPZKr`%jg#y8WtTUTDO>w(oG_jvGzu4FE$na{mc*?W-2*_ z&d^X#U&lriHIYj6_`WN6PJ3e_{7*AOIOg?LBO;BLW5Ln5lG6xa`03#MYY6b?WRMR^l`m`q?TtA)|1L8?v3C%gT{O6@pOeurD4*6*{im5Bl#bnw(VP{Z zFg473l}JY3x-As$uvovDajigKeN{ zHu%)Eb+eqG@yjItQ<;(fNYn~dJq7V^Hh|L-^ss5(YW+mN*m_Z9*~{!=!KUGpNuJfr z$TK>K`K_TeSUnrUX~}vz1Djt1Jd@^jgU?$??riH14anYQY&~nN!XCaB{Wcw)@8D!idaWUGm2k}jIX4K<3I8k zj{Y>(HgT-r1-4%!bZh*BqFMYKX!NHTzNF255xKvrxcZM-6>T5?&z@ix!7)3722eTC znDc?V(QH0KQYnW21&I?qNh_qbuRnRQl;?9C=Mz zZC^q4zljKqrlnGtS^EwSx@_~+=!veGPC6PNARTzi*JR+0#dum3`_|0Rxg)|&8ZNO< z$%y0>9}3aZUrC{2-n!Au5V%d_c@22ubu!?4ASnW3_S*#Yy_tb}NEb&9R`Y!_usdRx zbD5!V2h!f@T0_Gk_Q{5b#r_l0CEdTrf=73)i!``0Xl!6iw8i;BsTDPtw3oKF)iS{9 zkxK8aTF-3YZ4njGkyEpN^bmrG_0yCpO^H0#Pfd#p--9%b7hnc}$JAUccI$Yo1CE5@ zNH}5}HjtNu?nH0XnSO1aWAx6gP_jp|DC8bkIGfV`k{K;AYM-xQhtwL_S`yQn=p%;- z&cl?4hzMhzqnR0y81KkxXOnw4UE(})rGXtO$rA*jx6y?2rj1z^kwoVRJ-)F@hYI@6Enw}lHE0=9Cw!Cr|^K=`_3U`&fLeF=7kPOLmvC06{jV@g) zPxaS)wsS@hxXa63#MNzLmyGSH85CFZ_G1^a7#d9sGHMVa^w9{T+k!_dWyS_#6AkhK zE7~B;OvryIf_wkF1cQh^j zTxNv3l_XySoIei$a@wWiuVx1F*g%R&!)?HdHX@|uig)iq8)^{ms+rxue})wIZZ)!o zNH*>52BV`iT|}k_X)Xu0ua@5W+X$Y$T04NUBh+N^O`*QGJ(hsL{sF7 zm^U%+8&fm$&0%YM^i8^2*VC%S`bux z63>7M;AwpnUxDyOE3InK%s7?eX6V!DXTSZ?C3yVURDINx) zF%A4ca{b4j{=f&%GvJW!0Byh?YkMtWn6RrN!PnAoP&UFIP)Flf_6QcZHD|8B2V1@0 z9;w}bhU=;sPIS#?xVQG?6%FWwLW!tUpCOwTH-nJ%5#0xKGQ+`KE-L9W-zP#E>}b9$ zW`@FE##$Q5!xzaw?{YEpSZ3hIJR@olVxN*x(&9(NDNhw+B3orHlZDK{x2@%blxVB) z*#5qyj4AHbLjr5F}1nor2P zoY)nCn7sds%wSHIcPXM4t6WLER_fLZupbn#0e?;&zdf*4gv7All57mu-^>ixk<=!U zhQR=pY-pw>+?7|@29q=mUg@4JROoNiYc`oO>Vwl8N9ew_>VE~B1h-RxC+aYtt)+0i+U+$TnJ3)ZQmNKhzN)pe@C$oxx(UuR1XLmp zeXWVDETlSX=I$pO8M|KBaKkPopu$;NdV?3kkB&T?!x>QL!3Q67F1S}IjU|Poqjzjm z@-{-p;-k!_f$`mKVY`gibxH_0FH_i<>2oxfP!7xcGS2#8fB>lOn%D9vZU8r6(VbI> ziD!2U(-|zX-zBhWhqUdGR}dFxm7UTiYb?YOON{oi-`pHWY-bNJa2=Y7tz&KUmxzQ~6WqaJVU;)TT4E?%JK0N5D)F&o4;w5XtaR)1*g4=9;q z1>8TP6-oR^H^iAs{MVj1OT&d3gZpkvj<2a!;r**##h>6n4cfSijV{;?nBcIzRiC7k zWz}2J28@)O=^rE%QF{%h>nO-A!H?t|+_1sPSpN>=H}lch`YMEqZeb}AB- zFk9p>*&-k4c6u2jywsaisZ-s0x#k&$OK@Nbn{sHOy?uE*xVv70_JpE`J=F0^jRtO| zgDn&sLRM||sOk;}xABTg9o$m69qglwpYGaraBJON-9(B+n}|H`q{`*o zc6Vz#IJgA+wXt6J*0*13ms~s}BW)SSOIzE)e%RP9V#uh}8XVSTx8rVCPe5LAf!lC! zkSqna3FCSDJ8)exQg)O1yZsWHtxlp4+N*V=jb(Td5VZIrB+2pOw245A0t8fyt^0^P!1-QrHn@QgIJ}EowPDk|IxOLKHruCGLwrLZv92irA~YsY!%ne8PC$w5 z^0Zb$9Xj^wRJ&ND3>6W(j$BqeCpaCDD!rr*b9XM+8ZsF) zwi{gD7mm!1HH?PJ?%Uc8CJ&}mbsE5_tJvUDs^I3LaN**YR3^-3|9EBsf6T6*RewRR z5;ouy#a3r^(?3Tiat2iY8i0@PzOmilLcSyJ$V@d6X@Cz}(*~ttmwU|_Ejq&qUg}rO zWVHV|Ge$cgW>}2?>YWX>w9GWMqbXbB8SJdS1!B__jZV9ig;AS!h24p1cT8TQ{4XxZ zbTDlXT!mW-;PHhCkFXF*yW+w$!5{KelZ65wU&n`!9Ov1VD~LBmmG!#?QS9?PZ>53?jl5#3amJOvsBv| z{=n1cN0{6F#EEl$dDS~{0)x6LqG=h2v8xL*z(V7a(^)i!;ri_eFWZ7vEoC0vH9a+4 zGH7gIOf^_5aPQ^u-I9uaDR3KvE)=$&LQo@5ABXW%Ae+u35ZWB_x z;gd*X(~8L{G6~kPp(Lo5ajTLd)jJQd_06s5t&`?ePRJD7aVAC;>q4%M2TwU%(z{iQ*j9Ee7fiTgpF1 zo2W*RDmHBe|7O{wq)K&yGw;~I%=@ulwNSuh-j@vKjj~Ye>ePz{$AuBCrtw8rit22c zDkrhx)YlI{asU`xzB?n&Q}#>85O@g(YkxJM5yi?)NPhyK|C)yj z?U^ww1}FAjqFMbR8kytO|8AfGBD3@hYJe0hrb_x?u8$o#V(J!X7W0MvbY@H48jyX% zk|0d{e;m}v!~lHxptnJrnuZ6BW2I82#C^J_oq@sv4+(1$x%V%ZZ(r4u^5 zqjNXytkFRo(j|IsWm+H6yHIneZ5XbBuoE7+i5R&ykgT2l(!Lbkap`uXHSo41T$R2E zlFNZte=fqSnsRdbkxWQL|AHn*{O^%I`zx?7|BM`Z0Wecw4;#x)M&Go9rV(j3tt6As zP~>Sh#C|I?@_hX($cb`DgIBT_3wir%c8yzF_<^m?hjctLacZj1EUU-cb5xK}KU1i(!7 zon@*oI|55MgREP&kh;GNYiL{9^MSv`_5@1q@>L3JAWsf?EoEwWefbPudD`NV3e^W_ zq>fjI1{yH3<=&(QOhImFpN01!9x<}Q)EOtWGqK-l(Mj)HH1D0_t5xUXl?z*oF&E}Q zy&5*evs$~*5jxJBTP6g?$~WqR(p;f8Xo)e}H7zCEvpJ>+p3lT$zb`L!ml6eSj(Hrr z4s7F(rHK-<%)+o#q8q-w4tW-ve{5sM*eVH+$7R)=q(=1&R|2O7RszN6k}-d2Xo&8x z`da|%}rD?3~x?4+CU6$xMDqZN0CRsX~!s(|g zNZR+jc}SZ)@c`ZT!3f&g1X+J|p%>HbtKF^S1SS_>7okW0$$MI{fgmQEyx-hwG-QWC z&mxwA=|7!nfLJB*2TgutERx8PqC_H3vda*|JnYpgMY@TRU5$s|4=vW*wNlwN^n4G- zRo0)*q}2s3oUO>HXk7YzI+qHFjV(4q%0!7*94EofuUq&e8#2CsAwuE)d_SxBUJMW8 z`#nR>xTa>_2=z zUAYxb-pnTmuGA<0*dDLxtLU*0H8g}|H$HOnqOtR&qrv*&z6nzF4ml$60EvXQW;eS= z!XjCVD#`35vJ#8ebZhMf4>sW`jmr*;8)FN5l;rn=X<~Ml1!axY*3Y2*{}~xtjWJK{ zo?wERvuH}P4b!&&HUf8lIefR0LxHp*hx@~^6)?+Zv*SO=yyJbGmqfqf(d_msnRlC0 ztSh?KUzy$Ca@h0&?Vj8@B`vCZDL{&I*=Qfhy!%7CfC>Q2mnH@7%^U>7?VUEE%xLCd z929)u2r_7IOd33#dFMH${zUKkE3^CeXWspA$OU~ht^h851rzj(nS;KMPXPij@o08i z&ZyfS6SvT#=`B)C39E@)&G*3(-2kOa4sgydJcMX|qk9eTO`R>SyEbJqX`p!6@OiJ<@#xrJp)kJIoODyk75^}pG9F^reI5MF%^G&fG z^6-$P^9*7yob%6jv2|W{9&5GWyBdDx{9_~H$bg5o@dfUG91upT5Vi}zGS#ef>&rYU zS?t846@E7bdBCWb#9(s7J69UGT}14%=V*VS(M0BK{{N}0=mX0;d;N4NhMsyK2q?7-1S9x z#hW!3d9gNeE7T(7Yzbat6-CZH$cs2-bbS%Zv{EWvKex4Y<$7~#Yip7D=L%cb>wK4I z@p^o-XLD;zZ_XC=E;gAi?4~wvWKoN8e`6viIfhyPp94=ODcaP*@uxm4_Zt+mXp`^V z(0XthP&7QhG22H@G8yOI%L7M*Gfu*VSXBH}%()37n9{1mu2B zocnBI6+*@%S%d13Th8#N^68VE#z1D68Vl>hg=Zy}H66;-MOL*@Gg#{;tI8vG%>}&J5=VIW$>1~hXb`>c5fZwRXF4-?OmXQ z(@vqK>M09W8maHyC3!UCaMw*i2JQxD=qLDWMp>+k+F>}V+a{c2y(s%M~ zMu${B_NZh(0TkQTnqhP6!2F@na;Gf}OhWBE?QI%+YM>aeZS7}7{zoz+|43><($E~B zQZflah4{GAc4>}A&ng*|EGVUiLSogOXKJ!t@p@JODW;h@iL!*IumyG_+{2&mKyrZf! z$@)i`0l0^Jn-Y6WGvw+Vblf#_V{9*<{FH_?owK3ew7XL*OEZow4tK%8GqozIA_+(<3NFjDx2U zR@Kns;~oBnB_Bl=Q@Db8YAm8zV5n&rL_hCVEji)IpAr8`%hC0}H#PoV3 zTM?uVzGB13R0r=%<@qZx&mZ&oF&m0Jf9!|y{q4RXNf0IocLUo@jQv~AClBkKN|C~2 z6vwz5Si3b@I{={;0HZ>=@4Nwtaj^3?z!>ium@$sNV4;c07+)CNaG{Np#p{N-lVUFf z$B+iDBKG~HjT76uG*7bdwX!mB-k8Wqc47iFm6ZV9_d^zD(F~z4lyEnxdsX<&k$&C3 zhE*{|Y_Q;9&1v4tOCGw$p-byn>$YqDYNf;OB|^GJA4--Brgqwm#}0_)m;i?9RaQV@d!xBK%>M~Q2? z!V*6wMZcPr6qQa&W>Ls!Qgk1eBJ2%F?s=k`*#{OJO*&yr6}WiLkM8ai?ZzyO#YhH6Y!q;vi;&2Ok@zaD3vyB{CP-tu^&F zoQW)7IlFBJyYC1bp@0vzD5WsdFv9_Jz3^1aB_9#%*ANrpBG0)4U5PmNl@%vP*~H+Q z!OoJNV_ose+)fc!>M_`P8yL%*?=)Q;w(TKHnTH0Ty9Vk&)ojoyMcnU-fl!wE6_ZTQ z^vPWjYV;ShjuJFMCMIZm88>ODhc9eMSuAzYmJtB(G|j_V@umh^w(af)!#DSm7dcEp z&mxw7`zt1G_^gWQZ$I8`k@V7iz0d|Lv?fDPBlAIGm5s}s!l*U69sS59x zEDo&=g|?1My~+)og%IZ)NTB#}h7s&IdN_Dn7VfUs76?iD>ibAKj#nQUNJz*lx~YUj zQQ0&VV%aVAJ-fjZy(uqg_6{u}cprMeCS(di6L^VJ4MQ&+Ek-(dR1 z2-7ReEil$IX)|wok@ot}G#~qnCj3zJ-p`013M{7 zO3AH$H>rf<)xSHCW}xZyGdCR+o(=`CDY#Q<1lQ`a)Ao7vw1Dw5Wc|_&+8ujF>O*5! zO7G2*I4?~8L}!S|v7nm^J@Tv#n&oO!CEs4SLB9+97?#Qm);CKSqn~7NCZeCpN<=^V zpoQf%5q(nnF2lpX0T8nsj)i$QA{5ZD>Qy2cwH+BmpUVubo3#W_)uBC1sS3Q) zyR0;#DW$4$*dynCa`lKKKhEMR+?jcV5#z+Bx{LsvwFU-kR_K~7f}t#H~~d*WSPaM#rwi(xS>>p zhY$9ghkGY$Y@dm(P|1;k8_;w59Sy(&r%cPV-oUV9lgpp$oa-QAQ&NdYELV(Bvp z!A=BAX?fj$sIa9aE#r4gYEgI;)?g=>CZdDX0xuuM_#3C^lpE8~m7Dg>FuXST>3F2Q z{$l*)Pf5lRz%Vg>lWojZZ-M>04JC^cQ}iU1F8l^ZF2~s{!@Pp% z`7Mf1=(K$74Kgn%UxOod8W#}zYfWezx8510jZYT`$$9)*c-^GPON7a!OZ#>dS=^O)hHKgyHkg#=i)_^Dt7DQG!9@LvnXL6AnX%Rb zkgF6jtCJ;VjbySM3Z;lC0YL=wrHS&-WQMX$>021)=BOW5m63MIvEa^__R>gY`It-< z8KIdRvH8W!XfeeyM+~ZB<;Vm(t8XDf|5;X3j<#7gSRj2*GgjNZ%4Y{mk~M!Bfq$cz zG+81*p70r^!n?(>#`0I|Vq*}KlxD`u6_?=7SFQs|&+7j}BYV91rvnWz`O5!4HFYTJ zm`;M{jA+()pwLOfO&$NvuLyUHdvc!8a`wDp?Mw17r^8=^HkoWp-|{cz+EI~AIUR!G zC&=;uQ!Kk-WQ2&$Vpl!!FbUe677UWUg2bqL_%1f!hv=VyZjwLx#}??#0sl5*z@y>I z@Y-1}l{Zhj(5*;XQnQpB5{CCh1wy`Fz>&mf>~s$(p9wqNcQhB@t9LCXoq}V%VS9vTtprk6Ay-chd^89Tt|s^@wf=Sy@vt&et*u za*!Fb&1J=Gr@p~5@EWuIq{tjg6C(GVdTpeSrPH)d8*4nQ|L7CN*{Bb6KnXAXI#R(v zlXt!&~fuT1#ltkOZMP9x{n*=egy zwQT!f){txVSoUpWu6}<+YPF@}K}j?r_}UwjGd>h)rT=2_9PSliVU!94wpiTD#z(_C zd|?CCvUG}}b1Zl)ld;wy%BaDCG1BbzgNpOyKm^)LOWXZTRBcGC7DW}&W%2vwC$0L4S`l6m=xH}(Kr^yD|Y^o&>OxDM7CZtXz~Ag|c7kGcHhcz$lKIEmvdC{0(= z=q)pSK>>+VJ3&|zwVl<+*nK22b`_PW{+OMfLdU(u_W9*+`g?jbU(Y6ReN?35-kK2E z>m8B3zSj`S6!Qy;vjl2PUA{vMRgW>&XxX=@jcgVbEBe>GQ@3fHr1faLwzaMXEtJAh)q*{Kxu9;! zpd9JJJuSZ+rYfmLQk|gW1D6?sbZ3UTje_5q5g?ZvPL0zMobvWlH-r6d6SqIWI>Z^N z;mQ&5A{c%YQ7j#r1-j5REw=Qey+cHMizOs@lVnkNL;URS;^2B zSryIV{KE^FkCcHY;zx!sZ^7BZ0{=0SVVY|-XitJ|ax1%Hm`qBpxm_G0@M^UYeeaq) zGnf(Uv^!Bl-QKxsv9BNQ6i_-D3D3C0@5&?Hjl?oAPpKtxtGf}?6esryV0Mr>+>;^y zP{mtg(`;??y;3(HHc{4ODf$I8{)31RX=Y+duiuv_?T7IXp#?HgR zZYP7CMZq!H(a6=@FhBa~k^X?y2^*bM4;tukslP;R8{K8NCXsj%J8J2p!0GEdKV6Y zWn>Cn6_k*5)t;?d$)Cw$G<8YNq&@KNJ#XUdr)izoW{;)JW0^3PhEPTg4vdken@;VX z%{7FwXl*yxyk|EOr{S@?c6NionJmO!!z7#bc7xHxfI3J6e&DJ$IMq(PEy+>1&uaT5 zr&Q*-{a{3A^f$himGLE%2{XQWpaSn)#l<3pr9#kmhI5$Sv`sBUJ|RNayb4I(uZkdCIGGU9L~|=y3gG`T z`HYZP1M44o?GZV5-rBQAZNL%=VVM3-gve+$HkZZ9D495s9xt)Z9HfdVL*EmDwZ9D2 zlne|Df|LABjASS5)kQ&T?% z5+|+XQ(x#+`U$zappaA6dhoq0rrr<>T=d;jEb3d>HZn?!i@JYW$YwWc;V@pT zg1qKikAF`{R`W9vHq=()25%?hV-<%!Rm`#ag$Nw|#i8{@IVb`NCJwiZ>Y3r_2@EYt z$O%PB{e&*{DF#B|I&eJ`;ory%;h2hxA$u&im6%7N^O~T^AXQ9q{7H7? zu$&BwQl!5=)40nf^6U`K1x#uzi`p{wZw<+0i4@}EitGy5-Rk1X3AeR5p@mn;W@MZd zoP#RVMs~t7r+8R9V;*I*bEH=@VC7i^tY|Ye4ja3F9m(#%%JU*`#?K_~KT) zNwosL-5{67i;)jt%Ds0-)}%^WjiWSa&w?C|wAWv`bd_=uz%b>qmyt*VK726%&}pw= ze`jVue<*Xd(+KbiG@eY%r=whKJ{vsUm*s`x%C=EcwM}I^`*RC5i>GgPK^s+6Lgg6UJp#M~$=>jzssA|EmJH|Js#*EFWvBt_+WOGVg zGC%C5-O!3%KCkwj(p)}2^+dSIB)pWT8`9@V+WvH-g`3;CXH{HWC^K8^tg;-<>Q&C3 zKK@Cv!^Mu;rc$~qtcqr0|GQJ(3WbKy0@80UcX8~8)|BL0mi}%OKz4Z-fzBe#OQn^U z9&eGL8m`}3SFJ|bwWZ8uUB@XPa<1F&NoS#6{7NW(D+6~qFPl^)(3UNfW&Uxjd}$sJ zj|2H(A`w~wfBWkMNlm@KZa{*XTaPFP+w$I0<~)r?)!$of zHn$Hs^1Lk=z^LBvl7XV~233S(%n zy3{GmRNXMG;nQdgo7SQ?EyLLTDIn6AF;#Jp?xQIfC00hwnEOK#h{;Yq%Ry)Eg-=C# z>2FnjSPhWqzMoYo%8BVpTc2~V)Nyk8Y=ZeuG6QoTKS!<&hE4UP%SG6uQR5KuBZ(`zSVe5JwqNg2dsw2zVFm9n5a~5$;dyB$9U<-^4Z3Au3bZUq!Wd&DE5`Wj_gl!MF~);1 zsVUt=%Ueev6pzS?Tg7VhQBNTk_Nh8+VENhW1N_qVbVx|jdJ!njK47TyM~y}&#zQq|(ZH0;Ij+sdS0 zh_3QxN?IIqVh?LB9q{Y6b95g$Iefy)&%*1~Y7MxU5KxFzF$hv@htfs45rY(c1O;`KnbQRxnAtw&j z40UG}mrd0vv^<={h6L%;jDC*dfi8^|MhlnOMMr4Vz1HxN>C!{1l+-LT$#ohH$J9X2 zc{#FU87zFZ2`4TEb2t~#B#2^8M>&s8w=aCi@t7rYC2J1g0-u>w<6;l0CqXn-v4hHx z(jSPwUaFJ7BN`}3I%Z7k|b5mB=*dd7XJ(q}6pXTdBz z5L4R=2EMUuwZD-WVm+=pi2~eza@B;Qm)Gp~jF8l)`pvEuzjeV_+4i5H2XRM7TZ=eI zxhuR7YtdMpDQC-n6S$hv_9ZZ7CJy2IzD4R+#Y$>w51xF2pJj7P@S4gP1ePz0PwbAI z*T_-CZd&cKLuC9Q-H8)T1Y@}E6DL%>+G@M0De zk8&(jf#cN!Zyv-$`8#la7k^CBUckWSHd}CyC?F=1{z^h?-8!;Af>Gc{Ao%s`SpA2m z49VxvKq^)}#zdThY$GrQdG}77_&^Ie%MtA9JngwSzj+=(A2^+O;skQ*;VVCVsTw$O zf(|K)MLros6G1!b^Faa}Tuv=-6G>Y)&WXz64hg9Gc|Ddpme?upaWQ9j%pX`aP zcLa_?Mr?i;OPP12;!KTPDJ$6M*~1oDup3!;ZDRO!1Cfq$1N35n9=1r7JpI*-)`3zp zrVsv`qdxcrinTU&$#WY^*Yl(KE!Z6F7p__ke-*djwW6qI!Xe-h|C(R1IS=6KW2zteEdZq7RuJif0uq~+5={E7 zs`tQ<3We3}#?r!#!C;K_8V`mk)-8y2Cf3}kUy~Mv5=PCM`=j`Au0E$65jZMNIbxTf z>@Op;U|Y=EI2+O&a$qMQKLgt!ZiFtCT6e7;rlOY_8FKK`v=9^OP^ewW6H&V@BzzEo zcSsT+-)yuS3O>wIabc|w<-o7N60v@|BPQX9*ozT$sx1|b^FGNm5)XRZ&_#!qSM< z;&(_|WAI*QK*<4RisHAy?wL${rFYyO-)_<-zPs2g=7yUP{8B}sx2@kKoYntKB6+;} zM*~SF#kRE`x4>jFOvPXraD;#5LfjR{3|?QFw&GWD)VJBjWCHqIhV>_7J%U%SLrFk3 z(0`HDK)<+VA*veag?q8q2t(PBUP(I~(Pl?r$oF1{#UY}Z$N@4`Ttv!b7$(Ib9&F&& z=m5+_JfuN4I$Y!@MaovM?zOP_WEv?syEh|#rrk&D zq_SQRN}Lqlhd1P(%#RjE+2Vwj21AVPDRyFFKssp?$G}w~KnLDp`o}b5>!2I~A(Pr0 zlacO>w9?;H`q;MQ7y$zJvPGkN#8+wT919+28|J&_2aR%BwP+)#Wr9{XX%qDRkcBj` zyoVaF8nIP!}>A>Z9Rip(b1!?zXSVWH=}#Q}U~NV@44wF!-R+(P_djykzqHnm=`ihFO#(i1<~Wk%2M74%t4L9WoOVTMb?So z)ElrzeYFHm#np}7ZF|-Te|fb07X9QV(x~(-w^l& z-5irfgL7{Pd|J^p$o3iuylHg22%{qtN6DvuR<4GWQK8n)!9A2ZgZAh3P+`7a5cW}0 z5eap5o6Mx+)sGEiEs@*gGcQ{pG~6Z&n^ChT7T;tud-?@5^*3#zVM}B$MJJg)Q)rqd z)FdEf-BK-PM=XH!>J1KYtm||T$J7%b?h9_L5))1~mWDx~3>#ZK@lvcA1#+~R z#OK`^Dwg43a739X4PmSmBbqC1e?4uL0^w^nMQ#WoEq*K`_keRl2$Ai;!h1J_5bIH# zIv;SsU=u<)(K4UJf1j0k@Y#chllD;-9uH4?ob9ePH&y88i4*naI1D9(|KZdgyI3Cn zbZ$n#?DSpSg(G+Q9TpkN(oNBo_6S8ADohMx+hPRCbiz}Dh(yFo1PUOj6{@m)$~erA zMk!dU0UtiDia-)))(SFXEq9zX559eIP!Wd%JRD}M;id%&G-%Tu!FbWFFSFcM-8Kg= z#{j>EjQ`750lWOZUh$Wa+L;}>q+~#0Tmc10ma$cUs}>L~IaCP!^L2h21g9+N${Pec zs4WFxz>O#K0LgP($_;-Pff}Kw=AyHHhGF%S5yMIgLfpp(L)dHLQL+rOMX=GL^szr3 zX(rj9PCE(EIPNXu4OqLQF@46OCMcZYv(1frw=a zwC<~z4zkwsJ6Q=|NsB4bCygcVDI;Sn7Dau5;-lbx~$A%zr7c#6Yex8cg= z0<+|m4Ns;vv%K40hkmzN^4mxo;JmI-?bcR=!h#PS;GgV*>BPkZ{)f)HwRYFqEh3cT&NNSoZ9T*Hy3EHO-;4Si+c9pEdq;Spihs25U|1nM0c`=NpGq6J;Ap`;s*`iiZFW4iJ-d=rOTGo>CN z(d(}xG?>!XutC*>!O|Xx|6c|gh$NYMlTFEKNZP;KP)bYagHnTP-DoduZ7ZhDfoVgf zE7(?lr5IO#iza`2Ac`fi?kHp3l&W4saj<$eDx{_Gy|I}UvrengUFA25X)yIGX@f$I z#T^(6eV!5n5__*kCH4tD{CQ?Wlhfu&)u;Z}f>3{BUQ=Sq0;>KM@-vIW+*th4-P_fh zZi~LF?$urepS$0A0=Kx~a#c7E$@-zA&`mf9anp1=2S*}4(b*>WKXHe3y_u_HNl?h= za~t><)NWzD*H{~`H(G0MZMf~f;GL|G5fHFs9X0eJjejmHRGl({=FSh40m`QpWF*CvW+O()_tIY^PhQ-isP0 zyH%0jHhfim06#BpS5NRa!_`sz2==u*xK(&> zq@J9)@%i~;VQzkI_VVT2c6V#LI*D#xYM0#V6n<2v>CX)Pkuc8T={u_P`1_JpzOt7K zQ{`=2xXk`uP{+alHA)4CfJL+0Sz2y%>z(bVZYH|lhgM9|JtRpNA^qbh8YBJNss8b* zpm*hj7&lWpRG*1f4h}Bkrun7LX4BgaZe4Day={W$FKH-`SB1Jz?P&|ATW;Zr7;*OT z8dC(~77m(QN-W_8k_pQ-6xk>7zzHP1%CQ}YO@|UDij$Aw#(+5ds190+C0BdgAq%Ws zX>@Byuv=?4a_w$Oty+{N)Mkkr*?Nf|gp39}6JT;X1Z$fz?i*oy99Ukpoo3P0;wBHtu9t}D2R=kb$4^z5f?bC?2rkNilh_#1Vz~GsMBLF2$n@m`i@_Rw+sIBGx8c_?n zGZ#R|7%2wi1#NE6radt6S*gs<@}x%=JH%4v@od;q!zim32gXS#0~~C5EE6fwkjkjR z-Qa|CBU#9-hE!H9?gpzL{hCoB8sWZ%fVPc|TGqv}}LnDezh_0yGC zw3t2mucd_~6c2L{P1`2O{u)?<6YQ`73n@&yA&LaWB5FtoGXZAa4ptQl-vvV=VeN2# zm>Wr-cQhA%);}X_6~1JVYn2o$llyf;W`j+>NbKpc>=0Q4i}o128_pQ5uR_lPTR&}T zuQo?=!Wvi#mtu$*8Qyr`#>hlneIn%03Vqsq-zI(HOEXnhtf1r@w2Yy}5jnyrxSV8xyk64Sb<&r~J$2ruwqU>WD8J zn-hc$^4t!~x|=8D&kgDUIb_fd^;EbVVk=jNHyCqQ?0SPSvu8}H>e(v)2Qc#_?UD6a z<$s@?xP*adPF;zs{QJHl=dkUto$OcnUynsTt>O!FSk%wV6lV&PgACs&{0yz})sv&jyq0Txjc`992^S%J(i&e-Tdm2>xjM@= ze(=k*#`eO!Nm?jJ7v^rQ0aqY>Df{kf1ItTx&1IvG>n>T8BbN7kjSi0hKR*#(loPgu z%~mA+So4toXnEXuyxT%sEm}K|$`<_>;1<9hD2j%aupC8ZMW3x?L*NhwiSMq1s}6BL z5At!cgo<=43$LRVs;733lV^LRGI)$qxx#es1WItYu@_w9PD zrJl^7Eej^5#M!Ll;_*9@f`x+*k+*~=jz#>_vR9@=pDYmzw$I6d&ccP6A8pOW>Xvzv zmK$quwu8}E$RUG3UF@~TQ^>xxXVcm+Clms{UygF4+BDhApc9Lt@JW$dd_G?Nt4JHB zii^^WrQ}pJ69BMf(GUxXfc{9LgoazX^2un5bhcrp2Jxs66>reY9mnA;O@04X5~jB7 zwt^I5bH6|D%_usmm6>wf2Fp-@>lI{rfu@CD4?n<7S>lvtIou75EU+V+fwW?@tY-V{2GW8uvfy37 zE80{v_X9`9FNDjyg^}Dsvy4K`^7t9I<38SU*Sul8tztd|iQ2^~=ByM*VL_N8nYfBMbxKatPlfGdzKU5m4gc1q zOAgjDllht1d~wdf@A<;a{Onv|mewfP%Pi#Q@_12n#){*`naR1r+zi{IM9G=?>B9WX z{G{Vdj^~T>Gjns3Q(>(hiqrFj{Or^`eVU#tPR`>$s)YuN z(^J#=`6-;l%a2da;K%H2ku_KtpPA0*i&K-6&e+U&etu@QIKvx6$?3UiKruT_o2Z5P z`RVDoS-4DCgVR%mVqs>kNS}b>9G=(}k(Y`6&mhul)36VXiP!#Oh0|)c}J0 zS;*nHAd(_cj$udinaxY;%;(TqNE&SG3c}<7I9ed8%qg1Wrsy{(NJx$;#3TR{K@0lD zC^46tamEB06cKXhgHr%72>j=BY#mHM;1J)~L|&b!6z55nN@z zz1(fL>55jm!-206L!)KqjY#!Y{Rolkc=aWzqWI#@q+Qe$Cg=J&U+Se@PS2DE>3-*Q zV{Hw`^7y1|jnuKt*SQ=P(IL?u56=f8u4Z%O;oL#WFkHaw3IED8op1!XhR23UpiT_W zpV$~HBJ8&~0v|Mgg?F3byAfWw7^_V69xAYU6I1i!kakoqP;;Aj9afuU)wC|DvstP% zF%?!J5LkbctgW!(6e^M$P{2~nDJp`FSb5eAinlx#2hLG^h$T}lI{e?s@ZYH%C(be= zR65?$0t+`9b?Oe$2J5q$hq&tTcExRaBhDjE0dEh6&hQq_X4VjNjW?kmoWFr9J$LXd zpk#INxrW~q88uuds^D*NWTH57@ZkM)B(mhSSR8oG!EY4mAG%5@ zB!)LmpvKtM5mdx#^(u7}5^e#+x!-xly-ML6IG9>lZTV$_whTL~*#J&F^EIt!DL#UW z<%5XS2$_soic>ivh88{6MsyijbYT=(x9$VXwc-4zQy6v50#C86(68JJXqWe?aW$gF zazwl6h$2Fbrl?#GYw>=k=Z-q*AY(}-wjRP2RoEg~p<~RdWZO4vLnS;H95p(xX*Q>5 zEG#2U&Km*`1}4$HA@E9oZwUMwP~geV_{8rQZessYv>}Ba9-^7O>EVmtsU4i{lU5*{0|GJ@ITn$;eW9C!~bT)4+plpvq)Gc$z(Z~^FZlLfxC#IMO&@osvScQ-pZ6LvB?IX6wfVX>q&sGw2JU^Rj= z)bw<5jxCq)YbIACIwOo8Z4K?X69z6XeA0bX6Fl&A%s}3(tu-iryA5qtZ1W z4{)OKpoO7?FdQlBnUk1)aoW%?jueB7LBq`X`zEYicC=O*Xa zx)bQl6hj8e&rR{+nVrJkC`W#}IKvtQ1+)g|3n4p9P0xhQ%*|6lz%ZAeoagW0eh8Ur zb{cK-24^M-c`!ByguR@>LYr5anVQV=f;02^d2Is>nGaz9&C?vTdTvOqo%tEL+t>F*}C4FXo zj`RRf=78`9Cnx7QQrO`Rk(vcu9QoPF$?34^=|UmIWPUo&A(}1ZX`o=8;!pS=NEQBv z(&2wJX8b=QcKC}JnEh9vVc@?2mr#WnXhER_XA5GCX2G8!RTS$K<(R9%DoQGI@(A?@ z4i}OjSy-Sho_VODol&XuQ*o>1q;C=kP4yB3<$yoX7ckw;tF$9 zTncB!Fw(Ez4j2I&lZzl5MrC*UDL1A&4LfohF$oUlniWufUthk^``q>>uk%WDKJg#C>BFfK%J7H`aVa0+GkZTWukJ2=|(4 zM@8PdORThQ;axX{1=Fv~6;JQj8%r4+63BwK8Zue6I519PrAM(hyB%r`pWU}*!$bz@ zSCeiF`_ssvni3xMxl>er>!;+}Rg5;zpH5b`4hcio3HBPxc8KlvKzMQ+)pxFEz7mEajhNrUPkaANy z6nB1>jzxfA8=$tCE4Lc#*qh!R^&s!CMxdRxu`BNMq4*^nZj1n`BJUo{1VwEyGHMXx zx$kXe3=bqBmcq(X=1dmk))303y@B!3Lhrnaz3{QE9&_3GHAh)fYP^qGMgO-@1jch}a`@l=DeD~VG zzZ$(^l=4v-l`}zLq`66ZWAuEaz5Y|ght;SHVAvGV)4?uZw?tS-uX4Iz+H%{<-bFn~#(ZX|PU zthe0e_IKbH+cMogtIkBwIrncu@EWH67yrGS`W4x=x%tY424+x-G>5re^Kf`N40haf zYK_KK2eY*sv7jT;8Nc67BrGgy`EHAY_oIp7PHID}N)a*8(q#3$piChlB7z60Vvgq3 z2ps*z@nd_Bh#+f$M7PvmcWc$uXq!UzNkhoux0SLx+4GbMkS?GsP})HJD2O)&_QpsC z7`xS7mqbc?&FV&9#@kV1__~JC9NKTpN>D#NDo0!mohGQmPq5H7?@ z-~gt}5?r%fc7k2gSCAN0zlRw0c=e+L@hiK&&EP1Pb z{d$R89$O&;UnxGs8Tbk%)}){LEzZc{dwS5=o0p((cuNl~uOmI?w|HB4e}&R>8q7bM z6ZC$=;wRaI%}hU-6~lk_1q;h)41ar=MzQTwyX}ska^$Uqt@=+m>;Cw_to!*NvcO@m zF3W#!sLj}gd+{4#a3=?t*vOiBNq^kfx*S!U@&-PvjZLG4uAI?taf6pEULblY1t3Vw z`AXX&nO~$A?a?kQHz>+)gfIrxHtLo!j8asJ029xj%}P99{+vZDH1Yf`_+RK?7yj3x z9Ir!$S(uH03=NT&)~}cSWrQLM-w_Pe$eNQUZlck}tVZy2 zPq4GlI3bN(T@7&$JCZH(^($V%>Ez@Y|blQrHPfup}ze?^J4K!SORY^OU#f%GmSt#vi}ifMu=gjciM zb`X3$hACi7Z5EEfhmS|;{vQ+Z*6nRqq$xD&N2d_J2O#Uqcx|e$5yER*K_rCtS}tyGyC+)LIh{xAAV4h@5!Lg^%4<4Ntds8p}&1 zB#Wi5=x#6IYHe-@M^_q+4sCL4AD_B8xV?=PJG^#F8{`v5p3LAd@`3tI~>bh=EktG zz8$>H{J7+`T8-9H1rk;BTA(w5y4=|g?g+Dks#f;0RaC;4BMY_oB3yLExXmE>H-wy6-c~BtbrLxxqf1n$mQFE3U2YiRJWIr;b2KJ9tg``Kyi63WDudDyMw&} zb?a>!e)X!^_PXW9(#9IG)Die~8f|Y$ugSP%xwCZ5MQfD=r4L{Shdhv-eoMc2gJfm7*pn(c=t zCf3*2$D5nj1+9-aTB{Rf@7e@PwkNiOyQv1XNHvx^9`;!wINQMiydQg4ehOqc+*(@gWGk6V>GyZ z+2@W|Vr~A0l!7S7iLJlkrEzABPa~|@LD4IFI%>2J{obO) z%fa2zw!$wr1v#iJmYi(Gy804G_teepZ{0peYQk+n tBY-E`ln$W(lPl>K~fwgCi?zOFF9&-MXdm{~tAfpSu76 diff --git a/doc/LectureNotes/_build/.doctrees/environment.pickle b/doc/LectureNotes/_build/.doctrees/environment.pickle index 141148dec1ad44f47ad5194bf008cd9699181ff7..434f41d7159fc2edad571cff2755783743aecb56 100644 GIT binary patch literal 188475 zcmd?S37lm|RX?6(_I+Qn-porfJ(IrOvu2iLNM_B_Gm|hgAz&tHZ@+iD-+S{m-qJmt zFhGf^}1`Wy@vklu4y%jrP{?Iw>DX7)@xO_*6wvz9qE)R zh2zqrxAe9>+q={o=w9zM8okrqC53vv-E`eTsoCp3Jp5S8ZMKH1#j;y#xwYYQu9FAV ziQ!Y?r+dMuz`qJ=_N3PZDE@(CLg6aWdsvwfD*Tzc| zz3y^PJpbt(9cRLYj4K+`6Vx89(N=r9;u343t$N)h z#dfta+Ag|PJYCICN5|^*3;we;VTI9pqg|@knEc8XS|VQ@9dnwaZTBLYdhJ>9#A+8y zEsIDD4Gs0WD=JQ>M)f-Fw*T&$8d^+zq*QCW&2cA>k1xzuoK~xphoobrTET4=J7c4r zW~J9%S8TT%t%JkE)oCsnsyERfE6Sb5G+qztUDNB%ha_We?{ar>zFu+o{oG^1@Gd^CrNDM8gb*iN0&viF7oSIu{jS>aO z)NY|68l(AEi@wZ;H`El zZFG|SDDW9`oAkBkx*Mp$N8Oq;2Gu3bYAs5uTCbHz=Z6Z-dZSRE zs^MwdnHVi%)P^O7idu!zC58t@@v6E^cc@N z7hu4vB`7G_cCuTGMrqtE!Q{RLe>`>GerEUJrQ3TW*6Vs_dc{lh=qdHlUGk&X_qt2D zpLp)bQV(Mq$nfd%7?)DtC3U9GS1Gk%i&wY}_zD;!M#sT{7!+0r0~mR3hZR>2#O#=r%fDCsQcAvxP1G4s7IE{>{1r0xiHG2#*qkPLw8w#H0Cbva@K^ zbM#X@T9U69Tzjli&!b(IoJ1SIFjGlKG8=GiV80z0&W#CuZpdkr@RhTubP9C>CvrY} zNHjXkM^9|ld&M8^E;?4vcZ5GJ>J^_q4f~Ae3(wW_=ioZ?>jV67(FtJi5Nxl|1TyG_ z4)}j<@7Z4QXS$2piVu0qT0J@@ec;J?e4pKJHV ziXVXYF23|L-Bqo&(MB9=hElXWYq>J7v|!t+T;v))X8(>x|oS zs_+ufhUeUTu~vFHTpHmboP@b{n%3dUgbUxzW8^u7krnx((?Dm~DSZ*L`j2-dKi-}E zcu(@K#R~@Z%$Rh>>Qi0pubPU6?@Gjs; zwx=O*0iBMV2G)uGP#lox-~%gtgmy^J-R}BhuG#3?@S|5W4eIY0osY8iz;b1XqA=z_eRGMhNHk+P_+C42AVKx5wg4d}(lwSIZ=?Zxl&fA6j&lj_AKC=L*+ zYIn6La$k<-^Nn-J)l&aG5pN2}Eomd@1mi>jijbkD^b~Obw~0VaNMi|NBh68Wj1Y79 zbZH9>+J1Ql{Y!4?HPYizhuxR%^)El>hRwZBuHwZH*vc;U?UAr)*OeVu;YA|SOg4nN z%=Kt}%!I@&#O(y~EEjVkiU0`%SAL4RF2T4=6!>QNf%_MU==n9>dGuV^=p~{CPr}N- zi}%Do^zNFlL<$B6#omh|@+LkQlq?l5df_z;4n&m*GMB!LP(ruX3krE!2d*&7!<3;X zz30vNf^b~%zTmBu;!~JV*V?7=5=B`Tc4`-Dm~4lXnH>%`^~!%Mi?~R<-a#CepL@et zmu1USjJ>xlXk~snf$FaG)MLEq2J_M21?CQ+XY@#KuIiT+yTxx0q~MnJBYp9zUb|ru z>~)dreIi{JjY<&X2^E6lR z$?#p4Rg4)3;L#M8U74`4xrPW9Q(PQO`RK0_#IazJZ1n*;R00+#8Wfn&l_CrvwA&wd{4$Cd1-~O!w+zA^ayO~vo@fA>E@Q`5Z9*Fg6%^I^*$ zucTn!Fan@Nzt=r`#dO1PU`X{LbE;lIF{E|coR%*+#UMk1FTP@eeiSpLc`i=#obGZV zDb_IX7Hb|JI+8~r^bR8~7K1z=DNva8q6}+h?a@vH9*PV1Q255alg9C`7EBWsk%YhL zm+-4_7DX@;s|sTDCXdvw!K*mz8Xyu`DAA(8bAB;JRsG+)9BGrgw@<|DHHfUVi3Ym< z<=`zYBPAMTzc{2$>wVnYro1vtjV^@c6weLlFr)N!m^FkXXic&wmGgJVe)>_qpo@B4 zj)<#eOjnpSVv-kqf(Gz=D@7tbA1N&3#Tc?$08UJmR!3sPa3e8kT7I+w*NEaa^bt%z z!VU$$53y8O8hRhg4>zhsr4~H+3HKtcZ`>vo*K3t&c#mjRj|R;ufn0a9RH^A!F^qXN zsBpbh$Y!3`8?b29n6^3SKh&C>K=@v&8OFF*Q_wo_^)0xqQF%D-DP}LdmwtZ!HP`s_ z7z?J~X}E}E9lzKZKu8sKe4F*m5)1z|u}aabS^RJa3zHSNVFSZY3~j&bzNc<~=F-5n zS3Gh4$@Ax*9G)1oww^zK`<+|2-D3?8Tesh7Rb8jn5+TH?BBoImTt13Jdc>AoTCxQ7 zj>2gi!|cJDDq^Y6LA0?kZLzQxmI(8Nk6ReB9xqiY)|hKGusjVK6qu}GsKGBz+nREM znnV*=b}FJy&6;RBW1=?UD8h-J5LTn)qCZh6QWOb7{AO)yn?417E?A|S#R2;zL343K z9tET4Ky!fJK1zC4YYz(cnfphD`cREQ2!h6io>+&hai`L92Q5+&qQJFIl765N(QK5l zW^jrBl<*LMOd=A>N_S82w`kaVxE$i=n=TBISBrET=u(CRRDv|xYXn-T1<)4hrl3?B zw+4JhefU`gJl1On+U5G#2P6C9cpx1MgGzg zyPgccPt}yBr-$^P@;(U?dpF=JkqWVSTY?g&;&#TbvC;&}{Lnc1xoGGXuM<$u_Y|4Z zF|2U`DxTJ?GQ!u?Yb`jRSmSjn{GOml3`!pH4OVW0;Qxm;RSU1=%@{t36qz@xss?d5I>mUPL&eyg? zlufEdCL**pLoFCbcVNe$W$*O*njr1jY^f$}ZLbrI);zMaoKm=Kz6h6v-UsI#(SjnT z%cHc$CpjNo_FgzdfSd$>?CxGSWQ8O=AA)m~g85}Q_Iu+ymrKDZ-*;gayc{RYnVK~J z+#)8>UK$Gp8w=j72+c1$C|FAlM7~KlGqhkQ*6Scm&8^k_M6BXFgNpn`blf6_cFKRk z7sJ?sa4PnU(p(46Lq7_!7Y;1*i2a106_hX3%B`V%rQV@bgQh!#)*N;aZl)L-^4s{W z;ax-fhV~7MAY6N>+`13;2w{;!=iHathfkfgPn|kB`rx@!C+ki87B;R3y-+keq2Yo^ zw>J%>5Jecv4x|l8c%f|(%DC>lAJq2il~2$-^#S_FM`q=Oi#(N!Z3>c+e!zcO=sgnA zi&cI(#eaFNsQl{dINY$zFYC|*|8nqrjsKi_j+b>4&Yf=vN<)vi?KJU}A~3-$dZS-W z_~huFwH6w-jsV2w6OWxdX`McN>bQ09@l%H%I(h%$W5>=MKYR8?y?}-F;oDwt8VgHR zq#~U>eENaM4nKfbPoBKLQli|q@U@~_oFb(xzl56Tar`4xbO}fLMOu;x?*?xc(9F|T98%pk5u z!JTznAwG)`Wgbo8U~}Byx>}vXiEH^aQA86HMDY-j5N{!w5YUfexj^JH!MR2*4SWt- zi0r-eyCJ?XLu4uMpk-dHhQi76Yghrzl(s{Tx;hD^H!y(G)YA`bQE~CPBIE3- z00(J8BO^$xViH{DO^RjZK)_o-1Lg4Q!#KnH&tHhfospRu6i{H&3rBZ1hmV^sWdgKE zi>?EEOjBqdgy8Y-E1?6-o}JJT~rLo5HVn1tI_4 z>z=x;=ZN!@@l23Ju9I9HvC(F&IS5cIwbKMkYL+OR;NN;&?1*=C9=G)A#LTXSfBiY)g01&r3M zq9ovYs2B9ztu){f)C%63YES5JcX3cCoQ}1@pMG8V7pKeXu4lhvU07UjCnyC_8 zw`N1HgKC??YTg(9Wt#4_JHu)#!fGPlH}N|c#wfr;=`w*OutO57LK3J*Il_rVXgY|+ z;%NEC@LgW5^zGK=K#teiCvdwSQ2J*GGv8F~A z{Af*HJQqs3nrwHpR(COv79veWbQ>{o5|xsJreQgaPreljCsr$8j**$VOoWkOh*;$n zi}VCISMnnHGOtVw?dTn~IyOLrvyOFgal+K2c(FL`f2aHqjY|(pgHw3~e}wb0@=5#| zOry%D@K+GQEuW73^$7kdKT7|2Q;_nD>5ntg6G{&D4K*bQ2frg>IQSh&#KG@Rgc$(m zgJ0!*bT(OIzQI~edj=3=s8b3DC6UVcBgiiu^X81B7hL4mFW?DeIJB$@D`43lF$$z8Omj*BDaw`($gUHMI^?xtHTr>lfDR3ZgLV9-8cm9^qKyhs8cN6eR{ zV*W;$obBywkQiMf2zbduyzfCOT`h^B6!N#7Di-)5WuIcqODM>p7IO;DI~d+nv3>wgSs`oXV{ z1iyBd!Pbnqa8A6eyaA+o2C4fChD0gy%l&7Zl#fI=csjJZ!K><}-eaI0;@DOg@}fNj zzTKdG0s#{bhW%izwB>;^wi`5smb&Lgxm;{YK@u8v$Gn0SaX?0WD&+1(i3 zS_L1-+gTN&wa%+TiSvl}muS?9H2BJ31HdFNxCi8mPZwVweCj6YQ{%K4KjpS)%bA$F zNquLtpVVKeI}}Wt021(dD8?0lRD476+XBMD3;q-tI|0Z)M28Qg=pg@cIYTNIyy0Sv zTuVz=1hV&p_AMc!o3@@IctP8+PIni=Vd9L&6&xNI3LY$c)GG=S<^9c_#l@5h*jsEygg3Ty$7VGM$|09+dBg%787J%p;QF=O~B2?!vD@>M^#Td1>Z5 z@EFk{&Z7_B+l?U;ihz{;;L!o(Lx@FXkt82J--qX6%60hs?(o+=y*Hs5gLKVHkZP6J zDm;Zkbg?&boxdN)-+wm*9&1P;aiN{p`a2K8!V={l!1YC$zg;(=hTXU$*LT;&KEeyf zsJ}T@Pm#1c_ha2U?sFlx4jVY29rAjy-ods%Zl zFVR3;nm5(9>u@E9N^W~x&>%}q?^Er_`zyr$BMdO`RLMY$|h%v38gH z(SE>#gdj1Yz`is}%^US|^E%x{n6rjkUF6R2z~Mi9@FzFV|9`$B_c!tI_Ji;L`Jij< z?TKf1{{3hEzu?*3{A}x&f9n^5XZ!fsz%M=f_rbIM{A}CDUiQ7gvjhBW`?k;D7TN^y ziS64*j{7~E9}J$mC$KC0q`hfevK0L6;t%{=r1y)bcm4YIe~^p^Kl{y{-zS?Ve)zE$ z|5(7>9%Am{n|FP7;Cq5+JH@kGs>fCxFMk^IT+}%InZIg(@-NGO?Em#Q*WCR_*n5o} zHCoW9R$3vT~e1o{R_eSbHw1Q7NiRh2O z`q3YrS==W|ygv@mACk$%Uoyz}(>KgiFEp(9%cplYk&w-&RJNbW0@ID(J@LSL4}2&1zf;b1i>NLlH;FQiy{b2(YImO3 zR-$3bOYn$n$Pxq+DRHRbBBks2Gh4j16p{PA<)F32n+xyWGH7k_dj&mblR-~u$O@nA z-U2ff_8$u6^}3&YCRU5y^Nbz6icIXGz4WY#y*h2go#`Qsb;B3!@I%xWt0mf}E8GUu z3CUvb7HvR?(%pRtB!goM#EgRodv%3KwJ{iA@)j_d)6OTiNi{-Z!p49RPFJQf7)yxQ zDK8Zb_yQ2MRbKYO5q0?sN7NNB98p)ka7118!Vz`t3rE!TFC0-fy>LX`{K65Hy!#h~ zW7rZ?mluYpo$dlLLl@BqF{2Q3d0Mz?4N-nGW@Gb34L;q0<{OKf&Xkv}kH8t`NjUHf z>jt!(Jc;hmop%o2HqGePhQX!a%q4L+1E`drp{j{Bkh?%j(d}M&8g)8jILk>|v?dO& zFJX-k(EvUy3_RlZ`5bq{Z;PUd*hsnfysYX^(JwDs4MvNI;8 z1?7wQG@lSBIK{%wEARv&zKZz1Q=BJ<_=n|KC$LA-I#F-pFsg!e8Ye9w?enzTrUZ|u zuxVc^zZRb;e;59N?B&MJBux)yY014u9GvE7 zVZk4pHE7cXlI|YGR+D_GfgXDlX{2@J$gfNbNH9W94?D-xO#RDHy-6B58C1Kuyj~qw8i_@VvfJ4&2iK=u9=fYickbOgya)eS*c?QP_E@bXf@L_p2CDZ+t5P4dPScn%9Thk0 zk8!Jg^$J^!rfsw6-#sUh(ia|@G-y4DoK-A>O_2PDn@xl{#Xg`aa_X%|MdS}7sYt_$ z>FO0xVtJQgvzgggdR6GY?(0RCKfG$Lt^OEOd5D-1(E0M zOUF8uip#s~f|-77<~xbn-NhnBt;7dACQXnBkPs!#3&KIC1uufI+S{Z>DLM`|L^p~v ze7PRz=y?FNSc`EQSvyEaKq}>Ur-=kdYB7W(M1Gry z8z3-1gG~7?_{TFii$nJL<3FYSagS0$yD`Q03X0`-<3}O}<>&j9lt0j~;Ai_4h_)W$ z$VKJ%_&<0t6`TX6{dwKvd|Z4BCY(buBR zd52oY29;;N(T0x}af3goEn&*>tGnDYhMX|dlT6+9NyhHDHX}+?A2B5nc8mKANpvHA z4mT|$?`j0vJ&8hgGBUcio~zTM0;ZrAZlZ9l)14}#gn5?QUuUh&;y$h2bZIro%C(ta z+p#IEV`Gb=&#%&p=c&DTN}Dr9wc4g6;#eA}LlxiVCT8!X9N-?buEh5Zy2EO`#3zr?X+hXP6PpyJeTlL9H|=Ig zi`AVum$|o@dCY)h=53#O8MY+gzNF2e0^Ao&NrZOubBz65Pk-0Z^yh4Syp1DJ`}DWu zDvaI@3+HBy*F zG4b#*IuEB#+xXzX(JTf>g*B}Lj`X6#xGdD8O^1h@j^g?=?1mBnd2AUaap|H4OKk6mU_5hGhOesK1Zm;BIfp&O#Ho$7T5uU~ zYV$@Ee-6HU{5!YRrjsM z(7jn(ytL45%3&XCsV0CU{sdxzKe<084Fzx1=1D=VYf2(>)NU5uGERPlC8`MUL@rw! zI!^a%Mf%<>bs51AYKxi{!CTm8#$jQ^s{k^>YXrxH7}y82Ia6?apDBsVaa?fHnWodS zB7pf18JR!PW!s7MCK5zraV^~%|)Iooq`-iBcYsu zxfWMT%*8s6>in+BjY~Y?4jAwh!Dzl3WcsRU1506jQxchDwB=|K>7KE$fG~S>dS12k zG!9gVbfGjaFp76(hGH&7V_^AMXg@^jtDLKVaZwHZ@DJZ?%Na}ZY`rKp25cuP+w%2IlFL;sz?lq%_{oTVXgTM?FLS-H6@=nTjovDnuIyTuW9q6=*+K}lE@sbt;gxw zO1hYWXM<9+;5LkKRv-0{QoqHB{*$)&X%QXBxgP)C3{m3WuGj2f)-Suj36qq+*XB^c z_-{=~WRCHM!v%2%gE;t_k_~Ydi862OSBVi^wK%Kk%Ep`{xU=KjNu4rb#p2lW zHde+My-Hh@v>46Hl?phtI$SzPm|VO<`|Ao8)21Xc$6`mYRXo1thvkHGIFzd19Iw=; zM3iO(d#z((HT~Ba(I3`skhF;I%!!LCn1c$p}&FCmi51L||+#oKMn&MU81klsI#8CgHw(x18zEfluj0x`T zyx?9eEZJb5mv0q(m#8z*-_Yhy!S~lpNo0=i_7m9WYPWHRgR-h`#r?d99oBh~asFrR zMo5eET{*fD$CDz~t7r07m#Sd@lQxqI*ne+IB6F~}K3**4ix%D9Jt>@_AQ#BL^6??M z{_Vcl6f*5w4D;G0SxrE;=B9{$JLEse7_xEFJg%&?OSp*wr=^C&^)eOWRoV#(^3d||wl`I2y2q2lyS+T18OJ#I=O zbDS0)L#h`}$B*`=;3?zrE!ym-#bZ&f;C)}hV5N$|tF$>#FnEP2iOexrElx9_qi%5d zG+#3iv26+EjLVN|iq}&FA73GXi6e;gti^VIUx ziu7-4^Qa*G8>S>OM|$r`y23;FlHyRRRtIf`I3$jg6Tvr{RZyNRF2{2l$QtI<*(mCU zG*|=vMZ0OzYQWt&aXkskM%%1I**LIB5d@I~OtJ-O!Ll~2QMKWpwfR-F;h#)N#I?a- zO)^~8ekIL@}_KDrKbZ(|bbRuHnKC%Cu zv`=h6`>Tq|-62RAEn`m1^XgxX&BMdmvL~AdrNz6O za~vKK9CEsArGo8Z;4m2Z7bc~dKcLN$0>?2^I7~AI#B>q1+b-aC1l*K{EA1*)9yhr} zEqVWHj7CLU^z>+8JE0xp5FtNsD5H^tM@gG01&?u45}_^3Go*8!_P_eDHRj@?@g`lv z*sSBSr6^(vsx|Pem?t~nDS}bLwwdqH=0?Hj+e}HsF)|qP!cmiZt^tXV zi^JJy%J#$7%R8m~1st}8%T94oG9nKTM9HaHr#h8(3AtrTI)cuNtXsdT4Mker zx(m7`q_A;#tdN5I^-3T`kc383NJ^KWa=)z2q@r@aU`ir$u+i;l&tK-jKuU8SyB*pD2$KatS$Hi?w-DkXv9%B6H*hj+Ms8aUB-oQ(pTB z3{SaDES~<=tKWt*RO$FpWk3B)uWb!qVpMl(i=Vb1Zp{^Z{%slGs^H&l(TNCxdkNx% ztgj($1{H|!G9{5Y#H(qMrCP7oT9$YCK(tdPlrwBE(H1E!Y-_}_ir~rid6E!H$N)R5 z&5MH2qoyP>N61D>d=WQL;z(D_RJ>gsyyS_qfW?Jt;Xw$oloic)8QEvFn<6c;LzF-t z$YRT~P*jR#3D(jgZcReo*hOtV71TSXB;u$WxWS<(%^?W`5+N5`Ohau+y(5g`M87{Z&QN-YZBLgq=*|9IM2sb|RAPSaj(| z)UK<=-1&cBThx>d++EG5+qI~tV?lyA3at8~q-e&cv{_MF{kKg?ggxuy4BT8tGgdv| z){u}_>2uP)TFmhLr?x=p;hA8L>~a6>e+iz1S>;!>SyABmvMGtw@E8YeZwzupx%UiO z*ru0wocfG48MRxM&&|X|v06CZE64!lK80vOz@~&>!kqI)ZKf3bHVG0}(Wosy7I%_ZitSb?lD_sM$Xk1HZ5|uVy}Y7t<+oiC?LVD+;5W3X&KXIO@VUMltdg#1Ftc3 zJh}fGkO;Y$Wq35Uzv~YpB}P8|PF$!J^> z;@c*^X(l1@9pEel4i=5fOS0g9q|Kj#?59mh#E~^Hzo7+ZlVCt1vK`AO#A*5*)wZM!LnuzPN0C$`xY4uVUW|6r{?!=4r?mx4i{NIQ zYU*()2I~oMXfub>oNIp4y&_ZEOew&%O-W=9+@Z5#!@Pg_CS52&w^L%XXMwI{6_+{E zai>Tlq@!(Sbil8W7OTKJw3{le3cM)S60+KS9R(ju+^%CH?qJJXjrX*QGjCbe8GQEn zBMH;2w`+5*=*inmNyPQUz%2_sJ09^3NQ7Ku<=NeQyw=9v9lmuG-njM9vE8AY5H&Wl z)Ma)1q;`v^RkvGmNM0abMPdhd#Z6&bEYK1{`(KCJ9F*&;aYXk8h*mZpa|`74v1*TXb+yfI%BkqN&y?r#3DAU<-EqA}m4`rv>3OY?@CG;(fO*#>s~};zfkalkUDQ ze=JB<`bllIN$y6}WQnOtpGrzq`d`{#Rl3ZN3le<|)ZE|7a_ixm^~fY`wsogyEg}wD z)E}9(He0dZ(Qb&8&EF+=#IAe%(&&M0WJ1YsZ*k1MT%6=w{+2dp3PitYN+RsZzriTa zwR5@fh%uA~1NgTeu6TanL$iq^)N)UPM1h7jyYnw@0Sr(M~fL1R2>u5L6Owr zj_5I8YCG=WcVBZ_{E3ldk) zR@k&s((!8H&$BRLUyw^0YjGU7#PK#J$Kqg(ht~_j6y=r#V=?xrRdSm3KD&d!rae; z4n2g^4Y0Ed$4i|kiByw8Ih~eP0MEX>gRWMv-DVRPm>#7&r%!ZhIFhPfi{f^Lv>4gH z)NaJI$R5g-d|B;rmQ~Khr3Jv2ENb*dstEQ;R^-pL8CTH%V^b2L75PI}pt+u64JD{a zG%ZK0>>MsQqVGoaLic4>gaxa!ni&iwC_*$(M+9n}f+I{p6#0Z*Dc5Ursvv)jDT&OH z9|Weje+>4)w~GfYALc>060K6+3bO8^xa+;jsNbdC5NW$V4!7_mv3*HwA7c0skRxf0 zcJWAJYRG^#n+oK2n39M?ZZO`5E&~rZ1|&i*W|<$Dt|5#B=T!P|9b|R${MEB6e74@gA$fv)WCNRu#4- zsDgJ`fml&Y%1K4Fti`n7CJ4oTXGjCgdImz zS}+|NY2Uodm?qqp@=Z9^iYaJ1gUZ5Mp@(6|?N zimerxkzm{Lkam+L+YSY&?%rG}luWEgG!nNDc4s~~*TltkFI z?`I{M>mbt_8Ec$Cg=>!^{i~Z)fnls^3zZhewODHial&~6#8nUnUXrxXe?glW1*D=W ziPRt&FWYTASD$j41#zUF1sg~iO5#L2`S_%6-&%~&gFUw&#<*w0d$9nbtu& z2WzPYS16JZcz_ z2)W3}A6w7iFFFF0Y!U_=b)4^0hjneo+KgsF-3>X8hk-Y{&lsPOwPS1Zqv*_bQxch@ zb@TzZj%45_*5fdx!sQ=Lmv0sl(Kw~W_;O<}uPnEiWRcvQ6x8zMwkJt$$_JF>maI)eV#gV6?iIax#FRwl zdb5uDHsyK9x2Z>ckK`(h?9?lyRO-ZDN%6#s1 z#K9F4@FK{4kT%^$;o8`*79;i!ZTZq7wh5W=`3p3B5pU7h388zhb-A2DI6{eU(rijv%IN+J%A0m7k@@CuLtiI9ui zOefaF1(yC+UEQU>m8abf9gCiLziRpKgGIebZG4iojl@e_)cZoxqFzh;tBPVZ1c|HY z9Nl!n#ZZT6G_4e%UHdn0cjl_x&EKls1SuQ7dvk7F;oT}=?Lpmiv|gL6S8%kOxUJIbBB%KZ;;270b5(}$=d=Y)4CB7mVC2?fx_N~RJ&09Y=-m@}XbvOCW5%EVGYy4cYIcyX&i2bQxo%U1BorQ*oscSN(|XH?FLHQ(KhC)bOWj2&X&28 z5KD-B-l@%yf>=(FxQfolot!#iPrCUwHmu%F-1Cm4ka-!lB;VvgZ4MRSj+>GQ&EpZqey)9!b%%q7u=?bLC0Ake z8rp)TMQ?pB)UTwRu4ULwlo0Q!YBQvORW>CN2g_jM7tS5IuN#mExtPVBHMY*Qd})O? z(2`8FHE`&(bsU# z`C%saies{n20;rPRXQ9?j8-i^E3#9=9>it~({yp|`Nb0KB&H_G*-lqRijn;_?G{Xn z?7g{h90-Q1wQ)sA9VrpDY22|5uR&Z6YX^ez{qDY?YO>U_k;HREe?^;b1^HhzB@uSx zpED&98WYyPuSsKa?3mjuP5K$jwCF`APBw5bsL)BujS@E(II_hFy)ImSTW~8;2V`zY zvg-b;cH^g2-Qzi2Z7(DjOMGIvPm)|@g^7C)9KI_)?r+*Gx#YbhEC>FJHv5VO|Fa;` z*LKZ)8v89mBLM#-W^A;YPAjxHjR>h;%}ynj%QstPMsdT2tmbdGGK$Qt@GQl8EpclL zZe@Iuyvw!PtSJbsG9?k(nB{`RoR33$k02jSoSap{@r(5d9I)p$2d(i^6Pt~dzV714 z2sL%akOl*Pk9O0f?Y?_+W1ehwsg1#hWy5J05DmMEv34(a=0LQFIwbh7`?VQX)M2kF ziOkjE))OV9cE*6OO;|zeMDpHet<4aBv$nWtA+~bk#BU5u+#nS28$mN+x${YF-V`*y z$&^IqXl|3Pgd!7tBtCWrN$SzzS>ruM__f+ikQU+XIq6a;GTchX4P}U6osbdvE!tcv zSij1YL>y}aPcL*9dB8Uy5puyZPXiJm7rfABKqBO#Y8v1qF0gjG+Gy?6^pK8?SS4!H z0t5VvH93G`da$nN43AD==QIh zk_hqqRZ|iko@jkyeYt~4bPcDiMP z#GKCzR{N@ty;^OgkH^!L63Q8m1KJ{`RPXMZT*d2-*q!C^q=0g__U9E)cAJvO928va z;Wpvi;%>~gH}@uoXrfu~)Cv)M)1A30L-nM#plPAH8Fzq4oQiq3#HoVXH)(UCp!T>a ziPWeW4>Tgcp2v>DmTMJp?6b7uh$|>)-L znC80-**moxDJ^6}xmG9(`Wv6zAv&Hc3uQ0}Srq)2Rilti2aQ%k1KxyGxjkRy#V%h;m3L?Lz{dEPAUoj;SN5o*B7fuzqUmK7JxtPVv zF*eQX&(Ls+BY&-Pl#gAn)F(=DSEo-MR*|o0w{Th&*?@d8=FJwF**t5U&&V6;ajlyiG;+?18Ozb5D1nJV$5wDmge&ns=c+LT1t z8&(JsbMEtRe5~b;cd*5av8j~CnmC>)-W~eZVu0?^7B6jw*p%xC{`|XbL;e()_G>et zz_iztL>wjqyBC^H?wAH7LM}Yh`F;c-x(nO&JdWaXdvED&d$xC}H&A{CQH0`_@+*24qi?NQnIQ_M_jne>e{@(@q)9o(9UcO4F;EtCn{C2s8hA(&MpDFy~b{AEhiv=VY z7JCo>5B}>e%+n#w*udRgb$ARDL0*0ozG|<#r0Gog<>gCwzdLWDQXlJG?k*^n3I(^; zd#=0O`=s~aa(7X!Qys%}rO+EeM5SG7gOz%%GTnQQwIXb`?t&IRly@P=JZ!hdPgZ)b zjmPo9EZcQS;Nx*yE&vY*fcI(0w@@3tb(S_fa>n)V1q+;E|CS6_9BM&J|6*_yo0Y_Z z?@5S`UG;}66D~|dtku6)yVXzq-StV$UVaS;@LK$Hy8JrvuZVSCrM6y#73~IMygONk zy}x!v{@NY+Yft2_z4$9hy`Lwcev;b*8QScmmIBhaKtvPn)hkgf24-}+$;^d=~xL{#am)84TZ(eU?kuhG@{n|OW#;+ zctEt_V&7`)=+lJrH=_v`;-8uN`}$)z?>$(22yViRw%>9P$-ZkFxE_-CBGwKJNQBkm%d`bDx~YdftiV)9glbS%=a@uj06HQ~CX46_k!Hk6ir(3C{j z(T+1%a~*lJAHs=C%{H#b#-b|i_7KCWw_gP}7;@)mU=>5XK3nr$2DPQ#6lp=lT{^xj z{^4%m-`~CB%Yyj0CyRu7LLym1n@n#kvQaPOF7;!mZ;KtV-1ql5mr&FiwA^ zEm>Ne*5@WX&TLoWOu{N*pXHxxv!h`3CxS#@$D*%WXPWx8?c`(8!vlGrPN_!QbX;=n zu=^q55O0n57^-#&9ITGwm+Fxl){Z6*}} zziO%jVQ2doDNXh$4{AuxN9UHI~rU`F(?wgx6!G?F{wxEHr5+Wvs{w-jwZCP?U;E8_uU z<>Rh)wml_nK~pwrcU5jm@MHUM`^Qy>Hf3D<<4P;%XKv-WpKY$A zRPcjxeB-U8?;4E+urL%d)vGB+K%ANX3iAVe!VsaN~6EV zltgH}o@LzTdg6IAqjR^9&h8!dS*#+tw9;ekj>0rcUB>HqZBf(Wb&H4B-9BF6wdM0_ z?^b)uPiV8E0QY02Br*qX0|U3u3gNoj-nk=+SiedP)$eKxmlmpx9#s1zfCP6+=lUIO z9u$mz%alas7;R*X_DdM;+->iSS--xu7^SahiHYVSTE!NmM2Fm2RkLV;fY1Jv(HW_Sx1WIMas)tDRA}X06Szy+~W!w7u(AhHZ~LNbTBZBeR6qwRfuH)jit0 zDCq4sC6PILYZ<+r0bYCT{ZYgcYcNV<+G3?eX`P4C&HxzVOX*mn+6*YroHr$rIW+4T znq2`jJ9pYU_eR0#Q-|SsowjIc;o0E9vnzmyc~b!TR&5p(fL?7%;%Wi3I|OLIy=zw@ zK=C>Z(2r}2rVG&S5Fo*u0??0Yv!DROWJ~^g~tm*?AeQR{g^YG zI8)I1f;I;VI-fHokvTfv;Bt3}&VGAmvVDu!VSF~+l$G=C4?uT^_z2zH zqg}h~U3W(ZArB*^5@Ym~ws5)_?GG_x?i7rk(B?tG=%uD4GRMf9lpc^UI$+b9DUV4p zlQ(N^M(ta)#Z8NvKZQLYp>}|lM+Lj~E_IlCl{PO5dap1g5l7EptuS0})`@IOP1%W_`>VD^(~z`W)Rg$=Nr-4h(EZ zjvPu7v32Dg!9wUqv{fp(hfrI@7D7c5M|odTYUqcxzpC_w4+#=|mqh1&v2OFRdKG8> zarP}ve)F1N+1)lnJvK_8)fPTwlXq{(6_`hn_Y~zZNU6CtDI?>rwRuti`3qALp;`D- z#&oV1@>ZX#Bl!u*0%D_Ap@iL6k>%`!az<+D&2!^BE1jde8W*n%o)J70@Zd?5}8AFC8`arEN+gb5*$k&a0L0;I0AW zBu~0@GPv*8MhAeIDl)+D&=xW+z&G+~Mgf;}@NdAS)Xx*H7I?chQwn%*GbNEZcxxWT zIqq(=4Ih|Nm>)fMA~tF#Rba3_tSwYpu-4+_FrO>RN^TU!rR%Y-9Z5Jt{X^Q!C?Nfk zDT&NM+8OSj!dQ$ARAb_ry6~n5+&oydM)QiZpmsIv?1L75#dd;sf*R^1535} zQP5gsN+NT#HXXm%z-1@!hY-SvG)e@p{?!<>-P!`C?R=YaZpdNZPPRmaZHG2X3T(D1 ziOgYJ1K4nm1|Rn~=~R?knUg9oR4>&QDlJrN2`Zl}%wGjpQr}vtg7la+GYUv&Oi5%8 z(mtJeN!7)6xg;cwsW9A^w3{a_-1~IqAtYXcN-R@V;%RM$6_uDWC6T#GJfx!%{*kLy zoMv3}0~{hOgeXANYnns4tTyk|Zo;%`^PrB}_-D9!O(5bPK?_KxWx1+H@6eV&(WAGU zlE_?-wqPpcPYJDKlAmpz=+wmFHL7Wo`am3*!vLwVADjMt8=P(l5$ zHggK7A2KEJ^$hCgw1rL!>bzX3uv4DztW;6^2koybsD0LyMCPdNrjSy*h(ijkai>Z# zMcuw>M1ec&>RYp#EA0_MC?S{4a>-$+6uozqss}5yxmEOFsVRxf_28b_Vdq`=HAD+$ zoNQeYCDx0(wVNqzf4?V%5f{TWiy2WA*-Wff)nm6d(~5fRFeUNAQjaIJn<=e&&~UIz z#(9m3^GmhAuHgKbDT&N+zAvpAkX9l3$6cVxYd2R~yzfhE4nlGJnuN8gs$9}$ zTv3&$O-W>~D)*;Rl{yxGn^tg;*9?vH71Clo`IvT7rPY%|Y4il5+P*RFPh-{dEQD6{aLIM|%A!*X64QkRj)X zOmB-ujr-K$zI#Ahw6uM9U9Jk=#3V6fO~z`Iiq+lP+$dP>HYJfcR$G&>qHA0EfIG6$ z6SzY!7V}U27UTJpw)koB+?s@^jdVq3pNucFF9qy3s}Mh-&7cDDOHD~+4)KzsK_`s% zLAii|`c`cr(gL+Km)zfOP{DY$HWLaMmrO}y4#u{m{x)b~<)q$hx=0Pg^;+&Et+_?9 z(s+-d{4wn&NDJjaVxN;GussQ+PIse<^N(nAsNnogQxciuJb-h8aV{fWmPnZiO}giy z%{yvnq9k>ONU}@%*BIqbXg5Gwl(*5j!YqL;Nf0E3OA<&h-=xC)F>MwVm_K4l;u{6# zFKIVGTA0aM-6K0dH>(JKLHp|pf}b-bkvW3*r0uAKmXmLH(4TRka7Sc6#Z2@SQR42r z@wTicCHJK6&Nho_OJYhL{1#O`)@d`XsK;tk5}B*Vf%NKu+s>@|Sj%lr^4_V4VZQ=8 ztQz-fH&I#>a3H;EKtx*>QBsUsRmC`<&9b5xcbk&PTrm!%R}32P#r1G5@A*?wsIHI} zD~O}rRB09DPMg}>$ICIt)kqQUQzt)Iw3B_V}!Vps@$fk%C~AWuBghZO-W>~DhH3@Ue8*I zZtJ8SMn}ErApIHS)rsAwIQXDeaGC|27&2K(xZdJQ2(g0vgmxpPRgimfbbBdFNjsMO zNiU=f^YFwJ1GjeyDRIzR(5<@ga(5-%j>_@s6trBx1^itLp~i=2w` zC$zt=p!_jY5-%i_|4qA*bWpxqM)`IX_D z)c(4H@;XxznWH>nKAaEEJXx4i$~@rTr`?Qcd;7>04EQrmB<@tz>0WIi6m>daN+NT0 zx)P@@5{I}FLaZzW?M6zgEMzqH%SL0Xin62qbp_?8Oi5&p^8Tas0uuV`SRSZ0Iygy& zA_w8>oxdgv&p1{RohO=;VT3PhH&9xH4`3Cr;M(mvJbxi!Y$e`bwxzp5DU^`B$S|O) z#p|?LR@CBKO-W>~7Awx6J?d2p!310y5Q{p;3mL-awS`Fw;mTZ7aAVgzZlr11HWiqk z&}Kvd=EqD)WDd-(C@_Q8nA^r}Y*x*wx(BUB%k32E7B`pWH&?_On-E}te^0wn(gM6Q z2C&US*(8+BGTHrAV7saUpVVemQGrjGlE_>IZuC@u;k72*n%i{R^`>>^^aD|=JY!7; z^*^-5ObhBwQBduGPrF&0kcZs6RQ&!;n=1vsFPW0a9KRhi;3vXuw02*|v4vK>)5e$_ zv%dPTGtxKbvYL6tx^EO|J}uLe$o3_YEcl=b{|(x#D)4VKC6PJ&+h>Engrp5tfoN~m zd66MMqTL8-JNI2Pb#4JUq_90HB(QB2?EAEtRKUL1ltkuW-!%i+gBI_0aW6X6hH@sS z)|(9XgmyE`4cxqkB@jb`dq{=5pv|NLw_{4;8w>8Pb~B`fn`Xraiu&9|-={5dTFh>n(IPjU+721e9V(#DYqO>R`V*!kzJ3Ay z18tGh0y-a^5cjG|)^w)|+V5$9UIFcsrX;?8LHjRlk+ndJ91yZg1?@kyKd*rHZ>A)^ zenGQt&uac6dRk-~|85nuo3%f$fOdl^iOfN}bJp<=@!>*jM^4(8c;q{-EqvNOcjv4l zAA-7IUb3WnRD6$U^QYi@pDBsV@g2r)YD~ubvxLvO6&zfMZ66-&9Obnh@FPjFh=caq zjCfhQInpA&gSNwZ@=#7s%abP>Bn;yakt2%ts@P9xbE;rpFeUMgiTxY3nm#O*qb>2|SRiv|QW-eZgW8SN%W3*z=%OUQuSNl6B>%?S3lY$1c~ z$smox`&Fd>K$}Me>EAOYkvY=ZBWYymPWx>}{j1u|krs7fizE4y2UI}+OZ)Q*p#Nb? zB6C1D9q!-`BPnru+&hpo+Ee>iV~BEhWHqm5-cu>3H()QTn$cEuf-*W!D zSg;Y2_w}G{mfSAEmPe*i_o%9KT$_DGb&i;l$XsyY0dH6s5R9b43!{DP%OcwVE4t>?n9C>NAXQ z))qM}j9YTW`V=LtfoGAHhJEpZ=WtRh+wVgvqHomZO+mD4N+NSamp@*dw#F*;`~}=R z8S8qnGDhly+M=XIYB@UGwC(dEgYqI3ln-dLp@8x}Qxac$p!|upC}}|vj%j4e$9*ao zpV9uj0>&ShlE@s4qkdj*I3Z)>hvPx=;yyUu^hfEwF%Qx59ipgJoD+)N8?U`HD|h!; zknJnU&3V0{+%zqvRNt7~iJtNOs@{Cn6!cHczvdclfd4Wjk-6Tie!S?ktx~I>bxkN| zk?zb4)77xBPTMZE60PiE6`-6pD@w<lkWFz)gZDG>Fv6608l(~_j zpvP2T-mJ}t0?ZptNn{Sp&|yB+DB2>{RH2`zx4(?}oY@{{5>zKtsQyHo9R;e-n3BjGs^tMp4a~5k7{$sMoOxTba_Lv( z0$>C$5-Jap>N) zJGI$Sz{;7D$gm3ylwURPnrpf%V`xQtky6SCofh&ifq81q6+e=zy5-m5W0!gZ<>&D8 z$zJ&l{G-c1zJq_fN&H9)=GthNQ_`m%QlT6%#UY#&KWIuKdnlJa?Bp+8sFlXuK`RPl zq=a#~m@pTkG~KG1Xu@u9nX9|*9Leoz~vWaB|Hc9%G{e6il7?Yh0<7OxRL z7JTai+TT*l{QCrnzKuCh?$?^8jk)0=%Eam9XjxE0o+0{ytWK!L0Fg@M+pfwM9z{ z^oHD&&zqeWyx9ffO+stFiq^}t`BBh%i7AQ9(K`G{qm7F$o)&SuL6HdVUw{F(t4$`t zsZCp_L{P@HPP$IBMzJNQGEv9Q>2@)8HO3s!V=Z`AyUEgO!Qot8l9|&Wkq!fkW|PQd z10XUI6etem+7(Y^TM}7Pm<6iByi%KWMPZ&XC6T$pY(0Z}ATUoQC7_FzPWr=sI1RD# zPAj(ln))pU|6SVRrv-l?*9`c_xqHn-i!S(=FkYx){6pFtDj5HODT&N6-a!7G`*QDc zH40m_>XpeDr2Q%}f*;owE-iu^g+~`~N5Kc?P6BL^3fM=r8BzfIbyE_V1Ge=n@Sz^b z+oDgqQ*B)2at2do|Bm;hw4ys^dJDI?`w2f{8vjLY;nM&#Nv05=8JOH{1aX!EFGz0#CK=2$O}7~iPh94li}dr(`Hv^{f0)YQs;@=_I* zecF5|sO&K%kvS^2dZ$rLxOJE#+$W6rF_uyrO*bizde+*E+^Dv=X_2%1lP3axF?)^h zD~*=RR4mVHbEaVVGE)+nW0^aCvF+9<4}@HsDlWXkyvM<9Z`k}g=`>4pYiP9JrFw%g zeT}x*X)(PWVG56La(akwOkSKC?5N9^JQCj$uFF+ipVj70!S$7f@g&a&%3l)QQ-L@QxciOv*{G|G`KD^ z!_>bT!}Z(R0;Yv)b58Ur@;PUKZKVp^$F*5fVEd>kiOgYJO#Voz;5wCPcaoknFkjXd zAuTXVgdf5@NF8XEio_SSc~Fq}yeWyyk=RB^;JgEhzD(j&!d8pIb8S2n={YcX$%aqk zJw|fVUD?e6z%Ej`BpLjD$G!|nrgF84^m=U`6{OdglE@tCRY&W!N%vy7Bopm=YBA$> zNL!$^J#aO4kP}DYl8EeRtWn`PsLhH3&puNUnZvU(22T_nrIf)L(-tQ!IIH5|$k?n^ zu^H9oM8W2~DT&Onxdqr1#O=+njy0rN&D4=*tIWu~UR&6-$lXfFdE8Psgt<-bWb0HQ zU!%>K0_3x%Br*pw@B?RtuzxiM?>*WArUfr_7iWTPy$ajAwOLYNdzUGR%wb!176B5A z&%Ly8ATj2o)mUmyautT_Q`&;1g=;;+%(ytsJCQTsO!6l;s8Id3HaiMbA2%hDIaF&; zG)o0%+B)ktkfVhg4Xs^!qeEF@4F>8f+G3>zYF%zz@C7%~6XcoW88hje^q` zO-W>q)8@0-#8GgX1jwMX>+8YHfl=Z>jkwpXbYGYHA>3HttsJJ^^Gb*uh;&%g3xPB zNo0=D>Jz0Jl0)5#SQ`_&5@Oz8LOJ)O_iBrj7Lzr(apK9Ad6E#iNk!;A+Po+Tz1x&T z<_M`K&C7p{I)DAEFc;GKX#R(R!`inQ(9& zy&o%09Ij$}8?5rGk8n$qM zOgL=as$z7b_SY4RHkp$6`oZX^wuota7h!}eVM2^76{GvLzph|($dts_4@O085p^(% z1S@V+F>Ll_*0A2*QxHHP(qb_1k^b(=_D3?=aM-ADrL zK5VsubPw6a4yZ5}wOLePc1=lS4)Yp<`9TU8BM~2`3N}j@qx~|e0z>yEZK2Xaw^l$` zWUjCwSa2ov#ce7`->%J!0@52yNn{Sv3U3n(k|z+|i|zc57cw|Mr7cWaa8~+TTzqaM zV79BkykDCU1(^4mlE@sGaL_u&`wXn(GmmZYY7EvNX$zPZESifQknP)DDng&u{n(?C1xfU)vxH-XIuhaYR< zxVzzMv5Z`Bw>In_S~~2VG~pjKFgt97I5krTqmP6Lx5z?7ZvT_Wm%5h$sX+=3+W=bM+<+$rH9Q`z*ssm@hwFYtI zShd8PrekXWT5mG^uhDLXwD8}Ro*BvT;@6zTF<`2KoZWbwFaK5Z9Mp|%|TJh zBZ^8wIb*YFhwg+bEjDXJ^vdUn^70!pLc3Lj)@$>kAhgDmMCJ&s^@3OaoLjv{DzOHm zbVysQv?#6f!&n|)-gQLb%y5s2(?M-+6rA>%lE@sVRgV|lnpLPEw13o3c;cgYb*JyL4;Px~_B9+}-84%1z>=OpQ-hTwEVsaq;hH9A;y_ zHXB|a|7t+uIztlb6&L@*nDx8V&G@>P&5svxQ&6d;oWvb-k7lUHtu>@AYRW#+-3&ho zxBirHU~BB??4AT*a5qK>;9c4*DF6-#5`B%*+;^3&hpiJ$972q}w6M*A3q%JB(vkAW zb#^M#xPC7>o~C|_v3gXyVbWqXkaO(ukpI9nqJssAe`Gp){L9cK^}bWuJSyNlY)WD) zUgVZ~K#-X8n`PGfz0R>F=!%SLz2H`2J+4n3=BuMET3Q6x2ffX)i8q`F3Em<-Z6u+u zHMJR1;HsOFh{F{+F|&^x%tewz#9d#XRyky6?v1v$=zoV7bHFue9^@AKeBau2Ye-F1m>|7`#8# zmNzXn>vHvgFLBEQU-Kfhe$r6(N80=-w(--ZBtm2K`=%tm2QPBNvKHtly(dV>#oU`j z&ilAcnamAZ;sP}b7h_i8O~pK>6!lr=6}z&UjNC@IT*7?IJzTJC2P{iYQgGc<*sqsr zv!>|PB0=J+__yBBHIEiFqTVY%;^yAL42hhxdB}_{#xl+poX71sPvIa8?_PJ2YvwH;Dm?5}=&z1JB$P6Y#t`(%qt&t>s+dQe)^#5u)i9DA3P z_#IlNc}bSZHf$VeWY}&>BD4ux8S{Q~Thr?s_ns)V#dSi+{66koIzubbIQ0rg9Z;O| z8083Br#pGdU&IW!jr_l;Y8ujDurFvgO(Hq57N|H>L#!^UY@ZP%ulW`Sh0 zYb+b(n3HU>JxTK7i`pD37R5Cs5!VNuPU3M9j#O;d3`m4r%ra7$YUSYBM#a-ha%_&# zq#jq=oohNJz5osBis!^x^K^rpY|*-Uud)ulT^o+HI%wxwz9fMwgv%goTzDoV5u2Kk zSljmQ!V67Na2H-Ul)X)xO-1p(%alaskl#u}-Vtoe!MU-;I$xzkj$?A3#jLd%*bixo zn-*A0tnZHrezC)k)76OIFdrktGPtHL#PXN4Ia9Fwc~cUZW4Yl$2|({&Lj*{o9kpL2 zM((rP!lgxSLoNbW8%LsxYy`>d2UpI8c>T3DKMG!dVM-!3Ud93Ld(OC6co288pcmFU z;yhA#0R_5f)fFe*BVg$k>eWH3K8Yh3nshzmgf&@mr=qA{5haFx>F%s16Zc?)F3Tw{ zo@6=6Bk<&;Up+Z(NlaUaDd|UW!(FH!i?o?m^kcpt(RZ3L=i!4x!Ga2^hx~96j>QXQ^-VQ4feKNBDS;T3 zB~fMQlV%9pwHa5y-)c%CG!D0$k_bIQR>3SiLSqxP`1nP)nJ=~6Sd2n?&RX=8b~B{a zq9wQk%I85+iQqoO&>B3U&4Z#4FBK&ET7$V?RNLV<@IjnO&2z#|LtM#)!Q6Uux?O~4 z=GG=l*y5HDE7E_R;d-@pQ>BG#M*tTNv*w9lry=g@fNXHi>9MM1S3t(y2WW?TCmG)ks*{d#5(jifX*WltkvLaZ9Kgr|ZqCQ<-Va zVYbQ)^2fA=O$+iZA;`6m*7h$Cq*5{H91k01slLM}MG zV?ZM0g7c^hNQ7McnMmt#%CAFa*rnb;IqiaVnYieTl|Oww0@K>7a>ky@4ZQ7=?Bz+P z)vEW+oqIhJtGG9;+7q4fTox%;AEC4xlX#+`dFWiJBIMHi9UQXc1ABV|sy2A1O1k2JBj-)T-;*u#$0 zptA^RW6OVZvSLVs8*Ny-(NaRyy*mf70@-3$#?sWZ?#V_c2_RzF@?@z}XM}LRSerEk&eNtOGKX{h5vPUAov9o6M@^l5$+0Mg zed;i9)7qk?1#Ux*SDlGB>WdUMY)uw=5?X;T5u!Dz&5wds%alasXsteqm@bY0!x|x4 z!%~n+C})(uUt6TKD6PSERq!O%_7V^Z(gQ+-zE_(U1)=XYC6PHoTTek-d9Vy_D+Nq^ z7BEiV!x&0NGB!M>ev8rkHEr?JqB$T9h%KqpiSS%W=3nZC!Ma(9@vmres9^kyrX(`Q zc<+f$6CgL~y0?bgY?sg_2hce6Chml4i{44ocupxsSp{p~&23SeYDk0e|9kDGNsIrU z+&If-hqBp$XrhzT^xYTD7NW@(IaqfKb>VNdxm9%GuS`i~t_wGua^1Et#z*Uu&j0Q0 zTA<^qt}B+T8EK@^&z24NZ`rbpYzrIwfkJHA4hCck6B8(j$z*<#<}ts_$4ChfoHk}u zKQMtIg^-32x=7pAv|c17kcL$^4lL3@LLpg@KuB>yOM!e=KZ_=dhVFgNd-L9CWLGn> z&{}$TpEviNcg{Wco_pW@X0V%IILa9t75n*}DxzA|zj21XNX!M@2}mgwXt*S0X@5Vb zEn6CdbByP!TBr)+d23}cq7N^2gYieaN|bl zS*hdjnV~HnTY5Hy@EwwgQF>R?$7e6WbqqXSwSW}{K2R%*88>k6PVP+1(Fl4=-M`LN z6if3NCz*KqkExL#s5$|rYvkT;*_oKGm0or7MrNf+i)B`BuC($Os+O?A%J*@Q|ikg*3;u-hC5-QUl0peUHyXPCHyq-(|qw{)k!wpe6hV$<4U&R zBpf-+&uZ#ok*CzeL7B;F={%{w(CrsmDs#;7s%5XpF~@3UG2=OAP024@v3uXr;Y=!l zyER?V8A*}9E%?EE*oer7PG?Suhq(8#!cS8JvbiCp19>+cJZb%QCK`_?Px0Klmjv5T6ucabe~nT zw{M!MFQm2TYlJqe6R3(*{#rM11JpRjlw8YU+$FuW((L}K#jG&9uT~b5&F+i>{{I79 zmK1+c8bZ*arW#l{Qh00qa;Fp+NPOwN9Z2l_Ks3uEDA>Z;6UF?SNO?=f_RV$jwKb*5$6M-&&Ekb_$F4Z~(DlA7uE zs+F6rndW28uu8W!m2?_ht|obdvq;D>*x{-LsxVlgRu$FePZrYwo<ljr^m+__;f$gnYs0!n)td+%N5 zw<~M`{Hj7f;EM`d0smKF8{qOK!mJ%|m%aF_?U zQsI2S%N3ppm{NEaU{T@OfR8C$0Qic+g@E<08K7iKE}`xLGO+^et$Ft2bG;O7+f0{(--)qp=&cn)Aww=nAiT&Hji;68!|Jix0Jo)7p5g&P6CsBjbD6ACv2zM*gn zVB1Pzb^+k|3NHk_R^cB2-mLH%sUe%$8=G4w1Ji zB;%k3`J8dcCh9;utps2BOAAV*C0OSQK79W*7L@xp+5{i|iV~FUIfX3RZ!2WcUWhsL z;KHK)J_`z$loBlGpRu6af5axp{Uw{IcPqQWQg$|!-G;6pPM8Ios6s0HCkm<3-zuaQ zKTt?nf1{AHE=Ff4I8fFd3MuQTLW*~rLb{=c719m8ppb6p9ffp5%TOtR8QhR#oAWGj z8zAn-`8#ZfsP`+RxZhStasSnVk{0t(S0XlLzepiucNm{8zEmN3B@{9p?o`Nh__{)-!^;Yp4ztb?4ort0g-nM*g-nOELZ-vr3YiYyP)K+D zQ-yTLv-^Y@-SKLLbjL#q>5j7s>5lJFNO%0WLb~G<3h9o$YlIoy@fwA6$5$$(J3gS0 z?)W~1bjQaO(jC91knY%rbCZ#LbjSS)>5i{bNOwH0a2eni6fOrmuCN>Mb%iSc{WvfT z%vJ(!P}l=_jlxxcH!AD}d_du9z$X>b9lxoN?zjiL(t#P>@t{Jw5d;)2zTt{xQ$kh^CHK6xEXA{lH+c& zpk&%F*#ryl^GYx;{*OZD#YHXhDD&cWh0Kd13Yiy8g~*G}yEj?yZp6D^G#fHsOSliTk}a!N;#vg5~WK7Gxwx;mwx9O;Gq>7^6uPZfF-sh0jq)g?C#}-gA=@ z)bV}`%Kc}Rpj!W7LAgJ_Ls+5%402s$6I3gq1U0!+A?5wLLi&f771BS<>J%>U4~`C7 zEFFB%;Y0l0CpvsmA$9n3h1B6m3yMr{+5}~4pCgaf4^pN9C8*u7LMn7vAtgPkkdi)U zL1Fo}O_1fnxx&&bEcYk@h4Q9vM?8;@Tdt0@gl~rMZ#5u#vk2em5lG=TE2Qw(T2S6} zSP6*eB*g_5w-#`Fi0^9=Zr@c%ZogJYZe3jxfjVBOkUH+SpuFRtO;DSMm7w-Nu%JY0 zm?wOg6ss&K_jlU_AO4t4Fm*p`6UfMUv&n8>oNGz%hx9+Ec7BoG<5eh3`)q{&9--0YJx37o6Y~yvp+oV_4n+|hin2Hqg>ooL=TH>Wp(w9IQE-Q%1`b749Ev(Q z6qR!*YUxl^w?ySl|42L)g4UAM+2WC+*`YRwM%;I;6fk|*J_WlzMYv@Z(#MJP}G^2jSQ1F#zY;r&Q@2SuWQb!a=gJ5C;PXLfD+7=+N7v@zf2V8)DecECx!m75KN|$JDfZD zkm*f@3>*b3S?Onxa_|f-=E;#Lme-3aUX*&0APhT7W7s-xkTI;ga1W(J2yepMYzou9XA9*#KMENT+SEP{ut+^=1O)=AbFH#|q zWm?&H1~Ma{jpOp@x8=$`3x|v+fG3P6alH->Mgk1^nn-z@x{xmkR+k=k$!`2sR4Dyg zpTQvj^F%*K%@c8{a|jJ6ASLb2)3rm>IF z*t&QMv&Nz*zk#c;6HFF42W<9cQe)%TS+mz@M{Kh#5D$KQJb)fgi4esv*k@UuM@oY= zwnd5;&4$b54Y}e$7!uDJUA)ZWWj-#q77rCew-(Jtm_}uRzL|VExhy!(};@IQjSSI9Tk24)HsAz<-3QdAjsZGG%s z{(TOm%@a!?>9R$$*~&(kP=*}PehF$r`r8jCV;|cY3+Hrq)+0su&`4aWO7sLmGt<8l zTTjGO!3dwoYBaMG8*GfQ(LU-NuU( zW@jXUMPz|s9CZvzfE1>J+2OvMO$Wo#Vxc^01WKT?D44DJG^CCO$i@hc;Z8>|f|tnp zT=ZcFLnwI@rXP~ym~rPui@u^1p%so?L~-s!qQg9#$9bl0G?!qyjX1YD!>M>G85oXY zEsS%wLzx7SeAoh1e8%XNW-F%CQ5@99$s9yAZiD5`=6og|$Re*LV58A%%(l^J5T$hl zb!2!nm0|7DB=5yYco4n0d}hutD)l6eOjm!QYmp1^H~A2zsODtmA*K-A%ebw$8Nl%Y zJkl1^(~HLEaTgWtykrRSN&77V5Df>?NJ436oQa>rB4}yIFWLO?aBK|np?NZT-{`$} zm~#+?83fkP25#V?*|5e0S}0^14T}VJcG6-ag({JYp`oyA;KfUip831)>^HrcJPz65 zt!=(fUwq4gr;nQ+9q})kvxE6u3OO^I4~MZiTr^UIJ7?X;f_Nh`xUlJdYfG1L6RBjvFM@7#9H;&oiAHrHEuih zkq3_NeJ{n@WQj$OSteHR4IBQ*66=gjk3aJ@4~}IjH|9*H)@DmAdhjx_Rv&zKx1CxS z7hYWc=wu@zW76N3J#&iI}s7;8@mW;T?( z$mNSRJpXXSoBFRsw`D(iDlby*5N4*}oo|WEntqbVixcaA@;#Tx+m_rj`s%u; zu055=$SQ0slye&T(TUJ)J6xQ$zWsb(eA5eiOPoeSZtwYC=)J+xn{68Aq5DyK;iiXv z^s`6r{H*asQrqUP4Ch|CxW{+^)M&`~5`qciL0o6Z37)4i<;}AyDkprE@{1BRi`j`E zwXG6JV=74o6Zw(VdU39#y^g*AKr*t<$YWj>Y&a83 z=cH*hmXm4&-=fm!>dzh+=^IO+G1sJY8l8HkPqC4Xg7CBH)z6kv1dTZSC^Wx0$7}*$ zplEvG1#{6rWhIPul+@NaY4fnZKo+WK>oHJj&vv=*#<1!unM-B(abzxV|H39_1U)>i z-#gR6B))b6;Vk~Gl$$UYV)oYcfgBq!NWm=DOk?4g>-P?}f--DzV$&2h)Y8S#zsiT! F{U04%4tW3o literal 184724 zcmd?S37B0+buMaK^E^+MEN|)9R!i>PtZNnuFzdSOucQCkD;u?);ZN)Sg7Wkb=xjD^-lYt{)ZcOz0p5bEZLQY zUFkn>TX|3&?LR4g+9zzQUZKD7R{se*-)z&Tw0qPrS@nHHJX!U zn^+TV)oCv*Hpj|C&7wVqrz`mB&~UYS!F#qcs4!HmHJxgO$uDc5CGy3gVXHpWv@fEm zSDh12jAqek7(}A4udmZyTDDphs@G~Zy?0ku&|=~vPNiwrN31+PJ}+Ok8Vx58Nr#J~ zr`GBx_AmC)uV~ZIhlcAGngXpqW;MV#nryUM9WC2KR>dk$Hu1$Fr$F2-MuXO^p^7z* z=Iyi(o~cgQb-Q2;Pa5}FMzL;>9Ng;h>$ZYuaJ0+TdmrLvF%AKOd-|<=J07`_Dw@4c z^p_W_WA;!D$}!|r&@B1R<@TCZ!yXDVD*!`NuBHNXk0!ssK;roddhRqDExX~O+qu$e zuM+xV6$(Q&yFO->oyrAtg&Y3hBc1kIQPilm>Uo=<4>ejNBhE!)Xl|u7Mp}Nky}o8u z>~dp>C_tuW0}W9d$~PMH#YU@EtJ{sn&;<9wM&}7gH#XU5qT7vG4s_G^2qtfIkJpRCrKcExzGgr7z8Az=$Tq*S%Z zx-(jYw$I+ZbN4Ph5;B#mqt#A(KKNqz|U4BK`3+U53IYVaYuVhuxeiL**Wm<1AX5&B)VGBjd?46I9`S}t2q zgC?|o9%1f`Oaie+Yq$ZrEixw%Z@C}{PKO$3m@#~xNTHWFq0?-64GmXtOmK3qrI!GX06qP^@CjjzOx&}>IC{`P`&Al*{IYR z+}vK`_NbveOukKxx50bD_3a_gegVAM&>8T!At2?#6GFbdxNN~jqRB>`3YukptuP{< zbhy`ry6_M`zf8P^ASd(HX&=%aNBT)|`X*tJTJ1RvyV(*WUktlduK90PM`4uQe(nzn zr2F2pc>=Hsbab)TG-Q7WSuw8A-~lt-UgrMkDIYAJ`y?zKECWC7!_z)7B=Fz_&Cn|W_v_^-D7`0)Ep`u2?8SjI6Ec2hCa&ww;SH}Yatn*ASmcdE!gvvG!kV=govy=L*o7lbz6q(epM_1D-B+g%F2^9$tha>sS77gFR^M0w zHjX-mNgZP@Tl!A%ms{;6Jh}~yRLK+y?`&R!zXKb2j(;<5g+OyL2*RTTp<~WypLjH< zNp=>EdY*oYM+@`Sf^80$t9i7`!V_o%7-lMIh0F$=8`y6PhI3s)pX;+~4!&{@l}@6L z??ldF4~a&HIp~S?YNz;)_WUE&d`tM#qF(X6r(mD)eBSwL{ybb~e!Yhu&OZhWj>Gl} zO(26_Xo3G%bY9jeezZNmNe(sXjr(8$H6IxdeuBYZU>JG|FVZ&ha1|PM=kh~8!hct; zTyA!TiywmbF23~9_VPy4YLf8q)Wopr(Ois?#ww479@_0gXYFyvo-nE-#yS5rV*(DI zan^2FWAGBthUe{kvEn=hmqxeJVkj)Cz}@`j+UMzd<1gL4FT#dt(m9?!jLOw08hA<7}H?+iV* z+vX8F?}#rE;Ei76D5ghaq>v|V_)G1v^+zx) z3-1DsWOEV%7tra*X<(h`4#iy|I{3gc522l*=XQI|5!gC$csj-vdgKb8wsD1Cxq_!LTw!NWLDn6vvNx#WHI=6n zTw#AuK~fK{agSdEUeiz=vyo2mxA5DT-LzoE+l$3`Moc6|9dxV_eRqmgmpa(hhjrKAgKf#hP=EBPcZwoPtF2W}PKb_)% zE_0val_sWEbH}YRY$K0g_)H0=27}faL7>x~h0sgq)UzG(u}VYKc=#Q@7J2Y+J@Hq2 z9%2+^M&MR^HQMv)@Rl%D2|t_DtQM@v@RJ4N$crW!m5}t&BB-l76aPkhWgbO7wi!Wvo5F`M$JIH z^)w+KK`4dHAN=7u!a10^0gTK3yUVH0Se3?G#13d46_nl7tUF^+)oPO_FPP|$z_-C9 zZKzSB@XHmS$YSAN@k|(c<2@&@x-`s~wpSK02`vA55ydtO;gpNFd?WHt7 zBb98>ESdDar~OELhJ*L|5gkFdDOh{@%g%5=YwMoA{r%+OnBe{b;uwv7*U6y{$gwNT zdAtvF+Ar28T$?N)c7S%G=%P&8_FH9{_r0NEgyAUg<`*rwfPp56S_G|%DU07AYXO}I z9g#1MslpIq9TXpVqT|z92={ZyhM!#>4e5q>itZSFx>6vH-i{V-4q?JM8rFxUHRywd z=obf0U`%S00dk8g2#6wD$Wg*mr>N^L=Vvr?b0_?lI-+3lm{p-zQbR=20+pSQ$xhA5 zUzqG%5%re3e-AmM6$*AdAzsJS%x{5JuA>a+7{3h_>>Bi9@OrPj_?F_YdcU`qkx6yq z5)=mrRJFZA6xmOq`8?wsaJ9&LPsE#iatoUXI>9(mfFfXM5j{m5z^)@u6VOL!GWj}LFUqv5lU!RI({Kf>%bLe zd6+VELhrdVK0h2+yw87YnfMeY)Rm?);!u=zUaNAUg2{G3nc3lBQ>XO*ghiY$UT+}| z%g^0mtj)6JDaPK}?zb{O9Yu9J^wed%Zu|35{{`j_p=b0+cdqJ{72CyE`BHF8dy&3) zRkz(R33j{4ERRT=MWYhLcmhS{hNf9F;yBQ}DejMsbt3`8+!E+Hs zLlaJcx@7P!%PPhU1n_7I%dSk&*jz&dizzM+rabhQ3*uO?$k!dQv=GCB%VGOr$q;%% zI3pYEDtg_DnMT2}3x=e%tgm!!5j#owzBmZ~AioD+u zFQ-)!2w86qA#RC*IaJ6?D7>)ZTYL&Hd9PD^$^ZS;#n<@1zqa@~?|1JLG&Rk8eD$;+ z)*rUK@hTL|>qh{T=y%%Zu9|KT4h*Os*Qe?R6a!kP^l5pLQw%a7_@b*O=tVIDn&;y* z&#NvMl4A7(Z?Wd#q7(8cgx+Dq#bS`_Bl!xmMwDUAtU1)G!9%g(9tz*sbJ958)qrWj zB9iboy%K&E&Y}oLVpTzm-sF*bHFy<=T?0fS3l1#`T=t47s_OmT=15z(dwWFOUW3R= zlW3spU-94KGE$-;_KO4RwBEqBX*-tOZ z=XX)J%Mo$8jOhxqMojXekKX`ZZ>312>mvnayck1P3&4q~(uzoI7;YpcO-l}!;Tlog zhCYG`NYJ6+_aT-FOGEEt`C+46TV&V;#L%>p@5rc6__>%t8bI)v-!ZuNeHW4-1oJxM4m0kM-@i{k|t} zdFE2j_Mdy~@h2XC{E7b2USr$ikKc0Jw(SRu{(j?@+l(>Wsx(9haiWN6lmVBI;*c(} zg_jmCM7_gs8iz4^FeZvv>a!4StW6p$tbrxMJmF&(`iw`Na@iQRjT)AxL4yL56$~}_ z#cCQ8mS2--0?Sre)TtPwb!%AECLBdL(G|j|IX3zeg(5|fAjEH0wl(Qf(C32TR16N- zFZ7#>8}cw1Jr9~a^!8!Wvr4m9u+Q9|5$Z!VdLalJ7kXkGG)Am)!|pXmMTi2|Izjq@ zLPWDs#+tz;-c!Ou05Xn9C@b9o|8LQ-2e=&K=j%2Mkz0#&8|YGo1XO}F+HC|{s0Gjl z>87CMj2Jy0qaOUM0xs(n1a4g=+4f}5Hskh0Y4Ld5_MW~S+qZ2OWG@+5GqPQEnucCP z5d$R;nsU2Doux)UZ!}$?yvBU&iJ*m8@?+H&R-9c7xDZ$xJ^VH`gr^NIo_z@TIL)4I zk5{&B4>yTua1f$b`oteSj0uZOQc`P*lJI*}5M_lB7tKUP^dG$!QGodSREafG2-;U` zHH!SD$96vve4naGO-~Q$Kk0oEB=)Y)RU#E)b4!8}r{Z?Xud&kj%6xnT{aiG3gVzbD z=evqb=@`a{02NOwMhW3->a_-(Ppt7;WqwakB!)vxALcXEfq`kbZA!=uVDwpAV6v$B z(8taS>kWGar@( zIY+dhi0SeWt?`ANk2ZTR93ntYf;V=zZ|E}u60Q%yIZFQgG8p^a@tw;TxCeUsg3k4es?yLySA9hf%mh6kXNjNjKU?_72fp2hRgP3b7XsEc1x{n3ollFH}m6zI?gbqEv&r-G|ofw-9co z7#i~1_^tlkeRuZV*)M`{&Aw9OKG-9KMGl^~Uu+JXJZGLfd1C0n^CwSK>-a5bToHPq zXm&!w`H^mS8b~3EAeQY*>yvOp+ai>4!{c61+pAYPM)TAM=pPT6WurFoR4z6tNJjbr z|7D*0NJKA|d*u}W<+Y;HOK;$C!(y+jMHBoh{_~aIbLu&6)=e;XzR@oYJm#iV$5V>H z__OGBUNzy9qjy#sXxJ(O5F3s?eBy+0YT)EiPXVbpxt$5q>=4W8xzlxPG%*E8F8XrpLUF z4Kstd9tC$+bA|XULX^2Qg@es;gBvPU4kxbS*F+IbOc2FGL_)lUWI{kcgyjN}%LL~d zxis)OXd$xm;x|EjVTQ<3-b%~7SPg}f<<&3{phoW#o)vrTW+;oq6ts<7eG10okk}0` zKXwADROx*HYo8aMc&3Hb#JWgVv>TWF`l0I2v?|EN!WupGv!KSU24XB^u|*6)jQAK* z5R?gMU{cnsK2B~E!u*KcjZ*CEna5!f>{XboPE1w8S_5_%)(c--PQ z(!(+90;b8_jcFZCBocVh`&E={Shjg??gbS}y|AplXX?iGbhgb;eISCD9p ze8z)jY0vl8${6%D9)SwP!}_mNh6!r9c8T6cb|JSM83)8c=j}LX{`}V4UlI%uOGGW# zTchkHSc!{4@hVYFOL)F-LvD{3q$LK#H#ikD>h^e*7G6Z;1op1k46kA=%OkIN2$`rN zj0$xPjan-y+6eQ~rFd!H&9Ma0q47PT$ng5SSkD^5I+e)6gfryU33y(Yuhls8BQI%r zEUyrCy0N#KN~dCQIaPpj)fyctW9bh;?v7s^sGg#T+JE1mfz=?oeETAp^h8!8M z-9l{gYJRMIS@0b(q#}dRHF^&Mwm{sCK|LCl33v1eS|LI|2{;P1zh8~lP0?XIp4JAm zg!q_&xY4ryR-@jJ9SZ$L2ieJ3e(+uiwU|$r-&x_m;}ryN8Nr9(B>TzMZW?$MYb`;8 zFNa#OrbZV0XiZ)`7fQNSbm6C&|K{<_2o)rovR?D8k$V^=( z!iYaaEO(1VdIFrQ@FMwQw@eJ}=pB_RHb4Zkj@9AfgsDgIVsX;@PU$#}OAmzxr_vz) z2kT?L4N75J7*laU?abNE>9qXp=D)I z0n7e~Q9$hx?e|PDWytd@L$z`X@r&5{;Od}U3_@ijyJK3jKqR|jn&bGSC|lYmyIL&j zkk^XcSXTW4hKe%03BP=uC@+wY><%*6vO{U!!2rTr4Z>A8T_va?6Dc49gZ2rktP;WtU>iODM=87jp{= zm&+L&mCIT9(3T6iO1I4##TWTFFpr*%X-s16R3x4F>cQ<7+MZE-)PLD!5gsz!Lu_PX z7d8l7EEO*c5!|#n|JC)}tX@izm@$hLsSr5a^x^#?5zS}TQ4ANr&q$|`!}ZT}+Sgy| z*xtvGrtklH+W)n^7`A5EhI8U(<@F%d(@))>+b2qqU+z8QqN#_C2N$uB#KS;7>e6 z8FoE*pKPy-Zmoh3*Mu7x;9*S}KAQhi0zS1Y`zu--gu@iv&Lv(mwiWc%O zmoTJa!5c2t;Pte0MIgIRXx|btx@qeff)}(6>r{Il945|aT*~2rKL5eIGj5TeDDQ3V zEH0p2!1jEMpqz5|8ff2qH{JM7#3#JWV+?432?_Q7qq~A%cO!8@tp18@_Tc&6;MYC) z)lWmlRx~%|d?y|wQp7p+?S(-iHHHC<&`5)aT0(RR7zD)b2!7oMLrzwmbMSrU_IF;3 zX7tlFFF~s1ZmaMV3em;R;0@k>9B=G_)2Tkhl-CGqdm#*T!?*fIugi%tB$ zdT@WMz1nrj$=ab=c?lh>uqz|a5t)RAxB~yH%G(ktQiVpLAUyRaG$yj=F=Y~IBgk$- zdtJdgEV{vkA)7Y7(FRCL?nn2#jP0w)9wd*7_o^CRly_ocqK_q_uwXx&y?)ee^uuJ) z8-9`}Y4_s#NIpaZacSOE+pNNs>~rkqh@e51n%<|{k@uI1{YMyJ;Hi>%vO7?a4xZ56MY@};0{{_h`K7A3g@NpKH=sT z7iYDn%VTXX@uK~J2MIx9LV<>s~8^D$=)wz`D7%>x5pdhq=l=KRuk!hK9U zyyfl>{I1_W_H@LvTgTt_DgW6%esqkNsgP&dePyZehx{KcIU~MQjd6is4POF_SRx56RkIf;AsFQgDVRtjUJpoqQ%rKX$8b zM%DIgx5-5NlosL<8I*;HDpD3v%|?FL(Py^03o9ZKeCyrDR(E2&XKSyq)$1bkob3la zrSU6xvS%x7R?wL!uGeY*$uqH9^qy<^=vAa;_wA!+W7xRUL=c)D(&*BE(F{IB9dpc~ zO}oN}K%IarHgeH!gecuTmq5}#!$3?wh_G8%h*TMdH73^qBRg$_vg=eMASMhB7~$My zDud;Oh^^8h(SR=iQ5&VjFC0;qyl_Na`oa-)*$YS1ADC_h#7^L*wZRjqmPoEF)5oPYVc7HG~ZZIw2QZ0~8bGCViK-^nKq3RJOE){EXHcg#jDwv* zE7-)rEC&mQ2o3PbVc-$J&*2~(ew&XCP{ALxz$+4oP_n>ZU&kARi>wy*Vp~`VrhUM! zl&xVgEhs&WPxEncf>W&W{5+mO#Fr7@w~52$5DYOa;}|wf8po=2oJ>_PPT|-kz;8rC0pVXFNeoO{( z#;1`Xe-t6U@G&8G8{*^=%Qy!}urq^B6QRWAlU8L?{J{r_97S{l;YdOQSqs>4LOVy0Id}&9 zW%5o9mgX>WVXH_iZu%D1=s9zEV0*M}G-z#<8C{ zXP!GhxM$bCef@j!kAWRdq-YOU91-Nh5j;@6(~WYq*EmIE-DFhUtUt!Bw(Kffjpks} z=-+`8$V&`Pe(E(IMB*)$(?&`DfqEU`SusqGVPk-CMno*(0f=0(n66$GC6@OlWqC`k z4{$?Fuh&d3d5^b+)$l^?y!nN)eXymjN_**WN&De z?>XwGi4$g6za6%Qv0nx%e7V%rG1$<^387Kxu8tH-e7Ca19*Wn;P+T{? z?5hQeNHZ2vK2R6g8Bv*%t1z#}m3fV#vwnIG7tr*8*PJ7Y6nf6QJbIP9(A<0)O<5T_ z0WQ(0NUFfx*-`FhXikDdMTPGknvT%Cdm1rTov4l?jR;;sH@`ix1`F~`RFF~ye`BIi z;~#bY(c~ZF{NtkdF^E%hd7|+&{>DUurp?oEy23TD-S|u>XD*);pYW#@Gt}I(JP9Vz z$gSa4dm+xS9gWS1#Wa*>g)}MS`4mlaN@9jWQ-hN5>dC<_3E!9;#FFss$ayLWzlWTZ zlJGBR@GprGoCdU#7?sG>mxPrj16dMQjtoah^m*!*CDFI2QvrJ25&Cwi%^gB>BX2`NL=fHHV5;V=$8Ffi~+9&ZR znk2&Ak(v2pL21VEC*R0OkNEV}ncE*I%bl`YwzuR|P`yD$^?S;!NvM8Dm&Cv0#Z++i z==SH;kMiM2#_3kwI6YB8pa3~hVdL3OuEK0>nVVJLT$6K;Z8C9oqKU(~OwQKgi3|0> zSu$3emD!Q7+9*hLwWu@Rp%$}2EZcP&Hh@Znv%gEabk#tw0fSrtt?#<_`v}%C4nt^*KY~xgGj8TFoFZb7J zYqPj5<)%xkNk*>8{F;_Y@edOl58<2O3Ge)U%CIHtBxUR+dgs64d*>m)?cK^> zmGteM+}hn5x@YEF`o<%4RsjVZ;oso2BOEW|odOjdMW(9At^OHh`BS!fdt*+Vr~od7 zZ%tg9K9~Lovm|MJ`IItK5-9&o7ZhD*>b9d7>7D@lZUdVxGbDkvOqWC)ERAt8 z7;3q%Ymf-I_~g_oqdg`L9HG;1so^;%`&(n7U1hr~*7XU3R|Ahtk8>{ZGfNr*kCOCpY#Mtmj+ z@$h_IgG9i^G$9_{iT#@6W0=a1lUc^8x^RugkQfx3RdlJtTJv$`22QUvj>nrB<}IW( z33G^#Df1)g%Gj`7-og1B)(9CJ;{hB$0Qnm2Z<#0V~0pz1-S zMQ~lt65N?_?n0e1Va76FnIQ?VIl3e=2W-hBPNRi8oRgfQSQ*2!Q(2U>@GQ-ZM|cUL zk}%;gmHCiR*`Z4!b5u4q^3DaPY2x->+_Z#|gf~niIIdIHWW*j;7Bekkn{r`3%^05{ z{1WCGXO+2<@H?$bB6Iv=JtyMF#>yC@rk<}CT@smN zvD4oR9$)jra>99>I#sQYl&cdWN;8N}$+57S`sTC?umC~l zXt6{hf`hZiAW;bZgqg})lv$PFf3q%$%;CR{G6xRf^fs&+9j56)UF;|8#T8N$yy}|( zdfJy5>Q5*OpBC!dM0UZj;NHv&?#05A3FdkER>F6oJQMx6GJg`jAJZj~IleoNVMD0d z#ElKos=g8T^CEUw&lIg7U$b@bpMSjMXXm(<*hD~!Ty>ulM>ip)g_TR*xMd0 zI{BhOcXf{oXUNY5@-BEhPM5vi7n?$+eT!jUx-hE=$hO=B@oxtF`x!$f&Xvanm8OGx zCvY}uFkCN|Azq}+pak)JT@sl?yq@g!*`p^O4xk;e#vGhaAL+f_t1*aslm$%NS2qZo zT(`@u06dq&5Nu0i*mf$jB*A9tlE@skRfp&%S2}xOtjlaNu?B=)gwt7F5}D&P?+8-8a29^FH~CK)k4wtzr^RD_uHb$@guyZygQt}_ zkT96gC6PG>E5x>cIuiz0P4lG!5!;qf&bYiyS){bMtju9oaKQmjNI!OY3L&&yM(C}| zyhsSWMVCb82yGw0ff_ZWO=4pn!n|~JGdvDlB3toJ5c85Kqy0$XJx25om75?fqC0Yy z>B&GV5S|Pas*X(?!|uik8R<_b^C%(xaa|IbBfakgUDzRfNpX5pqlLCY91>^7iQpT} zDkx7DSK-+;WDRrbY!r1(8ms~Tq}()VHQ&@HJf$ac$68lMI$MdFzk{iGYjW(A_UVTzDt{b=$j?!PcderwEqb>u(IZ zZPCokh3JgK#EoGePTCljQ~s)?V}>Ac4U^2pj(fU^lX6T9S}COKGwIxoYJ=}iij48o zS7-BZRJkdV&4UDhyFuUM*c2R_QI35NU`|rH`5|T2B$V#cB@y(&dl=}MPB-5yHXJ>2 zq?b+*wQx_8IKF4VKanB==5&=A%966MX`$TAn~=r}*z+;sF`IOJ#+;-C^igHLBpeI6 zBr?Zw`BB_HQ5~B!8%Vx1&OLG@I&{m$jMZzD1xkz6iX4oB&ym>}$7Lg4v}aDz*$QoC zRwQ_?=#t1Bp743K1Lw}2?s`DhR23Pr4=D?o7P8n9+ML0Jtd8GO{E)H$YJ2RT}&mK*o8xmF^=zxr7=d#V*1w@!M{*$fV2p1$7F~lFe4I>R~(Zd)EN_U zLHNahE1L#w891``rc{--j#k}CX%E{V)lVL8qLyg+Io z=DzZxy2bx7uqW@nH3!Ij5RiFCghhG%B)E6+@wn)4v)qpGnl9HOh$u5z{O3v zdgjhk#W{-CZl0=e`g?f1DgC}bZGA!+xnxs9f+tQ}Kan(T{aNL&N-FoLAfYjB)!rq) z{y|&@SFhpXIh)U<#r=yg{#I;-pnEm$`9G&Dd&(AXZ^-d7zTi+;Yj6l74i5dXdS24} zbW)im3661HICL}G#j+-1jAjAX^x^()T(n*`^0;3#I&JA*jnViuWzo~40ms0Mafs9u za2Q4-36Eb)Xmuq}8q4p<6-UGoG~M!L-RN5KsO&Q{X9tP{OXHwaUCm z2(8j3kvT#ekp4-x^NJa6g_KxaFoEj`q6U15dW_h;$|9!iY&YhRhJb9Z9}ldFh*RDF)pqA)Wg+)oa^=ml)N& zviNCH-IgnO{F`BX#{~aogW?o|`w+wl5vi9bGblm)gf5B9AzpDFQK+$MwbC%$L-L}X zGNGJdyR0lyTG&>KwHCpX>G2doC?Qbv3T0j-gkG*oB6EaHY~3!}*ddKQ+hxN&eSkxR zhz^UJzk>t&V!=YicNy9DC^tn~Wcz5Nw=atsmWATPEK5>&a9+|`3hz?pQ$qb6x+LPL zYq-IIC(R)V4H5wt=XL!vH~u7U@3?mHr|B>3i-es%?T4NIUKy}t-6VMv!%lyi6n6SM z<*!Pb_P2tBM%YO=&aqsazAiGZEQ4-QjM{a%m^=U6r8DCdOAUK|LLbbHtHv z)#oQgGiE8XBDMN;x+H?0^+N`3rlT3lAFwOfI9Bd*b(&nv@Z7E}P)hv=JfqB!IpSUB z7J?^XR@tM>iUiNCx+GG=qaC!}=6x5+tsnQCo7-5^H8j7A;oBEnim_GHuH*g)c+AB-paVTP3Q>oJh@G z)+G^i7l#p>X=}FmT;6r-Lg^)R@nGIANT*OvSDBIfC1qjLB6l53j8^222!_bgwW(|ESy~ zX(77BKj?%kG^U)w-;ALac0Xq)IiP>9%%23=-|3PFdf4AG>N9P!bEnZPbp!Vpi#dXK zFpP&ZX>=@@km?OacGHWReA7%K#J7)gXgy^9;Ory|zF3(*3E2g@B;v?w znBTyHvq{h(5pa=}1@G}wxf|kEfOE)iB<*U|g4sXWlbDvJe~ne`eq|ie8WE&4ddcVw zamGIm8z%|O7WS>#d53Zbgk6c~TS5T&pfZb+w%sjATtm};>v_sf95{R4@Ebv(7#);8#hDRp4{VO_f#!?#(rXtR`QZ z$QS4|tC)yeIGUxxXD^AnSy5_=+iH2Jicy>JEYmf-I$jY<3 z=_u`Ds7(r;BujJr$ezGWh#H$|>ax1suso~j!sZ;37l>Dp*a2Q~Ble!aEeQJn3G2!~ z($$3E+Up+(64%giI}kd8&A=^Nupj<8Y)4$LRm4&_A4klljFWb=SS`dn@vEZ5z}}J> zu=nJ`hqVbggCpCb-noFDXN@>3SI8L}ZRRG;{I@9cEm@Jxx+H@ByHSwnx=USmWzZO? zFzRk{MK5LXxH%xAA)`Hb`s$4JabX3 zNyPEgFzLalz~)4QM8HK>qrxVH``M--k3+XQ;eyY+}l+`A=8&Q)brYe0UDOKtJR{pBgW&VdC z(G{hczdiKkfr@c@oDPMuCuqle9JHuEGHq?PV%M*jnK^~j{B3ea%&N;TjUL!WCX~#S z+{*}+cLvuK9bD%`~KLnAZY<8 zr_6!WO$=QUsWH%AJV$b$XawUZ-+LZ&zvN>N$IB2)5c zrF5%^!Mkyqt^O=GpSEymKbh`GWsLUJ{a58S zN(+`L)^s2X?zv|Z@2!gSIU-X)nbg^TUzt$}%>S%QBIxYDtxF>4?5t8hmYw~kU|M4t zhn#vrY~?#TX&aBg1CI_u8{>7cf6uSUy7f)v#!9PO$ZmEgV92r^2BX-sXHVKl`T?6E zqmYnu@h{3uNqY4E3KCt7!pzTu4j#t=VA$D(V~~$IBGsffoK6dyXq$4`TQckRxf0cEMm`YRJzjvnfITs4j^(744B}GX7IN%TV>O~{lP5@Te5`IgI6jGAu07`T@snA({^7c4*3Cg zFH}W=k#0$d3h%Khd{DUw(yGGt1XXa?)5VHnQcmK6q+RUqS7uQH`aQZN{(k{F=Bl{3 zN3B8<&|ThRpueQt1Xlxe%t3K+5BKPVD?q=f%%TMJ=ev`5!|dy>zmEQUqEmV`7KZTS zwfy7t;)hEsbHum4_yN(U??&vI*U+TC9)&v13ykp(yG!3i=(HGb&0QQ71|8vP!E|7) zJv$!;H{pWM?N3zMQv7nRwS z5N_#`2)cHim1L$D^jC(@q{mTIbtkr+B&hlgjd?#cO@8$^416 z;94GMmBf$UTbPsv@CV8qNud1~LE;+P&Q0gBtnWwRaIFWeVkYA;byWuC@0FV%EhsmM z{dB<=N#-;WnIxTL=D-aeaja1~)15A(q6C|U zHC98SXFj-Sg@+5u`m7E&X@3k=tNC6fZBZ0nWh@I~Mk%v;>{4#Vw0-*oGOhh~5Js2V z0UF|8%fjt|D@;vp2e!>#JD{fD4iSw?I7+HdSq@2~Zr3Fd*C>tYQ82^e!9s&Xz(q!G z*cuLh(Gj3ziZI5=!+V!HtZT!{4V+fj*5)`K2HwmrLwiEj&X6)clFmG?OCoc$4nJU5 zkqlhNdK_+i!sQ=zn{U7sE3_>CMY@No1}!tEq2Oo<}3^TyUCv ziEt#G(N38rD0N*^!|74P6qcq0*mn9kOu61iT1x zA3~dMqj0V3R*Mn)oU(jr5nGQ;`1}PL-N7Hiq_|?PE_T<4=gA2>+&-hskp$YO1c_@n zp3e^riIFBxnoE5{nHQwBsfurKW*A|`mwY*KoYz%b>Lel~P+O>Q0wx_Pj4gZJAO^~wT+c)J#LY$h+ zDSo($;CK1ONgmWEl-ZJy`M55LptF69!JTOjYSZCrWxQI((Qe|lO1F!g;+Bc}Q&U%E z2>(f0(DV?}9WFknF$@DYcyUr(`s>PUNf3Tbmqg|eZa8b_TUfG0vci;IaEf{i-ioy| z;~GnbuYDu(YFr*;z=d|}E>2peTdK^Hgxn%s5}6~n&UJ@yiLb~(@eNXRX|-D|M(qw| z@zQp=^`3J?{LuzmpTCg7Oo+ekQRYa(Y^N@X)R<`pXV!{4KFii599f*2n73;<1+EhH zCfeO9F=US^OP3b1b-6LRfmCp3hPewNmJs=Tu`)vvVh;-v*U%F-1Cm4fcY?NNxsR`${b3- zP3V#cx>}R5pK0G@^?=_H#)!KWG1kwLt1xI_U0$2PnM zaXGB%3u;CLm2;#P4z?iW9{a6~4BS-AIGwvO(LyKN? z;$#g6g9@Fblqhj?ffcqmf!BqDPYZTA>VV7)Nmkw4)@3zcJDS7Q_Cj*8#3z>fLXwMQ zFmdmJ#dpQW{Y{f44|y*M%Yiv%_9YEA1c|P;YvvTyXmJ`5QoZV} zax8^!y2^~=gUZd2)&SkiC^EOgvlQ#K#H}f~4davKT^?0tO+x69E{VX#+{Yl#w0F7h z5c1K)$ypALU#yPe{ARn}Ym7K`Y&Mqqx{V_vy;&Ch9z|v)g_U+I^2BBL273Vcx37NtrLmKOk0~Fe!a4| zX(2XpBgAhEP23>l^BX}kVY%})%DhQvwslElj^_5zl~81&55>oBKQ}!(JS)7%2>-Tn z6Qo6WM=o?J6d7)*;|4NBuuh1`eMp&03G3g|B@xG3!_y0#MIP`qNCaH)%u|Czzy&X~ zX^;rGc&qMm0&#)ek}I{=PIc#O>#$1Hqy+}}IS;jPzY1cX*o%E3(s@er{f&t~R92Sc zUO`gEmQY>A3>Hqmuly}Zx4)}PBEa+8x+GjYS83s?9VU5lpjIn8$eKE0HLYNeD|xgh zt$fkJ?EHjn)hqCjdW~a0bIv?>esIsOef#?N;vd7}^Qs@_xw_Mwqz$yE8|7-Raf%j$ zC!>0?*4K-k^)oYLq1KvCFK$)-mZTS31&M1oy;zKt?s~P*N;q{bTEv6T1Ii*McQdIu z+e?sV7~(|gbVroGEH&ruZ&H_66leN()(Et`W$B{>BG(h>jPQg)$g~EE0a7 zQ)W%V?=!k2f-d+eR)Luw&6ax(oi~C+v6PD$uK!RLC@owou=XunOx}Y87qcTF^6$!D zmk{|kT@rCbH0F81RFV6&28n=+X}lb5)4b*^4W~Hr*Emo4*wu1%)QP(~UFxuk^lZq; zn{Tg0z8Ldnip*?}H%U)!Rc1lbldXcpHMG1d+`Cwv3d~lyj0M4Hk4z}%_CBsGY}zil zGUwiz8sbT6>to8Fm)iQUE{UKw+|O{$w3S@*uB7Xa>vvl5pdy}&i5by(Vo|==5Yd_ z-Fd#V{bij?ou1MqL=lQxOFxevIOXp$e$dnB_|G=~NILMaJ(n(6s5CnzF>#(p?kuUw z6P=z@?fH#-(Js(h;4gOYSJTE=M_ru$TF}HHfH?LKdk=oGW49M$FJHM;ut%ISzg>De z8ou-n`sbba$8OIbvo02pU|8%t^dtP&o|mUXnsFd|d-=dHCW5^DD16mUdtu$0@XAZ? z!~5;oqvh&w=Sq8S(J2({O6PKWiTg?S!Ik#>N^5Kw)0IMJ5D}H8(*!HkN_nz#nYAKl zw)WfxK9sj1$82o3#!psyw~gO~4`$h}3wBlJ zf5q06Yt+{Bv7%i=jCU97u>05U$X|ORf9;L@wGV$KsrQ#jsISmJe@Fj(jsE!u{4NLKV5BjmuSNUp4Hgdr3vq(CcJB!CR}p_=e_%j5B^P<(e}IV znzWyW>k;x^#Pm~xMBu&LtUH5s*OXSnh3Pu4>6+K6J)b-f9U6O$2N6xeD2%$b2eWb4+Gx-?#|pgocg-cDN$3z z7L3H2dFgh1N^+r}RQ{^uLO&)*bZz~a&rFN14@HtyqDAbry;NDm_xNrFs+BV`EX3c6*3n)!nax8w|N~)Ub*nU!Se` zE`$1Z<)%mrD(=$pWO2_#72#Eu1z~cQ1@UoLmJsR*iDYk6=2Jrbt-2&KM|}++EbStm zXyDpi>M)9bq%2xm6xZV59=ZU>-Fr0R8Q&0E35jBVsLYRq)+cmHWRBMIQ?0Sur0AHI z7@{I0QClu%jQ&+wptKmR$YDlan-ty45T;3y7boW9Ix$bWfb0m`5l3MN%wEDSd})tABlbEQ3CEPK?pFO(;Zb6yxe+>ULjlx@$iC<~ghQQOON6M`SpgIiwf zev|UYrB;5!)U7=8v(44i%Eq33#z1Qnfiq+G9&`7d5tVHxSK;>lJ!O&8w)Yy*-sYZt zrX@HtnKMbXe@B@EsnI{8OCm5{A7tESdg6H#qjQIc&Yqp-Ijkbtw9;ejiNZ8ZUB>In z%A%&lYqN{j9Uflbwc+tBr*qXEdzI_5x{kaxoc+>v2K+Zs@a=n z#^aU7hxR%bsyjmf3GSrMb-gkV5=Q^)#}=b?jM4rOM!WWyyJFU_Yb{2pN4bU4cBu6( zO8Y}7F@F+Fw<mj_OuKiQyZ1)>QrB7x(+OqqRAIU+1QYWo!E{`i z2??fSx+F4(>1NTJ_U;VBbf;;Y#+g1eSnZ0!HEnH%t)?t)TG(#p-nBP8NbSDUL}m%G zYwnWAt1)F>B=kzUBr->D6{EMy$7`>-KZ;ml4MwS>ELK{SR=X(e@_`|~q>lAEWdZ(Em^tO%czKwATlSd6NM8p>FGb+7CE=UzbGY0C9w2?>=lg9p}02E;DA~lB+O0w`2y7 z8-&=q59j(ZXC`qbp|eGq1F8FL)+LcSI_}_dM}W?Lb62u`i`QX%9#j@h)xO;k;3IgG z06MD7f&|bZT@slC#BqeZcLo6M+Gp;H8Mtnh7^1SWaA_fOgAIG{3?O3eB#azo9wdxL zbV*z*jP?f@?cQzfz9Tvaxfn^67^BxJ3#W?F{s1H9PQvI_$~;IIJ*P_|bBx?c>0Kd= z?lNi3l*go)$(yz|qxK`K7j|z6p-SRN?Tgtph=)G5$L>xVhwZdSz zk(Ws{NCaHGUN9~wqUSwF%i;Y0kP4m;9&PvWH~#boRK=HEKqL$8||$4%NXVs6^r?9S}$c5;u9{D$82aJ&L;EG;q~o6X&~H zjaa|CN?Hv5v&v1C7W{*W;0x1A2MLm_IKr1@b-OW(ipxA9YDh^E@=bq1nQci)UZzVT zb0xV?RY}l{O{dbTwi*d)a@EvWQQocGTxk{MK2=2t#FbPfA>H+z%8W~@@*BD&GFO!w z;k+987Va8APV%@-Cxd%_ZFB&bsv-mYIb|W!0=$t=GxE8lgMWQ4L;XDAYJtxvGbMrd zDP0nogSYYw&T+TvP58i+!hGh)vDm1cRDr?zjfcgkMgr*@x+F3OX;-j+3S%)gPz{S~>VlghaP#1p5iW{$JdO7m;*B?FHP6`<+D8>; z+`kioL^8uA;n6tZKGOBdtV#;7Mwdk93b4lC{1Iu9he^uYM})VK zOwA2_JYkA&9Ux+F43YyHuSHC%QAe+VI*NTWmm>t2m9vy}x*i`j;p9dOvSlP#2C z8&+mXf^A5bMCP!q1Z+4*gOB?gx60D3%t;j(s^^r2N(_e-N$(S z;8GdX?%-g0#$x z_!UG8rkreD6(!b-qH;5()r$iujJO!4SclG30S^iwP!O|+r{b`g%2yFTSch#2F zvbKCdnR7{7KBr3}b8R`8Mq8jP#;{YVj!hlTy-HfFCqGbbsNId(_*Y)~=7uqaJxS$;y0o^%DY1%d*^Pp^A66D3El`Vc$^Gp{8H^7oGa-TTK3x)-gRwoSzx5heIjPp`Hc|s|y_P*r zYi?1j6y9Sf|5CXL(n8sj*yq9$n63n&PPb9U`OlR(lyLrnE{V)>?!h_1IG2$wOQg(% zI^FZo-=L4y`v&mwbAu&T8e6y?`$CR0t)Z?%&iOkjGuJr1G+s=&YaKo;T^WLe5 zVZRDGtQr;NCQ7RsccoVih-ijI3@OIVvSM6NW?52MCimf;_L>RB09DV0s0i$S8}-n+QqNkdhd(lDt-#ZAnR9rAs1nCAlxXl6V<+bT@zq zp5WG_vFIG&s;RM}d{nu)(kjY*=@rGxt`p)?JVuBcQk5;Ts(e_PaYkfz#E@|(;d+a!A;b#u*UF8QRzVKr==M^U zl6EY4lU_&}ZQsSTyPs)&TY?YPcFO`{=l;h8JNxYDhdRYnNxYCyKB3%5X$?Jv748h9e5;J| zapkW|C?C@$kvYnP`onqe)RTo7rOX5VQ_9VlRu2ZRV!)qjB5|9nP8DS#Bz3x=OCoc1 zx*Df05{I}NLaZ!rRBoiS%0fnCf7objlTm(N`RfwOuhk`yIm-JFR|`n!uVQ&%tk%Lw zG88!oR`0wuS$M{=lIT29p9~}XyUGoe7U8?F3RtksW)+^lkTA9q?=9Ox!dOXIEqY|N z_^2|=l3ILNmqg}jvGgq3qdI0Fn1D+IVo~RKAw&3OWnt1nxGYx}+?W-Yo6xjuy9~@< zD>EVi^Ow3LG6!aN6qsIP*lyxBHlt#V*>@YYhTSSu4Q?*OYp#ej)*-+E&$%V5Y1pn9 zz$Oc2l29hgWOi499kL4Cpv!J*ZOU9p_}!vQBJ(c1a|--KxQ*8Ct2nmMsJ5CIlVjFb z{dGqAv~q)_MLO1fqe$~m3+|68H$z&uX;yq!c!=(oar|B7uS+<7 zRF_2NIBuD;+nyab6}#^;MSbp~UsV=4EoNJ$w8(Xv@xsmz~*?^C)YGRL$JLo$$UMzFtO3K>jS zhR`^?Uq*VqGLI6{b96~$jsoWe&T{n_Hd6x{Rsr-2f&>gxYG6!`1 zKnr&mg%YPn+yhCYJ+*r^hUj5s0n${_x#0Y-g2Ol3+WnOCodFj)ZgF zJ;=n`+eFdH7o!X4!3t}`XcViha=|zbs~npR%?wFaho_YrF0DEoMK%m?`VQy6iv=4Y zc~=kGWXVkjwmdSGIv}gggfjb*>NIspWUe~v9u*pbp*f-q_eDE=*IEqlTb0F23otGv zCjMyH?F!jFGGuR2W=MkU&AKEqhiuD()d@;*gXW4Pwv)(cvMUuk=-5&4Qq*S{KcOsg zS{S$Hiq#29S_97_Ee-qP1<%2xHf+BS%7}hknKud1kLi-g9ML6@7AKA2ay5SeH&4d8 zUaX9f`ns|xX^~oj4mW9fyo5oyR|e&4%4|rWd{vjkj~^&Yw`DaQ5kZ2;mXG^nFcv9) zUIJsjE{V*+IPB&11`{$iemEW^FYbfmO@EZ`8}kqi&moFh#TlWX9nv!(5gNBnHx zkldWt8^}%5Qra~flRMEfzF*dxoyy!xdSmL6$Xst$JX*AxhSTU~T@%U~(-$j?lorz! zu&`FsbQ+0Pc0dB?4Yki*C;lrvtjv>y)LC5;KfXv^QWhyKQo`&;_Fx^7&?!Bw{CNqK z30)FDzM#BKStKP;B70m8%b>hf`STJeZ_y=@IVekyQ+Sn5!%En@9xr5T_J_*Cq=jP{ zU9TACCKL`mA_MaYWkw`mKCVk5b71-g_;{meix?A5vnbY^d-=}mWPe2UWd`=2lp7;0 zuzflA6r-p#CP^a}p!rg3UziZ?M`hfm<-iYWp*T}7U`169I7QgOf^ikqZq}?7@Rwl zMM>Mimgan51TP^}9*|Mlqs)hd%1&JpnWM5Mf=aJZxARUd7Le{zhf#V=S+uk$t%;&! zx~zr3dQb-I#mekRU_Go$B15oxN-vvz-F59{F|?w+NGfH7UMl2a0<-1hD}EHNYL_nK zW0yKTrRVVTiB74_KVHp0UdumTFMgy2b5#t?cplYp8Olq#I0VO~JgrM2dngw@WaTeh zs5m2buMveYQo^{rD?Nl$WgY65m+*ISYw72?C%&^wK~L#@ zT}nzH>Q*4k%tj|K=jCFy z-=J;ryLay16}8i8Ut$bsY+~|wA)44;deR@Ft|%jutWhM`bi?5~WZ6MDkk5U4U1@7xX+_amL}KIL%2qbo6wiT#XuNEedQG z{!is*Nr_^6Z>~&oQAUO*7rbd9mx;A0T1{;Ea?$!?mE@9a$Zsk$C_(>rT@rEVH4K2; zdpAtgd%J3swqLvQtS!!Wrh)#X2o=VC~WxcHH*03>0o z8<#GkerXc_FeL2-b$i6F+v2$CXQ@TLsQhu4(h5463c=%{npL+j{?v*c*5}U)ir3KV zU3|RKtXB(gdyyU(?UvCZ=I?vT5~pnL_7ZrwAx=c&KhfzKoIQBGH)s6^e4N?%jxrl= zuliS?#J4m_v=@}&cn&#D9GuO}d_z#`+6%PjBWLX~r&54Ri@Xh-$K1qcoqV(-wAXg2 z#GKu{BRU_MvCe_{2o4Sx+?hC48IHKeT?n@uWZX6>GbG`*L6^jOyqF5G88KVDju1mD zY}dRB%+e8MsnYfnk3qbhFj&b-5es*=UP1mJa8$dw=J$j0XrEP z&Ml8vI8CdC)cvMiYtS`=`Fgd{z+Dk#r;rfSNl~9w=}pSbmsXXw=I91X@C;K5o=w~> zDDfQX!n5Tr{03#-Bn5lDE{V($y^&UrhaHPBtUCxjBC!#ZcDp(<67Bs{Rb&i*Us=es z7;fa1_}&t(X_IWly?_h9rLB;CXMu~l)o-D_i|klK`&Y&NX)p`HTRI! zkmexXLvH;8%FL%!^7g#kFn`@QrgH}q<{0~x8ISxe1RqGcR~EG4-;7dGg%B1V8v4%KS)Z{kkrR z%+VS+U2Edny{E+tv{!6P^{(SX6u3zy!m3OfC&d!6ZJe;JdW8buR(Z6FbDWyR*hPIa zK##THv&v1DRtpAl)sW1*DGNFIuxKWUOf~=_BTJfA#ci|fifo2N4t4Lj^2F)W%B)KY z^WSwzWUesV&f-=&teTM$(6z58ykS3>X&8B{5laG1{T74&ZDsM(g5QG>vBy770k0=o zbiscJ<9Ra1-&E#M!uVfwNo0=kTJq=Yr`)TaX%V$iEsw__?N*5q+|ZlVbZ4FL=zQ*I zDU`Vj0XAO-Y^^dw5@4%zNn{S#wsXLTdL$pxbjqG+VgckVR`43t%2!_c=0@V)hFhn4 zYn%TL1A4Er@M*i`Z8^dZ+`Gp!RhWBPe+2ht!{7Z7xahj<-3$Qldyb;E{V*s%pJYhv@4XAPOi-u zuHVMI$HLvyIEqIs5r zbxC9n+XC`OoPuqYqunX=oPilo79njvS}6Pw<{{L9mdi-otIUIh!~tCrnIo~Ckih9{ z6nz=T8R?A%h3A@hC^ieg;3XSAh4&cA5#=UGi{uW0WJCt<6eLfEBvZLUMmn#|qlENJ zbV+26^zy^i%D8nVD^Q?%YU`ZtGXsndsxvb2J1kWpUNn{Ss zvKTy3bfi)S=l#m!qy=Yr9GoyVt7L56qs)nf&AW6-WRA^dU{ipB#0nJo8mzY6I?{BN z8M!Yi3!4_Xn+Z9WTS{4GZj(FNY8lASD>Ehm`B_~OnFHzjfm1`+y&8k}ePsdDf)}`p zQ^B@IhV8q`EJ?6^TbD%Uu&q9a0Exk;@Ef=u1#{A|Si*U76^85PzO20aH3&1~8fW)@ z0H3pvKe<+hYLhZM5>y*>Nn{Sys$+Ge9#0zQ>>Bos;C^*u_rB;*mRN&E0sBsu(_;DB6Dok$D@TtB1qk!s*n0%|wPsJ&mABMG(l=#uzJ zLG4S*0;WZcvaxZ8W3X1eQAX&C%3qfd`n)cQ%n@2~%&8zb)V_$dF|qL==KUp$A%r%`2z_6f7YU*7>XOJDA=#w4`LEI8se3iXYioa2uKEVq@_8JF zV7p0%?Pg_`B-l3TlE@sk4Tr0hQft&|hT^?RZp9S!7`O+NMNHe#Zlrhy^Jx0S zsA;j<9N*p~cr|@qLnz)RqgYnvOG44nC6PIb>-|`~n~RAMl|@(JL;>txjj`(}3z!zW z4MB9?iS}+GzHdae$Ja z+7X2@{c8;C?l(#?vFW-$M!0tmF0p%Z<5Q4c!hWR7PEJ`qcP?tpJFs~$- zAEbaW67g}ydEL1f1vIGwL-#kzLZyXnm4L3uTwz17;3@>tb{V9)hqXhhcuhI6vQST&?S*!f8eX6Zj`)nw4HI*DU8Pa z@u?~@pqG_}Obh5n*&`=}k(~xEL&J?JgZBz$rX*wba$ORcgLn5Cb^v_)g_~cbJt%yA zra-jYDTM8-A;jRnN4b&Gf`1_AIu?EphLpjorZ+_s*J=ul2%QNPR*pVdIo_qrw4@yG z&?S+%a@_tfj(!@I)q$6R8@)JkY|PypSE?v3Y~RSd~=3cTUlbl1I%Iy6((WH`U8EM{6bHzB3O<5R*k z++BCd_XOJDzx9W4=|hYABL!D5u@f1qvA)^88Y8!9cUJSf4Oox!Ii%o8 zz+tG{?UG^Jpv;m4+ge=`nZvf|+yh6v;WygNA|(vYfU+2AyVc@cW3=E6kl}8$TgKyF zWiBK<4(O7|9FG+gzw$Iwobet-C839R665>BtsC6PH!%O5S; z6{Ao!Ca{gHS*_g{?MQMlBlLb{fzl$hJU0Q3%tFGK)#8}5+t z`@Aw&5`Lf6C6PIPH+xfenz9Eju|IT0F`TwG*v&d$kF8@xWj@kJJ28zaPcp?S1!1BSbTmKu8in*+d|hv{k89{T7erJ z5w7kQJ1V`-zrkYfp6J};d2y>$=?(njm-xq<`Nyw_AIa)R0>*E!_*K*|{Tlvp5&0nf zE#k<#l)vhdc&|^QPmt)^rZazo#bUL4_0B1an6hD|d-bT9=_0UM!Q~Y}OP^6@Lu%=h zx+H$n2kRjQtJ~$#+Iqg>(IRdnbsEwc+cC#yih8V&7nNm9i`E8sK)7Ah!BMQSL$N!h z06G8GivYQnGD{M2b#C@jwoWFYa69A=mQFmy@X?w6E#l)&rgk_fup>lpuT-A?x& z%QarFvy4%?{9>$Hu*n{tw^Ka*x*_5pXf{w%T3Azts&Q;1*``O@doMSb-83@>9OU zYV{3P_eT&f&SnAsKXfsE7%a`y;{C4h;{D0*Zi~p?ed(SXM@2Kz_PO0&6o!EfE#-0V zOI*DVhCcrap`bhdvu-;F?%_YOE_56Ey1LxDHgVPI`lwZLo~GqHy4pe9jS^0wXeZWS z@NV6kkrUotovZqMi7OlU&X!Q?CyicPmHCm(;mx`v0zTKqh+s&J3JNF4JX zh7E+5WA$>~MtUh;6oX7@9{nbAyT0$@3QrbDHnYOA zQMx$E7PclyZu|R`IhO3nyLCy#^+BbRxLgF|6k9b75&;*}j8nRPP4Br{+0{#OYmU$? z9=Fq-uUih^Wrobd^WxZex(qIC&)RCQvJQS#8IH6%XyzK8B)%hrdmZRPXCaB$pNt&Y zrhBbjV2b=}?E*veWo0%c#rtbr5}8AOGYxo$u)_vNz!q_XIk~jtHYTS`Ok10Qoxd+D z7uOI=^}~W+Y}Vtmh|I{m&Pfp03eVOro1dch)`a2LqxnQH9k6r%c50x>Fw zL=8iq6uEdxnQ;mHiY|%3I9$*r5qN~Gf?0Zm+9qnj(TjFH?=)fvaxUG|#UdpYHFxfXCamfH(Z6m=EwK)i6AYiFjJof+qVUE_foa5lD} zl_?8?CDFtXuZSVBv{FzQG-^tX(U>APq7pDxtW;^4Xo&g$zps0HW&tA`kShB9zMk&y zec$W%zW4g|+irZ$$+jV{O7wi%(1`{QAGZxhREVvj;+WCk#6LxwW*6}3c)hgV6J`?f zbuDz}qnCB1!-xUF*y;%WTJ0z^MaO@-UapspyQseE<(k%Wx$s_Uy%EeL~&L4_di0+H$d_z{P^9ag^ug zhmPCmBdW%MzN$FsRb!-6HI~Ga9p31dJ#qM72kS+ypMA3K%tksFIp!GKbN8J;y;IqC zl*d3d$8FgWSJK^A6}_)yA9`Y^GuIxZ4=Nlhbb6-`DjX|x#Z(_uI95#V>w`I3k@02B zTKplA2cvxt9&q4;wyE4Lxn{$KnenzV!_8!*QN^UfsAl3aYM3+{wM^=aIwrM7y(SGz zii}1kE@J?ba$_KqdSeiiHe)c8{>Bg{#l}!3<;E#Y<{DhG*4CIYYiLs{=+~PNG0Ajs zW)e$SB7Tv>O>IT%a>m4wIHRboXnoFDqF4+}DV6{?DfS2MR4fJVS1bdTj}i^#z|#~f zfR`#(0#_@#fLj#Zz}<>f!1ooafv(Y_tOht$u@-oRVjZwcu^#xKVgqoGVk7XN;s9Xv zsiJHkuvKvoaE0Pv;LVCdfDb7S1^zlQEX5JPYZONUZ&Mrv{J!F7 z;46x!0{^bq1Z*55%EkcaDvkxNR2&DqLvcKCo8koEtBTFQe<)4_4jL=UCIQb-oD94{ z@igE%#TMXWic^5UQk)9>SaBL~=r~a}9eB24E6}ev1DI8u34Bs<7Vu5Q*}zW~=KzO~ z7iDvS3l--9+Z9g--mQ2BaJ%A}z_%680)D1=HgMDgQ8pjANO1u$qPP&aLGc{m4#jhU zdleS}4=bJrY-$!|=K~ijE(S&wF96=Jcp-4N;zjFo8M6$J3%$`0+c+9fF&fZ)r$AG& zG@xe`*?|6_$OhDJm>j?cG)|EXXt9NDMR!4Mh4mJL>6YRWC=MVnaRDR_?pCDY$1UV} z#v8U!3}FCfUvWIMoNb{T6jFitKWL%s-(w3r`C}Dm*-(rWpodNSY(+M0zapFVItxY1 zGb*s1@3m0&AGQT*Z$g&^mFN-koo%(8?GI;NSd83;2V_t)O_9znSENg8EEMIBsz8@s zSA^kCDbBDImqPKCZYVAl#oth*;_oU_@r#Po^?@P_p|(m+V{Db8rT9iGG_aT_DYBTCDzaqLij1I}6&XQyDKdh- ztH=miflom}86#+mA|vQ!ij1IZ6d6GuP-FysUXc;>fFdKP8!xSgGDgs8ij1Jk6&XQq zQe*_(s>lfXf+8d6Aw@>e8oU`3${0asC^CXxrN{_+iy|ZF!-|ZcFDWvDeyG?4tjEiD zpll3qw&GaewTk0_YZb=>A5okD{G}oz=tqi-paZa$3Cb8j=P5FRrWF}MH!CuN?owm~ zeOHkYv;uz>01b?wEsBhwmnkxWu2EzJeL#^B^m#=_&;yE$pl&wnvNl9er^d~)YFs&L z+&xwJyC>F&6QTmL9C0D6j>LSDzYx76uo$o#>(`vn-U;udxN5ezyv2Z%w(2ha2jlu~HnKqezFZQ>4SU zS}6HEr2>8YwS}_3xIwhgt+5u${tIn^cExOgZf#Y8p1hz)dk-lxKGZadO2&s7iii)6 z4|6RaT=2o3xzKsT4z0#)9o0vyViu5+Uqd@hPp0G9D?82{H&C~}MO)n$S-zEzRNUtyu- zv|a_6=oG~~OIsDR?PY#dqV2FEwKWZrz0|f?kv>Kh>Ei|qC667pKyThtf!>!57A@!t zuz!vUEQ+fwl>N8b0#E*)EwCtFwgpt=j9F<938q=rSHt?h(7S4}zNlPLl#aIrDqW!h z{pzw%4tmfQc+ehOV9p0^fla8oLKGLbl|pE>g)#^$Y@r;&&9+bh;UQb7gz%;cEX+?8 zS(w8sMJ)?+p(2Z{U6G}9w<4?dc12e0w-wp-eWu8+ZUr-O|3+&GUVIkuVFVvq=))7ZoFktTjK^aituso+1RpKBU5Ly&s21SbGs3dS04y3v#n1RG)U9 zoH0xMiG-Z+gE^>X2a%nz4OCbl#^czv#CU>Rvr?R2np~QI$2Ir_WFm^COv_LT_+lr@ z%HFdu8G>y5NKSo9wp^IE#Mln*HlD^7ivo8@lJOZEQ1W@+l;ZjYJM&#B?>%vXvpI2s zgcB!7IB|l66DLSGae{;sCrCJPf`k(%NZ3-4aN-0BCr*%X;sgmNPLOco1PLcjkZ|Gz z2`5fgG87aWEWT#rr!XG{TaG`r$e?9nU(fZ>C6RdtRpWg(9(xU#p3eE7tayn+%hXdK`fEt^)o($_HdI~ol4+g zedm;D-0#J^lg)Y$)=|Y$s5wxBKQ8X zt;4JFf>n2;wm>9ofk@Z_k+20KVGBgU7Knr`5DD8H5;is@Y+gv%ypXVYZOo|+i|0SL zng70n)>anjK+&agrrWAUnREm-pzeJ1hK#q%W04ydMf_=9fV?q>7#fI5SBddGJTt2o z;rU85?hWvalpba_;3-mw^E4h&@5v-1bh45G%wu&PrW=vcgU?f?gPm*^rn{pnmF5nN z17Lwj32zdwrJTY(Cui1N5e`CY7of96lYH$*dE24uyamrINiZ=3pu+Q{PAc! z=4lVc{CUdjRfz}1hjp$JGs2geHGxQq=Abu@rD3XZ53aoF&LpFr6zW@amUuGV^Mcjs z(-7lBXv2&M1?G)QJhny6oBzrBm1A7r+SkiG_{8{8aMJj9+TOB!s{HrQU)=xN?p`N# z8y)b>yym1hGt2UY@vOkC2~RZq(K4%I!S3rH+OzEIG;6kH7UOGySBI3%kcPKb%(wHmP>q+xJ`QX`Ee_p<} zmoGSpeM#X-v9a5%lRo;_YrlV^=okfX)rqYxI@@o#&z`NosL9W5ool(@xc{_oU%u>( zUY=NW__`Bol=B?VGK_sK3^Pl6LeE7bS}(b;AoNu3ONE~dfAh;iPhk`}ISsGXGMVE7 zmgOyIV@*q)?#Fw-)N2jD{6h`zYH!M)j3m-BzUfR$?8XhDjC`i1 zR);2cc3?zRsd54{Yo<%tNCY8NbNn-v!<7I=QutA1-uQLe0&W8_{y_! znQ0k#@TNV2VN_CwaGst)<-q*Ck=Sb7=Eak|LotWt|H5%z0Mjgazc(bjG2C)^{3-mm vO0L@+?u*A)d9a4KBZv}AVQ~$XmFE3k&!I??!@d-T0T?YMa^c4^zA66&K+A`E diff --git a/doc/LectureNotes/_build/html/_images/chapter3_25_2.png b/doc/LectureNotes/_build/html/_images/chapter3_25_2.png new file mode 100644 index 0000000000000000000000000000000000000000..98e9e3a9758194e6a1e94093cc9a6fd30e2aa5ec GIT binary patch literal 5116 zcmb7|2Ut_*+s024ra-|`0oiR2P-UrXkR>V{5padQ6lFsqdnbXvQj3Bf6l4Wa5KP!Z zKrn<_K|qG=O%aZJUf-1~d2=Q2$$9er&V4`kd#;@_H|EOSQNwc~ z>9Zq*{E^_uv4zRF|8&4Xn)<$qE;WIwhxebm2HKNsbdE0=fF9HC^1EL>u1e9FH@2+T zepJ=7m}vOp&|d@h6G-o=&lHu z-@L4+BsUs3SG`L1C%j*ZFfpE7+KkX2n_r8Fh;N^cB9PDRfwQBYUdYjrhHPy(NMK-_ z^v&$Hy=-u|R*V6x?IvJyX7V*(G+1P@$m$rkgGMu%o#3im=zU$M&Oy1RStwpsE1fyj z#BT(bTid({WP_9da{!0(MbS=U!xLvvN{=Y~V71VDEyiH)++#{uOH0A(VvBN-qTOQ! zKQ6dCH&!z2O#;Q!^U-uQo-|vDv9Rn>fr0=WZkdy)jFtj|fZ$%~^O7c|N=;WO+M$Ja zdNl*e&W@{oa{31A*2PMuH^mx&nF`BiWHaK83MC?)yjxd1B zOOI** zUJdxf)j!ICv(@PGaWaqmKa)^=*L=alY^Zdy@^wBTY(B7MSkPk`ANL6jFB+OkHOToP&fQ_$)~fIuGoD7uW?2Iv`J=?!2~%i zm{|ZRnfVc5xxpow0v~vo%yfsJL51WQ0T41hI3-l?LwBQ2#ga78#zb9u7G-dkxMvs8 z2iOg{Xy6;I!xbP=YG{mflNYfP^#MhhvY<|-(Z6CCcm)Afv^&8FU^<5W1Qcr+#zCET zua_RfvmfBuH~|-dYwmCyX&D<>S`jK_J=QEnaxrR=!Ue+FSohn~RRUF_RSzhIXj*G< zFa~uB%iev&QL||dRDoPw-Q0vr^FWX5$GM}&=?j#wVzaSl(jsJ?vX)%kOwT0?AT2g& ztb5AwK4k^l6M!|dFf&tpybWi|q-tUS z521Z+Y%4*i<@ra*qXFh#gH^sta?39j|Apg69oF7EDO%?5z+8DZI-OK4*Xcg|-6yRE z^FeXU$oK%-e_a}lT;;M=`i`mMm4CZFs&7S0H+4a@ROYXsO2OP`RZk@{S3u)LadW?A zkP~r*)GOY*H$t!uHrOtoFn)X<m|?W?&O1aR7}0r<^R zn;B{>pcqlBOl>^q5q+F58m*Vi%mQodM%F3X1I_K|X}i$x@!swO;{|gv@QnGP#EY&$ zK|#A6lEE9#@`P`1T4OUz7BTcqNK%SygT0e2wD>c&g1?{hfUfS-dzW%5UX1PQ@Koy* zGQ?)Mx91WqFgT7+U|V;<3L#(-LLIe+H<`bIV}ysiwLBqgnp`v9twHG3$BTxHhe0bH z>Wp_CN+8s^U!}P)Ynh&#nC`JXja?o9ozQdUr92@VRaq5v{8d7lyK1?H53e|y!VRvY z(s`6zqDI^4?Zd^9@#|>cy{7XZBse)@oU`Y(;l%>g7z650m1#*ynX97kfBWdaiS;Ao zFDGqDlFCo4#i-dT`R+!X`16-yJFa$5dbgPOEw?G^k>#yphq7o$ zwa(w#vCU)RdCkUlMPySPIctF#&*d7TuWA0I+N+{~s9wEk4`XqG0X5yW427I7OjdK!yk zD`XqZxG08~XWgQNNwCnx)QU0o+Kwsx&Or#ae1xnT$5xdYtyFi{4o#{)U_aKZGl;C# z3b@xQRt6eZ>pU0@3WK2{n(V{;hq)ulD73Cr@jr=*R(W5KOagDb+A%GHBi0I?M%2LQ z*LDk=m+CZ~gi{6v2676`;c^omZLd5EjXMGrB9ACNC47$$+Pr*`+gZgRZCjMFrqx?f zM0rT{4D7FIz?{yt-j);lR)7ET=6y3 zDHTW(qeo^wqgxR-3lOwciQ?=uRBbSN6DhK(7AZ28M17q{_^Ey&x@>xzEu`H#Ob$xb zBqSKP{5t=YiC1#v-A@krIn5llR>+WR3#4zoecGq!Z&BV`^}qDS&qsV#-JeZ1oX^8> z1C?6Q7%t$U_oXyHPTEmLD@41=ECCZ_L!GE~s!f{^*}Xlvd>yRTML5SM+UveGG=YV1 zw-ux3f$eZ9So6m+@f*9^h;Or;E&HA{EFA$UbKpX=`ov>q~WUG%&wCXQS z@#5(nFyF92j!n{RQ3Vve9!lmPU36KF*lHAq^ZdOZmt95AaK@kOsgp_#6zCsl)**$* zPT@S=_xVXrsFq&l7mwWenUbD5ZMQcdCvnvC*wUz)=dvd5#9(HaS5 z&*1EZk6k#JlBQu%KaJ_eymE^UU>7VOxz(@0$C7CqI`;C!?5~{2}J&k>g%NKh#{^Qen-NO|1a26i<14o*Bj-**Uh}0)I)bhl=?$b<24mxO~?Qzx6i`^dVA9qB!T)o?_uDohBv5UdGkl z4Ly$Bc*#rn^*618Z_1EZwNw0)1@W@S?XMma?UDxfL7j^WLV|y68z!G#ZTo)otV!pE zKgBgC3YTBpy4yPV`b%U9yYmgnvim*K|4cJqD$k9t-~w49yTUgs^L)`!$Gsf&`x(Nt z>^scDZ;|kefU@MnIaVG*U{cAbgEq){es8?h*JeadEc!Ck8ED1>Y(?#Z1x?Z>i!?9+3{`FVU^gO`xZwyF$*#46gty`?g{FQMaATr4wAg!Tc4IiwwmD?W z!*1>t7%a0!Mn1X6FJ|!idXp>hY{H9)t3_jUfuHCe5)3|(c8$XX);Wyhh zWe5|yB3ADv{Wv4JZz|-q^{Nkj%!%rPqVd0XVDKsU3!HR6+(?W|4i`@p;b)z2 zPO87+irNw^4yWnmKX))n00@drmmtShX&DVn!lA0%-Mln=jrNk6J-l1DqGXz^;0V>G z=Pj?^CYQWfIM>6?7(;IhYI3I+QrZ}NUP{OwiVF!UT8uLKGkT^_UcZ^s!nE;X_p)>bLVKRMMCWtFebt{Nw869o}fhevUEjSdvpZu3Al)4Zv2^QAW>U zaTrH{=7>$O>ZzejnelFw>1s9JZzPRlmz~pSv4#io^JK11;sAm*wrp0JWPu_Cu7z!t zl1)od_mC~)@`K@M=Fv~fqvaySI*Q%w%+}VrpL2bpfF1zn?wyfbmxpMYuSVN&`^H1b z^+~O{gYV>Q*5?0{bA9pzkrGyV<;BQ#Rz|TblK%M1C#A9_%0(&R>?~!G88PHmLzs|e z5_7r0Q-{h}>5r4(k8wCMG-$K$`~mX!EnU;05`VeluvcJ6WTs79tJXPf%M$kSvDe^J ztUDv5D@g>UT=CbZHd{LS))Xe5RzILP+F|X8QZ6jxmZ9X_p~>>w3*WHP=tFirp6|`A zo84yFSXaTbKI<9R7c+{_aGE5A;3tAbYHbLBH!g4JabNb zTL&cPFDyg|grwJ(Ty(8EiNL*M=#7_)h| z%V;_@B=7J@!#j{AW!-?;7?Mg=LxPvi&U&abtLrvBnK8%rGXMfee= z?8nE~VrR>O?i#*uP? G^#1_b4!?5% literal 0 HcmV?d00001 diff --git a/doc/LectureNotes/_build/html/_sources/chapter2.ipynb b/doc/LectureNotes/_build/html/_sources/chapter2.ipynb index d7f8222d5..1c18a18a0 100644 --- a/doc/LectureNotes/_build/html/_sources/chapter2.ipynb +++ b/doc/LectureNotes/_build/html/_sources/chapter2.ipynb @@ -4,66 +4,3340 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "# Resampling Methods\n", - "\n", - "## Introduction\n", - "\n", - "Resampling methods are an indispensable tool in modern\n", - "statistics. They involve repeatedly drawing samples from a training\n", - "set and refitting a model of interest on each sample in order to\n", - "obtain additional information about the fitted model. For example, in\n", - "order to estimate the variability of a linear regression fit, we can\n", - "repeatedly draw different samples from the training data, fit a linear\n", - "regression to each new sample, and then examine the extent to which\n", - "the resulting fits differ. Such an approach may allow us to obtain\n", - "information that would not be available from fitting the model only\n", - "once using the original training sample.\n", - "\n", - "Two resampling methods are often used in Machine Learning analyses,\n", - "1. The **bootstrap method**\n", - "\n", - "2. and **Cross-Validation**\n", - "\n", - "In addition there are several other methods such as the Jackknife and the Blocking methods. We will discuss in particular\n", - "cross-validation and the bootstrap method. \n", + "# Ridge and Lasso Regression\n", "\n", "\n", - "Resampling approaches can be computationally expensive, because they\n", - "involve fitting the same statistical method multiple times using\n", - "different subsets of the training data. However, due to recent\n", - "advances in computing power, the computational requirements of\n", - "resampling methods generally are not prohibitive. In this chapter, we\n", - "discuss two of the most commonly used resampling methods,\n", - "cross-validation and the bootstrap. Both methods are important tools\n", - "in the practical application of many statistical learning\n", - "procedures. For example, cross-validation can be used to estimate the\n", - "test error associated with a given statistical learning method in\n", - "order to evaluate its performance, or to select the appropriate level\n", - "of flexibility. The process of evaluating a model’s performance is\n", - "known as model assessment, whereas the process of selecting the proper\n", - "level of flexibility for a model is known as model selection. The\n", - "bootstrap is widely used.\n", + "\n", + "## Mathematical Interpretation of Ordinary Least Squares\n", + "\n", + "What is presented here is a mathematical analysis of various regression algorithms (ordinary least squares, Ridge and Lasso Regression). The analysis is based on an important algorithm in linear algebra, the so-called Singular Value Decomposition (SVD). \n", "\n", "\n", - "* Our simulations can be treated as *computer experiments*. This is particularly the case for Monte Carlo methods\n", + "We have shown that in ordinary least squares the optimal parameters $\\beta$ are given by" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}} = \\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The **hat** over $\\boldsymbol{\\beta}$ means we have the optimal parameters after minimization of the cost function.\n", "\n", - "* The results can be analysed with the same statistical tools as we would use analysing experimental data.\n", - "\n", - "* As in all experiments, we are looking for expectation values and an estimate of how accurate they are, i.e., possible sources for errors.\n", - "\n", - "## Reminder on Statistics\n", + "This means that our best model is defined as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{\\boldsymbol{y}}=\\boldsymbol{X}\\hat{\\boldsymbol{\\beta}} = \\boldsymbol{X}\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We now define a matrix" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{A}=\\boldsymbol{X}\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We can rewrite" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{\\boldsymbol{y}}=\\boldsymbol{X}\\hat{\\boldsymbol{\\beta}} = \\boldsymbol{A}\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The matrix $\\boldsymbol{A}$ has the important property that $\\boldsymbol{A}^2=\\boldsymbol{A}$. This is the definition of a projection matrix.\n", + "We can then interpret our optimal model $\\tilde{\\boldsymbol{y}}$ as being represented by an orthogonal projection of $\\boldsymbol{y}$ onto a space defined by the column vectors of $\\boldsymbol{X}$. In our case here the matrix $\\boldsymbol{A}$ is a square matrix. If it is a general rectangular matrix we have an oblique projection matrix.\n", "\n", "\n", - "* As in other experiments, many numerical experiments have two classes of errors:\n", - "\n", - " * Statistical errors\n", - "\n", - " * Systematical errors\n", "\n", "\n", - "* Statistical errors can be estimated using standard tools from statistics\n", + "We have defined the residual error as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\epsilon}=\\boldsymbol{y}-\\tilde{\\boldsymbol{y}}=\\left[\\boldsymbol{I}-\\boldsymbol{X}\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\right]\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The residual errors are then the projections of $\\boldsymbol{y}$ onto the orthogonal component of the space defined by the column vectors of $\\boldsymbol{X}$.\n", + "\n", + "\n", + "If the matrix $\\boldsymbol{X}$ is an orthogonal (or unitary in case of complex values) matrix, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=\\boldsymbol{X}\\boldsymbol{X}^T = \\boldsymbol{I}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "In this case the matrix $\\boldsymbol{A}$ becomes" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{A}=\\boldsymbol{X}\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T)=\\boldsymbol{I},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and we have the obvious case" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\epsilon}=\\boldsymbol{y}-\\tilde{\\boldsymbol{y}}=0.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "This serves also as a useful test of our codes. \n", + "\n", + "\n", + "\n", + "\n", + "## The singular value decomposition\n", + "\n", + "\n", + "The examples we have looked at so far are cases where we normally can\n", + "invert the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$. Using a polynomial expansion where we fit of various functions leads to\n", + "row vectors of the design matrix which are essentially orthogonal due\n", + "to the polynomial character of our model. Obtaining the inverse of the\n", + "design matrix is then often done via a so-called LU, QR or Cholesky\n", + "decomposition.\n", + "\n", + "\n", + "As we will also see in the first project, \n", + "this may\n", + "however not the be case in general and a standard matrix inversion\n", + "algorithm based on say LU, QR or Cholesky decomposition may lead to singularities. We will see examples of this below.\n", + "\n", + "There is however a way to circumvent this problem and also\n", + "gain some insights about the ordinary least squares approach, and\n", + "later shrinkage methods like Ridge and Lasso regressions.\n", + "\n", + "This is given by the **Singular Value Decomposition** (SVD) algorithm,\n", + "perhaps the most powerful linear algebra algorithm. The SVD provides\n", + "a numerically stable matrix decomposition that is used in a large\n", + "swath oc applications and the decomposition is always stable\n", + "numerically.\n", + "\n", + "In machine learning it plays a central role in dealing with for\n", + "example design matrices that may be near singular or singular.\n", + "Furthermore, as we will see here, the singular values can be related\n", + "to the covariance matrix (and thereby the correlation matrix) and in\n", + "turn the variance of a given quantity. It plays also an important role\n", + "in the principal component analysis where high-dimensional data can be\n", + "reduced to the statistically relevant features.\n", + "\n", + "\n", + "\n", + "\n", + "One of the typical problems we encounter with linear regression, in particular \n", + "when the matrix $\\boldsymbol{X}$ (our so-called design matrix) is high-dimensional, \n", + "are problems with near singular or singular matrices. The column vectors of $\\boldsymbol{X}$ \n", + "may be linearly dependent, normally referred to as super-collinearity. \n", + "This means that the matrix may be rank deficient and it is basically impossible to \n", + "to model the data using linear regression. As an example, consider the matrix" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\begin{align*}\n", + "\\mathbf{X} & = \\left[\n", + "\\begin{array}{rrr}\n", + "1 & -1 & 2\n", + "\\\\\n", + "1 & 0 & 1\n", + "\\\\\n", + "1 & 2 & -1\n", + "\\\\\n", + "1 & 1 & 0\n", + "\\end{array} \\right]\n", + "\\end{align*}\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The columns of $\\boldsymbol{X}$ are linearly dependent. We see this easily since the \n", + "the first column is the row-wise sum of the other two columns. The rank (more correct,\n", + "the column rank) of a matrix is the dimension of the space spanned by the\n", + "column vectors. Hence, the rank of $\\mathbf{X}$ is equal to the number\n", + "of linearly independent columns. In this particular case the matrix has rank 2.\n", + "\n", + "Super-collinearity of an $(n \\times p)$-dimensional design matrix $\\mathbf{X}$ implies\n", + "that the inverse of the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$ (the matrix we need to invert to solve the linear regression equations) is non-invertible. If we have a square matrix that does not have an inverse, we say this matrix singular. The example here demonstrates this" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\begin{align*}\n", + "\\boldsymbol{X} & = \\left[\n", + "\\begin{array}{rr}\n", + "1 & -1\n", + "\\\\\n", + "1 & -1\n", + "\\end{array} \\right].\n", + "\\end{align*}\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We see easily that $\\mbox{det}(\\boldsymbol{X}) = x_{11} x_{22} - x_{12} x_{21} = 1 \\times (-1) - 1 \\times (-1) = 0$. Hence, $\\mathbf{X}$ is singular and its inverse is undefined.\n", + "This is equivalent to saying that the matrix $\\boldsymbol{X}$ has at least an eigenvalue which is zero.\n", + "\n", + "\n", + "\n", + "If our design matrix $\\boldsymbol{X}$ which enters the linear regression problem" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "\n", + "
\n", + "\n", + "$$\n", + "\\begin{equation}\n", + "\\boldsymbol{\\beta} = (\\boldsymbol{X}^{T} \\boldsymbol{X})^{-1} \\boldsymbol{X}^{T} \\boldsymbol{y},\n", + "\\label{_auto1} \\tag{1}\n", + "\\end{equation}\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "has linearly dependent column vectors, we will not be able to compute the inverse\n", + "of $\\boldsymbol{X}^T\\boldsymbol{X}$ and we cannot find the parameters (estimators) $\\beta_i$. \n", + "The estimators are only well-defined if $(\\boldsymbol{X}^{T}\\boldsymbol{X})^{-1}$ exits. \n", + "This is more likely to happen when the matrix $\\boldsymbol{X}$ is high-dimensional. In this case it is likely to encounter a situation where \n", + "the regression parameters $\\beta_i$ cannot be estimated.\n", + "\n", + "A cheap *ad hoc* approach is simply to add a small diagonal component to the matrix to invert, that is we change" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^{T} \\boldsymbol{X} \\rightarrow \\boldsymbol{X}^{T} \\boldsymbol{X}+\\lambda \\boldsymbol{I},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where $\\boldsymbol{I}$ is the identity matrix. When we discuss **Ridge** regression this is actually what we end up evaluating. The parameter $\\lambda$ is called a hyperparameter. More about this later. \n", + "\n", + "\n", + "\n", + "\n", + "## Basic math of the SVD\n", + "\n", + "\n", + "From standard linear algebra we know that a square matrix $\\boldsymbol{X}$ can be diagonalized if and only it is \n", + "a so-called [normal matrix](https://en.wikipedia.org/wiki/Normal_matrix), that is if $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times n}$\n", + "we have $\\boldsymbol{X}\\boldsymbol{X}^T=\\boldsymbol{X}^T\\boldsymbol{X}$ or if $\\boldsymbol{X}\\in {\\mathbb{C}}^{n\\times n}$ we have $\\boldsymbol{X}\\boldsymbol{X}^{\\dagger}=\\boldsymbol{X}^{\\dagger}\\boldsymbol{X}$.\n", + "The matrix has then a set of eigenpairs" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "(\\lambda_1,\\boldsymbol{u}_1),\\dots, (\\lambda_n,\\boldsymbol{u}_n),\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and the eigenvalues are given by the diagonal matrix" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\Sigma}=\\mathrm{Diag}(\\lambda_1, \\dots,\\lambda_n).\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The matrix $\\boldsymbol{X}$ can be written in terms of an orthogonal/unitary transformation $\\boldsymbol{U}$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X} = \\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with $\\boldsymbol{U}\\boldsymbol{U}^T=\\boldsymbol{I}$ or $\\boldsymbol{U}\\boldsymbol{U}^{\\dagger}=\\boldsymbol{I}$.\n", + "\n", + "Not all square matrices are diagonalizable. A matrix like the one discussed above" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X} = \\begin{bmatrix} \n", + "1& -1 \\\\\n", + "1& -1\\\\\n", + "\\end{bmatrix}\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "is not diagonalizable, it is a so-called [defective matrix](https://en.wikipedia.org/wiki/Defective_matrix). It is easy to see that the condition\n", + "$\\boldsymbol{X}\\boldsymbol{X}^T=\\boldsymbol{X}^T\\boldsymbol{X}$ is not fulfilled. \n", + "\n", + "\n", + "\n", + "\n", + "\n", + "However, and this is the strength of the SVD algorithm, any general\n", + "matrix $\\boldsymbol{X}$ can be decomposed in terms of a diagonal matrix and\n", + "two orthogonal/unitary matrices. The [Singular Value Decompostion\n", + "(SVD) theorem](https://en.wikipedia.org/wiki/Singular_value_decomposition)\n", + "states that a general $m\\times n$ matrix $\\boldsymbol{X}$ can be written in\n", + "terms of a diagonal matrix $\\boldsymbol{\\Sigma}$ of dimensionality $m\\times n$\n", + "and two orthognal matrices $\\boldsymbol{U}$ and $\\boldsymbol{V}$, where the first has\n", + "dimensionality $m \\times m$ and the last dimensionality $n\\times n$.\n", + "We have then" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X} = \\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "As an example, the above defective matrix can be decomposed as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X} = \\frac{1}{\\sqrt{2}}\\begin{bmatrix} 1& 1 \\\\ 1& -1\\\\ \\end{bmatrix} \\begin{bmatrix} 2& 0 \\\\ 0& 0\\\\ \\end{bmatrix} \\frac{1}{\\sqrt{2}}\\begin{bmatrix} 1& -1 \\\\ 1& 1\\\\ \\end{bmatrix}=\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with eigenvalues $\\sigma_1=2$ and $\\sigma_2=0$. \n", + "The SVD exits always! \n", + "\n", + "The SVD\n", + "decomposition (singular values) gives eigenvalues \n", + "$\\sigma_i\\geq\\sigma_{i+1}$ for all $i$ and for dimensions larger than $i=p$, the\n", + "eigenvalues (singular values) are zero.\n", + "\n", + "In the general case, where our design matrix $\\boldsymbol{X}$ has dimension\n", + "$n\\times p$, the matrix is thus decomposed into an $n\\times n$\n", + "orthogonal matrix $\\boldsymbol{U}$, a $p\\times p$ orthogonal matrix $\\boldsymbol{V}$\n", + "and a diagonal matrix $\\boldsymbol{\\Sigma}$ with $r=\\mathrm{min}(n,p)$\n", + "singular values $\\sigma_i\\geq 0$ on the main diagonal and zeros filling\n", + "the rest of the matrix. There are at most $p$ singular values\n", + "assuming that $n > p$. In our regression examples for the nuclear\n", + "masses and the equation of state this is indeed the case, while for\n", + "the Ising model we have $p > n$. These are often cases that lead to\n", + "near singular or singular matrices.\n", + "\n", + "The columns of $\\boldsymbol{U}$ are called the left singular vectors while the columns of $\\boldsymbol{V}$ are the right singular vectors.\n", + "\n", + "\n", + "If we assume that $n > p$, then our matrix $\\boldsymbol{U}$ has dimension $n\n", + "\\times n$. The last $n-p$ columns of $\\boldsymbol{U}$ become however\n", + "irrelevant in our calculations since they are multiplied with the\n", + "zeros in $\\boldsymbol{\\Sigma}$.\n", + "\n", + "The economy-size decomposition removes extra rows or columns of zeros\n", + "from the diagonal matrix of singular values, $\\boldsymbol{\\Sigma}$, along with the columns\n", + "in either $\\boldsymbol{U}$ or $\\boldsymbol{V}$ that multiply those zeros in the expression. \n", + "Removing these zeros and columns can improve execution time\n", + "and reduce storage requirements without compromising the accuracy of\n", + "the decomposition.\n", + "\n", + "If $n > p$, we keep only the first $p$ columns of $\\boldsymbol{U}$ and $\\boldsymbol{\\Sigma}$ has dimension $p\\times p$. \n", + "If $p > n$, then only the first $n$ columns of $\\boldsymbol{V}$ are computed and $\\boldsymbol{\\Sigma}$ has dimension $n\\times n$.\n", + "The $n=p$ case is obvious, we retain the full SVD. \n", + "In general the economy-size SVD leads to less FLOPS and still conserving the desired accuracy.\n", + "\n", + "## Codes for the SVD" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "import numpy as np\n", + "# SVD inversion\n", + "def SVD(A):\n", + " ''' Takes as input a numpy matrix A and returns inv(A) based on singular value decomposition (SVD).\n", + " SVD is numerically more stable than the inversion algorithms provided by\n", + " numpy and scipy.linalg at the cost of being slower.\n", + " '''\n", + " U, S, VT = np.linalg.svd(A,full_matrices=True)\n", + " print('test U')\n", + " print( (np.transpose(U) @ U - U @np.transpose(U)))\n", + " print('test VT')\n", + " print( (np.transpose(VT) @ VT - VT @np.transpose(VT)))\n", + " print(U)\n", + " print(S)\n", + " print(VT)\n", + "\n", + " D = np.zeros((len(U),len(VT)))\n", + " for i in range(0,len(VT)):\n", + " D[i,i]=S[i]\n", + " return U @ D @ VT\n", + "\n", + "\n", + "X = np.array([ [1.0,-1.0], [1.0,-1.0]])\n", + "#X = np.array([[1, 2], [3, 4], [5, 6]])\n", + "\n", + "print(X)\n", + "C = SVD(X)\n", + "# Print the difference between the original matrix and the SVD one\n", + "print(C-X)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The matrix $\\boldsymbol{X}$ has columns that are linearly dependent. The first\n", + "column is the row-wise sum of the other two columns. The rank of a\n", + "matrix (the column rank) is the dimension of space spanned by the\n", + "column vectors. The rank of the matrix is the number of linearly\n", + "independent columns, in this case just $2$. We see this from the\n", + "singular values when running the above code. Running the standard\n", + "inversion algorithm for matrix inversion with $\\boldsymbol{X}^T\\boldsymbol{X}$ results\n", + "in the program terminating due to a singular matrix.\n", + "\n", + "\n", + "\n", + "The $U$, $S$, and $V$ matrices returned from the **svd()** function\n", + "cannot be multiplied directly.\n", + "\n", + "As you can see from the code, the $S$ vector must be converted into a\n", + "diagonal matrix. This may cause a problem as the size of the matrices\n", + "do not fit the rules of matrix multiplication, where the number of\n", + "columns in a matrix must match the number of rows in the subsequent\n", + "matrix.\n", + "\n", + "If you wish to include the zero singular values, you will need to\n", + "resize the matrices and set up a diagonal matrix as done in the above\n", + "example\n", + "\n", + "\n", + "\n", + "\n", + "\n", + "## Mathematics of the SVD and implications\n", + "\n", + "Let us take a closer look at the mathematics of the SVD and the various implications for machine learning studies.\n", + "\n", + "Our starting point is our design matrix $\\boldsymbol{X}$ of dimension $n\\times p$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}=\\begin{bmatrix}\n", + "x_{0,0} & x_{0,1} & x_{0,2}& \\dots & \\dots x_{0,p-1}\\\\\n", + "x_{1,0} & x_{1,1} & x_{1,2}& \\dots & \\dots x_{1,p-1}\\\\\n", + "x_{2,0} & x_{2,1} & x_{2,2}& \\dots & \\dots x_{2,p-1}\\\\\n", + "\\dots & \\dots & \\dots & \\dots \\dots & \\dots \\\\\n", + "x_{n-2,0} & x_{n-2,1} & x_{n-2,2}& \\dots & \\dots x_{n-2,p-1}\\\\\n", + "x_{n-1,0} & x_{n-1,1} & x_{n-1,2}& \\dots & \\dots x_{n-1,p-1}\\\\\n", + "\\end{bmatrix}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We can SVD decompose our matrix as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}=\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where $\\boldsymbol{U}$ is an orthogonal matrix of dimension $n\\times n$, meaning that $\\boldsymbol{U}\\boldsymbol{U}^T=\\boldsymbol{U}^T\\boldsymbol{U}=\\boldsymbol{I}_n$. Here $\\boldsymbol{I}_n$ is the unit matrix of dimension $n \\times n$.\n", + "\n", + "Similarly, $\\boldsymbol{V}$ is an orthogonal matrix of dimension $p\\times p$, meaning that $\\boldsymbol{V}\\boldsymbol{V}^T=\\boldsymbol{V}^T\\boldsymbol{V}=\\boldsymbol{I}_p$. Here $\\boldsymbol{I}_n$ is the unit matrix of dimension $p \\times p$.\n", + "\n", + "Finally $\\boldsymbol{\\Sigma}$ contains the singular values $\\sigma_i$. This matrix has dimension $n\\times p$ and the singular values $\\sigma_i$ are all positive. The non-zero values are ordered in descending order, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\sigma_0 > \\sigma_1 > \\sigma_2 > \\dots > \\sigma_{p-1} > 0.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "All values beyond $p-1$ are all zero.\n", + "\n", + "\n", + "As an example, consider the following $3\\times 2$ example for the matrix $\\boldsymbol{\\Sigma}$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\Sigma}=\n", + "\\begin{bmatrix}\n", + "2& 0 \\\\\n", + "0 & 1 \\\\\n", + "0 & 0 \\\\\n", + "\\end{bmatrix}\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The singular values are $\\sigma_0=2$ and $\\sigma_1=1$. It is common to rewrite the matrix $\\boldsymbol{\\Sigma}$ as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\Sigma}=\n", + "\\begin{bmatrix}\n", + "\\boldsymbol{\\tilde{\\Sigma}}\\\\\n", + "\\boldsymbol{0}\\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\tilde{\\Sigma}}=\n", + "\\begin{bmatrix}\n", + "2& 0 \\\\\n", + "0 & 1 \\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "contains only the singular values. Note also (and we will use this below) that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma}=\n", + "\\begin{bmatrix}\n", + "4& 0 \\\\\n", + "0 & 1 \\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which is a $2\\times 2 $ matrix while" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\Sigma}\\boldsymbol{\\Sigma}^T=\n", + "\\begin{bmatrix}\n", + "4& 0 & 0\\\\\n", + "0 & 1 & 0\\\\\n", + "0 & 0 & 0\\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "is a $3\\times 3 $ matrix. The last row and column of this last matrix\n", + "contain only zeros. This will have important consequences for our SVD\n", + "decomposition of the design matrix.\n", + "\n", + "\n", + "\n", + "The matrix that may cause problems for us is $\\boldsymbol{X}^T\\boldsymbol{X}$. Using the SVD we can rewrite this matrix as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{U}^T\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and using the orthogonality of the matrix $\\boldsymbol{U}$ we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma}\\boldsymbol{V}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We define $\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma}=\\tilde{\\boldsymbol{\\Sigma}}^2$ which is a diagonal matrix containing only the singular values squared. It has dimensionality $p \\times p$.\n", + "\n", + "This means, using the orthogonality of $\\boldsymbol{V}$, that we get" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=\\tilde{\\boldsymbol{\\Sigma}}^2.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We can now insert the result for the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$ into our equation for ordinary least squares where" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{y}_{\\mathrm{OLS}}=\\boldsymbol{X}\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and using our SVD decomposition of $\\boldsymbol{X}$ we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{y}_{\\mathrm{OLS}}=\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T\\tilde{\\boldsymbol{\\Sigma}}^{-2}\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{U}^T\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which gives us, using the orthogonality of the matrices $\\boldsymbol{U}$ and $\\boldsymbol{V}$," + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{y}_{\\mathrm{OLS}}=\\boldsymbol{U}\\boldsymbol{U}^T\\boldsymbol{y}=\\sum_{i=0}^{p-1}\\boldsymbol{u}_i\\boldsymbol{u}^T_j\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Note here that when we perform the multiplication of the various matrices, the orthogonal vectors of the matrix $\\boldsymbol{U}$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{U}=[\\boldsymbol{u}_0,\\boldsymbol{u}_1,\\dots,\\boldsymbol{u}_{n-1}],\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "that belong to $i>p-1$, result in only zeros when we perform the multiplications. This means that the sum above has non-zero elements only up to $i=p-1$. This corresponds also to the number of singular values (these are all non-zero).\n", + "\n", + "It means that the ordinary least square model (with the optimal parameters) $\\boldsymbol{\\tilde{y}}$, corresponds to an orthogonal transformation of the output (or target) vector $\\boldsymbol{y}$ by the vectors of the matrix $\\boldsymbol{U}$.\n", + "\n", + "\n", + "## Further properties (important for our analyses later)\n", + "\n", + "Let us study again $\\boldsymbol{X}^T\\boldsymbol{X}$ in terms of our SVD," + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{U}^T\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T=\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma}\\boldsymbol{V}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "If we now multiply from the right with $\\boldsymbol{V}$ (using the orthogonality of $\\boldsymbol{V}$) we get" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)\\boldsymbol{V}=\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "This means the vectors $\\boldsymbol{v}_i$ of the orthogonal matrix $\\boldsymbol{V}$ are the eigenvectors of the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$\n", + "with eigenvalues given by the singular values squared, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)\\boldsymbol{v}_i=\\boldsymbol{v}_i\\sigma_i^2.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Similarly, if we use the SVD decomposition for the matrix $\\boldsymbol{X}\\boldsymbol{X}^T$, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}\\boldsymbol{X}^T=\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{U}^T=\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{\\Sigma}^T\\boldsymbol{U}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "If we now multiply from the right with $\\boldsymbol{U}$ (using the orthogonality of $\\boldsymbol{U}$) we get" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\left(\\boldsymbol{X}\\boldsymbol{X}^T\\right)\\boldsymbol{U}=\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{\\Sigma}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "This means the vectors $\\boldsymbol{u}_i$ of the orthogonal matrix $\\boldsymbol{U}$ are the eigenvectors of the matrix $\\boldsymbol{X}\\boldsymbol{X}^T$\n", + "with eigenvalues given by the singular values squared, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\left(\\boldsymbol{X}\\boldsymbol{X}^T\\right)\\boldsymbol{u}_i=\\boldsymbol{u}_i\\sigma_i^2.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "**Important note**: we have defined our design matrix $\\boldsymbol{X}$ to be an\n", + "$n\\times p$ matrix. In most supervised learning cases we have that $n\n", + "\\ge p$, and quite often we have $n >> p$. For linear algebra based methods like ordinary least squares or Ridge regression, this leads to a matrix $\\boldsymbol{X}^T\\boldsymbol{X}$ which is small and thereby easier to handle from a computational point of view (in terms of number of floating point operations).\n", + "\n", + "In our lectures, the number of columns will\n", + "always refer to the number of features in our data set, while the\n", + "number of rows represents the number of data inputs. Note that in\n", + "other texts you may find the opposite notation. This has consequences\n", + "for the definition of for example the covariance matrix and its relation to the SVD.\n", + "\n", + "\n", + "## Meet the Covariance Matrix\n", + "\n", + "\n", + "Before we move on to a discussion of Ridge and Lasso regression, we want to show an important example of the above.\n", + "\n", + "We have already noted that the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$ in ordinary\n", + "least squares is proportional to the second derivative of the cost\n", + "function, that is we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{\\partial^2 C(\\boldsymbol{\\beta})}{\\partial \\boldsymbol{\\beta}^T\\partial \\boldsymbol{\\beta}} =\\frac{2}{n}\\boldsymbol{X}^T\\boldsymbol{X}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "This quantity defines was what is called the Hessian matrix (the second derivative of a function we want to optimize).\n", + "\n", + "The Hessian matrix plays an important role and is defined in this course as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{H}=\\boldsymbol{X}^T\\boldsymbol{X}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The Hessian matrix for ordinary least squares is also proportional to\n", + "the covariance matrix. This means also that we can use the SVD to find\n", + "the eigenvalues of the covariance matrix and the Hessian matrix in\n", + "terms of the singular values. Let us develop these arguments, as they will play an important role in our machine learning studies.\n", + "\n", + "\n", + "\n", + "Before we discuss the link between for example Ridge regression and the singular value decomposition, we need to remind ourselves about\n", + "the definition of the covariance and the correlation function. These are quantities that play a central role in machine learning methods.\n", + "\n", + "Suppose we have defined two vectors\n", + "$\\hat{x}$ and $\\hat{y}$ with $n$ elements each. The covariance matrix $\\boldsymbol{C}$ is defined as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{C}[\\boldsymbol{x},\\boldsymbol{y}] = \\begin{bmatrix} \\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{x}] & \\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}] \\\\\n", + " \\mathrm{cov}[\\boldsymbol{y},\\boldsymbol{x}] & \\mathrm{cov}[\\boldsymbol{y},\\boldsymbol{y}] \\\\\n", + " \\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where for example" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}] =\\frac{1}{n} \\sum_{i=0}^{n-1}(x_i- \\overline{x})(y_i- \\overline{y}).\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "With this definition and recalling that the variance is defined as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\mathrm{var}[\\boldsymbol{x}]=\\frac{1}{n} \\sum_{i=0}^{n-1}(x_i- \\overline{x})^2,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "we can rewrite the covariance matrix as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{C}[\\boldsymbol{x},\\boldsymbol{y}] = \\begin{bmatrix} \\mathrm{var}[\\boldsymbol{x}] & \\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}] \\\\\n", + " \\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}] & \\mathrm{var}[\\boldsymbol{y}] \\\\\n", + " \\end{bmatrix}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "**Note:** we have used $1/n$ in the above definitions of the *sample* variance and covariance. We assume then that we can calculate the exact mean value. \n", + "What you will find in essentially all statistics texts are equations\n", + "with a factor $1/(n-1)$. This is called [Bessel's correction](https://mathworld.wolfram.com/BesselsCorrection.html). This\n", + "method corrects the bias in the estimation of the population variance\n", + "and covariance. It also partially corrects the bias in the estimation\n", + "of the population standard deviation. If you use a library like\n", + "**Scikit-Learn** or **nunmpy's** function calculate the covariance, this\n", + "quantity will be computed with a factor $1/(n-1)$.\n", + "\n", + "\n", + "The covariance takes values between zero and infinity and may thus\n", + "lead to problems with loss of numerical precision for particularly\n", + "large values. It is common to scale the covariance matrix by\n", + "introducing instead the correlation matrix defined via the so-called\n", + "correlation function" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\mathrm{corr}[\\boldsymbol{x},\\boldsymbol{y}]=\\frac{\\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}]}{\\sqrt{\\mathrm{var}[\\boldsymbol{x}] \\mathrm{var}[\\boldsymbol{y}]}}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The correlation function is then given by values $\\mathrm{corr}[\\boldsymbol{x},\\boldsymbol{y}]\n", + "\\in [-1,1]$. This avoids eventual problems with too large values. We\n", + "can then define the correlation matrix for the two vectors $\\boldsymbol{x}$\n", + "and $\\boldsymbol{y}$ as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{K}[\\boldsymbol{x},\\boldsymbol{y}] = \\begin{bmatrix} 1 & \\mathrm{corr}[\\boldsymbol{x},\\boldsymbol{y}] \\\\\n", + " \\mathrm{corr}[\\boldsymbol{y},\\boldsymbol{x}] & 1 \\\\\n", + " \\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "In the above example this is the function we constructed using **pandas**.\n", + "\n", + "\n", + "\n", + "In our derivation of the various regression algorithms like **Ordinary Least Squares** or **Ridge regression**\n", + "we defined the design/feature matrix $\\boldsymbol{X}$ as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}=\\begin{bmatrix}\n", + "x_{0,0} & x_{0,1} & x_{0,2}& \\dots & \\dots x_{0,p-1}\\\\\n", + "x_{1,0} & x_{1,1} & x_{1,2}& \\dots & \\dots x_{1,p-1}\\\\\n", + "x_{2,0} & x_{2,1} & x_{2,2}& \\dots & \\dots x_{2,p-1}\\\\\n", + "\\dots & \\dots & \\dots & \\dots \\dots & \\dots \\\\\n", + "x_{n-2,0} & x_{n-2,1} & x_{n-2,2}& \\dots & \\dots x_{n-2,p-1}\\\\\n", + "x_{n-1,0} & x_{n-1,1} & x_{n-1,2}& \\dots & \\dots x_{n-1,p-1}\\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times p}$, with the predictors/features $p$ refering to the column numbers and the\n", + "entries $n$ being the row elements.\n", + "We can rewrite the design/feature matrix in terms of its column vectors as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}=\\begin{bmatrix} \\boldsymbol{x}_0 & \\boldsymbol{x}_1 & \\boldsymbol{x}_2 & \\dots & \\dots & \\boldsymbol{x}_{p-1}\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with a given vector" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{x}_i^T = \\begin{bmatrix}x_{0,i} & x_{1,i} & x_{2,i}& \\dots & \\dots x_{n-1,i}\\end{bmatrix}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "With these definitions, we can now rewrite our $2\\times 2$\n", + "correlation/covariance matrix in terms of a moe general design/feature\n", + "matrix $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times p}$. This leads to a $p\\times p$\n", + "covariance matrix for the vectors $\\boldsymbol{x}_i$ with $i=0,1,\\dots,p-1$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{C}[\\boldsymbol{x}] = \\begin{bmatrix}\n", + "\\mathrm{var}[\\boldsymbol{x}_0] & \\mathrm{cov}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] & \\mathrm{cov}[\\boldsymbol{x}_0,\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{cov}[\\boldsymbol{x}_0,\\boldsymbol{x}_{p-1}]\\\\\n", + "\\mathrm{cov}[\\boldsymbol{x}_1,\\boldsymbol{x}_0] & \\mathrm{var}[\\boldsymbol{x}_1] & \\mathrm{cov}[\\boldsymbol{x}_1,\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{cov}[\\boldsymbol{x}_1,\\boldsymbol{x}_{p-1}]\\\\\n", + "\\mathrm{cov}[\\boldsymbol{x}_2,\\boldsymbol{x}_0] & \\mathrm{cov}[\\boldsymbol{x}_2,\\boldsymbol{x}_1] & \\mathrm{var}[\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{cov}[\\boldsymbol{x}_2,\\boldsymbol{x}_{p-1}]\\\\\n", + "\\dots & \\dots & \\dots & \\dots & \\dots & \\dots \\\\\n", + "\\dots & \\dots & \\dots & \\dots & \\dots & \\dots \\\\\n", + "\\mathrm{cov}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_0] & \\mathrm{cov}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_1] & \\mathrm{cov}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_{2}] & \\dots & \\dots & \\mathrm{var}[\\boldsymbol{x}_{p-1}]\\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and the correlation matrix" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{K}[\\boldsymbol{x}] = \\begin{bmatrix}\n", + "1 & \\mathrm{corr}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] & \\mathrm{corr}[\\boldsymbol{x}_0,\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{corr}[\\boldsymbol{x}_0,\\boldsymbol{x}_{p-1}]\\\\\n", + "\\mathrm{corr}[\\boldsymbol{x}_1,\\boldsymbol{x}_0] & 1 & \\mathrm{corr}[\\boldsymbol{x}_1,\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{corr}[\\boldsymbol{x}_1,\\boldsymbol{x}_{p-1}]\\\\\n", + "\\mathrm{corr}[\\boldsymbol{x}_2,\\boldsymbol{x}_0] & \\mathrm{corr}[\\boldsymbol{x}_2,\\boldsymbol{x}_1] & 1 & \\dots & \\dots & \\mathrm{corr}[\\boldsymbol{x}_2,\\boldsymbol{x}_{p-1}]\\\\\n", + "\\dots & \\dots & \\dots & \\dots & \\dots & \\dots \\\\\n", + "\\dots & \\dots & \\dots & \\dots & \\dots & \\dots \\\\\n", + "\\mathrm{corr}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_0] & \\mathrm{corr}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_1] & \\mathrm{corr}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_{2}] & \\dots & \\dots & 1\\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The Numpy function **np.cov** calculates the covariance elements using\n", + "the factor $1/(n-1)$ instead of $1/n$ since it assumes we do not have\n", + "the exact mean values. The following simple function uses the\n", + "**np.vstack** function which takes each vector of dimension $1\\times n$\n", + "and produces a $2\\times n$ matrix $\\boldsymbol{W}$\n", + "\n", + "Note that this assumes you have the features as the rows, and the inputs as columns, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{W} = \\begin{bmatrix} x_0 & x_1 & x_2 & \\dots & x_{n-2} & x_{n-1} \\\\\n", + " y_0 & y_1 & y_2 & \\dots & y_{n-2} & y_{n-1} \\\\\n", + " \\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which in turn is converted into into the $2\\times 2$ covariance matrix\n", + "$\\boldsymbol{C}$ via the Numpy function **np.cov()**. We note that we can also calculate\n", + "the mean value of each set of samples $\\boldsymbol{x}$ etc using the Numpy\n", + "function **np.mean(x)**. We can also extract the eigenvalues of the\n", + "covariance matrix through the **np.linalg.eig()** function." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "# Importing various packages\n", + "import numpy as np\n", + "n = 100\n", + "x = np.random.normal(size=n)\n", + "print(np.mean(x))\n", + "y = 4+3*x+np.random.normal(size=n)\n", + "print(np.mean(y))\n", + "W = np.vstack((x, y))\n", + "C = np.cov(W)\n", + "print(C)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The previous example can be converted into the correlation matrix by\n", + "simply scaling the matrix elements with the variances. We should also\n", + "subtract the mean values for each column. This leads to the following\n", + "code which sets up the correlations matrix for the previous example in\n", + "a more brute force way. Here we scale the mean values for each column of the design matrix, calculate the relevant mean values and variances and then finally set up the $2\\times 2$ correlation matrix (since we have only two vectors)." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "import numpy as np\n", + "n = 100\n", + "# define two vectors \n", + "x = np.random.random(size=n)\n", + "y = 4+3*x+np.random.normal(size=n)\n", + "#scaling the x and y vectors \n", + "x = x - np.mean(x)\n", + "y = y - np.mean(y)\n", + "variance_x = np.sum(x@x)/n\n", + "variance_y = np.sum(y@y)/n\n", + "print(variance_x)\n", + "print(variance_y)\n", + "cov_xy = np.sum(x@y)/n\n", + "cov_xx = np.sum(x@x)/n\n", + "cov_yy = np.sum(y@y)/n\n", + "C = np.zeros((2,2))\n", + "C[0,0]= cov_xx/variance_x\n", + "C[1,1]= cov_yy/variance_y\n", + "C[0,1]= cov_xy/np.sqrt(variance_y*variance_x)\n", + "C[1,0]= C[0,1]\n", + "print(C)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We see that the matrix elements along the diagonal are one as they\n", + "should be and that the matrix is symmetric. Furthermore, diagonalizing\n", + "this matrix we easily see that it is a positive definite matrix.\n", + "\n", + "The above procedure with **numpy** can be made more compact if we use **pandas**.\n", + "\n", + "\n", + "\n", + "We whow here how we can set up the correlation matrix using **pandas**, as done in this simple code" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "import numpy as np\n", + "import pandas as pd\n", + "n = 10\n", + "x = np.random.normal(size=n)\n", + "x = x - np.mean(x)\n", + "y = 4+3*x+np.random.normal(size=n)\n", + "y = y - np.mean(y)\n", + "# Note that we transpose the matrix in order to stay with our ordering n x p\n", + "X = (np.vstack((x, y))).T\n", + "print(X)\n", + "Xpd = pd.DataFrame(X)\n", + "print(Xpd)\n", + "correlation_matrix = Xpd.corr()\n", + "print(correlation_matrix)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We expand this model to the Franke function discussed earlier." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "# Common imports\n", + "import numpy as np\n", + "import pandas as pd\n", + "\n", + "\n", + "def FrankeFunction(x,y):\n", + "\tterm1 = 0.75*np.exp(-(0.25*(9*x-2)**2) - 0.25*((9*y-2)**2))\n", + "\tterm2 = 0.75*np.exp(-((9*x+1)**2)/49.0 - 0.1*(9*y+1))\n", + "\tterm3 = 0.5*np.exp(-(9*x-7)**2/4.0 - 0.25*((9*y-3)**2))\n", + "\tterm4 = -0.2*np.exp(-(9*x-4)**2 - (9*y-7)**2)\n", + "\treturn term1 + term2 + term3 + term4\n", + "\n", + "\n", + "def create_X(x, y, n ):\n", + "\tif len(x.shape) > 1:\n", + "\t\tx = np.ravel(x)\n", + "\t\ty = np.ravel(y)\n", + "\n", + "\tN = len(x)\n", + "\tl = int((n+1)*(n+2)/2)\t\t# Number of elements in beta\n", + "\tX = np.ones((N,l))\n", + "\n", + "\tfor i in range(1,n+1):\n", + "\t\tq = int((i)*(i+1)/2)\n", + "\t\tfor k in range(i+1):\n", + "\t\t\tX[:,q+k] = (x**(i-k))*(y**k)\n", + "\n", + "\treturn X\n", + "\n", + "\n", + "# Making meshgrid of datapoints and compute Franke's function\n", + "n = 4\n", + "N = 100\n", + "x = np.sort(np.random.uniform(0, 1, N))\n", + "y = np.sort(np.random.uniform(0, 1, N))\n", + "z = FrankeFunction(x, y)\n", + "X = create_X(x, y, n=n) \n", + "\n", + "Xpd = pd.DataFrame(X)\n", + "# subtract the mean values and set up the covariance matrix\n", + "Xpd = Xpd - Xpd.mean()\n", + "covariance_matrix = Xpd.cov()\n", + "print(covariance_matrix)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We note here that the covariance is zero for the first rows and\n", + "columns since all matrix elements in the design matrix were set to one\n", + "(we are fitting the function in terms of a polynomial of degree $n$).\n", + "\n", + "This means that the variance for these elements will be zero and will\n", + "cause problems when we set up the correlation matrix. We can simply\n", + "drop these elements and construct a correlation\n", + "matrix without these elements. \n", + "\n", + "\n", + "\n", + "We can rewrite the covariance matrix in a more compact form in terms of the design/feature matrix $\\boldsymbol{X}$ as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{C}[\\boldsymbol{x}] = \\frac{1}{n}\\boldsymbol{X}^T\\boldsymbol{X}= \\mathbb{E}[\\boldsymbol{X}^T\\boldsymbol{X}].\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "To see this let us simply look at a design matrix $\\boldsymbol{X}\\in {\\mathbb{R}}^{2\\times 2}$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}=\\begin{bmatrix}\n", + "x_{00} & x_{01}\\\\\n", + "x_{10} & x_{11}\\\\\n", + "\\end{bmatrix}=\\begin{bmatrix}\n", + "\\boldsymbol{x}_{0} & \\boldsymbol{x}_{1}\\\\\n", + "\\end{bmatrix}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "If we then compute the expectation value (note the $1/n$ factor instead of $1/(n-1)$)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\mathbb{E}[\\boldsymbol{X}^T\\boldsymbol{X}] = \\frac{1}{n}\\boldsymbol{X}^T\\boldsymbol{X}=\\frac{1}{n}\\begin{bmatrix}\n", + "x_{00}^2+x_{10}^2 & x_{00}x_{01}+x_{10}x_{11}\\\\\n", + "x_{01}x_{00}+x_{11}x_{10} & x_{01}^2+x_{11}^2\\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which is just" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{C}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] = \\boldsymbol{C}[\\boldsymbol{x}]=\\begin{bmatrix} \\mathrm{var}[\\boldsymbol{x}_0] & \\mathrm{cov}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] \\\\\n", + " \\mathrm{cov}[\\boldsymbol{x}_1,\\boldsymbol{x}_0] & \\mathrm{var}[\\boldsymbol{x}_1] \\\\\n", + " \\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where we wrote $$\\boldsymbol{C}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] = \\boldsymbol{C}[\\boldsymbol{x}]$$ to indicate that this is the covariance of the vectors $\\boldsymbol{x}$ of the design/feature matrix $\\boldsymbol{X}$.\n", + "\n", + "It is easy to generalize this to a matrix $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times p}$.\n", + "\n", + "\n", + "\n", + "## Linking with the SVD\n", + "\n", + "We saw earlier that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{U}^T\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T=\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma}\\boldsymbol{V}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Since the matrices here have dimension $p\\times p$, with $p$ corresponding to the singular values, we defined earlier the matrix" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma} = \\begin{bmatrix} \\tilde{\\boldsymbol{\\Sigma}} & \\boldsymbol{0}\\\\ \\end{bmatrix}\\begin{bmatrix} \\tilde{\\boldsymbol{\\Sigma}} \\\\ \\boldsymbol{0}\\\\ \\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where the tilde-matrix $\\tilde{\\boldsymbol{\\Sigma}}$ is a matrix of dimension $p\\times p$ containing only the singular values $\\sigma_i$, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{\\boldsymbol{\\Sigma}}=\\begin{bmatrix} \\sigma_0 & 0 & 0 & \\dots & 0 & 0 \\\\\n", + " 0 & \\sigma_1 & 0 & \\dots & 0 & 0 \\\\\n", + "\t\t\t\t 0 & 0 & \\sigma_2 & \\dots & 0 & 0 \\\\\n", + "\t\t\t\t 0 & 0 & 0 & \\dots & \\sigma_{p-2} & 0 \\\\\n", + "\t\t\t\t 0 & 0 & 0 & \\dots & 0 & \\sigma_{p-1} \\\\\n", + "\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "meaning we can write" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=\\boldsymbol{V}\\tilde{\\boldsymbol{\\Sigma}}^2\\boldsymbol{V}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Multiplying from the right with $\\boldsymbol{V}$ (using the orthogonality of $\\boldsymbol{V}$) we get" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)\\boldsymbol{V}=\\boldsymbol{V}\\tilde{\\boldsymbol{\\Sigma}}^2.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "This means the vectors $\\boldsymbol{v}_i$ of the orthogonal matrix $\\boldsymbol{V}$\n", + "are the eigenvectors of the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$ with eigenvalues\n", + "given by the singular values squared, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)\\boldsymbol{v}_i=\\boldsymbol{v}_i\\sigma_i^2.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "In other words, each non-zero singular value of $\\boldsymbol{X}$ is a positive\n", + "square root of an eigenvalue of $\\boldsymbol{X}^T\\boldsymbol{X}$. It means also that\n", + "the columns of $\\boldsymbol{V}$ are the eigenvectors of\n", + "$\\boldsymbol{X}^T\\boldsymbol{X}$. Since we have ordered the singular values of\n", + "$\\boldsymbol{X}$ in a descending order, it means that the column vectors\n", + "$\\boldsymbol{v}_i$ are hierarchically ordered by how much correlation they\n", + "encode from the columns of $\\boldsymbol{X}$. \n", + "\n", + "\n", + "Note that these are also the eigenvectors and eigenvalues of the\n", + "Hessian matrix.\n", + "\n", + "If we now recall the definition of the covariance matrix (not using\n", + "Bessel's correction) we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{C}[\\boldsymbol{X}]=\\frac{1}{n}\\boldsymbol{X}^T\\boldsymbol{X},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "meaning that every squared non-singular value of $\\boldsymbol{X}$ divided by $n$ (\n", + "the number of samples) are the eigenvalues of the covariance\n", + "matrix. Every singular value of $\\boldsymbol{X}$ is thus a positive square\n", + "root of an eigenvalue of $\\boldsymbol{X}^T\\boldsymbol{X}$. If the matrix $\\boldsymbol{X}$ is\n", + "self-adjoint, the singular values of $\\boldsymbol{X}$ are equal to the\n", + "absolute value of the eigenvalues of $\\boldsymbol{X}$.\n", + "\n", + "\n", + "For $\\boldsymbol{X}\\boldsymbol{X}^T$ we found" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}\\boldsymbol{X}^T=\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T\\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{U}^T=\\boldsymbol{U}\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma}\\boldsymbol{U}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Since the matrices here have dimension $n\\times n$, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\Sigma}\\boldsymbol{\\Sigma}^T = \\begin{bmatrix} \\tilde{\\boldsymbol{\\Sigma}} \\\\ \\boldsymbol{0}\\\\ \\end{bmatrix}\\begin{bmatrix} \\tilde{\\boldsymbol{\\Sigma}} \\boldsymbol{0}\\\\ \\end{bmatrix}=\\begin{bmatrix} \\tilde{\\boldsymbol{\\Sigma}} & \\boldsymbol{0} \\\\ \\boldsymbol{0} & \\boldsymbol{0}\\\\ \\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "leading to" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}\\boldsymbol{X}^T=\\boldsymbol{U}\\begin{bmatrix} \\tilde{\\boldsymbol{\\Sigma}} & \\boldsymbol{0} \\\\ \\boldsymbol{0} & \\boldsymbol{0}\\\\ \\end{bmatrix}\\boldsymbol{U}^T.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Multiplying with $\\boldsymbol{U}$ from the right gives us the eigenvalue problem" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "(\\boldsymbol{X}\\boldsymbol{X}^T)\\boldsymbol{U}=\\boldsymbol{U}\\begin{bmatrix} \\tilde{\\boldsymbol{\\Sigma}} & \\boldsymbol{0} \\\\ \\boldsymbol{0} & \\boldsymbol{0}\\\\ \\end{bmatrix}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "It means that the eigenvalues of $\\boldsymbol{X}\\boldsymbol{X}^T$ are again given by\n", + "the non-zero singular values plus now a series of zeros. The column\n", + "vectors of $\\boldsymbol{U}$ are the eigenvectors of $\\boldsymbol{X}\\boldsymbol{X}^T$ and\n", + "measure how much correlations are contained in the rows of $\\boldsymbol{X}$.\n", + "\n", + "Since we will mainly be interested in the correlations among the features\n", + "of our data (the columns of $\\boldsymbol{X}$, the quantity of interest for us are the non-zero singular\n", + "values and the column vectors of $\\boldsymbol{V}$.\n", + "\n", + "\n", + "\n", + "## Ridge and LASSO Regression\n", + "\n", + "Let us remind ourselves about the expression for the standard Mean Squared Error (MSE) which we used to define our cost function and the equations for the ordinary least squares (OLS) method, that is \n", + "our optimization problem is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in {\\mathbb{R}}^{p}}}\\frac{1}{n}\\left\\{\\left(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\right)^T\\left(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\right)\\right\\}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "or we can state it as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", + "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\sum_{i=0}^{n-1}\\left(y_i-\\tilde{y}_i\\right)^2=\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where we have used the definition of a norm-2 vector, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\vert\\vert \\boldsymbol{x}\\vert\\vert_2 = \\sqrt{\\sum_i x_i^2}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "By minimizing the above equation with respect to the parameters\n", + "$\\boldsymbol{\\beta}$ we could then obtain an analytical expression for the\n", + "parameters $\\boldsymbol{\\beta}$. We can add a regularization parameter $\\lambda$ by\n", + "defining a new cost function to be optimized, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", + "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_2^2\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which leads to the Ridge regression minimization problem where we\n", + "require that $\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_2^2\\le t$, where $t$ is\n", + "a finite number larger than zero. By defining" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{X},\\boldsymbol{\\beta})=\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_1,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "we have a new optimization equation" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", + "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_1\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which leads to Lasso regression. Lasso stands for least absolute shrinkage and selection operator. \n", + "\n", + "Here we have defined the norm-1 as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\vert\\vert \\boldsymbol{x}\\vert\\vert_1 = \\sum_i \\vert x_i\\vert.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Using the matrix-vector expression for Ridge regression and dropping the parameter $1/n$ in front of the standard means squared error equation, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{X},\\boldsymbol{\\beta})=\\left\\{(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})^T(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\right\\}+\\lambda\\boldsymbol{\\beta}^T\\boldsymbol{\\beta},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and \n", + "taking the derivatives with respect to $\\boldsymbol{\\beta}$ we obtain then\n", + "a slightly modified matrix inversion problem which for finite values\n", + "of $\\lambda$ does not suffer from singularity problems. We obtain\n", + "the optimal parameters" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}_{\\mathrm{Ridge}} = \\left(\\boldsymbol{X}^T\\boldsymbol{X}+\\lambda\\boldsymbol{I}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with $\\boldsymbol{I}$ being a $p\\times p$ identity matrix with the constraint that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\sum_{i=0}^{p-1} \\beta_i^2 \\leq t,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with $t$ a finite positive number. \n", + "\n", + "When we compare this with the ordinary least squares result we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}_{\\mathrm{OLS}} = \\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which can lead to singular matrices. However, with the SVD, we can always compute the inverse of the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$.\n", + "\n", + "\n", + "We see that Ridge regression is nothing but the standard OLS with a\n", + "modified diagonal term added to $\\boldsymbol{X}^T\\boldsymbol{X}$. The consequences, in\n", + "particular for our discussion of the bias-variance tradeoff are rather\n", + "interesting. We will see that for specific values of $\\lambda$, we may\n", + "even reduce the variance of the optimal parameters $\\boldsymbol{\\beta}$. These topics and other related ones, will be discussed after the more linear algebra oriented analysis here.\n", + "\n", + "Using our insights about the SVD of the design matrix $\\boldsymbol{X}$ \n", + "We have already analyzed the OLS solutions in terms of the eigenvectors (the columns) of the right singular value matrix $\\boldsymbol{U}$ as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{\\boldsymbol{y}}_{\\mathrm{OLS}}=\\boldsymbol{X}\\boldsymbol{\\beta} =\\boldsymbol{U}\\boldsymbol{U}^T\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "For Ridge regression this becomes" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{\\boldsymbol{y}}_{\\mathrm{Ridge}}=\\boldsymbol{X}\\boldsymbol{\\beta}_{\\mathrm{Ridge}} = \\boldsymbol{U\\Sigma V^T}\\left(\\boldsymbol{V}\\boldsymbol{\\Sigma}^2\\boldsymbol{V}^T+\\lambda\\boldsymbol{I} \\right)^{-1}(\\boldsymbol{U\\Sigma V^T})^T\\boldsymbol{y}=\\sum_{j=0}^{p-1}\\boldsymbol{u}_j\\boldsymbol{u}_j^T\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda}\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with the vectors $\\boldsymbol{u}_j$ being the columns of $\\boldsymbol{U}$ from the SVD of the matrix $\\boldsymbol{X}$. \n", + "\n", + "\n", + "Since $\\lambda \\geq 0$, it means that compared to OLS, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda} \\leq 1.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Ridge regression finds the coordinates of $\\boldsymbol{y}$ with respect to the\n", + "orthonormal basis $\\boldsymbol{U}$, it then shrinks the coordinates by\n", + "$\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda}$. Recall that the SVD has\n", + "eigenvalues ordered in a descending way, that is $\\sigma_i \\geq\n", + "\\sigma_{i+1}$.\n", + "\n", + "For small eigenvalues $\\sigma_i$ it means that their contributions become less important, a fact which can be used to reduce the number of degrees of freedom. More about this when we have covered the material on a statistical interpretation of various linear regression methods.\n", + "\n", + "\n", + "\n", + "For the sake of simplicity, let us assume that the design matrix is orthonormal, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=(\\boldsymbol{X}^T\\boldsymbol{X})^{-1} =\\boldsymbol{I}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "In this case the standard OLS results in" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\beta}^{\\mathrm{OLS}} = \\boldsymbol{X}^T\\boldsymbol{y}=\\sum_{i=0}^{p-1}\\boldsymbol{u}_j\\boldsymbol{u}_j^T\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\beta}^{\\mathrm{Ridge}} = \\left(\\boldsymbol{I}+\\lambda\\boldsymbol{I}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}=\\left(1+\\lambda\\right)^{-1}\\boldsymbol{\\beta}^{\\mathrm{OLS}},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "that is the Ridge estimator scales the OLS estimator by the inverse of a factor $1+\\lambda$, and\n", + "the Ridge estimator converges to zero when the hyperparameter goes to\n", + "infinity.\n", + "\n", + "We will come back to more interpreations after we have gone through some of the statistical analysis part. \n", + "\n", + "For more discussions of Ridge and Lasso regression, [Wessel van Wieringen's](https://arxiv.org/abs/1509.09169) article is highly recommended.\n", + "Similarly, [Mehta et al's article](https://arxiv.org/abs/1803.08823) is also recommended.\n", + "\n", + "\n", + "Using the matrix-vector expression for Lasso regression and dropping the parameter $1/n$ in front of the standard means squared error equation, we have the following **cost** function" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{X},\\boldsymbol{\\beta})=\\left\\{(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})^T(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\right\\}+\\lambda\\vert\\vert\\boldsymbol{\\beta}\\vert\\vert_1,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Taking the derivative with respect to $\\boldsymbol{\\beta}$ and recalling that the derivative of the absolute value is (we drop the boldfaced vector symbol for simplicty)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{d \\vert \\beta\\vert}{d \\boldsymbol{\\beta}}=\\mathrm{sgn}(\\boldsymbol{\\beta})=\\left\\{\\begin{array}{cc} 1 & \\beta > 0 \\\\ 0 & \\beta =0\\\\-1 & \\beta < 0, \\end{array}\\right.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "we have that the derivative of the cost function is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{\\partial C(\\boldsymbol{X},\\boldsymbol{\\beta})}{\\partial \\boldsymbol{\\beta}}=-2\\boldsymbol{X}^T(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})+\\lambda sgn(\\boldsymbol{\\beta})=0,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and reordering we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}\\boldsymbol{\\beta})+\\lambda sgn(\\boldsymbol{\\beta})=2\\boldsymbol{X}^T(\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "This equation does not lead to a nice analytical equation as in either Ridge regression or ordinary least squares. This equation can however be solved by using standard convex optimization algorithms using for example the Python package [CVXOPT](https://cvxopt.org/). We will discuss this later. \n", + "\n", + "## Code for SVD and Inversion of Matrices\n", + "\n", + "How do we use the SVD to invert a matrix $\\boldsymbol{X}^\\boldsymbol{X}$ which is singular or near singular?\n", + "The simple answer is to use the linear algebra function for pseudoinvers, that is" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "Ainv = np.linlag.pinv(A)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Let us first look at a matrix which does not causes problems and write our own function where we just use the SVD." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "import numpy as np\n", + "# SVD inversion\n", + "def SVDinv(A):\n", + " ''' Takes as input a numpy matrix A and returns inv(A) based on singular value decomposition (SVD).\n", + " SVD is numerically more stable than the inversion algorithms provided by\n", + " numpy and scipy.linalg at the cost of being slower.\n", + " '''\n", + " U, s, VT = np.linalg.svd(A)\n", + " print('test U')\n", + " print( (np.transpose(U) @ U - U @np.transpose(U)))\n", + " print('test VT')\n", + " print( (np.transpose(VT) @ VT - VT @np.transpose(VT)))\n", + "\n", + "\n", + " D = np.zeros((len(U),len(VT)))\n", + " D = np.diag(s)\n", + " UT = np.transpose(U); V = np.transpose(VT); invD = np.linalg.inv(D)\n", + " return np.matmul(V,np.matmul(invD,UT))\n", + "\n", + "\n", + "#X = np.array([ [1.0, -1.0, 2.0], [1.0, 0.0, 1.0], [1.0, 2.0, -1.0], [1.0, 1.0, 0.0] ])\n", + "# Non-singular square matrix\n", + "X = np.array( [ [1,2,3],[2,4,5],[3,5,6]])\n", + "print(X)\n", + "A = np.transpose(X) @ X\n", + "# Brute force inversion\n", + "B = np.linalg.inv(A) # here we could use np.linalg.pinv(A)\n", + "C = SVDinv(A)\n", + "print(np.abs(B-C))" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Although our matrix to invert $\\boldsymbol{X}^T\\boldsymbol{X}$ is a square matrix, our matrix may be singular. \n", + "\n", + "The pseudoinverse is the generalization of the matrix inverse for square matrices to\n", + "rectangular matrices where the number of rows and columns are not equal.\n", + "\n", + "It is also called the the Moore-Penrose Inverse after two independent discoverers of the method or the Generalized Inverse.\n", + "It is used for the calculation of the inverse for singular or near singular matrices and for rectangular matrices.\n", + "\n", + "Using the SVD we can obtain the pseudoinverse of a matrix $\\boldsymbol{A}$ (labeled here as $\\boldsymbol{A}_{\\mathrm{PI}}$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{A}_{\\mathrm{PI}}= \\boldsymbol{V}\\boldsymbol{D}_{\\mathrm{PI}}\\boldsymbol{U}^T,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where $\\boldsymbol{D}_{\\mathrm{PI}}$ can be calculated by creating a diagonal matrix from $\\boldsymbol{Sigma}$ where we only keep the singular values (the non-zero values). The following code computes the pseudoinvers of the matrix based on the SVD." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "import numpy as np\n", + "# SVD inversion\n", + "def SVDinv(A):\n", + " U, s, VT = np.linalg.svd(A)\n", + " # reciprocals of singular values of s\n", + " d = 1.0 / s\n", + " # create m x n D matrix\n", + " D = np.zeros(A.shape)\n", + " # populate D with n x n diagonal matrix\n", + " D[:A.shape[1], :A.shape[1]] = np.diag(d)\n", + " UT = np.transpose(U)\n", + " V = np.transpose(VT)\n", + " return np.matmul(V,np.matmul(D.T,UT))\n", + "\n", + "\n", + "A = np.array([ [0.3, 0.4], [0.5, 0.6], [0.7, 0.8],[0.9, 1.0]])\n", + "print(A)\n", + "# Brute force inversion of super-collinear matrix\n", + "B = np.linalg.pinv(A)\n", + "print(B)\n", + "# Compare our own algorithm with pinv\n", + "C = SVDinv(A)\n", + "print(np.abs(C-B))" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "As you can see from this example, our own decomposition based on the SVD agrees the pseudoinverse algorithm provided by **Numpy**.\n", + "\n", + "\n", + "\n", + "## Deriving the Ridge Regression Equations\n", + "\n", + "Let us remind ourselves about the expression for the standard Mean Squared Error (MSE) which we used to define our cost function and the equations for the ordinary least squares (OLS) method, that is \n", + "our optimization problem is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in {\\mathbb{R}}^{p}}}\\frac{1}{n}\\left\\{\\left(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\right)^T\\left(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\right)\\right\\}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "or we can state it as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", + "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\sum_{i=0}^{n-1}\\left(y_i-\\tilde{y}_i\\right)^2=\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where we have used the definition of a norm-2 vector, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\vert\\vert \\boldsymbol{x}\\vert\\vert_2 = \\sqrt{\\sum_i x_i^2}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "By minimizing the above equation with respect to the parameters\n", + "$\\boldsymbol{\\beta}$ we could then obtain an analytical expression for the\n", + "parameters $\\boldsymbol{\\beta}$. We can add a regularization parameter $\\lambda$ by\n", + "defining a new cost function to be optimized, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", + "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_2^2\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which leads to the Ridge regression minimization problem where we\n", + "require that $\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_2^2\\le t$, where $t$ is\n", + "a finite number larger than zero. By defining" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{X},\\boldsymbol{\\beta})=\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_1,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "we have a new optimization equation" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", + "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_1\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which leads to Lasso regression. Lasso stands for least absolute shrinkage and selection operator. \n", + "\n", + "Here we have defined the norm-1 as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\vert\\vert \\boldsymbol{x}\\vert\\vert_1 = \\sum_i \\vert x_i\\vert.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Using the matrix-vector expression for Ridge regression and dropping the parameter $1/n$ in front of the standard means squared error equation, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{X},\\boldsymbol{\\beta})=\\left\\{(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})^T(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\right\\}+\\lambda\\boldsymbol{\\beta}^T\\boldsymbol{\\beta},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and \n", + "taking the derivatives with respect to $\\boldsymbol{\\beta}$ we obtain then\n", + "a slightly modified matrix inversion problem which for finite values\n", + "of $\\lambda$ does not suffer from singularity problems. We obtain\n", + "the optimal parameters" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}_{\\mathrm{Ridge}} = \\left(\\boldsymbol{X}^T\\boldsymbol{X}+\\lambda\\boldsymbol{I}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with $\\boldsymbol{I}$ being a $p\\times p$ identity matrix with the constraint that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\sum_{i=0}^{p-1} \\beta_i^2 \\leq t,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with $t$ a finite positive number. \n", + "\n", + "When we compare this with the ordinary least squares result we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}_{\\mathrm{OLS}} = \\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which can lead to singular matrices. However, with the SVD, we can always compute the inverse of the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$.\n", + "\n", + "\n", + "We see that Ridge regression is nothing but the standard OLS with a\n", + "modified diagonal term added to $\\boldsymbol{X}^T\\boldsymbol{X}$. The consequences, in\n", + "particular for our discussion of the bias-variance tradeoff are rather\n", + "interesting. We will see that for specific values of $\\lambda$, we may\n", + "even reduce the variance of the optimal parameters $\\boldsymbol{\\beta}$. These topics and other related ones, will be discussed after the more linear algebra oriented analysis here.\n", + "\n", + "\n", + "\n", + "Using our insights about the SVD of the design matrix $\\boldsymbol{X}$ \n", + "We have already analyzed the OLS solutions in terms of the eigenvectors (the columns) of the right singular value matrix $\\boldsymbol{U}$ as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{\\boldsymbol{y}}_{\\mathrm{OLS}}=\\boldsymbol{X}\\boldsymbol{\\beta} =\\boldsymbol{U}\\boldsymbol{U}^T\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "For Ridge regression this becomes" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\tilde{\\boldsymbol{y}}_{\\mathrm{Ridge}}=\\boldsymbol{X}\\boldsymbol{\\beta}_{\\mathrm{Ridge}} = \\boldsymbol{U\\Sigma V^T}\\left(\\boldsymbol{V}\\boldsymbol{\\Sigma}^2\\boldsymbol{V}^T+\\lambda\\boldsymbol{I} \\right)^{-1}(\\boldsymbol{U\\Sigma V^T})^T\\boldsymbol{y}=\\sum_{j=0}^{p-1}\\boldsymbol{u}_j\\boldsymbol{u}_j^T\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda}\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "with the vectors $\\boldsymbol{u}_j$ being the columns of $\\boldsymbol{U}$ from the SVD of the matrix $\\boldsymbol{X}$. \n", + "\n", + "\n", + "\n", + "Since $\\lambda \\geq 0$, it means that compared to OLS, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda} \\leq 1.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Ridge regression finds the coordinates of $\\boldsymbol{y}$ with respect to the\n", + "orthonormal basis $\\boldsymbol{U}$, it then shrinks the coordinates by\n", + "$\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda}$. Recall that the SVD has\n", + "eigenvalues ordered in a descending way, that is $\\sigma_i \\geq\n", + "\\sigma_{i+1}$.\n", + "\n", + "For small eigenvalues $\\sigma_i$ it means that their contributions become less important, a fact which can be used to reduce the number of degrees of freedom. More about this when we have covered the material on a statistical interpretation of various linear regression methods.\n", + "\n", + "\n", + "\n", + "For the sake of simplicity, let us assume that the design matrix is orthonormal, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}=(\\boldsymbol{X}^T\\boldsymbol{X})^{-1} =\\boldsymbol{I}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "In this case the standard OLS results in" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\beta}^{\\mathrm{OLS}} = \\boldsymbol{X}^T\\boldsymbol{y}=\\sum_{i=0}^{p-1}\\boldsymbol{u}_j\\boldsymbol{u}_j^T\\boldsymbol{y},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\beta}^{\\mathrm{Ridge}} = \\left(\\boldsymbol{I}+\\lambda\\boldsymbol{I}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}=\\left(1+\\lambda\\right)^{-1}\\boldsymbol{\\beta}^{\\mathrm{OLS}},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "that is the Ridge estimator scales the OLS estimator by the inverse of a factor $1+\\lambda$, and\n", + "the Ridge estimator converges to zero when the hyperparameter goes to\n", + "infinity.\n", + "\n", + "We will come back to more interpreations after we have gone through some of the statistical analysis part. \n", + "\n", + "\n", + "\n", + "Using the matrix-vector expression for Lasso regression and dropping the parameter $1/n$ in front of the standard mean squared error equation, we have the following **cost** function" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{X},\\boldsymbol{\\beta})=\\left\\{(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})^T(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\right\\}+\\lambda\\vert\\vert\\boldsymbol{\\beta}\\vert\\vert_1,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Taking the derivative with respect to $\\boldsymbol{\\beta}$ and recalling that the derivative of the absolute value is (we drop the boldfaced vector symbol for simplicty)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{d \\vert \\beta\\vert}{d \\boldsymbol{\\beta}}=\\mathrm{sgn}(\\boldsymbol{\\beta})=\\left\\{\\begin{array}{cc} 1 & \\beta > 0 \\\\ 0 & \\beta =0\\\\-1 & \\beta < 0, \\end{array}\\right.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "we have that the derivative of the cost function is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{\\partial C(\\boldsymbol{X},\\boldsymbol{\\beta})}{\\partial \\boldsymbol{\\beta}}=-2\\boldsymbol{X}^T(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})+\\lambda sgn(\\boldsymbol{\\beta})=0,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and reordering we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\boldsymbol{X}\\boldsymbol{\\beta}+\\lambda sgn(\\boldsymbol{\\beta})=2\\boldsymbol{X}^T\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "This equation does not lead to a nice analytical equation as in Ridge regression or ordinary least squares. This equation can however be solved by using standard convex optimization algorithms using for example the Python package [CVXOPT](https://cvxopt.org/). We will discuss this later. \n", + "\n", + "\n", + "\n", + "\n", + "\n", + "Let us assume that our design matrix is given by unit (identity) matrix, that is a square diagonal matrix with ones only along the\n", + "diagonal. In this case we have an equal number of rows and columns $n=p$.\n", + "\n", + "Our model approximation is just $\\tilde{\\boldsymbol{y}}=\\boldsymbol{\\beta}$ and the mean squared error and thereby the cost function for ordinary least sqquares (OLS) is then (we drop the term $1/n$)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta})=\\sum_{i=0}^{p-1}(y_i-\\beta_i)^2,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and minimizing we have that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\beta}_i^{\\mathrm{OLS}} = y_i.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "For Ridge regression our cost function is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta})=\\sum_{i=0}^{p-1}(y_i-\\beta_i)^2+\\lambda\\sum_{i=0}^{p-1}\\beta_i^2,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and minimizing we have that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\beta}_i^{\\mathrm{Ridge}} = \\frac{y_i}{1+\\lambda}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "For Lasso regression our cost function is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta})=\\sum_{i=0}^{p-1}(y_i-\\beta_i)^2+\\lambda\\sum_{i=0}^{p-1}\\vert\\beta_i\\vert=\\sum_{i=0}^{p-1}(y_i-\\beta_i)^2+\\lambda\\sum_{i=0}^{p-1}\\sqrt{\\beta_i^2},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and minimizing we have that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "-2\\sum_{i=0}^{p-1}(y_i-\\beta_i)+\\lambda \\sum_{i=0}^{p-1}\\frac{(\\beta_i)}{\\vert\\beta_i\\vert}=0,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which leads to" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}_i^{\\mathrm{Lasso}} = \\left\\{\\begin{array}{ccc}y_i-\\frac{\\lambda}{2} &\\mathrm{if} & y_i> \\frac{\\lambda}{2}\\\\\n", + " y_i+\\frac{\\lambda}{2} &\\mathrm{if} & y_i< -\\frac{\\lambda}{2}\\\\\n", + "\t\t\t\t\t\t\t 0 &\\mathrm{if} & \\vert y_i\\vert\\le \\frac{\\lambda}{2}\\end{array}\\right.\\\\.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Plotting these results ([figure in handwritten notes for week 36](https://github.com/CompPhysics/MachineLearning/blob/master/doc/HandWrittenNotes/2021/NotesSeptember9.pdf)) shows clearly that Lasso regression suppresses (sets to zero) values of $\\beta_i$ for specific values of $\\lambda$. Ridge regression reduces on the other hand the values of $\\beta_i$ as function of $\\lambda$.\n", + "\n", + "\n", + "As another examples, \n", + "let us assume we have a data set with outputs/targets given by the vector" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{y}=\\begin{bmatrix}4 \\\\ 2 \\\\3\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and our inputs as a $3\\times 2$ design matrix" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}=\\begin{bmatrix}2 & 0\\\\ 0 & 1 \\\\ 0 & 0\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "meaning that we have two features and two unknown parameters $\\beta_0$ and $\\beta_1$ to be determined either by ordinary least squares, Ridge or Lasso regression.\n", + "\n", + "\n", + "For ordinary least squares (OLS) we know that the optimal solution is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}^{\\mathrm{OLS}}=\\left( \\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Inserting the above values we obtain that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}^{\\mathrm{OLS}}=\\begin{bmatrix}2 \\\\ 2\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The code which implements this simpler case is presented after the discussion of Ridge and Lasso.\n", + "\n", + "\n", + "For Ridge regression we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}^{\\mathrm{Ridge}}=\\left( \\boldsymbol{X}^T\\boldsymbol{X}+\\lambda\\boldsymbol{I}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Inserting the above values we obtain that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}^{\\mathrm{Ridge}}=\\begin{bmatrix}\\frac{8}{4+\\lambda} \\\\ \\frac{2}{1+\\lambda}\\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "There is normally a constraint on the value of $\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_2$ via the parameter $\\lambda$.\n", + "Let us for simplicity assume that $\\beta_0^2+\\beta_1^2=1$ as constraint. This will allow us to find an expression for the optimal values of $\\beta$ and $\\lambda$.\n", + "\n", + "To see this, let us write the cost function for Ridge regression. \n", + "\n", + "\n", + "\n", + "We define the MSE without the $1/n$ factor and have then, using that" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}\\boldsymbol{\\beta}=\\begin{bmatrix} 2\\beta_0 \\\\ \\beta_1 \\\\0 \\end{bmatrix},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta})=(4-2\\beta_0)^2+(2-\\beta_1)^2+\\lambda(\\beta_0^2+\\beta_1^2),\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and taking the derivative with respect to $\\beta_0$ we get" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\beta_0=\\frac{8}{4+\\lambda},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and for $\\beta_1$ we obtain" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\beta_1=\\frac{2}{1+\\lambda},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Using the constraint for $\\beta_0^2+\\beta_1^2=1$ we can constrain $\\lambda$ by solving" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\left(\\frac{8}{4+\\lambda}\\right)^2+\\left(\\frac{2}{1+\\lambda}\\right)^2=1,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which gives $\\lambda=4.571$ and $\\beta_0=0.933$ and $\\beta_1=0.359$.\n", + "\n", + "\n", + "For Lasso we need now, keeping a constraint on $\\vert\\beta_0\\vert+\\vert\\beta_1\\vert=1$, to take the derivative of the absolute values of $\\beta_0$\n", + "and $\\beta_1$. This gives us the following derivatives of the cost function" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta})=(4-2\\beta_0)^2+(2-\\beta_1)^2+\\lambda(\\vert\\beta_0\\vert+\\vert\\beta_1\\vert),\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{\\partial C(\\boldsymbol{\\beta})}{\\partial \\beta_0}=-4(4-2\\beta_0)+\\lambda\\mathrm{sgn}(\\beta_0)=0,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\frac{\\partial C(\\boldsymbol{\\beta})}{\\partial \\beta_1}=-2(2-\\beta_1)+\\lambda\\mathrm{sgn}(\\beta_1)=0.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We have now four cases to solve besides the trivial cases $\\beta_0$ and/or $\\beta_1$ are zero, namely\n", + "1. $\\beta_0 > 0$ and $\\beta_1 > 0$,\n", + "\n", + "2. $\\beta_0 > 0$ and $\\beta_1 < 0$,\n", + "\n", + "3. $\\beta_0 < 0$ and $\\beta_1 > 0$,\n", + "\n", + "4. $\\beta_0 < 0$ and $\\beta_1 < 0$.\n", + "\n", + "If we consider the first case, we have then" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "-4(4-2\\beta_0)+\\lambda=0,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "-2(2-\\beta_1)+\\lambda=0.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which yields" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\beta_0=\\frac{16+\\lambda}{8},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\beta_1=\\frac{4+\\lambda}{2}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Using the constraint on $\\beta_0$ and $\\beta_1$ we can then find the optimal value of $\\lambda$ for the different cases. We leave this as an exercise to you.\n", + "\n", + "\n", + "Here we set up the OLS, Ridge and Lasso functionality in order to study the above example. Note that here we have opted for a set of values of $\\lambda$, meaning that we need to perform a search in order to find the optimal values.\n", + "\n", + "First we study and compare the OLS and Ridge results. The next code compares all three methods." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "%matplotlib inline\n", + "\n", + "import os\n", + "import numpy as np\n", + "import pandas as pd\n", + "import matplotlib.pyplot as plt\n", + "\n", + "def R2(y_data, y_model):\n", + " return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2)\n", + "def MSE(y_data,y_model):\n", + " n = np.size(y_model)\n", + " return np.sum((y_data-y_model)**2)/n\n", + "\n", + "\n", + "# A seed just to ensure that the random numbers are the same for every run.\n", + "# Useful for eventual debugging.\n", + "\n", + "X = np.array( [ [ 2, 0], [0, 1], [0,0]])\n", + "y = np.array( [4, 2, 3])\n", + "\n", + "\n", + "# matrix inversion to find beta\n", + "OLSbeta = np.linalg.inv(X.T @ X) @ X.T @ y\n", + "print(OLSbeta)\n", + "# and then make the prediction\n", + "ytildeOLS = X @ OLSbeta\n", + "print(\"Training MSE for OLS\")\n", + "print(MSE(y,ytildeOLS))\n", + "ypredictOLS = X @ OLSbeta\n", + "\n", + "# Repeat now for Ridge regression and various values of the regularization parameter\n", + "I = np.eye(2,2)\n", + "# Decide which values of lambda to use\n", + "nlambdas = 100\n", + "MSEPredict = np.zeros(nlambdas)\n", + "lambdas = np.logspace(-4, 4, nlambdas)\n", + "for i in range(nlambdas):\n", + " lmb = lambdas[i]\n", + " Ridgebeta = np.linalg.inv(X.T @ X+lmb*I) @ X.T @ y\n", + "# print(Ridgebeta)\n", + " # and then make the prediction\n", + " ypredictRidge = X @ Ridgebeta\n", + " MSEPredict[i] = MSE(y,ypredictRidge)\n", + "# print(MSEPredict[i])\n", + " # Now plot the results\n", + "plt.figure()\n", + "plt.plot(np.log10(lambdas), MSEPredict, 'r--', label = 'MSE Ridge Train')\n", + "plt.xlabel('log10(lambda)')\n", + "plt.ylabel('MSE')\n", + "plt.legend()\n", + "plt.show()" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We see here that we reach a plateau. What is actually happening?" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "import os\n", + "import numpy as np\n", + "import pandas as pd\n", + "import matplotlib.pyplot as plt\n", + "from sklearn import linear_model\n", + "\n", + "def R2(y_data, y_model):\n", + " return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2)\n", + "def MSE(y_data,y_model):\n", + " n = np.size(y_model)\n", + " return np.sum((y_data-y_model)**2)/n\n", + "\n", + "\n", + "# A seed just to ensure that the random numbers are the same for every run.\n", + "# Useful for eventual debugging.\n", + "\n", + "X = np.array( [ [ 2, 0], [0, 1], [0,0]])\n", + "y = np.array( [4, 2, 3])\n", + "\n", + "\n", + "# matrix inversion to find beta\n", + "OLSbeta = np.linalg.inv(X.T @ X) @ X.T @ y\n", + "print(OLSbeta)\n", + "# and then make the prediction\n", + "ytildeOLS = X @ OLSbeta\n", + "print(\"Training MSE for OLS\")\n", + "print(MSE(y,ytildeOLS))\n", + "ypredictOLS = X @ OLSbeta\n", + "\n", + "# Repeat now for Ridge regression and various values of the regularization parameter\n", + "I = np.eye(2,2)\n", + "# Decide which values of lambda to use\n", + "nlambdas = 100\n", + "MSERidgePredict = np.zeros(nlambdas)\n", + "MSELassoPredict = np.zeros(nlambdas)\n", + "lambdas = np.logspace(-4, 4, nlambdas)\n", + "for i in range(nlambdas):\n", + " lmb = lambdas[i]\n", + " Ridgebeta = np.linalg.inv(X.T @ X+lmb*I) @ X.T @ y\n", + " print(Ridgebeta)\n", + " # and then make the prediction\n", + " ypredictRidge = X @ Ridgebeta\n", + " MSERidgePredict[i] = MSE(y,ypredictRidge)\n", + " RegLasso = linear_model.Lasso(lmb)\n", + " RegLasso.fit(X,y)\n", + " ypredictLasso = RegLasso.predict(X)\n", + " print(RegLasso.coef_)\n", + " MSELassoPredict[i] = MSE(y,ypredictLasso)\n", + "# Now plot the results\n", + "plt.figure()\n", + "plt.plot(np.log10(lambdas), MSERidgePredict, 'r--', label = 'MSE Ridge Train')\n", + "plt.plot(np.log10(lambdas), MSELassoPredict, 'r--', label = 'MSE Lasso Train')\n", + "plt.xlabel('log10(lambda)')\n", + "plt.ylabel('MSE')\n", + "plt.legend()\n", + "plt.show()" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Another Example, now with a polynomial fit." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "import os\n", + "import numpy as np\n", + "import pandas as pd\n", + "import matplotlib.pyplot as plt\n", + "from sklearn.model_selection import train_test_split\n", + "from sklearn import linear_model\n", + "\n", + "def R2(y_data, y_model):\n", + " return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2)\n", + "def MSE(y_data,y_model):\n", + " n = np.size(y_model)\n", + " return np.sum((y_data-y_model)**2)/n\n", + "\n", + "\n", + "# A seed just to ensure that the random numbers are the same for every run.\n", + "# Useful for eventual debugging.\n", + "np.random.seed(3155)\n", + "\n", + "x = np.random.rand(100)\n", + "y = 2.0+5*x*x+0.1*np.random.randn(100)\n", + "\n", + "# number of features p (here degree of polynomial\n", + "p = 3\n", + "# The design matrix now as function of a given polynomial\n", + "X = np.zeros((len(x),p))\n", + "X[:,0] = 1.0\n", + "X[:,1] = x\n", + "X[:,2] = x*x\n", + "# We split the data in test and training data\n", + "X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2)\n", + "\n", + "# matrix inversion to find beta\n", + "OLSbeta = np.linalg.inv(X_train.T @ X_train) @ X_train.T @ y_train\n", + "print(OLSbeta)\n", + "# and then make the prediction\n", + "ytildeOLS = X_train @ OLSbeta\n", + "print(\"Training MSE for OLS\")\n", + "print(MSE(y_train,ytildeOLS))\n", + "ypredictOLS = X_test @ OLSbeta\n", + "print(\"Test MSE OLS\")\n", + "print(MSE(y_test,ypredictOLS))\n", + "\n", + "# Repeat now for Lasso and Ridge regression and various values of the regularization parameter\n", + "I = np.eye(p,p)\n", + "# Decide which values of lambda to use\n", + "nlambdas = 100\n", + "MSEPredict = np.zeros(nlambdas)\n", + "MSETrain = np.zeros(nlambdas)\n", + "MSELassoPredict = np.zeros(nlambdas)\n", + "MSELassoTrain = np.zeros(nlambdas)\n", + "lambdas = np.logspace(-4, 4, nlambdas)\n", + "for i in range(nlambdas):\n", + " lmb = lambdas[i]\n", + " Ridgebeta = np.linalg.inv(X_train.T @ X_train+lmb*I) @ X_train.T @ y_train\n", + " # include lasso using Scikit-Learn\n", + " RegLasso = linear_model.Lasso(lmb)\n", + " RegLasso.fit(X_train,y_train)\n", + " # and then make the prediction\n", + " ytildeRidge = X_train @ Ridgebeta\n", + " ypredictRidge = X_test @ Ridgebeta\n", + " ytildeLasso = RegLasso.predict(X_train)\n", + " ypredictLasso = RegLasso.predict(X_test)\n", + " MSEPredict[i] = MSE(y_test,ypredictRidge)\n", + " MSETrain[i] = MSE(y_train,ytildeRidge)\n", + " MSELassoPredict[i] = MSE(y_test,ypredictLasso)\n", + " MSELassoTrain[i] = MSE(y_train,ytildeLasso)\n", + "\n", + "# Now plot the results\n", + "plt.figure()\n", + "plt.plot(np.log10(lambdas), MSETrain, label = 'MSE Ridge train')\n", + "plt.plot(np.log10(lambdas), MSEPredict, 'r--', label = 'MSE Ridge Test')\n", + "plt.plot(np.log10(lambdas), MSELassoTrain, label = 'MSE Lasso train')\n", + "plt.plot(np.log10(lambdas), MSELassoPredict, 'r--', label = 'MSE Lasso Test')\n", + "\n", + "plt.xlabel('log10(lambda)')\n", + "plt.ylabel('MSE')\n", + "plt.legend()\n", + "plt.show()" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "## Linking the regression analysis with a statistical interpretation\n", + "\n", + "We will now couple the discussions of ordinary least squares, Ridge\n", + "and Lasso regression with a statistical interpretation, that is we\n", + "move from a linear algebra analysis to a statistical analysis. In\n", + "particular, we will focus on what the regularization terms can result\n", + "in. We will amongst other things show that the regularization\n", + "parameter can reduce considerably the variance of the parameters\n", + "$\\beta$.\n", "\n", - "* Systematical errors are method specific and must be treated differently from case to case. \n", "\n", "The\n", "advantage of doing linear regression is that we actually end up with\n", @@ -107,6 +3381,7 @@ "row number $i$ and perform a sum over all values $p$.\n", "\n", "\n", + "\n", "The assumption we have made here can be summarized as (and this is going to be useful when we discuss the bias-variance trade off)\n", "that there exists a function $f(\\boldsymbol{x})$ and a normal distributed error $\\boldsymbol{\\varepsilon}\\sim \\mathcal{N}(0, \\sigma^2)$\n", "which describe our data" @@ -254,8 +3529,7 @@ "\\sigma^2 \\, \\mathbf{I}_{nn}$. From $\\mbox{Var}(\\boldsymbol{\\beta}) = \\sigma^2\n", "\\, (\\mathbf{X}^{T} \\mathbf{X})^{-1}$, one obtains an estimate of the\n", "variance of the estimate of the $j$-th regression coefficient:\n", - "$\\boldsymbol{\\sigma}^2 (\\boldsymbol{\\beta}_j ) = \\boldsymbol{\\sigma}^2 \\sqrt{\n", - "[(\\mathbf{X}^{T} \\mathbf{X})^{-1}]_{jj} }$. This may be used to\n", + "$\\boldsymbol{\\sigma}^2 (\\boldsymbol{\\beta}_j ) = \\boldsymbol{\\sigma}^2 [(\\mathbf{X}^{T} \\mathbf{X})^{-1}]_{jj} $. This may be used to\n", "construct a confidence interval for the estimates.\n", "\n", "\n", @@ -322,48 +3596,20 @@ "\n", "\n", "\n", - "## Resampling methods\n", + "## Deriving OLS from a probability distribution\n", "\n", - "With all these analytical equations for both the OLS and Ridge\n", - "regression, we will now outline how to assess a given model. This will\n", - "lead us to a discussion of the so-called bias-variance tradeoff (see\n", - "below) and so-called resampling methods.\n", + "Our basic assumption when we derived the OLS equations was to assume\n", + "that our output is determined by a given continuous function\n", + "$f(\\boldsymbol{x})$ and a random noise $\\boldsymbol{\\epsilon}$ given by the normal\n", + "distribution with zero mean value and an undetermined variance\n", + "$\\sigma^2$.\n", "\n", - "One of the quantities we have discussed as a way to measure errors is\n", - "the mean-squared error (MSE), mainly used for fitting of continuous\n", - "functions. Another choice is the absolute error.\n", - "\n", - "In the discussions below we will focus on the MSE and in particular since we will split the data into test and training data,\n", - "we discuss the\n", - "1. prediction error or simply the **test error** $\\mathrm{Err_{Test}}$, where we have a fixed training set and the test error is the MSE arising from the data reserved for testing. We discuss also the \n", - "\n", - "2. training error $\\mathrm{Err_{Train}}$, which is the average loss over the training data.\n", - "\n", - "As our model becomes more and more complex, more of the training data tends to used. The training may thence adapt to more complicated structures in the data. This may lead to a decrease in the bias (see below for code example) and a slight increase of the variance for the test error.\n", - "For a certain level of complexity the test error will reach minimum, before starting to increase again. The\n", - "training error reaches a saturation.\n", - "\n", - "\n", - "\n", - "Two famous\n", - "resampling methods are the **independent bootstrap** and **the jackknife**. \n", - "\n", - "The jackknife is a special case of the independent bootstrap. Still, the jackknife was made\n", - "popular prior to the independent bootstrap. And as the popularity of\n", - "the independent bootstrap soared, new variants, such as **the dependent bootstrap**.\n", - "\n", - "The Jackknife and independent bootstrap work for\n", - "independent, identically distributed random variables.\n", - "If these conditions are not\n", - "satisfied, the methods will fail. Yet, it should be said that if the data are\n", - "independent, identically distributed, and we only want to estimate the\n", - "variance of $\\overline{X}$ (which often is the case), then there is no\n", - "need for bootstrapping. \n", - "\n", - "\n", - "The Jackknife works by making many replicas of the estimator $\\widehat{\\theta}$. \n", - "The jackknife is a resampling method where we systematically leave out one observation from the vector of observed values $\\boldsymbol{x} = (x_1,x_2,\\cdots,X_n)$. \n", - "Let $\\boldsymbol{x}_i$ denote the vector" + "We found above that the outputs $\\boldsymbol{y}$ have a mean value given by\n", + "$\\boldsymbol{X}\\hat{\\boldsymbol{\\beta}}$ and variance $\\sigma^2$. Since the entries to\n", + "the design matrix are not stochastic variables, we can assume that the\n", + "probability distribution of our targets is also a normal distribution\n", + "but now with mean value $\\boldsymbol{X}\\hat{\\boldsymbol{\\beta}}$. This means that a\n", + "single output $y_i$ is given by the Gaussian distribution" ] }, { @@ -371,7 +3617,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{x}_i = (x_1,x_2,\\cdots,x_{i-1},x_{i+1},\\cdots,x_n),\n", + "y_i\\sim \\mathcal{N}(\\boldsymbol{X}_{i,*}\\boldsymbol{\\beta}, \\sigma^2)=\\frac{1}{\\sqrt{2\\pi\\sigma^2}}\\exp{\\left[-\\frac{(y_i-\\boldsymbol{X}_{i,*}\\boldsymbol{\\beta})^2}{2\\sigma^2}\\right]}.\n", "$$" ] }, @@ -379,229 +3625,8 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "which equals the vector $\\boldsymbol{x}$ with the exception that observation\n", - "number $i$ is left out. Using this notation, define\n", - "$\\widehat{\\theta}_i$ to be the estimator\n", - "$\\widehat{\\theta}$ computed using $\\vec{X}_i$." - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": { - "collapsed": false, - "editable": true - }, - "outputs": [], - "source": [ - "from numpy import *\n", - "from numpy.random import randint, randn\n", - "from time import time\n", - "\n", - "def jackknife(data, stat):\n", - " n = len(data);t = zeros(n); inds = arange(n); t0 = time()\n", - " ## 'jackknifing' by leaving out an observation for each i \n", - " for i in range(n):\n", - " t[i] = stat(delete(data,i) )\n", - "\n", - " # analysis \n", - " print(\"Runtime: %g sec\" % (time()-t0)); print(\"Jackknife Statistics :\")\n", - " print(\"original bias std. error\")\n", - " print(\"%8g %14g %15g\" % (stat(data),(n-1)*mean(t)/n, (n*var(t))**.5))\n", - "\n", - " return t\n", - "\n", - "\n", - "# Returns mean of data samples \n", - "def stat(data):\n", - " return mean(data)\n", - "\n", - "\n", - "mu, sigma = 100, 15\n", - "datapoints = 10000\n", - "x = mu + sigma*random.randn(datapoints)\n", - "# jackknife returns the data sample \n", - "t = jackknife(x, stat)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "### Bootstrap\n", - "\n", - "Bootstrapping is a nonparametric approach to statistical inference\n", - "that substitutes computation for more traditional distributional\n", - "assumptions and asymptotic results. Bootstrapping offers a number of\n", - "advantages: \n", - "1. The bootstrap is quite general, although there are some cases in which it fails. \n", - "\n", - "2. Because it does not require distributional assumptions (such as normally distributed errors), the bootstrap can provide more accurate inferences when the data are not well behaved or when the sample size is small. \n", - "\n", - "3. It is possible to apply the bootstrap to statistics with sampling distributions that are difficult to derive, even asymptotically. \n", - "\n", - "4. It is relatively simple to apply the bootstrap to complex data-collection plans (such as stratified and clustered samples).\n", - "\n", - "Since $\\widehat{\\theta} = \\widehat{\\theta}(\\boldsymbol{X})$ is a function of random variables,\n", - "$\\widehat{\\theta}$ itself must be a random variable. Thus it has\n", - "a pdf, call this function $p(\\boldsymbol{t})$. The aim of the bootstrap is to\n", - "estimate $p(\\boldsymbol{t})$ by the relative frequency of\n", - "$\\widehat{\\theta}$. You can think of this as using a histogram\n", - "in the place of $p(\\boldsymbol{t})$. If the relative frequency closely\n", - "resembles $p(\\vec{t})$, then using numerics, it is straight forward to\n", - "estimate all the interesting parameters of $p(\\boldsymbol{t})$ using point\n", - "estimators. \n", - "\n", - "\n", - "\n", - "In the case that $\\widehat{\\theta}$ has\n", - "more than one component, and the components are independent, we use the\n", - "same estimator on each component separately. If the probability\n", - "density function of $X_i$, $p(x)$, had been known, then it would have\n", - "been straight forward to do this by: \n", - "1. Drawing lots of numbers from $p(x)$, suppose we call one such set of numbers $(X_1^*, X_2^*, \\cdots, X_n^*)$. \n", - "\n", - "2. Then using these numbers, we could compute a replica of $\\widehat{\\theta}$ called $\\widehat{\\theta}^*$. \n", - "\n", - "By repeated use of (1) and (2), many\n", - "estimates of $\\widehat{\\theta}$ could have been obtained. The\n", - "idea is to use the relative frequency of $\\widehat{\\theta}^*$\n", - "(think of a histogram) as an estimate of $p(\\boldsymbol{t})$.\n", - "\n", - "\n", - "But\n", - "unless there is enough information available about the process that\n", - "generated $X_1,X_2,\\cdots,X_n$, $p(x)$ is in general\n", - "unknown. Therefore, [Efron in 1979](https://projecteuclid.org/euclid.aos/1176344552) asked the\n", - "question: What if we replace $p(x)$ by the relative frequency\n", - "of the observation $X_i$; if we draw observations in accordance with\n", - "the relative frequency of the observations, will we obtain the same\n", - "result in some asymptotic sense? The answer is yes.\n", - "\n", - "\n", - "Instead of generating the histogram for the relative\n", - "frequency of the observation $X_i$, just draw the values\n", - "$(X_1^*,X_2^*,\\cdots,X_n^*)$ with replacement from the vector\n", - "$\\boldsymbol{X}$. \n", - "\n", - "\n", - "The independent bootstrap works like this: \n", - "\n", - "1. Draw with replacement $n$ numbers for the observed variables $\\boldsymbol{x} = (x_1,x_2,\\cdots,x_n)$. \n", - "\n", - "2. Define a vector $\\boldsymbol{x}^*$ containing the values which were drawn from $\\boldsymbol{x}$. \n", - "\n", - "3. Using the vector $\\boldsymbol{x}^*$ compute $\\widehat{\\theta}^*$ by evaluating $\\widehat \\theta$ under the observations $\\boldsymbol{x}^*$. \n", - "\n", - "4. Repeat this process $k$ times. \n", - "\n", - "When you are done, you can draw a histogram of the relative frequency\n", - "of $\\widehat \\theta^*$. This is your estimate of the probability\n", - "distribution $p(t)$. Using this probability distribution you can\n", - "estimate any statistics thereof. In principle you never draw the\n", - "histogram of the relative frequency of $\\widehat{\\theta}^*$. Instead\n", - "you use the estimators corresponding to the statistic of interest. For\n", - "example, if you are interested in estimating the variance of $\\widehat\n", - "\\theta$, apply the etsimator $\\widehat \\sigma^2$ to the values\n", - "$\\widehat \\theta ^*$.\n", - "\n", - "\n", - "\n", - "The following code starts with a Gaussian distribution with mean value\n", - "$\\mu =100$ and variance $\\sigma=15$. We use this to generate the data\n", - "used in the bootstrap analysis. The bootstrap analysis returns a data\n", - "set after a given number of bootstrap operations (as many as we have\n", - "data points). This data set consists of estimated mean values for each\n", - "bootstrap operation. The histogram generated by the bootstrap method\n", - "shows that the distribution for these mean values is also a Gaussian,\n", - "centered around the mean value $\\mu=100$ but with standard deviation\n", - "$\\sigma/\\sqrt{n}$, where $n$ is the number of bootstrap samples (in\n", - "this case the same as the number of original data points). The value\n", - "of the standard deviation is what we expect from the central limit\n", - "theorem." - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": { - "collapsed": false, - "editable": true - }, - "outputs": [], - "source": [ - "%matplotlib inline\n", - "\n", - "from numpy import *\n", - "from numpy.random import randint, randn\n", - "from time import time\n", - "import matplotlib.mlab as mlab\n", - "import matplotlib.pyplot as plt\n", - "\n", - "# Returns mean of bootstrap samples \n", - "def stat(data):\n", - " return mean(data)\n", - "\n", - "# Bootstrap algorithm\n", - "def bootstrap(data, statistic, R):\n", - " t = zeros(R); n = len(data); inds = arange(n); t0 = time()\n", - " # non-parametric bootstrap \n", - " for i in range(R):\n", - " t[i] = statistic(data[randint(0,n,n)])\n", - "\n", - " # analysis \n", - " print(\"Runtime: %g sec\" % (time()-t0)); print(\"Bootstrap Statistics :\")\n", - " print(\"original bias std. error\")\n", - " print(\"%8g %8g %14g %15g\" % (statistic(data), std(data),mean(t),std(t)))\n", - " return t\n", - "\n", - "\n", - "mu, sigma = 100, 15\n", - "datapoints = 10000\n", - "x = mu + sigma*random.randn(datapoints)\n", - "# bootstrap returns the data sample \n", - "t = bootstrap(x, stat, datapoints)\n", - "# the histogram of the bootstrapped data \n", - "n, binsboot, patches = plt.hist(t, 50, normed=1, facecolor='red', alpha=0.75)\n", - "\n", - "# add a 'best fit' line \n", - "y = mlab.normpdf( binsboot, mean(t), std(t))\n", - "lt = plt.plot(binsboot, y, 'r--', linewidth=1)\n", - "plt.xlabel('Smarts')\n", - "plt.ylabel('Probability')\n", - "plt.axis([99.5, 100.6, 0, 3.0])\n", - "plt.grid(True)\n", - "\n", - "plt.show()" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## Various steps in cross-validation\n", - "\n", - "When the repetitive splitting of the data set is done randomly,\n", - "samples may accidently end up in a fast majority of the splits in\n", - "either training or test set. Such samples may have an unbalanced\n", - "influence on either model building or prediction evaluation. To avoid\n", - "this $k$-fold cross-validation structures the data splitting. The\n", - "samples are divided into $k$ more or less equally sized exhaustive and\n", - "mutually exclusive subsets. In turn (at each split) one of these\n", - "subsets plays the role of the test set while the union of the\n", - "remaining subsets constitutes the training set. Such a splitting\n", - "warrants a balanced representation of each sample in both training and\n", - "test set over the splits. Still the division into the $k$ subsets\n", - "involves a degree of randomness. This may be fully excluded when\n", - "choosing $k=n$. This particular case is referred to as leave-one-out\n", - "cross-validation (LOOCV). \n", - "\n", - "\n", - "* Define a range of interest for the penalty parameter.\n", - "\n", - "* Divide the data set into training and test set comprising samples $\\{1, \\ldots, n\\} \\setminus i$ and $\\{ i \\}$, respectively.\n", - "\n", - "* Fit the linear regression model by means of ridge estimation for each $\\lambda$ in the grid using the training set, and the corresponding estimate of the error variance $\\boldsymbol{\\sigma}_{-i}^2(\\lambda)$, as" + "We assume now that the various $y_i$ values are stochastically distributed according to the above Gaussian distribution. \n", + "We define this distribution as" ] }, { @@ -609,11 +3634,7 @@ "metadata": {}, "source": [ "$$\n", - "\\begin{align*}\n", - "\\boldsymbol{\\beta}_{-i}(\\lambda) & = ( \\boldsymbol{X}_{-i, \\ast}^{T}\n", - "\\boldsymbol{X}_{-i, \\ast} + \\lambda \\boldsymbol{I}_{pp})^{-1}\n", - "\\boldsymbol{X}_{-i, \\ast}^{T} \\boldsymbol{y}_{-i}\n", - "\\end{align*}\n", + "p(y_i, \\boldsymbol{X}\\vert\\boldsymbol{\\beta})=\\frac{1}{\\sqrt{2\\pi\\sigma^2}}\\exp{\\left[-\\frac{(y_i-\\boldsymbol{X}_{i,*}\\boldsymbol{\\beta})^2}{2\\sigma^2}\\right]},\n", "$$" ] }, @@ -621,11 +3642,9 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "* Evaluate the prediction performance of these models on the test set by $\\log\\{L[y_i, \\boldsymbol{X}_{i, \\ast}; \\boldsymbol{\\beta}_{-i}(\\lambda), \\boldsymbol{\\sigma}_{-i}^2(\\lambda)]\\}$. Or, by the prediction error $|y_i - \\boldsymbol{X}_{i, \\ast} \\boldsymbol{\\beta}_{-i}(\\lambda)|$, the relative error, the error squared or the R2 score function.\n", + "which reads as finding the likelihood of an event $y_i$ with the input variables $\\boldsymbol{X}$ given the parameters (to be determined) $\\boldsymbol{\\beta}$.\n", "\n", - "* Repeat the first three steps such that each sample plays the role of the test set once.\n", - "\n", - "* Average the prediction performances of the test sets at each grid point of the penalty bias/parameter. It is an estimate of the prediction performance of the model corresponding to this value of the penalty parameter on novel data. It is defined as" + "Since these events are assumed to be independent and identicall distributed we can build the probability distribution function (PDF) for all possible event $\\boldsymbol{y}$ as the product of the single events, that is we have" ] }, { @@ -633,9 +3652,7 @@ "metadata": {}, "source": [ "$$\n", - "\\begin{align*}\n", - "\\frac{1}{n} \\sum_{i = 1}^n \\log\\{L[y_i, \\mathbf{X}_{i, \\ast}; \\boldsymbol{\\beta}_{-i}(\\lambda), \\boldsymbol{\\sigma}_{-i}^2(\\lambda)]\\}.\n", - "\\end{align*}\n", + "p(\\boldsymbol{y},\\boldsymbol{X}\\vert\\boldsymbol{\\beta})=\\prod_{i=0}^{n-1}\\frac{1}{\\sqrt{2\\pi\\sigma^2}}\\exp{\\left[-\\frac{(y_i-\\boldsymbol{X}_{i,*}\\boldsymbol{\\beta})^2}{2\\sigma^2}\\right]}=\\prod_{i=0}^{n-1}p(y_i,\\boldsymbol{X}\\vert\\boldsymbol{\\beta}).\n", "$$" ] }, @@ -643,26 +3660,360 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "For the various values of $k$\n", - "\n", - "1. shuffle the dataset randomly.\n", - "\n", - "2. Split the dataset into $k$ groups.\n", - "\n", - "3. For each unique group:\n", - "\n", - "a. Decide which group to use as set for test data\n", - "\n", - "b. Take the remaining groups as a training data set\n", - "\n", - "c. Fit a model on the training set and evaluate it on the test set\n", - "\n", - "d. Retain the evaluation score and discard the model\n", + "We will write this in a more compact form reserving $\\boldsymbol{D}$ for the domain of events, including the ouputs (targets) and the inputs. That is\n", + "in case we have a simple one-dimensional input and output case" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{D}=[(x_0,y_0), (x_1,y_1),\\dots, (x_{n-1},y_{n-1})].\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "In the more general case the various inputs should be replaced by the possible features represented by the input data set $\\boldsymbol{X}$. \n", + "We can now rewrite the above probability as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(\\boldsymbol{D}\\vert\\boldsymbol{\\beta})=\\prod_{i=0}^{n-1}\\frac{1}{\\sqrt{2\\pi\\sigma^2}}\\exp{\\left[-\\frac{(y_i-\\boldsymbol{X}_{i,*}\\boldsymbol{\\beta})^2}{2\\sigma^2}\\right]}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "It is a conditional probability (see below) and reads as the likelihood of a domain of events $\\boldsymbol{D}$ given a set of parameters $\\boldsymbol{\\beta}$.\n", "\n", "\n", - "5. Summarize the model using the sample of model evaluation scores\n", + "In statistics, maximum likelihood estimation (MLE) is a method of\n", + "estimating the parameters of an assumed probability distribution,\n", + "given some observed data. This is achieved by maximizing a likelihood\n", + "function so that, under the assumed statistical model, the observed\n", + "data is the most probable. \n", "\n", - "The code here uses Ridge regression with cross-validation (CV) resampling and $k$-fold CV in order to fit a specific polynomial." + "\n", + "We will assume here that our events are given by the above Gaussian\n", + "distribution and we will determine the optimal parameters $\\beta$ by\n", + "maximizing the above PDF. However, computing the derivatives of a\n", + "product function is cumbersome and can easily lead to overflow and/or\n", + "underflowproblems, with potentials for loss of numerical precision.\n", + "\n", + "\n", + "In practice, it is more convenient to maximize the logarithm of the\n", + "PDF because it is a monotonically increasing function of the argument.\n", + "Alternatively, and this will be our option, we will minimize the\n", + "negative of the logarithm since this is a monotonically decreasing\n", + "function.\n", + "\n", + "Note also that maximization/minimization of the logarithm of the PDF\n", + "is equivalent to the maximization/minimization of the function itself.\n", + "\n", + "\n", + "\n", + "\n", + "We could now define a new cost function to minimize, namely the negative logarithm of the above PDF" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta}=-\\log{\\prod_{i=0}^{n-1}p(y_i,\\boldsymbol{X}\\vert\\boldsymbol{\\beta})}=-\\sum_{i=0}^{n-1}\\log{p(y_i,\\boldsymbol{X}\\vert\\boldsymbol{\\beta})},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which becomes" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta}=\\frac{n}{2}\\log{2\\pi\\sigma^2}+\\frac{\\vert\\vert (\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\vert\\vert_2^2}{2\\sigma^2}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Taking the derivative of the *new* cost function with respect to the parameters $\\beta$ we recognize our familiar OLS equation, namely" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{X}^T\\left(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\right) =0,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which leads to the well-known OLS equation for the optimal paramters $\\beta$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\hat{\\boldsymbol{\\beta}}^{\\mathrm{OLS}}=\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}!\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Before we make a similar analysis for Ridge and Lasso regression, we need a short reminder on statistics. \n", + "\n", + "\n", + "A central theorem in statistics is Bayes' theorem. This theorem plays a similar role as the good old Pythagoras' theorem in geometry.\n", + "Bayes' theorem is extremely simple to derive. But to do so we need some basic axioms from statistics.\n", + "\n", + "Assume we have two domains of events $X=[x_0,x_1,\\dots,x_{n-1}]$ and $Y=[y_0,y_1,\\dots,y_{n-1}]$.\n", + "\n", + "We define also the likelihood for $X$ and $Y$ as $p(X)$ and $p(Y)$ respectively.\n", + "The likelihood of a specific event $x_i$ (or $y_i$) is then written as $p(X=x_i)$ or just $p(x_i)=p_i$. \n", + "\n", + "**Union of events is given by.**" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(X \\cup Y)= p(X)+p(Y)-p(X \\cap Y).\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "**The product rule (aka joint probability) is given by.**" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(X \\cup Y)= p(X,Y)= p(X\\vert Y)p(Y)=p(Y\\vert X)p(X),\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "where we read $p(X\\vert Y)$ as the likelihood of obtaining $X$ given $Y$.\n", + "\n", + "\n", + "\n", + "If we have independent events then $p(X,Y)=p(X)p(Y)$.\n", + "\n", + "\n", + "\n", + "The marginal probability is defined in terms of only one of the set of variables $X,Y$. For a discrete probability we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(X)=\\sum_{i=0}^{n-1}p(X,Y=y_i)=\\sum_{i=0}^{n-1}p(X\\vert Y=y_i)p(Y=y_i)=\\sum_{i=0}^{n-1}p(X\\vert y_i)p(y_i).\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "The conditional probability, if $p(Y) > 0$, is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(X\\vert Y)= \\frac{p(X,Y)}{p(Y)}=\\frac{p(X,Y)}{\\sum_{i=0}^{n-1}p(Y\\vert X=x_i)p(x_i)}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "If we combine the conditional probability with the marginal probability and the standard product rule, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(X\\vert Y)= \\frac{p(X,Y)}{p(Y)},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which we can rewrite as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(X\\vert Y)= \\frac{p(X,Y)}{\\sum_{i=0}^{n-1}p(Y\\vert X=x_i)p(x_i)}=\\frac{p(Y\\vert X)p(X)}{\\sum_{i=0}^{n-1}p(Y\\vert X=x_i)p(x_i)},\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which is Bayes' theorem. It allows us to evaluate the uncertainty in in $X$ after we have observed $Y$. We can easily interchange $X$ with $Y$. \n", + "\n", + "\n", + "The quantity $p(Y\\vert X)$ on the right-hand side of the theorem is\n", + "evaluated for the observed data $Y$ and can be viewed as a function of\n", + "the parameter space represented by $X$. This function is not\n", + "necesseraly normalized and is normally called the likelihood function.\n", + "\n", + "The function $p(X)$ on the right hand side is called the prior while the function on the left hand side is the called the posterior probability. The denominator on the right hand side serves as a normalization factor for the posterior distribution.\n", + "\n", + "Let us try to illustrate Bayes' theorem through an example.\n", + "\n", + "\n", + "Let us suppose that you are undergoing a series of mammography scans in\n", + "order to rule out possible breast cancer cases. We define the\n", + "sensitivity for a positive event by the variable $X$. It takes binary\n", + "values with $X=1$ representing a positive event and $X=0$ being a\n", + "negative event. We reserve $Y$ as a classification parameter for\n", + "either a negative or a positive breast cancer confirmation. (Short note on wordings: positive here means having breast cancer, although none of us would consider this being a positive thing).\n", + "\n", + "We let $Y=1$ represent the the case of having breast cancer and $Y=0$ as not.\n", + "\n", + "Let us assume that if you have breast cancer, the test will be positive with a probability of $0.8$, that is we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(X=1\\vert Y=1) =0.8.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "This obviously sounds scary since many would conclude that if the test is positive, there is a likelihood of $80\\%$ for having cancer.\n", + "It is however not correct, as the following Bayesian analysis shows.\n", + "\n", + "\n", + "If we look at various national surveys on breast cancer, the general likelihood of developing breast cancer is a very small number.\n", + "Let us assume that the prior probability in the population as a whole is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(Y=1) =0.004.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We need also to account for the fact that the test may produce a false positive result (false alarm). Let us here assume that we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(X=1\\vert Y=0) =0.1.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Using Bayes' theorem we can then find the posterior probability that the person has breast cancer in case of a positive test, that is we can compute" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(Y=1\\vert X=1)=\\frac{p(X=1\\vert Y=1)p(Y=1)}{p(X=1\\vert Y=1)p(Y=1)+p(X=1\\vert Y=0)p(Y=0)}=\\frac{0.8\\times 0.004}{0.8\\times 0.004+0.1\\times 0.996}=0.031.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "That is, in case of a positive test, there is only a $3\\%$ chance of having breast cancer!\n", + "\n", + "\n", + "\n", + "## Bayes' Theorem and Ridge and Lasso Regression\n", + "\n", + "Hitherto we have discussed Ridge and Lasso regression in terms of a\n", + "linear analysis. This may to many of you feel rather technical and\n", + "perhaps not that intuitive. The question is whether we can develop a\n", + "more intuitive way of understanding what Ridge and Lasso express.\n", + "\n", + "Before we proceed let us perform a Ridge, Lasso and OLS analysis of a polynomial fit. \n", + "\n", + "\n", + "We will play around with a study of the values for the optimal\n", + "parameters $\\boldsymbol{\\beta}$ using OLS, Ridge and Lasso regression. For\n", + "OLS, you will notice as function of the noise and polynomial degree,\n", + "that the parameters $\\beta$ will fluctuate from order to order in the\n", + "polynomial fit and that for larger and larger polynomial degrees of freedom, the parameters will tend to increase in value for OLS.\n", + "\n", + "For Ridge and Lasso regression, the higher order parameters will typically be reduced, providing thereby less fluctuations from one order to another one." ] }, { @@ -676,674 +4027,289 @@ "source": [ "import numpy as np\n", "import matplotlib.pyplot as plt\n", - "from sklearn.model_selection import KFold\n", - "from sklearn.linear_model import Ridge\n", - "from sklearn.model_selection import cross_val_score\n", - "from sklearn.preprocessing import PolynomialFeatures\n", - "\n", - "# A seed just to ensure that the random numbers are the same for every run.\n", - "# Useful for eventual debugging.\n", - "np.random.seed(3155)\n", - "\n", - "# Generate the data.\n", - "nsamples = 100\n", - "x = np.random.randn(nsamples)\n", - "y = 3*x**2 + np.random.randn(nsamples)\n", - "\n", - "## Cross-validation on Ridge regression using KFold only\n", - "\n", - "# Decide degree on polynomial to fit\n", - "poly = PolynomialFeatures(degree = 6)\n", - "\n", - "# Decide which values of lambda to use\n", - "nlambdas = 500\n", - "lambdas = np.logspace(-3, 5, nlambdas)\n", - "\n", - "# Initialize a KFold instance\n", - "k = 5\n", - "kfold = KFold(n_splits = k)\n", - "\n", - "# Perform the cross-validation to estimate MSE\n", - "scores_KFold = np.zeros((nlambdas, k))\n", - "\n", - "i = 0\n", - "for lmb in lambdas:\n", - " ridge = Ridge(alpha = lmb)\n", - " j = 0\n", - " for train_inds, test_inds in kfold.split(x):\n", - " xtrain = x[train_inds]\n", - " ytrain = y[train_inds]\n", - "\n", - " xtest = x[test_inds]\n", - " ytest = y[test_inds]\n", - "\n", - " Xtrain = poly.fit_transform(xtrain[:, np.newaxis])\n", - " ridge.fit(Xtrain, ytrain[:, np.newaxis])\n", - "\n", - " Xtest = poly.fit_transform(xtest[:, np.newaxis])\n", - " ypred = ridge.predict(Xtest)\n", - "\n", - " scores_KFold[i,j] = np.sum((ypred - ytest[:, np.newaxis])**2)/np.size(ypred)\n", - "\n", - " j += 1\n", - " i += 1\n", - "\n", - "\n", - "estimated_mse_KFold = np.mean(scores_KFold, axis = 1)\n", - "\n", - "## Cross-validation using cross_val_score from sklearn along with KFold\n", - "\n", - "# kfold is an instance initialized above as:\n", - "# kfold = KFold(n_splits = k)\n", - "\n", - "estimated_mse_sklearn = np.zeros(nlambdas)\n", - "i = 0\n", - "for lmb in lambdas:\n", - " ridge = Ridge(alpha = lmb)\n", - "\n", - " X = poly.fit_transform(x[:, np.newaxis])\n", - " estimated_mse_folds = cross_val_score(ridge, X, y[:, np.newaxis], scoring='neg_mean_squared_error', cv=kfold)\n", - "\n", - " # cross_val_score return an array containing the estimated negative mse for every fold.\n", - " # we have to the the mean of every array in order to get an estimate of the mse of the model\n", - " estimated_mse_sklearn[i] = np.mean(-estimated_mse_folds)\n", - "\n", - " i += 1\n", - "\n", - "## Plot and compare the slightly different ways to perform cross-validation\n", - "\n", - "plt.figure()\n", - "\n", - "plt.plot(np.log10(lambdas), estimated_mse_sklearn, label = 'cross_val_score')\n", - "plt.plot(np.log10(lambdas), estimated_mse_KFold, 'r--', label = 'KFold')\n", - "\n", - "plt.xlabel('log10(lambda)')\n", - "plt.ylabel('mse')\n", - "\n", - "plt.legend()\n", - "\n", - "plt.show()" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "## The bias-variance tradeoff\n", - "\n", - "\n", - "We will discuss the bias-variance tradeoff in the context of\n", - "continuous predictions such as regression. However, many of the\n", - "intuitions and ideas discussed here also carry over to classification\n", - "tasks. Consider a dataset $\\mathcal{L}$ consisting of the data\n", - "$\\mathbf{X}_\\mathcal{L}=\\{(y_j, \\boldsymbol{x}_j), j=0\\ldots n-1\\}$. \n", - "\n", - "Let us assume that the true data is generated from a noisy model" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{y}=f(\\boldsymbol{x}) + \\boldsymbol{\\epsilon}\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "where $\\epsilon$ is normally distributed with mean zero and standard deviation $\\sigma^2$.\n", - "\n", - "In our derivation of the ordinary least squares method we defined then\n", - "an approximation to the function $f$ in terms of the parameters\n", - "$\\boldsymbol{\\beta}$ and the design matrix $\\boldsymbol{X}$ which embody our model,\n", - "that is $\\boldsymbol{\\tilde{y}}=\\boldsymbol{X}\\boldsymbol{\\beta}$. \n", - "\n", - "Thereafter we found the parameters $\\boldsymbol{\\beta}$ by optimizing the means squared error via the so-called cost function" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "C(\\boldsymbol{X},\\boldsymbol{\\beta}) =\\frac{1}{n}\\sum_{i=0}^{n-1}(y_i-\\tilde{y}_i)^2=\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right].\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We can rewrite this as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right]=\\frac{1}{n}\\sum_i(f_i-\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right])^2+\\frac{1}{n}\\sum_i(\\tilde{y}_i-\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right])^2+\\sigma^2.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The three terms represent the square of the bias of the learning\n", - "method, which can be thought of as the error caused by the simplifying\n", - "assumptions built into the method. The second term represents the\n", - "variance of the chosen model and finally the last terms is variance of\n", - "the error $\\boldsymbol{\\epsilon}$.\n", - "\n", - "To derive this equation, we need to recall that the variance of $\\boldsymbol{y}$ and $\\boldsymbol{\\epsilon}$ are both equal to $\\sigma^2$. The mean value of $\\boldsymbol{\\epsilon}$ is by definition equal to zero. Furthermore, the function $f$ is not a stochastics variable, idem for $\\boldsymbol{\\tilde{y}}$.\n", - "We use a more compact notation in terms of the expectation value" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right]=\\mathbb{E}\\left[(\\boldsymbol{f}+\\boldsymbol{\\epsilon}-\\boldsymbol{\\tilde{y}})^2\\right],\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "and adding and subtracting $\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right]$ we get" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right]=\\mathbb{E}\\left[(\\boldsymbol{f}+\\boldsymbol{\\epsilon}-\\boldsymbol{\\tilde{y}}+\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right]-\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right])^2\\right],\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "which, using the abovementioned expectation values can be rewritten as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right]=\\mathbb{E}\\left[(\\boldsymbol{y}-\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right])^2\\right]+\\mathrm{Var}\\left[\\boldsymbol{\\tilde{y}}\\right]+\\sigma^2,\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "that is the rewriting in terms of the so-called bias, the variance of the model $\\boldsymbol{\\tilde{y}}$ and the variance of $\\boldsymbol{\\epsilon}$." - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": { - "collapsed": false, - "editable": true - }, - "outputs": [], - "source": [ - "import matplotlib.pyplot as plt\n", - "import numpy as np\n", - "from sklearn.linear_model import LinearRegression, Ridge, Lasso\n", - "from sklearn.preprocessing import PolynomialFeatures\n", "from sklearn.model_selection import train_test_split\n", - "from sklearn.pipeline import make_pipeline\n", - "from sklearn.utils import resample\n", + "from sklearn import linear_model\n", "\n", - "np.random.seed(2018)\n", - "\n", - "n = 500\n", - "n_boostraps = 100\n", - "degree = 18 # A quite high value, just to show.\n", - "noise = 0.1\n", + "def R2(y_data, y_model):\n", + " return 1 - np.sum((y_data - y_model) ** 2) / np.sum((y_data - np.mean(y_data)) ** 2)\n", + "def MSE(y_data,y_model):\n", + " n = np.size(y_model)\n", + " return np.sum((y_data-y_model)**2)/n\n", "\n", "# Make data set.\n", - "x = np.linspace(-1, 3, n).reshape(-1, 1)\n", - "y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2) + np.random.normal(0, 0.1, x.shape)\n", + "n = 10000\n", + "x = np.random.rand(n)\n", + "y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2)+ np.random.randn(n)\n", "\n", - "# Hold out some test data that is never used in training.\n", - "x_train, x_test, y_train, y_test = train_test_split(x, y, test_size=0.2)\n", - "\n", - "# Combine x transformation and model into one operation.\n", - "# Not neccesary, but convenient.\n", - "model = make_pipeline(PolynomialFeatures(degree=degree), LinearRegression(fit_intercept=False))\n", - "\n", - "# The following (m x n_bootstraps) matrix holds the column vectors y_pred\n", - "# for each bootstrap iteration.\n", - "y_pred = np.empty((y_test.shape[0], n_boostraps))\n", - "for i in range(n_boostraps):\n", - " x_, y_ = resample(x_train, y_train)\n", - "\n", - " # Evaluate the new model on the same test data each time.\n", - " y_pred[:, i] = model.fit(x_, y_).predict(x_test).ravel()\n", - "\n", - "# Note: Expectations and variances taken w.r.t. different training\n", - "# data sets, hence the axis=1. Subsequent means are taken across the test data\n", - "# set in order to obtain a total value, but before this we have error/bias/variance\n", - "# calculated per data point in the test set.\n", - "# Note 2: The use of keepdims=True is important in the calculation of bias as this \n", - "# maintains the column vector form. Dropping this yields very unexpected results.\n", - "error = np.mean( np.mean((y_test - y_pred)**2, axis=1, keepdims=True) )\n", - "bias = np.mean( (y_test - np.mean(y_pred, axis=1, keepdims=True))**2 )\n", - "variance = np.mean( np.var(y_pred, axis=1, keepdims=True) )\n", - "print('Error:', error)\n", - "print('Bias^2:', bias)\n", - "print('Var:', variance)\n", - "print('{} >= {} + {} = {}'.format(error, bias, variance, bias+variance))\n", - "\n", - "plt.plot(x[::5, :], y[::5, :], label='f(x)')\n", - "plt.scatter(x_test, y_test, label='Data points')\n", - "plt.scatter(x_test, np.mean(y_pred, axis=1), label='Pred')\n", - "plt.legend()\n", - "plt.show()" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": { - "collapsed": false, - "editable": true - }, - "outputs": [], - "source": [ - "import matplotlib.pyplot as plt\n", - "import numpy as np\n", - "from sklearn.linear_model import LinearRegression, Ridge, Lasso\n", - "from sklearn.preprocessing import PolynomialFeatures\n", - "from sklearn.model_selection import train_test_split\n", - "from sklearn.pipeline import make_pipeline\n", - "from sklearn.utils import resample\n", - "\n", - "np.random.seed(2018)\n", - "\n", - "n = 40\n", - "n_boostraps = 100\n", - "maxdegree = 14\n", - "\n", - "\n", - "# Make data set.\n", - "x = np.linspace(-3, 3, n).reshape(-1, 1)\n", - "y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2)+ np.random.normal(0, 0.1, x.shape)\n", - "error = np.zeros(maxdegree)\n", - "bias = np.zeros(maxdegree)\n", - "variance = np.zeros(maxdegree)\n", - "polydegree = np.zeros(maxdegree)\n", - "x_train, x_test, y_train, y_test = train_test_split(x, y, test_size=0.2)\n", - "\n", - "for degree in range(maxdegree):\n", - " model = make_pipeline(PolynomialFeatures(degree=degree), LinearRegression(fit_intercept=False))\n", - " y_pred = np.empty((y_test.shape[0], n_boostraps))\n", - " for i in range(n_boostraps):\n", - " x_, y_ = resample(x_train, y_train)\n", - " y_pred[:, i] = model.fit(x_, y_).predict(x_test).ravel()\n", - "\n", - " polydegree[degree] = degree\n", - " error[degree] = np.mean( np.mean((y_test - y_pred)**2, axis=1, keepdims=True) )\n", - " bias[degree] = np.mean( (y_test - np.mean(y_pred, axis=1, keepdims=True))**2 )\n", - " variance[degree] = np.mean( np.var(y_pred, axis=1, keepdims=True) )\n", - " print('Polynomial degree:', degree)\n", - " print('Error:', error[degree])\n", - " print('Bias^2:', bias[degree])\n", - " print('Var:', variance[degree])\n", - " print('{} >= {} + {} = {}'.format(error[degree], bias[degree], variance[degree], bias[degree]+variance[degree]))\n", - "\n", - "plt.plot(polydegree, error, label='Error')\n", - "plt.plot(polydegree, bias, label='bias')\n", - "plt.plot(polydegree, variance, label='Variance')\n", - "plt.legend()\n", - "plt.show()" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The bias-variance tradeoff summarizes the fundamental tension in\n", - "machine learning, particularly supervised learning, between the\n", - "complexity of a model and the amount of training data needed to train\n", - "it. Since data is often limited, in practice it is often useful to\n", - "use a less-complex model with higher bias, that is a model whose asymptotic\n", - "performance is worse than another model because it is easier to\n", - "train and less sensitive to sampling noise arising from having a\n", - "finite-sized training dataset (smaller variance). \n", - "\n", - "\n", - "\n", - "The above equations tell us that in\n", - "order to minimize the expected test error, we need to select a\n", - "statistical learning method that simultaneously achieves low variance\n", - "and low bias. Note that variance is inherently a nonnegative quantity,\n", - "and squared bias is also nonnegative. Hence, we see that the expected\n", - "test MSE can never lie below $Var(\\epsilon)$, the irreducible error.\n", - "\n", - "\n", - "What do we mean by the variance and bias of a statistical learning\n", - "method? The variance refers to the amount by which our model would change if we\n", - "estimated it using a different training data set. Since the training\n", - "data are used to fit the statistical learning method, different\n", - "training data sets will result in a different estimate. But ideally the\n", - "estimate for our model should not vary too much between training\n", - "sets. However, if a method has high variance then small changes in\n", - "the training data can result in large changes in the model. In general, more\n", - "flexible statistical methods have higher variance.\n", - "\n", - "\n", - "You may also find this recent [article](https://www.pnas.org/content/116/32/15849) of interest." - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": { - "collapsed": false, - "editable": true - }, - "outputs": [], - "source": [ - "\"\"\"\n", - "============================\n", - "Underfitting vs. Overfitting\n", - "============================\n", - "\n", - "This example demonstrates the problems of underfitting and overfitting and\n", - "how we can use linear regression with polynomial features to approximate\n", - "nonlinear functions. The plot shows the function that we want to approximate,\n", - "which is a part of the cosine function. In addition, the samples from the\n", - "real function and the approximations of different models are displayed. The\n", - "models have polynomial features of different degrees. We can see that a\n", - "linear function (polynomial with degree 1) is not sufficient to fit the\n", - "training samples. This is called **underfitting**. A polynomial of degree 4\n", - "approximates the true function almost perfectly. However, for higher degrees\n", - "the model will **overfit** the training data, i.e. it learns the noise of the\n", - "training data.\n", - "We evaluate quantitatively **overfitting** / **underfitting** by using\n", - "cross-validation. We calculate the mean squared error (MSE) on the validation\n", - "set, the higher, the less likely the model generalizes correctly from the\n", - "training data.\n", - "\"\"\"\n", - "\n", - "print(__doc__)\n", - "\n", - "import numpy as np\n", - "import matplotlib.pyplot as plt\n", - "from sklearn.pipeline import Pipeline\n", - "from sklearn.preprocessing import PolynomialFeatures\n", - "from sklearn.linear_model import LinearRegression\n", - "from sklearn.model_selection import cross_val_score\n", - "\n", - "\n", - "def true_fun(X):\n", - " return np.cos(1.5 * np.pi * X)\n", - "\n", - "np.random.seed(0)\n", - "\n", - "n_samples = 30\n", - "degrees = [1, 4, 15]\n", - "\n", - "X = np.sort(np.random.rand(n_samples))\n", - "y = true_fun(X) + np.random.randn(n_samples) * 0.1\n", - "\n", - "plt.figure(figsize=(14, 5))\n", - "for i in range(len(degrees)):\n", - " ax = plt.subplot(1, len(degrees), i + 1)\n", - " plt.setp(ax, xticks=(), yticks=())\n", - "\n", - " polynomial_features = PolynomialFeatures(degree=degrees[i],\n", - " include_bias=False)\n", - " linear_regression = LinearRegression()\n", - " pipeline = Pipeline([(\"polynomial_features\", polynomial_features),\n", - " (\"linear_regression\", linear_regression)])\n", - " pipeline.fit(X[:, np.newaxis], y)\n", - "\n", - " # Evaluate the models using crossvalidation\n", - " scores = cross_val_score(pipeline, X[:, np.newaxis], y,\n", - " scoring=\"neg_mean_squared_error\", cv=10)\n", - "\n", - " X_test = np.linspace(0, 1, 100)\n", - " plt.plot(X_test, pipeline.predict(X_test[:, np.newaxis]), label=\"Model\")\n", - " plt.plot(X_test, true_fun(X_test), label=\"True function\")\n", - " plt.scatter(X, y, edgecolor='b', s=20, label=\"Samples\")\n", - " plt.xlabel(\"x\")\n", - " plt.ylabel(\"y\")\n", - " plt.xlim((0, 1))\n", - " plt.ylim((-2, 2))\n", - " plt.legend(loc=\"best\")\n", - " plt.title(\"Degree {}\\nMSE = {:.2e}(+/- {:.2e})\".format(\n", - " degrees[i], -scores.mean(), scores.std()))\n", - "plt.show()" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": { - "collapsed": false, - "editable": true - }, - "outputs": [], - "source": [ - "# Common imports\n", - "import os\n", - "import numpy as np\n", - "import pandas as pd\n", - "import matplotlib.pyplot as plt\n", - "from sklearn.linear_model import LinearRegression, Ridge, Lasso\n", - "from sklearn.model_selection import train_test_split\n", - "from sklearn.utils import resample\n", - "from sklearn.metrics import mean_squared_error\n", - "# Where to save the figures and data files\n", - "PROJECT_ROOT_DIR = \"Results\"\n", - "FIGURE_ID = \"Results/FigureFiles\"\n", - "DATA_ID = \"DataFiles/\"\n", - "\n", - "if not os.path.exists(PROJECT_ROOT_DIR):\n", - " os.mkdir(PROJECT_ROOT_DIR)\n", - "\n", - "if not os.path.exists(FIGURE_ID):\n", - " os.makedirs(FIGURE_ID)\n", - "\n", - "if not os.path.exists(DATA_ID):\n", - " os.makedirs(DATA_ID)\n", - "\n", - "def image_path(fig_id):\n", - " return os.path.join(FIGURE_ID, fig_id)\n", - "\n", - "def data_path(dat_id):\n", - " return os.path.join(DATA_ID, dat_id)\n", - "\n", - "def save_fig(fig_id):\n", - " plt.savefig(image_path(fig_id) + \".png\", format='png')\n", - "\n", - "infile = open(data_path(\"EoS.csv\"),'r')\n", - "\n", - "# Read the EoS data as csv file and organize the data into two arrays with density and energies\n", - "EoS = pd.read_csv(infile, names=('Density', 'Energy'))\n", - "EoS['Energy'] = pd.to_numeric(EoS['Energy'], errors='coerce')\n", - "EoS = EoS.dropna()\n", - "Energies = EoS['Energy']\n", - "Density = EoS['Density']\n", - "# The design matrix now as function of various polytrops\n", - "\n", - "Maxpolydegree = 30\n", - "X = np.zeros((len(Density),Maxpolydegree))\n", + "Maxpolydegree = 5\n", + "X = np.zeros((len(x),Maxpolydegree))\n", "X[:,0] = 1.0\n", - "testerror = np.zeros(Maxpolydegree)\n", - "trainingerror = np.zeros(Maxpolydegree)\n", - "polynomial = np.zeros(Maxpolydegree)\n", - "\n", - "trials = 100\n", - "for polydegree in range(1, Maxpolydegree):\n", - " polynomial[polydegree] = polydegree\n", - " for degree in range(polydegree):\n", - " X[:,degree] = Density**(degree/3.0)\n", - "\n", - "# loop over trials in order to estimate the expectation value of the MSE\n", - " testerror[polydegree] = 0.0\n", - " trainingerror[polydegree] = 0.0\n", - " for samples in range(trials):\n", - " x_train, x_test, y_train, y_test = train_test_split(X, Energies, test_size=0.2)\n", - " model = LinearRegression(fit_intercept=True).fit(x_train, y_train)\n", - " ypred = model.predict(x_train)\n", - " ytilde = model.predict(x_test)\n", - " testerror[polydegree] += mean_squared_error(y_test, ytilde)\n", - " trainingerror[polydegree] += mean_squared_error(y_train, ypred) \n", - "\n", - " testerror[polydegree] /= trials\n", - " trainingerror[polydegree] /= trials\n", - " print(\"Degree of polynomial: %3d\"% polynomial[polydegree])\n", - " print(\"Mean squared error on training data: %.8f\" % trainingerror[polydegree])\n", - " print(\"Mean squared error on test data: %.8f\" % testerror[polydegree])\n", - "\n", - "plt.plot(polynomial, np.log10(trainingerror), label='Training Error')\n", - "plt.plot(polynomial, np.log10(testerror), label='Test Error')\n", - "plt.xlabel('Polynomial degree')\n", - "plt.ylabel('log10[MSE]')\n", - "plt.legend()\n", - "plt.show()" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": { - "collapsed": false, - "editable": true - }, - "outputs": [], - "source": [ - "# Common imports\n", - "import os\n", - "import numpy as np\n", - "import pandas as pd\n", - "import matplotlib.pyplot as plt\n", - "from sklearn.linear_model import LinearRegression, Ridge, Lasso\n", - "from sklearn.metrics import mean_squared_error\n", - "from sklearn.model_selection import KFold\n", - "from sklearn.model_selection import cross_val_score\n", - "\n", - "\n", - "# Where to save the figures and data files\n", - "PROJECT_ROOT_DIR = \"Results\"\n", - "FIGURE_ID = \"Results/FigureFiles\"\n", - "DATA_ID = \"DataFiles/\"\n", - "\n", - "if not os.path.exists(PROJECT_ROOT_DIR):\n", - " os.mkdir(PROJECT_ROOT_DIR)\n", - "\n", - "if not os.path.exists(FIGURE_ID):\n", - " os.makedirs(FIGURE_ID)\n", - "\n", - "if not os.path.exists(DATA_ID):\n", - " os.makedirs(DATA_ID)\n", - "\n", - "def image_path(fig_id):\n", - " return os.path.join(FIGURE_ID, fig_id)\n", - "\n", - "def data_path(dat_id):\n", - " return os.path.join(DATA_ID, dat_id)\n", - "\n", - "def save_fig(fig_id):\n", - " plt.savefig(image_path(fig_id) + \".png\", format='png')\n", - "\n", - "infile = open(data_path(\"EoS.csv\"),'r')\n", - "\n", - "# Read the EoS data as csv file and organize the data into two arrays with density and energies\n", - "EoS = pd.read_csv(infile, names=('Density', 'Energy'))\n", - "EoS['Energy'] = pd.to_numeric(EoS['Energy'], errors='coerce')\n", - "EoS = EoS.dropna()\n", - "Energies = EoS['Energy']\n", - "Density = EoS['Density']\n", - "# The design matrix now as function of various polytrops\n", - "\n", - "Maxpolydegree = 30\n", - "X = np.zeros((len(Density),Maxpolydegree))\n", - "X[:,0] = 1.0\n", - "estimated_mse_sklearn = np.zeros(Maxpolydegree)\n", - "polynomial = np.zeros(Maxpolydegree)\n", - "k =5\n", - "kfold = KFold(n_splits = k)\n", "\n", "for polydegree in range(1, Maxpolydegree):\n", - " polynomial[polydegree] = polydegree\n", " for degree in range(polydegree):\n", - " X[:,degree] = Density**(degree/3.0)\n", - " OLS = LinearRegression()\n", - "# loop over trials in order to estimate the expectation value of the MSE\n", - " estimated_mse_folds = cross_val_score(OLS, X, Energies, scoring='neg_mean_squared_error', cv=kfold)\n", - "#[:, np.newaxis]\n", - " estimated_mse_sklearn[polydegree] = np.mean(-estimated_mse_folds)\n", + " X[:,degree] = x**(degree)\n", "\n", - "plt.plot(polynomial, np.log10(estimated_mse_sklearn), label='Test Error')\n", - "plt.xlabel('Polynomial degree')\n", - "plt.ylabel('log10[MSE]')\n", - "plt.legend()\n", - "plt.show()" - ] - }, - { - "cell_type": "code", - "execution_count": null, - "metadata": { - "collapsed": false, - "editable": true - }, - "outputs": [], - "source": [ - "import numpy as np\n", - "import matplotlib.pyplot as plt\n", - "from sklearn.model_selection import KFold\n", - "from sklearn.linear_model import Ridge\n", - "from sklearn.model_selection import cross_val_score\n", - "from sklearn.preprocessing import PolynomialFeatures\n", "\n", - "# A seed just to ensure that the random numbers are the same for every run.\n", - "np.random.seed(3155)\n", - "# Generate the data.\n", - "n = 100\n", - "x = np.linspace(-3, 3, n).reshape(-1, 1)\n", - "y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2)+ np.random.normal(0, 0.1, x.shape)\n", - "# Decide degree on polynomial to fit\n", - "poly = PolynomialFeatures(degree = 10)\n", + "# We split the data in test and training data\n", + "X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2)\n", "\n", + "# matrix inversion to find beta\n", + "OLSbeta = np.linalg.pinv(X_train.T @ X_train) @ X_train.T @ y_train\n", + "print(OLSbeta)\n", + "ypredictOLS = X_test @ OLSbeta\n", + "print(\"Test MSE OLS\")\n", + "print(MSE(y_test,ypredictOLS))\n", + "# Repeat now for Lasso and Ridge regression and various values of the regularization parameter using Scikit-Learn\n", "# Decide which values of lambda to use\n", - "nlambdas = 500\n", - "lambdas = np.logspace(-3, 5, nlambdas)\n", - "# Initialize a KFold instance\n", - "k = 5\n", - "kfold = KFold(n_splits = k)\n", - "estimated_mse_sklearn = np.zeros(nlambdas)\n", - "i = 0\n", - "for lmb in lambdas:\n", - " ridge = Ridge(alpha = lmb)\n", - " estimated_mse_folds = cross_val_score(ridge, x, y, scoring='neg_mean_squared_error', cv=kfold)\n", - " estimated_mse_sklearn[i] = np.mean(-estimated_mse_folds)\n", - " i += 1\n", + "nlambdas = 4\n", + "MSERidgePredict = np.zeros(nlambdas)\n", + "MSELassoPredict = np.zeros(nlambdas)\n", + "lambdas = np.logspace(-3, 1, nlambdas)\n", + "for i in range(nlambdas):\n", + " lmb = lambdas[i]\n", + " # Make the fit using Ridge and Lasso\n", + " RegRidge = linear_model.Ridge(lmb,fit_intercept=False)\n", + " RegRidge.fit(X_train,y_train)\n", + " RegLasso = linear_model.Lasso(lmb,fit_intercept=False)\n", + " RegLasso.fit(X_train,y_train)\n", + " # and then make the prediction\n", + " ypredictRidge = RegRidge.predict(X_test)\n", + " ypredictLasso = RegLasso.predict(X_test)\n", + " # Compute the MSE and print it\n", + " MSERidgePredict[i] = MSE(y_test,ypredictRidge)\n", + " MSELassoPredict[i] = MSE(y_test,ypredictLasso)\n", + " print(lmb,RegRidge.coef_)\n", + " print(lmb,RegLasso.coef_)\n", + "# Now plot the results\n", "plt.figure()\n", - "plt.plot(np.log10(lambdas), estimated_mse_sklearn, label = 'cross_val_score')\n", + "plt.plot(np.log10(lambdas), MSERidgePredict, 'b', label = 'MSE Ridge Test')\n", + "plt.plot(np.log10(lambdas), MSELassoPredict, 'r', label = 'MSE Lasso Test')\n", "plt.xlabel('log10(lambda)')\n", "plt.ylabel('MSE')\n", "plt.legend()\n", "plt.show()" ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "How can we understand this? \n", + "\n", + "\n", + "\n", + "Using Bayes' theorem we can gain a better intuition about Ridge and Lasso regression. \n", + "\n", + "For ordinary least squares we postulated that the maximum likelihood for the doamin of events $\\boldsymbol{D}$ (one-dimensional case)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{D}=[(x_0,y_0), (x_1,y_1),\\dots, (x_{n-1},y_{n-1})],\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "is given by" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(\\boldsymbol{D}\\vert\\boldsymbol{\\beta})=\\prod_{i=0}^{n-1}\\frac{1}{\\sqrt{2\\pi\\sigma^2}}\\exp{\\left[-\\frac{(y_i-\\boldsymbol{X}_{i,*}\\boldsymbol{\\beta})^2}{2\\sigma^2}\\right]}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "In Bayes' theorem this function plays the role of the so-called likelihood. We could now ask the question what is the posterior probability of a parameter set $\\boldsymbol{\\beta}$ given a domain of events $\\boldsymbol{D}$? That is, how can we define the posterior probability" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(\\boldsymbol{\\beta}\\vert\\boldsymbol{D}).\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Bayes' theorem comes to our rescue here since (omitting the normalization constant)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(\\boldsymbol{\\beta}\\vert\\boldsymbol{D})\\propto p(\\boldsymbol{D}\\vert\\boldsymbol{\\beta})p(\\boldsymbol{\\beta}).\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We have a model for $p(\\boldsymbol{D}\\vert\\boldsymbol{\\beta})$ but need one for the **prior** $p(\\boldsymbol{\\beta}$! \n", + "\n", + "\n", + "\n", + "With the posterior probability defined by a likelihood which we have\n", + "already modeled and an unknown prior, we are now ready to make\n", + "additional models for the prior.\n", + "\n", + "We can, based on our discussions of the variance of $\\boldsymbol{\\beta}$ and the mean value, assume that the prior for the values $\\boldsymbol{\\beta}$ is given by a Gaussian with mean value zero and variance $\\tau^2$, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(\\boldsymbol{\\beta})=\\prod_{j=0}^{p-1}\\exp{\\left(-\\frac{\\beta_j^2}{2\\tau^2}\\right)}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Our posterior probability becomes then (omitting the normalization factor which is just a constant)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(\\boldsymbol{\\beta\\vert\\boldsymbol{D})}=\\prod_{i=0}^{n-1}\\frac{1}{\\sqrt{2\\pi\\sigma^2}}\\exp{\\left[-\\frac{(y_i-\\boldsymbol{X}_{i,*}\\boldsymbol{\\beta})^2}{2\\sigma^2}\\right]}\\prod_{j=0}^{p-1}\\exp{\\left(-\\frac{\\beta_j^2}{2\\tau^2}\\right)}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We can now optimize this quantity with respect to $\\boldsymbol{\\beta}$. As we\n", + "did for OLS, this is most conveniently done by taking the negative\n", + "logarithm of the posterior probability. Doing so and leaving out the\n", + "constants terms that do not depend on $\\beta$, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta})=\\frac{\\vert\\vert (\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\vert\\vert_2^2}{2\\sigma^2}+\\frac{1}{2\\tau^2}\\vert\\vert\\boldsymbol{\\beta}\\vert\\vert_2^2,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and replacing $1/2\\tau^2$ with $\\lambda$ we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta})=\\frac{\\vert\\vert (\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\vert\\vert_2^2}{2\\sigma^2}+\\lambda\\vert\\vert\\boldsymbol{\\beta}\\vert\\vert_2^2,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which is our Ridge cost function! Nice, isn't it?\n", + "\n", + "\n", + "To derive the Lasso cost function, we simply replace the Gaussian prior with an exponential distribution ([Laplace in this case](https://en.wikipedia.org/wiki/Laplace_distribution)) with zero mean value, that is" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(\\boldsymbol{\\beta})=\\prod_{j=0}^{p-1}\\exp{\\left(-\\frac{\\vert\\beta_j\\vert}{\\tau}\\right)}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Our posterior probability becomes then (omitting the normalization factor which is just a constant)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "p(\\boldsymbol{\\beta}\\vert\\boldsymbol{D})=\\prod_{i=0}^{n-1}\\frac{1}{\\sqrt{2\\pi\\sigma^2}}\\exp{\\left[-\\frac{(y_i-\\boldsymbol{X}_{i,*}\\boldsymbol{\\beta})^2}{2\\sigma^2}\\right]}\\prod_{j=0}^{p-1}\\exp{\\left(-\\frac{\\vert\\beta_j\\vert}{\\tau}\\right)}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "Taking the negative\n", + "logarithm of the posterior probability and leaving out the\n", + "constants terms that do not depend on $\\beta$, we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta}=\\frac{\\vert\\vert (\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\vert\\vert_2^2}{2\\sigma^2}+\\frac{1}{\\tau}\\vert\\vert\\boldsymbol{\\beta}\\vert\\vert_1,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "and replacing $1/\\tau$ with $\\lambda$ we have" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "C(\\boldsymbol{\\beta}=\\frac{\\vert\\vert (\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\vert\\vert_2^2}{2\\sigma^2}+\\lambda\\vert\\vert\\boldsymbol{\\beta}\\vert\\vert_1,\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "which is our Lasso cost function!" + ] } ], "metadata": {}, diff --git a/doc/LectureNotes/_build/html/_sources/chapter3.ipynb b/doc/LectureNotes/_build/html/_sources/chapter3.ipynb index 5ede9f687..d7f8222d5 100644 --- a/doc/LectureNotes/_build/html/_sources/chapter3.ipynb +++ b/doc/LectureNotes/_build/html/_sources/chapter3.ipynb @@ -4,40 +4,78 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "# Ridge and Lasso Regression\n", + "# Resampling Methods\n", "\n", - "[Video of Lecture](https://www.uio.no/studier/emner/matnat/fys/FYS-STK4155/h20/forelesningsvideoer/LectureSeptember10.mp4?vrtx=view-as-webpage)\n", + "## Introduction\n", + "\n", + "Resampling methods are an indispensable tool in modern\n", + "statistics. They involve repeatedly drawing samples from a training\n", + "set and refitting a model of interest on each sample in order to\n", + "obtain additional information about the fitted model. For example, in\n", + "order to estimate the variability of a linear regression fit, we can\n", + "repeatedly draw different samples from the training data, fit a linear\n", + "regression to each new sample, and then examine the extent to which\n", + "the resulting fits differ. Such an approach may allow us to obtain\n", + "information that would not be available from fitting the model only\n", + "once using the original training sample.\n", + "\n", + "Two resampling methods are often used in Machine Learning analyses,\n", + "1. The **bootstrap method**\n", + "\n", + "2. and **Cross-Validation**\n", + "\n", + "In addition there are several other methods such as the Jackknife and the Blocking methods. We will discuss in particular\n", + "cross-validation and the bootstrap method. \n", "\n", "\n", - "## The singular value decomposition\n", - "\n", - "The examples we have looked at so far are cases where we normally can\n", - "invert the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$. Using a polynomial expansion as we\n", - "did both for the masses and the fitting of the equation of state,\n", - "leads to row vectors of the design matrix which are essentially\n", - "orthogonal due to the polynomial character of our model. Obtaining the inverse of the design matrix is then often done via a so-called LU, QR or Cholesky decomposition. \n", + "Resampling approaches can be computationally expensive, because they\n", + "involve fitting the same statistical method multiple times using\n", + "different subsets of the training data. However, due to recent\n", + "advances in computing power, the computational requirements of\n", + "resampling methods generally are not prohibitive. In this chapter, we\n", + "discuss two of the most commonly used resampling methods,\n", + "cross-validation and the bootstrap. Both methods are important tools\n", + "in the practical application of many statistical learning\n", + "procedures. For example, cross-validation can be used to estimate the\n", + "test error associated with a given statistical learning method in\n", + "order to evaluate its performance, or to select the appropriate level\n", + "of flexibility. The process of evaluating a model’s performance is\n", + "known as model assessment, whereas the process of selecting the proper\n", + "level of flexibility for a model is known as model selection. The\n", + "bootstrap is widely used.\n", "\n", "\n", + "* Our simulations can be treated as *computer experiments*. This is particularly the case for Monte Carlo methods\n", "\n", - "This may\n", - "however not the be case in general and a standard matrix inversion\n", - "algorithm based on say LU, QR or Cholesky decomposition may lead to singularities. We will see examples of this below.\n", + "* The results can be analysed with the same statistical tools as we would use analysing experimental data.\n", "\n", - "There is however a way to partially circumvent this problem and also gain some insights about the ordinary least squares approach, and later shrinkage methods like Ridge and Lasso regressions. \n", + "* As in all experiments, we are looking for expectation values and an estimate of how accurate they are, i.e., possible sources for errors.\n", "\n", - "This is given by the **Singular Value Decomposition** algorithm, perhaps\n", - "the most powerful linear algebra algorithm. Let us look at a\n", - "different example where we may have problems with the standard matrix\n", - "inversion algorithm. Thereafter we dive into the math of the SVD.\n", + "## Reminder on Statistics\n", "\n", "\n", + "* As in other experiments, many numerical experiments have two classes of errors:\n", "\n", - "One of the typical problems we encounter with linear regression, in particular \n", - "when the matrix $\\boldsymbol{X}$ (our so-called design matrix) is high-dimensional, \n", - "are problems with near singular or singular matrices. The column vectors of $\\boldsymbol{X}$ \n", - "may be linearly dependent, normally referred to as super-collinearity. \n", - "This means that the matrix may be rank deficient and it is basically impossible to \n", - "to model the data using linear regression. As an example, consider the matrix" + " * Statistical errors\n", + "\n", + " * Systematical errors\n", + "\n", + "\n", + "* Statistical errors can be estimated using standard tools from statistics\n", + "\n", + "* Systematical errors are method specific and must be treated differently from case to case. \n", + "\n", + "The\n", + "advantage of doing linear regression is that we actually end up with\n", + "analytical expressions for several statistical quantities. \n", + "Standard least squares and Ridge regression allow us to\n", + "derive quantities like the variance and other expectation values in a\n", + "rather straightforward way.\n", + "\n", + "\n", + "It is assumed that $\\varepsilon_i\n", + "\\sim \\mathcal{N}(0, \\sigma^2)$ and the $\\varepsilon_{i}$ are\n", + "independent, i.e.:" ] }, { @@ -45,17 +83,10 @@ "metadata": {}, "source": [ "$$\n", - "\\begin{align*}\n", - "\\mathbf{X} & = \\left[\n", - "\\begin{array}{rrr}\n", - "1 & -1 & 2\n", - "\\\\\n", - "1 & 0 & 1\n", - "\\\\\n", - "1 & 2 & -1\n", - "\\\\\n", - "1 & 1 & 0\n", - "\\end{array} \\right]\n", + "\\begin{align*} \n", + "\\mbox{Cov}(\\varepsilon_{i_1},\n", + "\\varepsilon_{i_2}) & = \\left\\{ \\begin{array}{lcc} \\sigma^2 & \\mbox{if}\n", + "& i_1 = i_2, \\\\ 0 & \\mbox{if} & i_1 \\not= i_2. \\end{array} \\right.\n", "\\end{align*}\n", "$$" ] @@ -64,14 +95,21 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "The columns of $\\boldsymbol{X}$ are linearly dependent. We see this easily since the \n", - "the first column is the row-wise sum of the other two columns. The rank (more correct,\n", - "the column rank) of a matrix is the dimension of the space spanned by the\n", - "column vectors. Hence, the rank of $\\mathbf{X}$ is equal to the number\n", - "of linearly independent columns. In this particular case the matrix has rank 2.\n", + "The randomness of $\\varepsilon_i$ implies that\n", + "$\\mathbf{y}_i$ is also a random variable. In particular,\n", + "$\\mathbf{y}_i$ is normally distributed, because $\\varepsilon_i \\sim\n", + "\\mathcal{N}(0, \\sigma^2)$ and $\\mathbf{X}_{i,\\ast} \\, \\boldsymbol{\\beta}$ is a\n", + "non-random scalar. To specify the parameters of the distribution of\n", + "$\\mathbf{y}_i$ we need to calculate its first two moments. \n", "\n", - "Super-collinearity of an $(n \\times p)$-dimensional design matrix $\\mathbf{X}$ implies\n", - "that the inverse of the matrix $\\boldsymbol{X}^T\\boldsymbol{X}$ (the matrix we need to invert to solve the linear regression equations) is non-invertible. If we have a square matrix that does not have an inverse, we say this matrix singular. The example here demonstrates this" + "Recall that $\\boldsymbol{X}$ is a matrix of dimensionality $n\\times p$. The\n", + "notation above $\\mathbf{X}_{i,\\ast}$ means that we are looking at the\n", + "row number $i$ and perform a sum over all values $p$.\n", + "\n", + "\n", + "The assumption we have made here can be summarized as (and this is going to be useful when we discuss the bias-variance trade off)\n", + "that there exists a function $f(\\boldsymbol{x})$ and a normal distributed error $\\boldsymbol{\\varepsilon}\\sim \\mathcal{N}(0, \\sigma^2)$\n", + "which describe our data" ] }, { @@ -79,13 +117,43 @@ "metadata": {}, "source": [ "$$\n", - "\\begin{align*}\n", - "\\boldsymbol{X} & = \\left[\n", - "\\begin{array}{rr}\n", - "1 & -1\n", - "\\\\\n", - "1 & -1\n", - "\\end{array} \\right].\n", + "\\boldsymbol{y} = f(\\boldsymbol{x})+\\boldsymbol{\\varepsilon}\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We approximate this function with our model from the solution of the linear regression equations, that is our\n", + "function $f$ is approximated by $\\boldsymbol{\\tilde{y}}$ where we want to minimize $(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2$, our MSE, with" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\boldsymbol{\\tilde{y}} = \\boldsymbol{X}\\boldsymbol{\\beta}.\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "We can calculate the expectation value of $\\boldsymbol{y}$ for a given element $i$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\begin{align*} \n", + "\\mathbb{E}(y_i) & =\n", + "\\mathbb{E}(\\mathbf{X}_{i, \\ast} \\, \\boldsymbol{\\beta}) + \\mathbb{E}(\\varepsilon_i)\n", + "\\, \\, \\, = \\, \\, \\, \\mathbf{X}_{i, \\ast} \\, \\beta, \n", "\\end{align*}\n", "$$" ] @@ -94,39 +162,8 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "We see easily that $\\mbox{det}(\\boldsymbol{X}) = x_{11} x_{22} - x_{12} x_{21} = 1 \\times (-1) - 1 \\times (-1) = 0$. Hence, $\\mathbf{X}$ is singular and its inverse is undefined.\n", - "This is equivalent to saying that the matrix $\\boldsymbol{X}$ has at least an eigenvalue which is zero.\n", - "\n", - "\n", - "If our design matrix $\\boldsymbol{X}$ which enters the linear regression problem" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "\n", - "
\n", - "\n", - "$$\n", - "\\begin{equation}\n", - "\\boldsymbol{\\beta} = (\\boldsymbol{X}^{T} \\boldsymbol{X})^{-1} \\boldsymbol{X}^{T} \\boldsymbol{y},\n", - "\\label{_auto1} \\tag{1}\n", - "\\end{equation}\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "has linearly dependent column vectors, we will not be able to compute the inverse\n", - "of $\\boldsymbol{X}^T\\boldsymbol{X}$ and we cannot find the parameters (estimators) $\\beta_i$. \n", - "The estimators are only well-defined if $(\\boldsymbol{X}^{T}\\boldsymbol{X})^{-1}$ exits. \n", - "This is more likely to happen when the matrix $\\boldsymbol{X}$ is high-dimensional. In this case it is likely to encounter a situation where \n", - "the regression parameters $\\beta_i$ cannot be estimated.\n", - "\n", - "A cheap *ad hoc* approach is simply to add a small diagonal component to the matrix to invert, that is we change" + "while\n", + "its variance is" ] }, { @@ -134,7 +171,18 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{X}^{T} \\boldsymbol{X} \\rightarrow \\boldsymbol{X}^{T} \\boldsymbol{X}+\\lambda \\boldsymbol{I},\n", + "\\begin{align*} \\mbox{Var}(y_i) & = \\mathbb{E} \\{ [y_i\n", + "- \\mathbb{E}(y_i)]^2 \\} \\, \\, \\, = \\, \\, \\, \\mathbb{E} ( y_i^2 ) -\n", + "[\\mathbb{E}(y_i)]^2 \\\\ & = \\mathbb{E} [ ( \\mathbf{X}_{i, \\ast} \\,\n", + "\\beta + \\varepsilon_i )^2] - ( \\mathbf{X}_{i, \\ast} \\, \\boldsymbol{\\beta})^2 \\\\ &\n", + "= \\mathbb{E} [ ( \\mathbf{X}_{i, \\ast} \\, \\boldsymbol{\\beta})^2 + 2 \\varepsilon_i\n", + "\\mathbf{X}_{i, \\ast} \\, \\boldsymbol{\\beta} + \\varepsilon_i^2 ] - ( \\mathbf{X}_{i,\n", + "\\ast} \\, \\beta)^2 \\\\ & = ( \\mathbf{X}_{i, \\ast} \\, \\boldsymbol{\\beta})^2 + 2\n", + "\\mathbb{E}(\\varepsilon_i) \\mathbf{X}_{i, \\ast} \\, \\boldsymbol{\\beta} +\n", + "\\mathbb{E}(\\varepsilon_i^2 ) - ( \\mathbf{X}_{i, \\ast} \\, \\boldsymbol{\\beta})^2 \n", + "\\\\ & = \\mathbb{E}(\\varepsilon_i^2 ) \\, \\, \\, = \\, \\, \\,\n", + "\\mbox{Var}(\\varepsilon_i) \\, \\, \\, = \\, \\, \\, \\sigma^2. \n", + "\\end{align*}\n", "$$" ] }, @@ -142,16 +190,11 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "where $\\boldsymbol{I}$ is the identity matrix. When we discuss **Ridge** regression this is actually what we end up evaluating. The parameter $\\lambda$ is called a hyperparameter. More about this later. \n", + "Hence, $y_i \\sim \\mathcal{N}( \\mathbf{X}_{i, \\ast} \\, \\boldsymbol{\\beta}, \\sigma^2)$, that is $\\boldsymbol{y}$ follows a normal distribution with \n", + "mean value $\\boldsymbol{X}\\boldsymbol{\\beta}$ and variance $\\sigma^2$ (not be confused with the singular values of the SVD). \n", "\n", "\n", - "\n", - "\n", - "\n", - "From standard linear algebra we know that a square matrix $\\boldsymbol{X}$ can be diagonalized if and only it is \n", - "a so-called [normal matrix](https://en.wikipedia.org/wiki/Normal_matrix), that is if $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times n}$\n", - "we have $\\boldsymbol{X}\\boldsymbol{X}^T=\\boldsymbol{X}^T\\boldsymbol{X}$ or if $\\boldsymbol{X}\\in {\\mathbb{C}}^{n\\times n}$ we have $\\boldsymbol{X}\\boldsymbol{X}^{\\dagger}=\\boldsymbol{X}^{\\dagger}\\boldsymbol{X}$.\n", - "The matrix has then a set of eigenpairs" + "With the OLS expressions for the parameters $\\boldsymbol{\\beta}$ we can evaluate the expectation value" ] }, { @@ -159,7 +202,7 @@ "metadata": {}, "source": [ "$$\n", - "(\\lambda_1,\\boldsymbol{u}_1),\\dots, (\\lambda_n,\\boldsymbol{u}_n),\n", + "\\mathbb{E}(\\boldsymbol{\\beta}) = \\mathbb{E}[ (\\mathbf{X}^{\\top} \\mathbf{X})^{-1}\\mathbf{X}^{T} \\mathbf{Y}]=(\\mathbf{X}^{T} \\mathbf{X})^{-1}\\mathbf{X}^{T} \\mathbb{E}[ \\mathbf{Y}]=(\\mathbf{X}^{T} \\mathbf{X})^{-1} \\mathbf{X}^{T}\\mathbf{X}\\boldsymbol{\\beta}=\\boldsymbol{\\beta}.\n", "$$" ] }, @@ -167,7 +210,11 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "and the eigenvalues are given by the diagonal matrix" + "This means that the estimator of the regression parameters is unbiased.\n", + "\n", + "We can also calculate the variance\n", + "\n", + "The variance of $\\boldsymbol{\\beta}$ is" ] }, { @@ -175,7 +222,26 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{\\Sigma}=\\mathrm{Diag}(\\lambda_1, \\dots,\\lambda_n).\n", + "\\begin{eqnarray*}\n", + "\\mbox{Var}(\\boldsymbol{\\beta}) & = & \\mathbb{E} \\{ [\\boldsymbol{\\beta} - \\mathbb{E}(\\boldsymbol{\\beta})] [\\boldsymbol{\\beta} - \\mathbb{E}(\\boldsymbol{\\beta})]^{T} \\}\n", + "\\\\\n", + "& = & \\mathbb{E} \\{ [(\\mathbf{X}^{T} \\mathbf{X})^{-1} \\, \\mathbf{X}^{T} \\mathbf{Y} - \\boldsymbol{\\beta}] \\, [(\\mathbf{X}^{T} \\mathbf{X})^{-1} \\, \\mathbf{X}^{T} \\mathbf{Y} - \\boldsymbol{\\beta}]^{T} \\}\n", + "\\\\\n", + "% & = & \\mathbb{E} \\{ [(\\mathbf{X}^{T} \\mathbf{X})^{-1} \\, \\mathbf{X}^{T} \\mathbf{Y}] \\, [(\\mathbf{X}^{T} \\mathbf{X})^{-1} \\, \\mathbf{X}^{T} \\mathbf{Y}]^{T} \\} - \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^{T}\n", + "% \\\\\n", + "% & = & \\mathbb{E} \\{ (\\mathbf{X}^{T} \\mathbf{X})^{-1} \\, \\mathbf{X}^{T} \\mathbf{Y} \\, \\mathbf{Y}^{T} \\, \\mathbf{X} \\, (\\mathbf{X}^{T} \\mathbf{X})^{-1} \\} - \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^{T}\n", + "% \\\\\n", + "& = & (\\mathbf{X}^{T} \\mathbf{X})^{-1} \\, \\mathbf{X}^{T} \\, \\mathbb{E} \\{ \\mathbf{Y} \\, \\mathbf{Y}^{T} \\} \\, \\mathbf{X} \\, (\\mathbf{X}^{T} \\mathbf{X})^{-1} - \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^{T}\n", + "\\\\\n", + "& = & (\\mathbf{X}^{T} \\mathbf{X})^{-1} \\, \\mathbf{X}^{T} \\, \\{ \\mathbf{X} \\, \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^{T} \\, \\mathbf{X}^{T} + \\sigma^2 \\} \\, \\mathbf{X} \\, (\\mathbf{X}^{T} \\mathbf{X})^{-1} - \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^{T}\n", + "% \\\\\n", + "% & = & (\\mathbf{X}^T \\mathbf{X})^{-1} \\, \\mathbf{X}^T \\, \\mathbf{X} \\, \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^T \\, \\mathbf{X}^T \\, \\mathbf{X} \\, (\\mathbf{X}^T % \\mathbf{X})^{-1}\n", + "% \\\\\n", + "% & & + \\, \\, \\sigma^2 \\, (\\mathbf{X}^T \\mathbf{X})^{-1} \\, \\mathbf{X}^T \\, \\mathbf{X} \\, (\\mathbf{X}^T \\mathbf{X})^{-1} - \\boldsymbol{\\beta} \\boldsymbol{\\beta}^T\n", + "\\\\\n", + "& = & \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^{T} + \\sigma^2 \\, (\\mathbf{X}^{T} \\mathbf{X})^{-1} - \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^{T}\n", + "\\, \\, \\, = \\, \\, \\, \\sigma^2 \\, (\\mathbf{X}^{T} \\mathbf{X})^{-1},\n", + "\\end{eqnarray*}\n", "$$" ] }, @@ -183,7 +249,21 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "The matrix $\\boldsymbol{X}$ can be written in terms of an orthogonal/unitary transformation $\\boldsymbol{U}$" + "where we have used that $\\mathbb{E} (\\mathbf{Y} \\mathbf{Y}^{T}) =\n", + "\\mathbf{X} \\, \\boldsymbol{\\beta} \\, \\boldsymbol{\\beta}^{T} \\, \\mathbf{X}^{T} +\n", + "\\sigma^2 \\, \\mathbf{I}_{nn}$. From $\\mbox{Var}(\\boldsymbol{\\beta}) = \\sigma^2\n", + "\\, (\\mathbf{X}^{T} \\mathbf{X})^{-1}$, one obtains an estimate of the\n", + "variance of the estimate of the $j$-th regression coefficient:\n", + "$\\boldsymbol{\\sigma}^2 (\\boldsymbol{\\beta}_j ) = \\boldsymbol{\\sigma}^2 \\sqrt{\n", + "[(\\mathbf{X}^{T} \\mathbf{X})^{-1}]_{jj} }$. This may be used to\n", + "construct a confidence interval for the estimates.\n", + "\n", + "\n", + "In a similar way, we can obtain analytical expressions for say the\n", + "expectation values of the parameters $\\boldsymbol{\\beta}$ and their variance\n", + "when we employ Ridge regression, allowing us again to define a confidence interval. \n", + "\n", + "It is rather straightforward to show that" ] }, { @@ -191,7 +271,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{X} = \\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T,\n", + "\\mathbb{E} \\big[ \\boldsymbol{\\beta}^{\\mathrm{Ridge}} \\big]=(\\mathbf{X}^{T} \\mathbf{X} + \\lambda \\mathbf{I}_{pp})^{-1} (\\mathbf{X}^{\\top} \\mathbf{X})\\boldsymbol{\\beta}^{\\mathrm{OLS}}.\n", "$$" ] }, @@ -199,9 +279,10 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "with $\\boldsymbol{U}\\boldsymbol{U}^T=\\boldsymbol{I}$ or $\\boldsymbol{U}\\boldsymbol{U}^{\\dagger}=\\boldsymbol{I}$.\n", + "We see clearly that \n", + "$\\mathbb{E} \\big[ \\boldsymbol{\\beta}^{\\mathrm{Ridge}} \\big] \\not= \\boldsymbol{\\beta}^{\\mathrm{OLS}}$ for any $\\lambda > 0$. We say then that the ridge estimator is biased.\n", "\n", - "Not all square matrices are diagonalizable. A matrix like the one discussed above" + "We can also compute the variance as" ] }, { @@ -209,10 +290,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{X} = \\begin{bmatrix} \n", - "1& -1 \\\\\n", - "1& -1\\\\\n", - "\\end{bmatrix}\n", + "\\mbox{Var}[\\boldsymbol{\\beta}^{\\mathrm{Ridge}}]=\\sigma^2[ \\mathbf{X}^{T} \\mathbf{X} + \\lambda \\mathbf{I} ]^{-1} \\mathbf{X}^{T} \\mathbf{X} \\{ [ \\mathbf{X}^{\\top} \\mathbf{X} + \\lambda \\mathbf{I} ]^{-1}\\}^{T},\n", "$$" ] }, @@ -220,23 +298,9 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "is not diagonalizable, it is a so-called [defective matrix](https://en.wikipedia.org/wiki/Defective_matrix). It is easy to see that the condition\n", - "$\\boldsymbol{X}\\boldsymbol{X}^T=\\boldsymbol{X}^T\\boldsymbol{X}$ is not fulfilled. \n", + "and it is easy to see that if the parameter $\\lambda$ goes to infinity then the variance of Ridge parameters $\\boldsymbol{\\beta}$ goes to zero. \n", "\n", - "\n", - "\n", - "## The SVD, a Fantastic Algorithm\n", - "\n", - "\n", - "However, and this is the strength of the SVD algorithm, any general\n", - "matrix $\\boldsymbol{X}$ can be decomposed in terms of a diagonal matrix and\n", - "two orthogonal/unitary matrices. The [Singular Value Decompostion\n", - "(SVD) theorem](https://en.wikipedia.org/wiki/Singular_value_decomposition)\n", - "states that a general $m\\times n$ matrix $\\boldsymbol{X}$ can be written in\n", - "terms of a diagonal matrix $\\boldsymbol{\\Sigma}$ of dimensionality $m\\times n$\n", - "and two orthognal matrices $\\boldsymbol{U}$ and $\\boldsymbol{V}$, where the first has\n", - "dimensionality $m \\times m$ and the last dimensionality $n\\times n$.\n", - "We have then" + "With this, we can compute the difference" ] }, { @@ -244,7 +308,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{X} = \\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T\n", + "\\mbox{Var}[\\boldsymbol{\\beta}^{\\mathrm{OLS}}]-\\mbox{Var}(\\boldsymbol{\\beta}^{\\mathrm{Ridge}})=\\sigma^2 [ \\mathbf{X}^{T} \\mathbf{X} + \\lambda \\mathbf{I} ]^{-1}[ 2\\lambda\\mathbf{I} + \\lambda^2 (\\mathbf{X}^{T} \\mathbf{X})^{-1} ] \\{ [ \\mathbf{X}^{T} \\mathbf{X} + \\lambda \\mathbf{I} ]^{-1}\\}^{T}.\n", "$$" ] }, @@ -252,7 +316,54 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "As an example, the above defective matrix can be decomposed as" + "The difference is non-negative definite since each component of the\n", + "matrix product is non-negative definite. \n", + "This means the variance we obtain with the standard OLS will always for $\\lambda > 0$ be larger than the variance of $\\boldsymbol{\\beta}$ obtained with the Ridge estimator. This has interesting consequences when we discuss the so-called bias-variance trade-off below. \n", + "\n", + "\n", + "\n", + "## Resampling methods\n", + "\n", + "With all these analytical equations for both the OLS and Ridge\n", + "regression, we will now outline how to assess a given model. This will\n", + "lead us to a discussion of the so-called bias-variance tradeoff (see\n", + "below) and so-called resampling methods.\n", + "\n", + "One of the quantities we have discussed as a way to measure errors is\n", + "the mean-squared error (MSE), mainly used for fitting of continuous\n", + "functions. Another choice is the absolute error.\n", + "\n", + "In the discussions below we will focus on the MSE and in particular since we will split the data into test and training data,\n", + "we discuss the\n", + "1. prediction error or simply the **test error** $\\mathrm{Err_{Test}}$, where we have a fixed training set and the test error is the MSE arising from the data reserved for testing. We discuss also the \n", + "\n", + "2. training error $\\mathrm{Err_{Train}}$, which is the average loss over the training data.\n", + "\n", + "As our model becomes more and more complex, more of the training data tends to used. The training may thence adapt to more complicated structures in the data. This may lead to a decrease in the bias (see below for code example) and a slight increase of the variance for the test error.\n", + "For a certain level of complexity the test error will reach minimum, before starting to increase again. The\n", + "training error reaches a saturation.\n", + "\n", + "\n", + "\n", + "Two famous\n", + "resampling methods are the **independent bootstrap** and **the jackknife**. \n", + "\n", + "The jackknife is a special case of the independent bootstrap. Still, the jackknife was made\n", + "popular prior to the independent bootstrap. And as the popularity of\n", + "the independent bootstrap soared, new variants, such as **the dependent bootstrap**.\n", + "\n", + "The Jackknife and independent bootstrap work for\n", + "independent, identically distributed random variables.\n", + "If these conditions are not\n", + "satisfied, the methods will fail. Yet, it should be said that if the data are\n", + "independent, identically distributed, and we only want to estimate the\n", + "variance of $\\overline{X}$ (which often is the case), then there is no\n", + "need for bootstrapping. \n", + "\n", + "\n", + "The Jackknife works by making many replicas of the estimator $\\widehat{\\theta}$. \n", + "The jackknife is a resampling method where we systematically leave out one observation from the vector of observed values $\\boldsymbol{x} = (x_1,x_2,\\cdots,X_n)$. \n", + "Let $\\boldsymbol{x}_i$ denote the vector" ] }, { @@ -260,7 +371,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{X} = \\frac{1}{\\sqrt{2}}\\begin{bmatrix} 1& 1 \\\\ 1& -1\\\\ \\end{bmatrix} \\begin{bmatrix} 2& 0 \\\\ 0& 0\\\\ \\end{bmatrix} \\frac{1}{\\sqrt{2}}\\begin{bmatrix} 1& -1 \\\\ 1& 1\\\\ \\end{bmatrix}=\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T,\n", + "\\boldsymbol{x}_i = (x_1,x_2,\\cdots,x_{i-1},x_{i+1},\\cdots,x_n),\n", "$$" ] }, @@ -268,45 +379,290 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "with eigenvalues $\\sigma_1=2$ and $\\sigma_2=0$. \n", - "The SVD exits always! \n", + "which equals the vector $\\boldsymbol{x}$ with the exception that observation\n", + "number $i$ is left out. Using this notation, define\n", + "$\\widehat{\\theta}_i$ to be the estimator\n", + "$\\widehat{\\theta}$ computed using $\\vec{X}_i$." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "from numpy import *\n", + "from numpy.random import randint, randn\n", + "from time import time\n", "\n", - "The SVD\n", - "decomposition (singular values) gives eigenvalues \n", - "$\\sigma_i\\geq\\sigma_{i+1}$ for all $i$ and for dimensions larger than $i=p$, the\n", - "eigenvalues (singular values) are zero.\n", + "def jackknife(data, stat):\n", + " n = len(data);t = zeros(n); inds = arange(n); t0 = time()\n", + " ## 'jackknifing' by leaving out an observation for each i \n", + " for i in range(n):\n", + " t[i] = stat(delete(data,i) )\n", "\n", - "In the general case, where our design matrix $\\boldsymbol{X}$ has dimension\n", - "$n\\times p$, the matrix is thus decomposed into an $n\\times n$\n", - "orthogonal matrix $\\boldsymbol{U}$, a $p\\times p$ orthogonal matrix $\\boldsymbol{V}$\n", - "and a diagonal matrix $\\boldsymbol{\\Sigma}$ with $r=\\mathrm{min}(n,p)$\n", - "singular values $\\sigma_i\\geq 0$ on the main diagonal and zeros filling\n", - "the rest of the matrix. There are at most $p$ singular values\n", - "assuming that $n > p$. In our regression examples for the nuclear\n", - "masses and the equation of state this is indeed the case, while for\n", - "the Ising model we have $p > n$. These are often cases that lead to\n", - "near singular or singular matrices.\n", + " # analysis \n", + " print(\"Runtime: %g sec\" % (time()-t0)); print(\"Jackknife Statistics :\")\n", + " print(\"original bias std. error\")\n", + " print(\"%8g %14g %15g\" % (stat(data),(n-1)*mean(t)/n, (n*var(t))**.5))\n", "\n", - "The columns of $\\boldsymbol{U}$ are called the left singular vectors while the columns of $\\boldsymbol{V}$ are the right singular vectors.\n", + " return t\n", "\n", - "## Economy-size SVD\n", "\n", - "If we assume that $n > p$, then our matrix $\\boldsymbol{U}$ has dimension $n\n", - "\\times n$. The last $n-p$ columns of $\\boldsymbol{U}$ become however\n", - "irrelevant in our calculations since they are multiplied with the\n", - "zeros in $\\boldsymbol{\\Sigma}$.\n", + "# Returns mean of data samples \n", + "def stat(data):\n", + " return mean(data)\n", "\n", - "The economy-size decomposition removes extra rows or columns of zeros\n", - "from the diagonal matrix of singular values, $\\boldsymbol{\\Sigma}$, along with the columns\n", - "in either $\\boldsymbol{U}$ or $\\boldsymbol{V}$ that multiply those zeros in the expression. \n", - "Removing these zeros and columns can improve execution time\n", - "and reduce storage requirements without compromising the accuracy of\n", - "the decomposition.\n", "\n", - "If $n > p$, we keep only the first $p$ columns of $\\boldsymbol{U}$ and $\\boldsymbol{\\Sigma}$ has dimension $p\\times p$. \n", - "If $p > n$, then only the first $n$ columns of $\\boldsymbol{V}$ are computed and $\\boldsymbol{\\Sigma}$ has dimension $n\\times n$.\n", - "The $n=p$ case is obvious, we retain the full SVD. \n", - "In general the economy-size SVD leads to less FLOPS and still conserving the desired accuracy." + "mu, sigma = 100, 15\n", + "datapoints = 10000\n", + "x = mu + sigma*random.randn(datapoints)\n", + "# jackknife returns the data sample \n", + "t = jackknife(x, stat)" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "### Bootstrap\n", + "\n", + "Bootstrapping is a nonparametric approach to statistical inference\n", + "that substitutes computation for more traditional distributional\n", + "assumptions and asymptotic results. Bootstrapping offers a number of\n", + "advantages: \n", + "1. The bootstrap is quite general, although there are some cases in which it fails. \n", + "\n", + "2. Because it does not require distributional assumptions (such as normally distributed errors), the bootstrap can provide more accurate inferences when the data are not well behaved or when the sample size is small. \n", + "\n", + "3. It is possible to apply the bootstrap to statistics with sampling distributions that are difficult to derive, even asymptotically. \n", + "\n", + "4. It is relatively simple to apply the bootstrap to complex data-collection plans (such as stratified and clustered samples).\n", + "\n", + "Since $\\widehat{\\theta} = \\widehat{\\theta}(\\boldsymbol{X})$ is a function of random variables,\n", + "$\\widehat{\\theta}$ itself must be a random variable. Thus it has\n", + "a pdf, call this function $p(\\boldsymbol{t})$. The aim of the bootstrap is to\n", + "estimate $p(\\boldsymbol{t})$ by the relative frequency of\n", + "$\\widehat{\\theta}$. You can think of this as using a histogram\n", + "in the place of $p(\\boldsymbol{t})$. If the relative frequency closely\n", + "resembles $p(\\vec{t})$, then using numerics, it is straight forward to\n", + "estimate all the interesting parameters of $p(\\boldsymbol{t})$ using point\n", + "estimators. \n", + "\n", + "\n", + "\n", + "In the case that $\\widehat{\\theta}$ has\n", + "more than one component, and the components are independent, we use the\n", + "same estimator on each component separately. If the probability\n", + "density function of $X_i$, $p(x)$, had been known, then it would have\n", + "been straight forward to do this by: \n", + "1. Drawing lots of numbers from $p(x)$, suppose we call one such set of numbers $(X_1^*, X_2^*, \\cdots, X_n^*)$. \n", + "\n", + "2. Then using these numbers, we could compute a replica of $\\widehat{\\theta}$ called $\\widehat{\\theta}^*$. \n", + "\n", + "By repeated use of (1) and (2), many\n", + "estimates of $\\widehat{\\theta}$ could have been obtained. The\n", + "idea is to use the relative frequency of $\\widehat{\\theta}^*$\n", + "(think of a histogram) as an estimate of $p(\\boldsymbol{t})$.\n", + "\n", + "\n", + "But\n", + "unless there is enough information available about the process that\n", + "generated $X_1,X_2,\\cdots,X_n$, $p(x)$ is in general\n", + "unknown. Therefore, [Efron in 1979](https://projecteuclid.org/euclid.aos/1176344552) asked the\n", + "question: What if we replace $p(x)$ by the relative frequency\n", + "of the observation $X_i$; if we draw observations in accordance with\n", + "the relative frequency of the observations, will we obtain the same\n", + "result in some asymptotic sense? The answer is yes.\n", + "\n", + "\n", + "Instead of generating the histogram for the relative\n", + "frequency of the observation $X_i$, just draw the values\n", + "$(X_1^*,X_2^*,\\cdots,X_n^*)$ with replacement from the vector\n", + "$\\boldsymbol{X}$. \n", + "\n", + "\n", + "The independent bootstrap works like this: \n", + "\n", + "1. Draw with replacement $n$ numbers for the observed variables $\\boldsymbol{x} = (x_1,x_2,\\cdots,x_n)$. \n", + "\n", + "2. Define a vector $\\boldsymbol{x}^*$ containing the values which were drawn from $\\boldsymbol{x}$. \n", + "\n", + "3. Using the vector $\\boldsymbol{x}^*$ compute $\\widehat{\\theta}^*$ by evaluating $\\widehat \\theta$ under the observations $\\boldsymbol{x}^*$. \n", + "\n", + "4. Repeat this process $k$ times. \n", + "\n", + "When you are done, you can draw a histogram of the relative frequency\n", + "of $\\widehat \\theta^*$. This is your estimate of the probability\n", + "distribution $p(t)$. Using this probability distribution you can\n", + "estimate any statistics thereof. In principle you never draw the\n", + "histogram of the relative frequency of $\\widehat{\\theta}^*$. Instead\n", + "you use the estimators corresponding to the statistic of interest. For\n", + "example, if you are interested in estimating the variance of $\\widehat\n", + "\\theta$, apply the etsimator $\\widehat \\sigma^2$ to the values\n", + "$\\widehat \\theta ^*$.\n", + "\n", + "\n", + "\n", + "The following code starts with a Gaussian distribution with mean value\n", + "$\\mu =100$ and variance $\\sigma=15$. We use this to generate the data\n", + "used in the bootstrap analysis. The bootstrap analysis returns a data\n", + "set after a given number of bootstrap operations (as many as we have\n", + "data points). This data set consists of estimated mean values for each\n", + "bootstrap operation. The histogram generated by the bootstrap method\n", + "shows that the distribution for these mean values is also a Gaussian,\n", + "centered around the mean value $\\mu=100$ but with standard deviation\n", + "$\\sigma/\\sqrt{n}$, where $n$ is the number of bootstrap samples (in\n", + "this case the same as the number of original data points). The value\n", + "of the standard deviation is what we expect from the central limit\n", + "theorem." + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], + "source": [ + "%matplotlib inline\n", + "\n", + "from numpy import *\n", + "from numpy.random import randint, randn\n", + "from time import time\n", + "import matplotlib.mlab as mlab\n", + "import matplotlib.pyplot as plt\n", + "\n", + "# Returns mean of bootstrap samples \n", + "def stat(data):\n", + " return mean(data)\n", + "\n", + "# Bootstrap algorithm\n", + "def bootstrap(data, statistic, R):\n", + " t = zeros(R); n = len(data); inds = arange(n); t0 = time()\n", + " # non-parametric bootstrap \n", + " for i in range(R):\n", + " t[i] = statistic(data[randint(0,n,n)])\n", + "\n", + " # analysis \n", + " print(\"Runtime: %g sec\" % (time()-t0)); print(\"Bootstrap Statistics :\")\n", + " print(\"original bias std. error\")\n", + " print(\"%8g %8g %14g %15g\" % (statistic(data), std(data),mean(t),std(t)))\n", + " return t\n", + "\n", + "\n", + "mu, sigma = 100, 15\n", + "datapoints = 10000\n", + "x = mu + sigma*random.randn(datapoints)\n", + "# bootstrap returns the data sample \n", + "t = bootstrap(x, stat, datapoints)\n", + "# the histogram of the bootstrapped data \n", + "n, binsboot, patches = plt.hist(t, 50, normed=1, facecolor='red', alpha=0.75)\n", + "\n", + "# add a 'best fit' line \n", + "y = mlab.normpdf( binsboot, mean(t), std(t))\n", + "lt = plt.plot(binsboot, y, 'r--', linewidth=1)\n", + "plt.xlabel('Smarts')\n", + "plt.ylabel('Probability')\n", + "plt.axis([99.5, 100.6, 0, 3.0])\n", + "plt.grid(True)\n", + "\n", + "plt.show()" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "## Various steps in cross-validation\n", + "\n", + "When the repetitive splitting of the data set is done randomly,\n", + "samples may accidently end up in a fast majority of the splits in\n", + "either training or test set. Such samples may have an unbalanced\n", + "influence on either model building or prediction evaluation. To avoid\n", + "this $k$-fold cross-validation structures the data splitting. The\n", + "samples are divided into $k$ more or less equally sized exhaustive and\n", + "mutually exclusive subsets. In turn (at each split) one of these\n", + "subsets plays the role of the test set while the union of the\n", + "remaining subsets constitutes the training set. Such a splitting\n", + "warrants a balanced representation of each sample in both training and\n", + "test set over the splits. Still the division into the $k$ subsets\n", + "involves a degree of randomness. This may be fully excluded when\n", + "choosing $k=n$. This particular case is referred to as leave-one-out\n", + "cross-validation (LOOCV). \n", + "\n", + "\n", + "* Define a range of interest for the penalty parameter.\n", + "\n", + "* Divide the data set into training and test set comprising samples $\\{1, \\ldots, n\\} \\setminus i$ and $\\{ i \\}$, respectively.\n", + "\n", + "* Fit the linear regression model by means of ridge estimation for each $\\lambda$ in the grid using the training set, and the corresponding estimate of the error variance $\\boldsymbol{\\sigma}_{-i}^2(\\lambda)$, as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\begin{align*}\n", + "\\boldsymbol{\\beta}_{-i}(\\lambda) & = ( \\boldsymbol{X}_{-i, \\ast}^{T}\n", + "\\boldsymbol{X}_{-i, \\ast} + \\lambda \\boldsymbol{I}_{pp})^{-1}\n", + "\\boldsymbol{X}_{-i, \\ast}^{T} \\boldsymbol{y}_{-i}\n", + "\\end{align*}\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "* Evaluate the prediction performance of these models on the test set by $\\log\\{L[y_i, \\boldsymbol{X}_{i, \\ast}; \\boldsymbol{\\beta}_{-i}(\\lambda), \\boldsymbol{\\sigma}_{-i}^2(\\lambda)]\\}$. Or, by the prediction error $|y_i - \\boldsymbol{X}_{i, \\ast} \\boldsymbol{\\beta}_{-i}(\\lambda)|$, the relative error, the error squared or the R2 score function.\n", + "\n", + "* Repeat the first three steps such that each sample plays the role of the test set once.\n", + "\n", + "* Average the prediction performances of the test sets at each grid point of the penalty bias/parameter. It is an estimate of the prediction performance of the model corresponding to this value of the penalty parameter on novel data. It is defined as" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "$$\n", + "\\begin{align*}\n", + "\\frac{1}{n} \\sum_{i = 1}^n \\log\\{L[y_i, \\mathbf{X}_{i, \\ast}; \\boldsymbol{\\beta}_{-i}(\\lambda), \\boldsymbol{\\sigma}_{-i}^2(\\lambda)]\\}.\n", + "\\end{align*}\n", + "$$" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "For the various values of $k$\n", + "\n", + "1. shuffle the dataset randomly.\n", + "\n", + "2. Split the dataset into $k$ groups.\n", + "\n", + "3. For each unique group:\n", + "\n", + "a. Decide which group to use as set for test data\n", + "\n", + "b. Take the remaining groups as a training data set\n", + "\n", + "c. Fit a model on the training set and evaluate it on the test set\n", + "\n", + "d. Retain the evaluation score and discard the model\n", + "\n", + "\n", + "5. Summarize the model using the sample of model evaluation scores\n", + "\n", + "The code here uses Ridge regression with cross-validation (CV) resampling and $k$-fold CV in order to fit a specific polynomial." ] }, { @@ -319,60 +675,110 @@ "outputs": [], "source": [ "import numpy as np\n", - "# SVD inversion\n", - "def SVDinv(A):\n", - " ''' Takes as input a numpy matrix A and returns inv(A) based on singular value decomposition (SVD).\n", - " SVD is numerically more stable than the inversion algorithms provided by\n", - " numpy and scipy.linalg at the cost of being slower.\n", - " '''\n", - " U, s, VT = np.linalg.svd(A)\n", - "# print('test U')\n", - "# print( (np.transpose(U) @ U - U @np.transpose(U)))\n", - "# print('test VT')\n", - "# print( (np.transpose(VT) @ VT - VT @np.transpose(VT)))\n", - " print(U)\n", - " print(s)\n", - " print(VT)\n", + "import matplotlib.pyplot as plt\n", + "from sklearn.model_selection import KFold\n", + "from sklearn.linear_model import Ridge\n", + "from sklearn.model_selection import cross_val_score\n", + "from sklearn.preprocessing import PolynomialFeatures\n", "\n", - " D = np.zeros((len(U),len(VT)))\n", - " for i in range(0,len(VT)):\n", - " D[i,i]=s[i]\n", - " UT = np.transpose(U); V = np.transpose(VT); invD = np.linalg.inv(D)\n", - " return np.matmul(V,np.matmul(invD,UT))\n", + "# A seed just to ensure that the random numbers are the same for every run.\n", + "# Useful for eventual debugging.\n", + "np.random.seed(3155)\n", + "\n", + "# Generate the data.\n", + "nsamples = 100\n", + "x = np.random.randn(nsamples)\n", + "y = 3*x**2 + np.random.randn(nsamples)\n", + "\n", + "## Cross-validation on Ridge regression using KFold only\n", + "\n", + "# Decide degree on polynomial to fit\n", + "poly = PolynomialFeatures(degree = 6)\n", + "\n", + "# Decide which values of lambda to use\n", + "nlambdas = 500\n", + "lambdas = np.logspace(-3, 5, nlambdas)\n", + "\n", + "# Initialize a KFold instance\n", + "k = 5\n", + "kfold = KFold(n_splits = k)\n", + "\n", + "# Perform the cross-validation to estimate MSE\n", + "scores_KFold = np.zeros((nlambdas, k))\n", + "\n", + "i = 0\n", + "for lmb in lambdas:\n", + " ridge = Ridge(alpha = lmb)\n", + " j = 0\n", + " for train_inds, test_inds in kfold.split(x):\n", + " xtrain = x[train_inds]\n", + " ytrain = y[train_inds]\n", + "\n", + " xtest = x[test_inds]\n", + " ytest = y[test_inds]\n", + "\n", + " Xtrain = poly.fit_transform(xtrain[:, np.newaxis])\n", + " ridge.fit(Xtrain, ytrain[:, np.newaxis])\n", + "\n", + " Xtest = poly.fit_transform(xtest[:, np.newaxis])\n", + " ypred = ridge.predict(Xtest)\n", + "\n", + " scores_KFold[i,j] = np.sum((ypred - ytest[:, np.newaxis])**2)/np.size(ypred)\n", + "\n", + " j += 1\n", + " i += 1\n", "\n", "\n", - "X = np.array([ [1.0, -1.0, 2.0], [1.0, 0.0, 1.0], [1.0, 2.0, -1.0], [1.0, 1.0, 0.0] ])\n", - "print(X)\n", - "A = np.transpose(X) @ X\n", - "print(A)\n", - "# Brute force inversion of super-collinear matrix\n", - "#B = np.linalg.inv(A)\n", - "#print(B)\n", - "C = SVDinv(A)\n", - "print(C)" + "estimated_mse_KFold = np.mean(scores_KFold, axis = 1)\n", + "\n", + "## Cross-validation using cross_val_score from sklearn along with KFold\n", + "\n", + "# kfold is an instance initialized above as:\n", + "# kfold = KFold(n_splits = k)\n", + "\n", + "estimated_mse_sklearn = np.zeros(nlambdas)\n", + "i = 0\n", + "for lmb in lambdas:\n", + " ridge = Ridge(alpha = lmb)\n", + "\n", + " X = poly.fit_transform(x[:, np.newaxis])\n", + " estimated_mse_folds = cross_val_score(ridge, X, y[:, np.newaxis], scoring='neg_mean_squared_error', cv=kfold)\n", + "\n", + " # cross_val_score return an array containing the estimated negative mse for every fold.\n", + " # we have to the the mean of every array in order to get an estimate of the mse of the model\n", + " estimated_mse_sklearn[i] = np.mean(-estimated_mse_folds)\n", + "\n", + " i += 1\n", + "\n", + "## Plot and compare the slightly different ways to perform cross-validation\n", + "\n", + "plt.figure()\n", + "\n", + "plt.plot(np.log10(lambdas), estimated_mse_sklearn, label = 'cross_val_score')\n", + "plt.plot(np.log10(lambdas), estimated_mse_KFold, 'r--', label = 'KFold')\n", + "\n", + "plt.xlabel('log10(lambda)')\n", + "plt.ylabel('mse')\n", + "\n", + "plt.legend()\n", + "\n", + "plt.show()" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ - "The matrix $\\boldsymbol{X}$ has columns that are linearly dependent. The first\n", - "column is the row-wise sum of the other two columns. The rank of a\n", - "matrix (the column rank) is the dimension of space spanned by the\n", - "column vectors. The rank of the matrix is the number of linearly\n", - "independent columns, in this case just $2$. We see this from the\n", - "singular values when running the above code. Running the standard\n", - "inversion algorithm for matrix inversion with $\\boldsymbol{X}^T\\boldsymbol{X}$ results\n", - "in the program terminating due to a singular matrix.\n", + "## The bias-variance tradeoff\n", "\n", "\n", + "We will discuss the bias-variance tradeoff in the context of\n", + "continuous predictions such as regression. However, many of the\n", + "intuitions and ideas discussed here also carry over to classification\n", + "tasks. Consider a dataset $\\mathcal{L}$ consisting of the data\n", + "$\\mathbf{X}_\\mathcal{L}=\\{(y_j, \\boldsymbol{x}_j), j=0\\ldots n-1\\}$. \n", "\n", - "\n", - "There are several interesting mathematical properties which will be\n", - "relevant when we are going to discuss the differences between say\n", - "ordinary least squares (OLS) and **Ridge** regression.\n", - "\n", - "We have from OLS that the parameters of the linear approximation are given by" + "Let us assume that the true data is generated from a noisy model" ] }, { @@ -380,7 +786,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{\\tilde{y}} = \\boldsymbol{X}\\boldsymbol{\\beta} = \\boldsymbol{X}\\left(\\boldsymbol{X}^T\\boldsymbol{X}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}.\n", + "\\boldsymbol{y}=f(\\boldsymbol{x}) + \\boldsymbol{\\epsilon}\n", "$$" ] }, @@ -388,7 +794,14 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "The matrix to invert can be rewritten in terms of our SVD decomposition as" + "where $\\epsilon$ is normally distributed with mean zero and standard deviation $\\sigma^2$.\n", + "\n", + "In our derivation of the ordinary least squares method we defined then\n", + "an approximation to the function $f$ in terms of the parameters\n", + "$\\boldsymbol{\\beta}$ and the design matrix $\\boldsymbol{X}$ which embody our model,\n", + "that is $\\boldsymbol{\\tilde{y}}=\\boldsymbol{X}\\boldsymbol{\\beta}$. \n", + "\n", + "Thereafter we found the parameters $\\boldsymbol{\\beta}$ by optimizing the means squared error via the so-called cost function" ] }, { @@ -396,7 +809,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{X}^T\\boldsymbol{X} = \\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{U}^T\\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T.\n", + "C(\\boldsymbol{X},\\boldsymbol{\\beta}) =\\frac{1}{n}\\sum_{i=0}^{n-1}(y_i-\\tilde{y}_i)^2=\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right].\n", "$$" ] }, @@ -404,7 +817,7 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "Using the orthogonality properties of $\\boldsymbol{U}$ we have" + "We can rewrite this as" ] }, { @@ -412,7 +825,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{X}^T\\boldsymbol{X} = \\boldsymbol{V}\\boldsymbol{\\Sigma}^T\\boldsymbol{\\Sigma}\\boldsymbol{V}^T = \\boldsymbol{V}\\boldsymbol{D}\\boldsymbol{V}^T,\n", + "\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right]=\\frac{1}{n}\\sum_i(f_i-\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right])^2+\\frac{1}{n}\\sum_i(\\tilde{y}_i-\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right])^2+\\sigma^2.\n", "$$" ] }, @@ -420,9 +833,14 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "with $\\boldsymbol{D}$ being a diagonal matrix with values along the diagonal given by the singular values squared. \n", + "The three terms represent the square of the bias of the learning\n", + "method, which can be thought of as the error caused by the simplifying\n", + "assumptions built into the method. The second term represents the\n", + "variance of the chosen model and finally the last terms is variance of\n", + "the error $\\boldsymbol{\\epsilon}$.\n", "\n", - "This means that" + "To derive this equation, we need to recall that the variance of $\\boldsymbol{y}$ and $\\boldsymbol{\\epsilon}$ are both equal to $\\sigma^2$. The mean value of $\\boldsymbol{\\epsilon}$ is by definition equal to zero. Furthermore, the function $f$ is not a stochastics variable, idem for $\\boldsymbol{\\tilde{y}}$.\n", + "We use a more compact notation in terms of the expectation value" ] }, { @@ -430,7 +848,7 @@ "metadata": {}, "source": [ "$$\n", - "(\\boldsymbol{X}^T\\boldsymbol{X})\\boldsymbol{V} = \\boldsymbol{V}\\boldsymbol{D},\n", + "\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right]=\\mathbb{E}\\left[(\\boldsymbol{f}+\\boldsymbol{\\epsilon}-\\boldsymbol{\\tilde{y}})^2\\right],\n", "$$" ] }, @@ -438,7 +856,7 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "that is the eigenvectors of $(\\boldsymbol{X}^T\\boldsymbol{X})$ are given by the columns of the right singular matrix of $\\boldsymbol{X}$ and the eigenvalues are the squared singular values. It is easy to show (show this) that" + "and adding and subtracting $\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right]$ we get" ] }, { @@ -446,7 +864,7 @@ "metadata": {}, "source": [ "$$\n", - "(\\boldsymbol{X}\\boldsymbol{X}^T)\\boldsymbol{U} = \\boldsymbol{U}\\boldsymbol{D},\n", + "\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right]=\\mathbb{E}\\left[(\\boldsymbol{f}+\\boldsymbol{\\epsilon}-\\boldsymbol{\\tilde{y}}+\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right]-\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right])^2\\right],\n", "$$" ] }, @@ -454,9 +872,7 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "that is, the eigenvectors of $(\\boldsymbol{X}\\boldsymbol{X})^T$ are the columns of the left singular matrix and the eigenvalues are the same. \n", - "\n", - "Going back to our OLS equation we have" + "which, using the abovementioned expectation values can be rewritten as" ] }, { @@ -464,7 +880,7 @@ "metadata": {}, "source": [ "$$\n", - "\\boldsymbol{X}\\boldsymbol{\\beta} = \\boldsymbol{X}\\left(\\boldsymbol{V}\\boldsymbol{D}\\boldsymbol{V}^T \\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}=\\boldsymbol{U\\Sigma V^T}\\left(\\boldsymbol{V}\\boldsymbol{D}\\boldsymbol{V}^T \\right)^{-1}(\\boldsymbol{U\\Sigma V^T})^T\\boldsymbol{y}=\\boldsymbol{U}\\boldsymbol{U}^T\\boldsymbol{y}.\n", + "\\mathbb{E}\\left[(\\boldsymbol{y}-\\boldsymbol{\\tilde{y}})^2\\right]=\\mathbb{E}\\left[(\\boldsymbol{y}-\\mathbb{E}\\left[\\boldsymbol{\\tilde{y}}\\right])^2\\right]+\\mathrm{Var}\\left[\\boldsymbol{\\tilde{y}}\\right]+\\sigma^2,\n", "$$" ] }, @@ -472,642 +888,7 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "We will come back to this expression when we discuss Ridge regression. \n", - "\n", - "\n", - "$$ \\tilde{y}^{OLS}=\\boldsymbol{X}\\hat{\\beta}^{OLS}=\\sum_{j=1}^p \\boldsymbol{u}_j\\boldsymbol{u}_j^T\\boldsymbol{y}$$ and for Ridge we have \n", - "\n", - "$$ \\tilde{y}^{Ridge}=\\boldsymbol{X}\\hat{\\beta}^{Ridge}=\\sum_{j=1}^p \\boldsymbol{u}_j\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda}\\boldsymbol{u}_j^T\\boldsymbol{y}$$ . \n", - "\n", - "It is indeed the economy-sized SVD, note the summation runs up tp $$p$$ only and not $$n$$. \n", - "\n", - "Here we have that $$\\boldsymbol{X} = \\boldsymbol{U}\\boldsymbol{\\Sigma}\\boldsymbol{V}^T$$, with $$\\Sigma$$ being an $$ n\\times p$$ matrix and $$\\boldsymbol{V}$$ being a $$ p\\times p$$ matrix. We also have assumed here that $$ n > p$$. \n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "\n", - "## Ridge and LASSO Regression\n", - "\n", - "[Video of Lecture](https://www.uio.no/studier/emner/matnat/fys/FYS-STK4155/h20/forelesningsvideoer/LectureSeptember11.mp4?vrtx=view-as-webpage)\n", - "\n", - "Let us remind ourselves about the expression for the standard Mean Squared Error (MSE) which we used to define our cost function and the equations for the ordinary least squares (OLS) method, that is \n", - "our optimization problem is" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in {\\mathbb{R}}^{p}}}\\frac{1}{n}\\left\\{\\left(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\right)^T\\left(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\right)\\right\\}.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "or we can state it as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", - "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\sum_{i=0}^{n-1}\\left(y_i-\\tilde{y}_i\\right)^2=\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2,\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "where we have used the definition of a norm-2 vector, that is" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\vert\\vert \\boldsymbol{x}\\vert\\vert_2 = \\sqrt{\\sum_i x_i^2}.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "By minimizing the above equation with respect to the parameters\n", - "$\\boldsymbol{\\beta}$ we could then obtain an analytical expression for the\n", - "parameters $\\boldsymbol{\\beta}$. We can add a regularization parameter $\\lambda$ by\n", - "defining a new cost function to be optimized, that is" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", - "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_2^2\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "which leads to the Ridge regression minimization problem where we\n", - "require that $\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_2^2\\le t$, where $t$ is\n", - "a finite number larger than zero. By defining" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "C(\\boldsymbol{X},\\boldsymbol{\\beta})=\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_1,\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "we have a new optimization equation" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "{\\displaystyle \\min_{\\boldsymbol{\\beta}\\in\n", - "{\\mathbb{R}}^{p}}}\\frac{1}{n}\\vert\\vert \\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta}\\vert\\vert_2^2+\\lambda\\vert\\vert \\boldsymbol{\\beta}\\vert\\vert_1\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "which leads to Lasso regression. Lasso stands for least absolute shrinkage and selection operator. \n", - "\n", - "Here we have defined the norm-1 as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\vert\\vert \\boldsymbol{x}\\vert\\vert_1 = \\sum_i \\vert x_i\\vert.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Using the matrix-vector expression for Ridge regression," - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "C(\\boldsymbol{X},\\boldsymbol{\\beta})=\\frac{1}{n}\\left\\{(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})^T(\\boldsymbol{y}-\\boldsymbol{X}\\boldsymbol{\\beta})\\right\\}+\\lambda\\boldsymbol{\\beta}^T\\boldsymbol{\\beta},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "by taking the derivatives with respect to $\\boldsymbol{\\beta}$ we obtain then\n", - "a slightly modified matrix inversion problem which for finite values\n", - "of $\\lambda$ does not suffer from singularity problems. We obtain" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{\\beta}^{\\mathrm{Ridge}} = \\left(\\boldsymbol{X}^T\\boldsymbol{X}+\\lambda\\boldsymbol{I}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "with $\\boldsymbol{I}$ being a $p\\times p$ identity matrix with the constraint that" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\sum_{i=0}^{p-1} \\beta_i^2 \\leq t,\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "with $t$ a finite positive number. \n", - "\n", - "We see that Ridge regression is nothing but the standard\n", - "OLS with a modified diagonal term added to $\\boldsymbol{X}^T\\boldsymbol{X}$. The\n", - "consequences, in particular for our discussion of the bias-variance tradeoff \n", - "are rather interesting.\n", - "\n", - "Furthermore, if we use the result above in terms of the SVD decomposition (our analysis was done for the OLS method), we had" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "(\\boldsymbol{X}\\boldsymbol{X}^T)\\boldsymbol{U} = \\boldsymbol{U}\\boldsymbol{D}.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We can analyse the OLS solutions in terms of the eigenvectors (the columns) of the right singular value matrix $\\boldsymbol{U}$ as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{X}\\boldsymbol{\\beta} = \\boldsymbol{X}\\left(\\boldsymbol{V}\\boldsymbol{D}\\boldsymbol{V}^T \\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}=\\boldsymbol{U\\Sigma V^T}\\left(\\boldsymbol{V}\\boldsymbol{D}\\boldsymbol{V}^T \\right)^{-1}(\\boldsymbol{U\\Sigma V^T})^T\\boldsymbol{y}=\\boldsymbol{U}\\boldsymbol{U}^T\\boldsymbol{y}\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "For Ridge regression this becomes" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{X}\\boldsymbol{\\beta}^{\\mathrm{Ridge}} = \\boldsymbol{U\\Sigma V^T}\\left(\\boldsymbol{V}\\boldsymbol{D}\\boldsymbol{V}^T+\\lambda\\boldsymbol{I} \\right)^{-1}(\\boldsymbol{U\\Sigma V^T})^T\\boldsymbol{y}=\\sum_{j=0}^{p-1}\\boldsymbol{u}_j\\boldsymbol{u}_j^T\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda}\\boldsymbol{y},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "with the vectors $\\boldsymbol{u}_j$ being the columns of $\\boldsymbol{U}$. \n", - "\n", - "\n", - "Since $\\lambda \\geq 0$, it means that compared to OLS, we have" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda} \\leq 1.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "Ridge regression finds the coordinates of $\\boldsymbol{y}$ with respect to the\n", - "orthonormal basis $\\boldsymbol{U}$, it then shrinks the coordinates by\n", - "$\\frac{\\sigma_j^2}{\\sigma_j^2+\\lambda}$. Recall that the SVD has\n", - "eigenvalues ordered in a descending way, that is $\\sigma_i \\geq\n", - "\\sigma_{i+1}$.\n", - "\n", - "For small eigenvalues $\\sigma_i$ it means that their contributions become less important, a fact which can be used to reduce the number of degrees of freedom.\n", - "Actually, calculating the variance of $\\boldsymbol{X}\\boldsymbol{v}_j$ shows that this quantity is equal to $\\sigma_j^2/n$.\n", - "With a parameter $\\lambda$ we can thus shrink the role of specific parameters. \n", - "\n", - "\n", - "\n", - "For the sake of simplicity, let us assume that the design matrix is orthonormal, that is" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{X}^T\\boldsymbol{X}=(\\boldsymbol{X}^T\\boldsymbol{X})^{-1} =\\boldsymbol{I}.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "In this case the standard OLS results in" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{\\beta}^{\\mathrm{OLS}} = \\boldsymbol{X}^T\\boldsymbol{y}=\\sum_{i=0}^{p-1}\\boldsymbol{u}_j\\boldsymbol{u}_j^T\\boldsymbol{y},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "and" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{\\beta}^{\\mathrm{Ridge}} = \\left(\\boldsymbol{I}+\\lambda\\boldsymbol{I}\\right)^{-1}\\boldsymbol{X}^T\\boldsymbol{y}=\\left(1+\\lambda\\right)^{-1}\\boldsymbol{\\beta}^{\\mathrm{OLS}},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "that is the Ridge estimator scales the OLS estimator by the inverse of a factor $1+\\lambda$, and\n", - "the Ridge estimator converges to zero when the hyperparameter goes to\n", - "infinity.\n", - "\n", - "We will come back to more interpreations after we have gone through some of the statistical analysis part. \n", - "\n", - "For more discussions of Ridge and Lasso regression, [Wessel van Wieringen's](https://arxiv.org/abs/1509.09169) article is highly recommended.\n", - "Similarly, [Mehta et al's article](https://arxiv.org/abs/1803.08823) is also recommended.\n", - "\n", - "\n", - "\n", - "## A better understanding of regularization\n", - "\n", - "The parameter $\\lambda$ that we have introduced in the Ridge (and\n", - "Lasso as well) regression is often called a regularization parameter\n", - "or shrinkage parameter. It is common to call it a hyperparameter. What does it mean mathemtically?\n", - "\n", - "Here we will first look at how to analyze the difference between the\n", - "standard OLS equations and the Ridge expressions in terms of a linear\n", - "algebra analysis using the SVD algorithm. Thereafter, we will link\n", - "(see the material on the bias-variance tradeoff below) these\n", - "observation to the statisical analysis of the results. In particular\n", - "we consider how the variance of the parameters $\\boldsymbol{\\beta}$ is\n", - "affected by changing the parameter $\\lambda$.\n", - "\n", - "\n", - "We have our design matrix\n", - " $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times p}$. With the SVD we decompose it as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{X} = \\boldsymbol{U\\Sigma V^T},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "with $\\boldsymbol{U}\\in {\\mathbb{R}}^{n\\times n}$, $\\boldsymbol{\\Sigma}\\in {\\mathbb{R}}^{n\\times p}$\n", - "and $\\boldsymbol{V}\\in {\\mathbb{R}}^{p\\times p}$.\n", - "\n", - "The matrices $\\boldsymbol{U}$ and $\\boldsymbol{V}$ are unitary/orthonormal matrices, that is in case the matrices are real we have $\\boldsymbol{U}^T\\boldsymbol{U}=\\boldsymbol{U}\\boldsymbol{U}^T=\\boldsymbol{I}$ and $\\boldsymbol{V}^T\\boldsymbol{V}=\\boldsymbol{V}\\boldsymbol{V}^T=\\boldsymbol{I}$.\n", - "\n", - "\n", - "\n", - "## Introducing the Covariance and Correlation functions\n", - "\n", - "Before we discuss the link between for example Ridge regression and the singular value decomposition, we need to remind ourselves about\n", - "the definition of the covariance and the correlation function. These are quantities \n", - "\n", - "Suppose we have defined two vectors\n", - "$\\hat{x}$ and $\\hat{y}$ with $n$ elements each. The covariance matrix $\\boldsymbol{C}$ is defined as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{C}[\\boldsymbol{x},\\boldsymbol{y}] = \\begin{bmatrix} \\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{x}] & \\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}] \\\\\n", - " \\mathrm{cov}[\\boldsymbol{y},\\boldsymbol{x}] & \\mathrm{cov}[\\boldsymbol{y},\\boldsymbol{y}] \\\\\n", - " \\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "where for example" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}] =\\frac{1}{n} \\sum_{i=0}^{n-1}(x_i- \\overline{x})(y_i- \\overline{y}).\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "With this definition and recalling that the variance is defined as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\mathrm{var}[\\boldsymbol{x}]=\\frac{1}{n} \\sum_{i=0}^{n-1}(x_i- \\overline{x})^2,\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "we can rewrite the covariance matrix as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{C}[\\boldsymbol{x},\\boldsymbol{y}] = \\begin{bmatrix} \\mathrm{var}[\\boldsymbol{x}] & \\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}] \\\\\n", - " \\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}] & \\mathrm{var}[\\boldsymbol{y}] \\\\\n", - " \\end{bmatrix}.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The covariance takes values between zero and infinity and may thus\n", - "lead to problems with loss of numerical precision for particularly\n", - "large values. It is common to scale the covariance matrix by\n", - "introducing instead the correlation matrix defined via the so-called\n", - "correlation function" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\mathrm{corr}[\\boldsymbol{x},\\boldsymbol{y}]=\\frac{\\mathrm{cov}[\\boldsymbol{x},\\boldsymbol{y}]}{\\sqrt{\\mathrm{var}[\\boldsymbol{x}] \\mathrm{var}[\\boldsymbol{y}]}}.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The correlation function is then given by values $\\mathrm{corr}[\\boldsymbol{x},\\boldsymbol{y}]\n", - "\\in [-1,1]$. This avoids eventual problems with too large values. We\n", - "can then define the correlation matrix for the two vectors $\\boldsymbol{x}$\n", - "and $\\boldsymbol{y}$ as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{K}[\\boldsymbol{x},\\boldsymbol{y}] = \\begin{bmatrix} 1 & \\mathrm{corr}[\\boldsymbol{x},\\boldsymbol{y}] \\\\\n", - " \\mathrm{corr}[\\boldsymbol{y},\\boldsymbol{x}] & 1 \\\\\n", - " \\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "In the above example this is the function we constructed using **pandas**.\n", - "\n", - "\n", - "\n", - "In our derivation of the various regression algorithms like **Ordinary Least Squares** or **Ridge regression**\n", - "we defined the design/feature matrix $\\boldsymbol{X}$ as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{X}=\\begin{bmatrix}\n", - "x_{0,0} & x_{0,1} & x_{0,2}& \\dots & \\dots x_{0,p-1}\\\\\n", - "x_{1,0} & x_{1,1} & x_{1,2}& \\dots & \\dots x_{1,p-1}\\\\\n", - "x_{2,0} & x_{2,1} & x_{2,2}& \\dots & \\dots x_{2,p-1}\\\\\n", - "\\dots & \\dots & \\dots & \\dots \\dots & \\dots \\\\\n", - "x_{n-2,0} & x_{n-2,1} & x_{n-2,2}& \\dots & \\dots x_{n-2,p-1}\\\\\n", - "x_{n-1,0} & x_{n-1,1} & x_{n-1,2}& \\dots & \\dots x_{n-1,p-1}\\\\\n", - "\\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "with $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times p}$, with the predictors/features $p$ refering to the column numbers and the\n", - "entries $n$ being the row elements.\n", - "We can rewrite the design/feature matrix in terms of its column vectors as" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{X}=\\begin{bmatrix} \\boldsymbol{x}_0 & \\boldsymbol{x}_1 & \\boldsymbol{x}_2 & \\dots & \\dots & \\boldsymbol{x}_{p-1}\\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "with a given vector" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{x}_i^T = \\begin{bmatrix}x_{0,i} & x_{1,i} & x_{2,i}& \\dots & \\dots x_{n-1,i}\\end{bmatrix}.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "With these definitions, we can now rewrite our $2\\times 2$\n", - "correaltion/covariance matrix in terms of a moe general design/feature\n", - "matrix $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times p}$. This leads to a $p\\times p$\n", - "covariance matrix for the vectors $\\boldsymbol{x}_i$ with $i=0,1,\\dots,p-1$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{C}[\\boldsymbol{x}] = \\begin{bmatrix}\n", - "\\mathrm{var}[\\boldsymbol{x}_0] & \\mathrm{cov}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] & \\mathrm{cov}[\\boldsymbol{x}_0,\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{cov}[\\boldsymbol{x}_0,\\boldsymbol{x}_{p-1}]\\\\\n", - "\\mathrm{cov}[\\boldsymbol{x}_1,\\boldsymbol{x}_0] & \\mathrm{var}[\\boldsymbol{x}_1] & \\mathrm{cov}[\\boldsymbol{x}_1,\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{cov}[\\boldsymbol{x}_1,\\boldsymbol{x}_{p-1}]\\\\\n", - "\\mathrm{cov}[\\boldsymbol{x}_2,\\boldsymbol{x}_0] & \\mathrm{cov}[\\boldsymbol{x}_2,\\boldsymbol{x}_1] & \\mathrm{var}[\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{cov}[\\boldsymbol{x}_2,\\boldsymbol{x}_{p-1}]\\\\\n", - "\\dots & \\dots & \\dots & \\dots & \\dots & \\dots \\\\\n", - "\\dots & \\dots & \\dots & \\dots & \\dots & \\dots \\\\\n", - "\\mathrm{cov}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_0] & \\mathrm{cov}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_1] & \\mathrm{cov}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_{2}] & \\dots & \\dots & \\mathrm{var}[\\boldsymbol{x}_{p-1}]\\\\\n", - "\\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "and the correlation matrix" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{K}[\\boldsymbol{x}] = \\begin{bmatrix}\n", - "1 & \\mathrm{corr}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] & \\mathrm{corr}[\\boldsymbol{x}_0,\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{corr}[\\boldsymbol{x}_0,\\boldsymbol{x}_{p-1}]\\\\\n", - "\\mathrm{corr}[\\boldsymbol{x}_1,\\boldsymbol{x}_0] & 1 & \\mathrm{corr}[\\boldsymbol{x}_1,\\boldsymbol{x}_2] & \\dots & \\dots & \\mathrm{corr}[\\boldsymbol{x}_1,\\boldsymbol{x}_{p-1}]\\\\\n", - "\\mathrm{corr}[\\boldsymbol{x}_2,\\boldsymbol{x}_0] & \\mathrm{corr}[\\boldsymbol{x}_2,\\boldsymbol{x}_1] & 1 & \\dots & \\dots & \\mathrm{corr}[\\boldsymbol{x}_2,\\boldsymbol{x}_{p-1}]\\\\\n", - "\\dots & \\dots & \\dots & \\dots & \\dots & \\dots \\\\\n", - "\\dots & \\dots & \\dots & \\dots & \\dots & \\dots \\\\\n", - "\\mathrm{corr}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_0] & \\mathrm{corr}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_1] & \\mathrm{corr}[\\boldsymbol{x}_{p-1},\\boldsymbol{x}_{2}] & \\dots & \\dots & 1\\\\\n", - "\\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The Numpy function **np.cov** calculates the covariance elements using\n", - "the factor $1/(n-1)$ instead of $1/n$ since it assumes we do not have\n", - "the exact mean values. The following simple function uses the\n", - "**np.vstack** function which takes each vector of dimension $1\\times n$\n", - "and produces a $2\\times n$ matrix $\\boldsymbol{W}$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{W} = \\begin{bmatrix} x_0 & y_0 \\\\\n", - " x_1 & y_1 \\\\\n", - " x_2 & y_2\\\\\n", - " \\dots & \\dots \\\\\n", - " x_{n-2} & y_{n-2}\\\\\n", - " x_{n-1} & y_{n-1} & \n", - " \\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "which in turn is converted into into the $2\\times 2$ covariance matrix\n", - "$\\boldsymbol{C}$ via the Numpy function **np.cov()**. We note that we can also calculate\n", - "the mean value of each set of samples $\\boldsymbol{x}$ etc using the Numpy\n", - "function **np.mean(x)**. We can also extract the eigenvalues of the\n", - "covariance matrix through the **np.linalg.eig()** function." + "that is the rewriting in terms of the so-called bias, the variance of the model $\\boldsymbol{\\tilde{y}}$ and the variance of $\\boldsymbol{\\epsilon}$." ] }, { @@ -1119,27 +900,60 @@ }, "outputs": [], "source": [ - "# Importing various packages\n", + "import matplotlib.pyplot as plt\n", "import numpy as np\n", - "n = 100\n", - "x = np.random.normal(size=n)\n", - "print(np.mean(x))\n", - "y = 4+3*x+np.random.normal(size=n)\n", - "print(np.mean(y))\n", - "W = np.vstack((x, y))\n", - "C = np.cov(W)\n", - "print(C)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "The previous example can be converted into the correlation matrix by\n", - "simply scaling the matrix elements with the variances. We should also\n", - "subtract the mean values for each column. This leads to the following\n", - "code which sets up the correlations matrix for the previous example in\n", - "a more brute force way. Here we scale the mean values for each column of the design matrix, calculate the relevant mean values and variances and then finally set up the $2\\times 2$ correlation matrix (since we have only two vectors)." + "from sklearn.linear_model import LinearRegression, Ridge, Lasso\n", + "from sklearn.preprocessing import PolynomialFeatures\n", + "from sklearn.model_selection import train_test_split\n", + "from sklearn.pipeline import make_pipeline\n", + "from sklearn.utils import resample\n", + "\n", + "np.random.seed(2018)\n", + "\n", + "n = 500\n", + "n_boostraps = 100\n", + "degree = 18 # A quite high value, just to show.\n", + "noise = 0.1\n", + "\n", + "# Make data set.\n", + "x = np.linspace(-1, 3, n).reshape(-1, 1)\n", + "y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2) + np.random.normal(0, 0.1, x.shape)\n", + "\n", + "# Hold out some test data that is never used in training.\n", + "x_train, x_test, y_train, y_test = train_test_split(x, y, test_size=0.2)\n", + "\n", + "# Combine x transformation and model into one operation.\n", + "# Not neccesary, but convenient.\n", + "model = make_pipeline(PolynomialFeatures(degree=degree), LinearRegression(fit_intercept=False))\n", + "\n", + "# The following (m x n_bootstraps) matrix holds the column vectors y_pred\n", + "# for each bootstrap iteration.\n", + "y_pred = np.empty((y_test.shape[0], n_boostraps))\n", + "for i in range(n_boostraps):\n", + " x_, y_ = resample(x_train, y_train)\n", + "\n", + " # Evaluate the new model on the same test data each time.\n", + " y_pred[:, i] = model.fit(x_, y_).predict(x_test).ravel()\n", + "\n", + "# Note: Expectations and variances taken w.r.t. different training\n", + "# data sets, hence the axis=1. Subsequent means are taken across the test data\n", + "# set in order to obtain a total value, but before this we have error/bias/variance\n", + "# calculated per data point in the test set.\n", + "# Note 2: The use of keepdims=True is important in the calculation of bias as this \n", + "# maintains the column vector form. Dropping this yields very unexpected results.\n", + "error = np.mean( np.mean((y_test - y_pred)**2, axis=1, keepdims=True) )\n", + "bias = np.mean( (y_test - np.mean(y_pred, axis=1, keepdims=True))**2 )\n", + "variance = np.mean( np.var(y_pred, axis=1, keepdims=True) )\n", + "print('Error:', error)\n", + "print('Bias^2:', bias)\n", + "print('Var:', variance)\n", + "print('{} >= {} + {} = {}'.format(error, bias, variance, bias+variance))\n", + "\n", + "plt.plot(x[::5, :], y[::5, :], label='f(x)')\n", + "plt.scatter(x_test, y_test, label='Data points')\n", + "plt.scatter(x_test, np.mean(y_pred, axis=1), label='Pred')\n", + "plt.legend()\n", + "plt.show()" ] }, { @@ -1151,41 +965,89 @@ }, "outputs": [], "source": [ + "import matplotlib.pyplot as plt\n", "import numpy as np\n", - "n = 100\n", - "# define two vectors \n", - "x = np.random.random(size=n)\n", - "y = 4+3*x+np.random.normal(size=n)\n", - "#scaling the x and y vectors \n", - "x = x - np.mean(x)\n", - "y = y - np.mean(y)\n", - "variance_x = np.sum(x@x)/n\n", - "variance_y = np.sum(y@y)/n\n", - "print(variance_x)\n", - "print(variance_y)\n", - "cov_xy = np.sum(x@y)/n\n", - "cov_xx = np.sum(x@x)/n\n", - "cov_yy = np.sum(y@y)/n\n", - "C = np.zeros((2,2))\n", - "C[0,0]= cov_xx/variance_x\n", - "C[1,1]= cov_yy/variance_y\n", - "C[0,1]= cov_xy/np.sqrt(variance_y*variance_x)\n", - "C[1,0]= C[0,1]\n", - "print(C)" + "from sklearn.linear_model import LinearRegression, Ridge, Lasso\n", + "from sklearn.preprocessing import PolynomialFeatures\n", + "from sklearn.model_selection import train_test_split\n", + "from sklearn.pipeline import make_pipeline\n", + "from sklearn.utils import resample\n", + "\n", + "np.random.seed(2018)\n", + "\n", + "n = 40\n", + "n_boostraps = 100\n", + "maxdegree = 14\n", + "\n", + "\n", + "# Make data set.\n", + "x = np.linspace(-3, 3, n).reshape(-1, 1)\n", + "y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2)+ np.random.normal(0, 0.1, x.shape)\n", + "error = np.zeros(maxdegree)\n", + "bias = np.zeros(maxdegree)\n", + "variance = np.zeros(maxdegree)\n", + "polydegree = np.zeros(maxdegree)\n", + "x_train, x_test, y_train, y_test = train_test_split(x, y, test_size=0.2)\n", + "\n", + "for degree in range(maxdegree):\n", + " model = make_pipeline(PolynomialFeatures(degree=degree), LinearRegression(fit_intercept=False))\n", + " y_pred = np.empty((y_test.shape[0], n_boostraps))\n", + " for i in range(n_boostraps):\n", + " x_, y_ = resample(x_train, y_train)\n", + " y_pred[:, i] = model.fit(x_, y_).predict(x_test).ravel()\n", + "\n", + " polydegree[degree] = degree\n", + " error[degree] = np.mean( np.mean((y_test - y_pred)**2, axis=1, keepdims=True) )\n", + " bias[degree] = np.mean( (y_test - np.mean(y_pred, axis=1, keepdims=True))**2 )\n", + " variance[degree] = np.mean( np.var(y_pred, axis=1, keepdims=True) )\n", + " print('Polynomial degree:', degree)\n", + " print('Error:', error[degree])\n", + " print('Bias^2:', bias[degree])\n", + " print('Var:', variance[degree])\n", + " print('{} >= {} + {} = {}'.format(error[degree], bias[degree], variance[degree], bias[degree]+variance[degree]))\n", + "\n", + "plt.plot(polydegree, error, label='Error')\n", + "plt.plot(polydegree, bias, label='bias')\n", + "plt.plot(polydegree, variance, label='Variance')\n", + "plt.legend()\n", + "plt.show()" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ - "We see that the matrix elements along the diagonal are one as they\n", - "should be and that the matrix is symmetric. Furthermore, diagonalizing\n", - "this matrix we easily see that it is a positive definite matrix.\n", - "\n", - "The above procedure with **numpy** can be made more compact if we use **pandas**.\n", + "The bias-variance tradeoff summarizes the fundamental tension in\n", + "machine learning, particularly supervised learning, between the\n", + "complexity of a model and the amount of training data needed to train\n", + "it. Since data is often limited, in practice it is often useful to\n", + "use a less-complex model with higher bias, that is a model whose asymptotic\n", + "performance is worse than another model because it is easier to\n", + "train and less sensitive to sampling noise arising from having a\n", + "finite-sized training dataset (smaller variance). \n", "\n", "\n", - "We whow here how we can set up the correlation matrix using **pandas**, as done in this simple code" + "\n", + "The above equations tell us that in\n", + "order to minimize the expected test error, we need to select a\n", + "statistical learning method that simultaneously achieves low variance\n", + "and low bias. Note that variance is inherently a nonnegative quantity,\n", + "and squared bias is also nonnegative. Hence, we see that the expected\n", + "test MSE can never lie below $Var(\\epsilon)$, the irreducible error.\n", + "\n", + "\n", + "What do we mean by the variance and bias of a statistical learning\n", + "method? The variance refers to the amount by which our model would change if we\n", + "estimated it using a different training data set. Since the training\n", + "data are used to fit the statistical learning method, different\n", + "training data sets will result in a different estimate. But ideally the\n", + "estimate for our model should not vary too much between training\n", + "sets. However, if a method has high variance then small changes in\n", + "the training data can result in large changes in the model. In general, more\n", + "flexible statistical methods have higher variance.\n", + "\n", + "\n", + "You may also find this recent [article](https://www.pnas.org/content/116/32/15849) of interest." ] }, { @@ -1197,26 +1059,77 @@ }, "outputs": [], "source": [ + "\"\"\"\n", + "============================\n", + "Underfitting vs. Overfitting\n", + "============================\n", + "\n", + "This example demonstrates the problems of underfitting and overfitting and\n", + "how we can use linear regression with polynomial features to approximate\n", + "nonlinear functions. The plot shows the function that we want to approximate,\n", + "which is a part of the cosine function. In addition, the samples from the\n", + "real function and the approximations of different models are displayed. The\n", + "models have polynomial features of different degrees. We can see that a\n", + "linear function (polynomial with degree 1) is not sufficient to fit the\n", + "training samples. This is called **underfitting**. A polynomial of degree 4\n", + "approximates the true function almost perfectly. However, for higher degrees\n", + "the model will **overfit** the training data, i.e. it learns the noise of the\n", + "training data.\n", + "We evaluate quantitatively **overfitting** / **underfitting** by using\n", + "cross-validation. We calculate the mean squared error (MSE) on the validation\n", + "set, the higher, the less likely the model generalizes correctly from the\n", + "training data.\n", + "\"\"\"\n", + "\n", + "print(__doc__)\n", + "\n", "import numpy as np\n", - "import pandas as pd\n", - "n = 10\n", - "x = np.random.normal(size=n)\n", - "x = x - np.mean(x)\n", - "y = 4+3*x+np.random.normal(size=n)\n", - "y = y - np.mean(y)\n", - "X = (np.vstack((x, y))).T\n", - "print(X)\n", - "Xpd = pd.DataFrame(X)\n", - "print(Xpd)\n", - "correlation_matrix = Xpd.corr()\n", - "print(correlation_matrix)" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "We expand this model to the Franke function discussed above." + "import matplotlib.pyplot as plt\n", + "from sklearn.pipeline import Pipeline\n", + "from sklearn.preprocessing import PolynomialFeatures\n", + "from sklearn.linear_model import LinearRegression\n", + "from sklearn.model_selection import cross_val_score\n", + "\n", + "\n", + "def true_fun(X):\n", + " return np.cos(1.5 * np.pi * X)\n", + "\n", + "np.random.seed(0)\n", + "\n", + "n_samples = 30\n", + "degrees = [1, 4, 15]\n", + "\n", + "X = np.sort(np.random.rand(n_samples))\n", + "y = true_fun(X) + np.random.randn(n_samples) * 0.1\n", + "\n", + "plt.figure(figsize=(14, 5))\n", + "for i in range(len(degrees)):\n", + " ax = plt.subplot(1, len(degrees), i + 1)\n", + " plt.setp(ax, xticks=(), yticks=())\n", + "\n", + " polynomial_features = PolynomialFeatures(degree=degrees[i],\n", + " include_bias=False)\n", + " linear_regression = LinearRegression()\n", + " pipeline = Pipeline([(\"polynomial_features\", polynomial_features),\n", + " (\"linear_regression\", linear_regression)])\n", + " pipeline.fit(X[:, np.newaxis], y)\n", + "\n", + " # Evaluate the models using crossvalidation\n", + " scores = cross_val_score(pipeline, X[:, np.newaxis], y,\n", + " scoring=\"neg_mean_squared_error\", cv=10)\n", + "\n", + " X_test = np.linspace(0, 1, 100)\n", + " plt.plot(X_test, pipeline.predict(X_test[:, np.newaxis]), label=\"Model\")\n", + " plt.plot(X_test, true_fun(X_test), label=\"True function\")\n", + " plt.scatter(X, y, edgecolor='b', s=20, label=\"Samples\")\n", + " plt.xlabel(\"x\")\n", + " plt.ylabel(\"y\")\n", + " plt.xlim((0, 1))\n", + " plt.ylim((-2, 2))\n", + " plt.legend(loc=\"best\")\n", + " plt.title(\"Degree {}\\nMSE = {:.2e}(+/- {:.2e})\".format(\n", + " degrees[i], -scores.mean(), scores.std()))\n", + "plt.show()" ] }, { @@ -1229,146 +1142,207 @@ "outputs": [], "source": [ "# Common imports\n", + "import os\n", "import numpy as np\n", "import pandas as pd\n", + "import matplotlib.pyplot as plt\n", + "from sklearn.linear_model import LinearRegression, Ridge, Lasso\n", + "from sklearn.model_selection import train_test_split\n", + "from sklearn.utils import resample\n", + "from sklearn.metrics import mean_squared_error\n", + "# Where to save the figures and data files\n", + "PROJECT_ROOT_DIR = \"Results\"\n", + "FIGURE_ID = \"Results/FigureFiles\"\n", + "DATA_ID = \"DataFiles/\"\n", "\n", + "if not os.path.exists(PROJECT_ROOT_DIR):\n", + " os.mkdir(PROJECT_ROOT_DIR)\n", "\n", - "def FrankeFunction(x,y):\n", - "\tterm1 = 0.75*np.exp(-(0.25*(9*x-2)**2) - 0.25*((9*y-2)**2))\n", - "\tterm2 = 0.75*np.exp(-((9*x+1)**2)/49.0 - 0.1*(9*y+1))\n", - "\tterm3 = 0.5*np.exp(-(9*x-7)**2/4.0 - 0.25*((9*y-3)**2))\n", - "\tterm4 = -0.2*np.exp(-(9*x-4)**2 - (9*y-7)**2)\n", - "\treturn term1 + term2 + term3 + term4\n", + "if not os.path.exists(FIGURE_ID):\n", + " os.makedirs(FIGURE_ID)\n", "\n", + "if not os.path.exists(DATA_ID):\n", + " os.makedirs(DATA_ID)\n", "\n", - "def create_X(x, y, n ):\n", - "\tif len(x.shape) > 1:\n", - "\t\tx = np.ravel(x)\n", - "\t\ty = np.ravel(y)\n", + "def image_path(fig_id):\n", + " return os.path.join(FIGURE_ID, fig_id)\n", "\n", - "\tN = len(x)\n", - "\tl = int((n+1)*(n+2)/2)\t\t# Number of elements in beta\n", - "\tX = np.ones((N,l))\n", + "def data_path(dat_id):\n", + " return os.path.join(DATA_ID, dat_id)\n", "\n", - "\tfor i in range(1,n+1):\n", - "\t\tq = int((i)*(i+1)/2)\n", - "\t\tfor k in range(i+1):\n", - "\t\t\tX[:,q+k] = (x**(i-k))*(y**k)\n", + "def save_fig(fig_id):\n", + " plt.savefig(image_path(fig_id) + \".png\", format='png')\n", "\n", - "\treturn X\n", + "infile = open(data_path(\"EoS.csv\"),'r')\n", "\n", + "# Read the EoS data as csv file and organize the data into two arrays with density and energies\n", + "EoS = pd.read_csv(infile, names=('Density', 'Energy'))\n", + "EoS['Energy'] = pd.to_numeric(EoS['Energy'], errors='coerce')\n", + "EoS = EoS.dropna()\n", + "Energies = EoS['Energy']\n", + "Density = EoS['Density']\n", + "# The design matrix now as function of various polytrops\n", "\n", - "# Making meshgrid of datapoints and compute Franke's function\n", - "n = 4\n", - "N = 100\n", - "x = np.sort(np.random.uniform(0, 1, N))\n", - "y = np.sort(np.random.uniform(0, 1, N))\n", - "z = FrankeFunction(x, y)\n", - "X = create_X(x, y, n=n) \n", + "Maxpolydegree = 30\n", + "X = np.zeros((len(Density),Maxpolydegree))\n", + "X[:,0] = 1.0\n", + "testerror = np.zeros(Maxpolydegree)\n", + "trainingerror = np.zeros(Maxpolydegree)\n", + "polynomial = np.zeros(Maxpolydegree)\n", "\n", - "Xpd = pd.DataFrame(X)\n", - "# subtract the mean values and set up the covariance matrix\n", - "Xpd = Xpd - Xpd.mean()\n", - "covariance_matrix = Xpd.cov()\n", - "print(covariance_matrix)" + "trials = 100\n", + "for polydegree in range(1, Maxpolydegree):\n", + " polynomial[polydegree] = polydegree\n", + " for degree in range(polydegree):\n", + " X[:,degree] = Density**(degree/3.0)\n", + "\n", + "# loop over trials in order to estimate the expectation value of the MSE\n", + " testerror[polydegree] = 0.0\n", + " trainingerror[polydegree] = 0.0\n", + " for samples in range(trials):\n", + " x_train, x_test, y_train, y_test = train_test_split(X, Energies, test_size=0.2)\n", + " model = LinearRegression(fit_intercept=True).fit(x_train, y_train)\n", + " ypred = model.predict(x_train)\n", + " ytilde = model.predict(x_test)\n", + " testerror[polydegree] += mean_squared_error(y_test, ytilde)\n", + " trainingerror[polydegree] += mean_squared_error(y_train, ypred) \n", + "\n", + " testerror[polydegree] /= trials\n", + " trainingerror[polydegree] /= trials\n", + " print(\"Degree of polynomial: %3d\"% polynomial[polydegree])\n", + " print(\"Mean squared error on training data: %.8f\" % trainingerror[polydegree])\n", + " print(\"Mean squared error on test data: %.8f\" % testerror[polydegree])\n", + "\n", + "plt.plot(polynomial, np.log10(trainingerror), label='Training Error')\n", + "plt.plot(polynomial, np.log10(testerror), label='Test Error')\n", + "plt.xlabel('Polynomial degree')\n", + "plt.ylabel('log10[MSE]')\n", + "plt.legend()\n", + "plt.show()" ] }, { - "cell_type": "markdown", - "metadata": {}, + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], "source": [ - "We note here that the covariance is zero for the first rows and\n", - "columns since all matrix elements in the design matrix were set to one\n", - "(we are fitting the function in terms of a polynomial of degree $n$).\n", - "\n", - "This means that the variance for these elements will be zero and will\n", - "cause problems when we set up the correlation matrix. We can simply\n", - "drop these elements and construct a correlation\n", - "matrix without these elements. \n", + "# Common imports\n", + "import os\n", + "import numpy as np\n", + "import pandas as pd\n", + "import matplotlib.pyplot as plt\n", + "from sklearn.linear_model import LinearRegression, Ridge, Lasso\n", + "from sklearn.metrics import mean_squared_error\n", + "from sklearn.model_selection import KFold\n", + "from sklearn.model_selection import cross_val_score\n", "\n", "\n", + "# Where to save the figures and data files\n", + "PROJECT_ROOT_DIR = \"Results\"\n", + "FIGURE_ID = \"Results/FigureFiles\"\n", + "DATA_ID = \"DataFiles/\"\n", "\n", + "if not os.path.exists(PROJECT_ROOT_DIR):\n", + " os.mkdir(PROJECT_ROOT_DIR)\n", "\n", - "We can rewrite the covariance matrix in a more compact form in terms of the design/feature matrix $\\boldsymbol{X}$ as" + "if not os.path.exists(FIGURE_ID):\n", + " os.makedirs(FIGURE_ID)\n", + "\n", + "if not os.path.exists(DATA_ID):\n", + " os.makedirs(DATA_ID)\n", + "\n", + "def image_path(fig_id):\n", + " return os.path.join(FIGURE_ID, fig_id)\n", + "\n", + "def data_path(dat_id):\n", + " return os.path.join(DATA_ID, dat_id)\n", + "\n", + "def save_fig(fig_id):\n", + " plt.savefig(image_path(fig_id) + \".png\", format='png')\n", + "\n", + "infile = open(data_path(\"EoS.csv\"),'r')\n", + "\n", + "# Read the EoS data as csv file and organize the data into two arrays with density and energies\n", + "EoS = pd.read_csv(infile, names=('Density', 'Energy'))\n", + "EoS['Energy'] = pd.to_numeric(EoS['Energy'], errors='coerce')\n", + "EoS = EoS.dropna()\n", + "Energies = EoS['Energy']\n", + "Density = EoS['Density']\n", + "# The design matrix now as function of various polytrops\n", + "\n", + "Maxpolydegree = 30\n", + "X = np.zeros((len(Density),Maxpolydegree))\n", + "X[:,0] = 1.0\n", + "estimated_mse_sklearn = np.zeros(Maxpolydegree)\n", + "polynomial = np.zeros(Maxpolydegree)\n", + "k =5\n", + "kfold = KFold(n_splits = k)\n", + "\n", + "for polydegree in range(1, Maxpolydegree):\n", + " polynomial[polydegree] = polydegree\n", + " for degree in range(polydegree):\n", + " X[:,degree] = Density**(degree/3.0)\n", + " OLS = LinearRegression()\n", + "# loop over trials in order to estimate the expectation value of the MSE\n", + " estimated_mse_folds = cross_val_score(OLS, X, Energies, scoring='neg_mean_squared_error', cv=kfold)\n", + "#[:, np.newaxis]\n", + " estimated_mse_sklearn[polydegree] = np.mean(-estimated_mse_folds)\n", + "\n", + "plt.plot(polynomial, np.log10(estimated_mse_sklearn), label='Test Error')\n", + "plt.xlabel('Polynomial degree')\n", + "plt.ylabel('log10[MSE]')\n", + "plt.legend()\n", + "plt.show()" ] }, { - "cell_type": "markdown", - "metadata": {}, + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": false, + "editable": true + }, + "outputs": [], "source": [ - "$$\n", - "\\boldsymbol{C}[\\boldsymbol{x}] = \\frac{1}{n}\\boldsymbol{X}^T\\boldsymbol{X}= \\mathbb{E}[\\boldsymbol{X}^T\\boldsymbol{X}].\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "To see this let us simply look at a design matrix $\\boldsymbol{X}\\in {\\mathbb{R}}^{2\\times 2}$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{X}=\\begin{bmatrix}\n", - "x_{00} & x_{01}\\\\\n", - "x_{10} & x_{11}\\\\\n", - "\\end{bmatrix}=\\begin{bmatrix}\n", - "\\boldsymbol{x}_{0} & \\boldsymbol{x}_{1}\\\\\n", - "\\end{bmatrix}.\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "If we then compute the expectation value" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\mathbb{E}[\\boldsymbol{X}^T\\boldsymbol{X}] = \\frac{1}{n}\\boldsymbol{X}^T\\boldsymbol{X}=\\begin{bmatrix}\n", - "x_{00}^2+x_{01}^2 & x_{00}x_{10}+x_{01}x_{11}\\\\\n", - "x_{10}x_{00}+x_{11}x_{01} & x_{10}^2+x_{11}^2\\\\\n", - "\\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "which is just" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "$$\n", - "\\boldsymbol{C}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] = \\boldsymbol{C}[\\boldsymbol{x}]=\\begin{bmatrix} \\mathrm{var}[\\boldsymbol{x}_0] & \\mathrm{cov}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] \\\\\n", - " \\mathrm{cov}[\\boldsymbol{x}_1,\\boldsymbol{x}_0] & \\mathrm{var}[\\boldsymbol{x}_1] \\\\\n", - " \\end{bmatrix},\n", - "$$" - ] - }, - { - "cell_type": "markdown", - "metadata": {}, - "source": [ - "where we wrote $$\\boldsymbol{C}[\\boldsymbol{x}_0,\\boldsymbol{x}_1] = \\boldsymbol{C}[\\boldsymbol{x}]$$ to indicate that this the covariance of the vectors $\\boldsymbol{x}$ of the design/feature matrix $\\boldsymbol{X}$.\n", + "import numpy as np\n", + "import matplotlib.pyplot as plt\n", + "from sklearn.model_selection import KFold\n", + "from sklearn.linear_model import Ridge\n", + "from sklearn.model_selection import cross_val_score\n", + "from sklearn.preprocessing import PolynomialFeatures\n", "\n", - "It is easy to generalize this to a matrix $\\boldsymbol{X}\\in {\\mathbb{R}}^{n\\times p}$.\n", + "# A seed just to ensure that the random numbers are the same for every run.\n", + "np.random.seed(3155)\n", + "# Generate the data.\n", + "n = 100\n", + "x = np.linspace(-3, 3, n).reshape(-1, 1)\n", + "y = np.exp(-x**2) + 1.5 * np.exp(-(x-2)**2)+ np.random.normal(0, 0.1, x.shape)\n", + "# Decide degree on polynomial to fit\n", + "poly = PolynomialFeatures(degree = 10)\n", "\n", - "\n", - "## Linking with SVD" + "# Decide which values of lambda to use\n", + "nlambdas = 500\n", + "lambdas = np.logspace(-3, 5, nlambdas)\n", + "# Initialize a KFold instance\n", + "k = 5\n", + "kfold = KFold(n_splits = k)\n", + "estimated_mse_sklearn = np.zeros(nlambdas)\n", + "i = 0\n", + "for lmb in lambdas:\n", + " ridge = Ridge(alpha = lmb)\n", + " estimated_mse_folds = cross_val_score(ridge, x, y, scoring='neg_mean_squared_error', cv=kfold)\n", + " estimated_mse_sklearn[i] = np.mean(-estimated_mse_folds)\n", + " i += 1\n", + "plt.figure()\n", + "plt.plot(np.log10(lambdas), estimated_mse_sklearn, label = 'cross_val_score')\n", + "plt.xlabel('log10(lambda)')\n", + "plt.ylabel('MSE')\n", + "plt.legend()\n", + "plt.show()" ] } ], diff --git a/doc/LectureNotes/_build/html/chapter2.html b/doc/LectureNotes/_build/html/chapter2.html index 21ac40195..258b482f4 100644 --- a/doc/LectureNotes/_build/html/chapter2.html +++ b/doc/LectureNotes/_build/html/chapter2.html @@ -5,7 +5,7 @@ - 4. Resampling Methods — Applied Data Analysis and Machine Learning + 4. Ridge and Lasso Regression — Applied Data Analysis and Machine Learning @@ -54,7 +54,7 @@ - + @@ -144,12 +144,12 @@
  • - 5. Ridge and Lasso Regression + 5. Resampling Methods
  • @@ -285,35 +285,73 @@
  • - 4. Resampling Methods + 4. Ridge and Lasso Regression