# 16. Introduction to Artificial Neural Networks¶

!pip install --upgrade jax jaxlib
!conda install -y -c plotly plotly plotly-orca retrying

Requirement already satisfied: jax in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (0.3.23)

Requirement already satisfied: jaxlib in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (0.3.22)

Requirement already satisfied: scipy>=1.5 in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (from jax) (1.9.1)
Requirement already satisfied: typing-extensions in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (from jax) (4.3.0)
Requirement already satisfied: absl-py in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (from jax) (1.3.0)
Requirement already satisfied: etils[epath] in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (from jax) (0.9.0)
Requirement already satisfied: opt-einsum in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (from jax) (3.3.0)

Requirement already satisfied: numpy>=1.20 in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (from jax) (1.23.4)

Requirement already satisfied: zipp in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (from etils[epath]->jax) (3.8.0)
Requirement already satisfied: importlib_resources in /usr/share/miniconda3/envs/quantecon/lib/python3.9/site-packages (from etils[epath]->jax) (5.10.0)

Collecting package metadata (current_repodata.json): -

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

done
Solving environment: \

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

\

|

/

-

done

## Package Plan ##

environment location: /usr/share/miniconda3/envs/quantecon

- plotly
- plotly-orca
- retrying

package                    |            build
---------------------------|-----------------
plotly-orca-1.3.1          |                1        56.6 MB  plotly
retrying-1.3.3             |     pyhd3eb1b0_2          14 KB
------------------------------------------------------------
Total:        56.6 MB

The following NEW packages will be INSTALLED:

plotly-orca        plotly/linux-64::plotly-orca-1.3.1-1 None
retrying           pkgs/main/noarch::retrying-1.3.3-pyhd3eb1b0_2 None

plotly-orca-1.3.1    | 56.6 MB   |                                       |   0%

plotly-orca-1.3.1    | 56.6 MB   | ##################################### | 100%
plotly-orca-1.3.1    | 56.6 MB   | ##################################### | 100%

retrying-1.3.3       | 14 KB     |                                       |   0%

retrying-1.3.3       | 14 KB     | ##################################### | 100%
Preparing transaction: |

/

done
Verifying transaction: \

|

/

done
Executing transaction:

\

|

/

-

\

|

/

-

\

|

/

-

\

done
Retrieving notices: ...working...

done


Note

If you are running this on Google Colab the above cell will present an error. This is because Google Colab doesn’t use Anaconda to manage the Python packages. However this lecture will still execute as Google Colab has plotly installed.

## 16.1. Overview¶

Substantial parts of machine learning and artificial intelligence are about

• approximating an unknown function with a known function

• estimating the known function from a set of data on the left- and right-hand variables

This lecture describes the structure of a plain vanilla artificial neural network (ANN) of a type that is widely used to approximate a function $$f$$ that maps $$x$$ in a space $$X$$ into $$y$$ in a space $$Y$$.

To introduce elementary concepts, we study an example in which $$x$$ and $$y$$ are scalars.

We’ll describe the following concepts that are brick and mortar for neural networks:

• a neuron

• an activation function

• a network of neurons

• A neural network as a composition of functions

• back-propagation and its relationship to the chain rule of differential calculus

## 16.2. A Deep (but not Wide) Artificial Neural Network¶

We describe a “deep” neural network of “width” one.

Deep means that the network composes a large number of functions organized into nodes of a graph.

Width refers to the number of right hand side variables on the right hand side of the function being approximated.

Setting “width” to one means that the network composes just univariate functions.

Let $$x \in \mathbb{R}$$ be a scalar and $$y \in \mathbb{R}$$ be another scalar.

We assume that $$y$$ is a nonlinear function of $$x$$:

$y = f(x)$

We want to approximate $$f(x)$$ with another function that we define recursively.

For a network of depth $$N \geq 1$$, each layer $$i =1, \ldots N$$ consists of

• an input $$x_i$$

• an affine function $$w_i x_i + bI$$, where $$w_i$$ is a scalar weight placed on the input $$x_i$$ and $$b_i$$ is a scalar bias

• an activation function $$h_i$$ that takes $$(w_i x_i + b_i)$$ as an argument and produces an output $$x_{i+1}$$

An example of an activation function $$h$$ is the sigmoid function

$h (z) = \frac{1}{1 + e^{-z}}$

Another popular activation function is the rectified linear unit (ReLU) function

$h(z) = \max (0, z)$

Yet another activation function is the identity function

$h(z) = z$

As activation functions below, we’ll use the sigmoid function for layers $$1$$ to $$N-1$$ and the identity function for layer $$N$$.

To approximate a function $$f(x)$$ we construct $$\hat f(x)$$ by proceeding as follows.

Let

$l_{i}\left(x\right)=w_{i}x+b_{i} .$

We construct $$\hat f$$ by iterating on compositions of functions $$h_i \circ l_i$$:

$f(x)\approx\hat{f}(x)=h_{N}\circ l_{N}\circ h_{N-1}\circ l_{1}\circ\cdots\circ h_{1}\circ l_{1}(x)$

If $$N >1$$, we call the right side a “deep” neural net.

The larger is the integer $$N$$, the “deeper” is the neural net.

Evidently, if we know the parameters $$\{w_i, b_i\}_{i=1}^N$$, then we can compute $$\hat f(x)$$ for a given $$x = \tilde x$$ by iterating on the recursion

(16.1)$x_{i+1} = h_i \circ l_i(x_i) , \quad, i = 1, \ldots N$

starting from $$x_1 = \tilde x$$.

The value of $$x_{N+1}$$ that emerges from this iterative scheme equals $$\hat f(\tilde x)$$.

## 16.3. Calibrating Parameters¶

We now consider a neural network like the one describe above with width 1, depth $$N$$, and activation functions $$h_{i}$$ for $$1\leqslant i\leqslant N$$ that map $$\mathbb{R}$$ into itself.

Let $$\left\{ \left(w_{i},b_{i}\right)\right\} _{i=1}^{N}$$ denote a sequence of weights and biases.

As mentioned above, for a given input $$x_{1}$$, our approximating function $$\hat f$$ evaluated at $$x_1$$ equals the “output” $$x_{N+1}$$ from our network that can be computed by iterating on $$x_{i+1}=h_{i}\left(w_{i}x_{i}+b_{i}\right)$$.

For a given prediction $$\hat{y} (x)$$ and target $$y= f(x)$$, consider the loss function

$\mathcal{L} \left(\hat{y},y\right)(x)=\frac{1}{2}\left(\hat{y}-y\right)^{2}(x) .$

This criterion is a function of the parameters $$\left\{ \left(w_{i},b_{i}\right)\right\} _{i=1}^{N}$$ and the point $$x$$.

We’re interested in solving the following problem:

$\min_{\left\{ \left(w_{i},b_{i}\right)\right\} _{i=1}^{N}} \int {\mathcal L}\left(x_{N+1},y\right)(x) d \mu(x)$

where $$\mu(x)$$ is some measure of points $$x \in \mathbb{R}$$ over which we want a good approximation $$\hat f(x)$$ to $$f(x)$$.

Stack weights and biases into a vector of parameters $$p$$:

$p = \begin{bmatrix} w_1 \cr b_1 \cr w_2 \cr b_2 \cr \vdots \cr w_N \cr b_N \end{bmatrix}$

Applying a “poor man’s version” of a stochastic gradient descent algorithm for finding a zero of a function leads to the following update rule for parameters:

(16.2)$p_{k+1}=p_k-\alpha\frac{d \mathcal{L}}{dx_{N+1}}\frac{dx_{N+1}}{dp_k}$

where $$\frac{d {\mathcal L}}{dx_{N+1}}=-\left(x_{N+1}-y\right)$$ and $$\alpha > 0$$ is a step size.

(See this and this to gather insights about how stochastic gradient descent relates to Newton’s method.)

To implement one step of this parameter update rule, we want the vector of derivatives $$\frac{dx_{N+1}}{dp_k}$$.

In the neural network literature, this step is accomplished by what is known as back propagation.

## 16.4. Back Propagation and the Chain Rule¶

Thanks to properties of

• the chain and product rules for differentiation from differential calculus, and

• lower triangular matrices

back propagation can actually be accomplished in one step by

• inverting a lower triangular matrix, and

• matrix multiplication

(This idea is from the last 7 minutes of this great youtube video by MIT’s Alan Edelman)

Here goes.

Define the derivative of $$h(z)$$ with respect to $$z$$ evaluated at $$z = z_i$$ as $$\delta_i$$:

$\delta_i = \frac{d}{d z} h(z)|_{z=z_i}$

or

$\delta_{i}=h'\left(w_{i}x_{i}+b_{i}\right).$

Repeated application of the chain rule and product rule to our recursion (16.1) allows us to obtain:

$dx_{i+1}=\delta_{i}\left(dw_{i}x_{i}+w_{i}dx_{i}+b_{i}\right)$

After imposing $$dx_{1}=0$$, we get the following system of equations:

$\begin{split} \left(\begin{array}{c} dx_{2}\\ \vdots\\ dx_{N+1} \end{array}\right)=\underbrace{\left(\begin{array}{ccccc} \delta_{1}w_{1} & \delta_{1} & 0 & 0 & 0\\ 0 & 0 & \ddots & 0 & 0\\ 0 & 0 & 0 & \delta_{N}w_{N} & \delta_{N} \end{array}\right)}_{D}\left(\begin{array}{c} dw_{1}\\ db_{1}\\ \vdots\\ dw_{N}\\ db_{N} \end{array}\right)+\underbrace{\left(\begin{array}{cccc} 0 & 0 & 0 & 0\\ w_{2} & 0 & 0 & 0\\ 0 & \ddots & 0 & 0\\ 0 & 0 & w_{N} & 0 \end{array}\right)}_{L}\left(\begin{array}{c} dx_{2}\\ \vdots\\ dx_{N+1} \end{array}\right) \end{split}$

or

$d x = D dp + L dx$

which implies that

$dx = (I -L)^{-1} D dp$

which in turn implies

$\begin{split} \left(\begin{array}{c} dx_{N+1}/dw_{1}\\ dx_{N+1}/db_{1}\\ \vdots\\ dx_{N+1}/dw_{N}\\ dx_{N+1}/db_{N} \end{array}\right)=e_{N}\left(I-L\right)^{-1}D. \end{split}$

We can then solve the above problem by applying our update for $$p$$ multiple times for a collection of input-output pairs $$\left\{ \left(x_{1}^{i},y^{i}\right)\right\} _{i=1}^{M}$$ that we’ll call our “training set”.

## 16.5. Training Set¶

Choosing a training set amounts to a choice of measure $$\mu$$ in the above formulation of our function approximation problem as a minimization problem.

In this spirit, we shall use a uniform grid of, say, 50 or 200 points.

There are many possible approaches to the minimization problem posed above:

• batch gradient descent in which you use an average gradient over the training set

• stochastic gradient descent in which you sample points randomly and use individual gradients

• something in-between (so-called “mini-batch gradient descent”)

The update rule (16.2) described above amounts to a stochastic gradient descent algorithm.

from IPython.display import Image
import jax.numpy as jnp
from jax import grad, jit, jacfwd, vmap
from jax import random
import jax
import plotly.graph_objects as go

# A helper function to randomly initialize weights and biases
# for a dense neural network layer
def random_layer_params(m, n, key, scale=1.):
w_key, b_key = random.split(key)
return scale * random.normal(w_key, (n, m)), scale * random.normal(b_key, (n,))

# Initialize all layers for a fully-connected neural network with sizes "sizes"
def init_network_params(sizes, key):
keys = random.split(key, len(sizes))
return [random_layer_params(m, n, k) for m, n, k in zip(sizes[:-1], sizes[1:], keys)]

def compute_xδw_seq(params, x):
# Initialize arrays
δ = jnp.zeros(len(params))
xs = jnp.zeros(len(params) + 1)
ws = jnp.zeros(len(params))
bs = jnp.zeros(len(params))

h = jax.nn.sigmoid

xs = xs.at[0].set(x)
for i, (w, b) in enumerate(params[:-1]):
output = w * xs[i] + b
activation = h(output[0, 0])

# Store elements
ws = ws.at[i].set(w[0, 0])
bs = bs.at[i].set(b[0])
xs = xs.at[i+1].set(activation)

final_w, final_b = params[-1]
preds = final_w * xs[-2] + final_b

# Store elements
δ = δ.at[-1].set(1.)
ws = ws.at[-1].set(final_w[0, 0])
bs = bs.at[-1].set(final_b[0])
xs = xs.at[-1].set(preds[0, 0])

return xs, δ, ws, bs

def loss(params, x, y):
xs, δ, ws, bs = compute_xδw_seq(params, x)
preds = xs[-1]

return 1 / 2 * (y - preds) ** 2

# Parameters
N = 3  # Number of layers
layer_sizes = [1, ] * (N + 1)
param_scale = 0.1
step_size = 0.01
params = init_network_params(layer_sizes, random.PRNGKey(1))

WARNING:absl:No GPU/TPU found, falling back to CPU. (Set TF_CPP_MIN_LOG_LEVEL=0 and rerun for more info.)

x = 5
y = 3
xs, δ, ws, bs = compute_xδw_seq(params, x)

dxs_ad = jacfwd(lambda params, x: compute_xδw_seq(params, x)[0], argnums=0)(params, x)
dxs_ad_mat = jnp.block([dx.reshape((-1, 1)) for dx_tuple in dxs_ad for dx in dx_tuple ])[1:]

jnp.block([[δ * xs[:-1]], [δ]])

DeviceArray([[8.5726520e-03, 4.0850646e-04, 6.1021698e-01],
[1.7145304e-03, 2.3785222e-01, 1.0000000e+00]],            dtype=float32)

L = jnp.diag(δ * ws, k=-1)
L = L[1:, 1:]

D = jax.scipy.linalg.block_diag(*[row.reshape((1, 2)) for row in jnp.block([[δ * xs[:-1]], [δ]]).T])

dxs_la = jax.scipy.linalg.solve_triangular(jnp.eye(N) - L, D, lower=True)

# Check that the dx generated by the linear algebra method
# are the same as the ones generated using automatic differentiation

DeviceArray(0., dtype=float32)

grad_loss_ad = jnp.block([dx.reshape((-1, 1)) for dx_tuple in grad(loss)(params, x, y) for dx in dx_tuple ])

# Check that the gradient of the loss is the same for both approaches

DeviceArray(1.4901161e-08, dtype=float32)

@jit
return [(w - step_size * dw, b - step_size * db)
for (w, b), (dw, db) in zip(params, grads)]

@jit
def update_la(params, x, y):
xs, δ, ws, bs = compute_xδw_seq(params, x)
N = len(params)
L = jnp.diag(δ * ws, k=-1)
L = L[1:, 1:]

D = jax.scipy.linalg.block_diag(*[row.reshape((1, 2)) for row in jnp.block([[δ * xs[:-1]], [δ]]).T])

dxs_la = jax.scipy.linalg.solve_triangular(jnp.eye(N) - L, D, lower=True)

grads = -(y - xs[-1]) * dxs_la[-1]

return [(w - step_size * dw, b - step_size * db)
for (w, b), (dw, db) in zip(params, grads.reshape((-1, 2)))]


# Check that both updates are the same
update_la(params, x, y)

[(DeviceArray([[-1.3489482]], dtype=float32),
DeviceArray([0.37956238], dtype=float32)),
(DeviceArray([[-0.00782906]], dtype=float32),
DeviceArray([0.44972023], dtype=float32)),
(DeviceArray([[0.22937916]], dtype=float32),
DeviceArray([-0.04793657], dtype=float32))]

update_ad(params, x, y)

[(DeviceArray([[-1.3489482]], dtype=float32),
DeviceArray([0.37956238], dtype=float32)),
(DeviceArray([[-0.00782906]], dtype=float32),
DeviceArray([0.44972023], dtype=float32)),
(DeviceArray([[0.22937916]], dtype=float32),
DeviceArray([-0.04793657], dtype=float32))]


## 16.6. Example 1¶

Consider the function

$f\left(x\right)=-3x+2$

on $$\left[0.5,3\right]$$.

We use a uniform grid of 200 points and update the parameters for each point on the grid 300 times.

$$h_{i}$$ is the sigmoid activation function for all layers except the final one for which we use the identity function and $$N=3$$.

Weights are initialized randomly.

def f(x):
return -3 * x + 2

M = 200
grid = jnp.linspace(0.5, 3, num=M)
f_val = f(grid)

indices = jnp.arange(M)
key = random.PRNGKey(0)

def train(params, grid, f_val, key, num_epochs=300):
for epoch in range(num_epochs):
key, _ = random.split(key)
random_permutation = random.permutation(random.PRNGKey(1), indices)
for x, y in zip(grid[random_permutation], f_val[random_permutation]):
params = update_la(params, x, y)

return params

# Parameters
N = 3  # Number of layers
layer_sizes = [1, ] * (N + 1)
params_ex1 = init_network_params(layer_sizes, key)

%%time
params_ex1 = train(params_ex1, grid, f_val, key, num_epochs=500)

CPU times: user 5.13 s, sys: 5.89 ms, total: 5.13 s
Wall time: 5.13 s

predictions = vmap(compute_xδw_seq, in_axes=(None, 0))(params_ex1, grid)[0][:, -1]

fig = go.Figure()
fig.add_trace(go.Scatter(x=grid, y=f_val, name=r'$-3x+2$'))

# Export to PNG file
Image(fig.to_image(format="png"))
# fig.show() will provide interactive plot when running
# notebook locally


## 16.7. How Deep?¶

It is fun to think about how deepening the neural net for the above example affects the quality of approximation

• If the network is too deep, you’ll run into the vanishing gradient problem

• Other parameters such as the step size and the number of epochs can be as important or more important than the number of layers in the situation considered in this lecture.

• Indeed, since $$f$$ is a linear function of $$x$$, a one-layer network with the identity map as an activation would probably work best.

## 16.8. Example 2¶

We use the same setup as for the previous example with

$f\left(x\right)=\log\left(x\right)$
def f(x):
return jnp.log(x)

grid = jnp.linspace(0.5, 3, num=M)
f_val = f(grid)

# Parameters
N = 1  # Number of layers
layer_sizes = [1, ] * (N + 1)
params_ex2_1 = init_network_params(layer_sizes, key)

# Parameters
N = 2  # Number of layers
layer_sizes = [1, ] * (N + 1)
params_ex2_2 = init_network_params(layer_sizes, key)

# Parameters
N = 3  # Number of layers
layer_sizes = [1, ] * (N + 1)
params_ex2_3 = init_network_params(layer_sizes, key)

params_ex2_1 = train(params_ex2_1, grid, f_val, key, num_epochs=300)

params_ex2_2 = train(params_ex2_2, grid, f_val, key, num_epochs=300)

params_ex2_3 = train(params_ex2_3, grid, f_val, key, num_epochs=300)

predictions_1 = vmap(compute_xδw_seq, in_axes=(None, 0))(params_ex2_1, grid)[0][:, -1]
predictions_2 = vmap(compute_xδw_seq, in_axes=(None, 0))(params_ex2_2, grid)[0][:, -1]
predictions_3 = vmap(compute_xδw_seq, in_axes=(None, 0))(params_ex2_3, grid)[0][:, -1]

fig = go.Figure()
fig.add_trace(go.Scatter(x=grid, y=f_val, name=r'$\log{x}$'))

# Export to PNG file
Image(fig.to_image(format="png"))
# fig.show() will provide interactive plot when running
# notebook locally

## to check that gpu is activated in environment

from jax.lib import xla_bridge
print(xla_bridge.get_backend().platform)

cpu


Note

Cloud Environment: This lecture site is built in a server environment that doesn’t have access to a gpu If you run this lecture locally this lets you know where your code is being executed, either via the cpu or the gpu