From f3be9b9268333882dd1d4df12012d2f234d7c8f4 Mon Sep 17 00:00:00 2001 From: mhjensen Date: Thu, 26 Nov 2020 11:35:25 +0100 Subject: [PATCH] typo week48 --- doc/pub/week48/html/._week48-bs015.html | 2 +- doc/pub/week48/html/week48-reveal.html | 2 +- doc/pub/week48/html/week48-solarized.html | 2 +- doc/pub/week48/html/week48.html | 2 +- doc/pub/week48/ipynb/ipynb-week48-src.tar.gz | Bin 822634 -> 822634 bytes doc/pub/week48/ipynb/week48.ipynb | 2 +- doc/src/week48/week48.do.txt | 2 +- 7 files changed, 6 insertions(+), 6 deletions(-) diff --git a/doc/pub/week48/html/._week48-bs015.html b/doc/pub/week48/html/._week48-bs015.html index 598ecf1af..d78bf5373 100644 --- a/doc/pub/week48/html/._week48-bs015.html +++ b/doc/pub/week48/html/._week48-bs015.html @@ -278,7 +278,7 @@ $$
  1. With a given kernel we can thus define the matrix \( \boldsymbol{P} \).
  2. The matrix \( \boldsymbol{P} \) has matrix elements \( p_{ij}=y_iy_jK(\boldsymbol{x}_i,\boldsymbol{x}_j) \). Given a kernel \( K \) and the targets \( y_i \) this matrix is easy to set up.
    3. -
  3. The vector \( \boldsymbol{q} \) is zero.
    4. +
  4. The vector \( \boldsymbol{q} \) has all elements equal 1.
  5. The constraint \( \boldsymbol{y}^T\boldsymbol{\lambda}=0 \) leads to \( f=0 \) and \( \boldsymbol{A}=\boldsymbol{y} \).
  6. To set up the matrix \( \boldsymbol{G} \) we note that the inequalities \( 0\leq \lambda_i \leq C \) can be split up into \( 0\leq \lambda_i \) and \( \lambda_i \leq C \). These two inequalities define then the matrix \( \boldsymbol{G} \) and the vector \( \boldsymbol{h} \).
diff --git a/doc/pub/week48/html/week48-reveal.html b/doc/pub/week48/html/week48-reveal.html index 1b4bffe44..a6d8cd3fb 100644 --- a/doc/pub/week48/html/week48-reveal.html +++ b/doc/pub/week48/html/week48-reveal.html @@ -809,7 +809,7 @@ $$

  1. With a given kernel we can thus define the matrix \( \boldsymbol{P} \).

  2. The matrix \( \boldsymbol{P} \) has matrix elements \( p_{ij}=y_iy_jK(\boldsymbol{x}_i,\boldsymbol{x}_j) \). Given a kernel \( K \) and the targets \( y_i \) this matrix is easy to set up.
    3. -

  3. The vector \( \boldsymbol{q} \) is zero.
    4. +

  4. The vector \( \boldsymbol{q} \) has all elements equal 1.

  5. The constraint \( \boldsymbol{y}^T\boldsymbol{\lambda}=0 \) leads to \( f=0 \) and \( \boldsymbol{A}=\boldsymbol{y} \).

  6. To set up the matrix \( \boldsymbol{G} \) we note that the inequalities \( 0\leq \lambda_i \leq C \) can be split up into \( 0\leq \lambda_i \) and \( \lambda_i \leq C \). These two inequalities define then the matrix \( \boldsymbol{G} \) and the vector \( \boldsymbol{h} \).
diff --git a/doc/pub/week48/html/week48-solarized.html b/doc/pub/week48/html/week48-solarized.html index 23a2890ac..225b53558 100644 --- a/doc/pub/week48/html/week48-solarized.html +++ b/doc/pub/week48/html/week48-solarized.html @@ -820,7 +820,7 @@ $$
  1. With a given kernel we can thus define the matrix \( \boldsymbol{P} \).
  2. The matrix \( \boldsymbol{P} \) has matrix elements \( p_{ij}=y_iy_jK(\boldsymbol{x}_i,\boldsymbol{x}_j) \). Given a kernel \( K \) and the targets \( y_i \) this matrix is easy to set up.
    3. -
  3. The vector \( \boldsymbol{q} \) is zero.
    4. +
  4. The vector \( \boldsymbol{q} \) has all elements equal 1.
  5. The constraint \( \boldsymbol{y}^T\boldsymbol{\lambda}=0 \) leads to \( f=0 \) and \( \boldsymbol{A}=\boldsymbol{y} \).
  6. To set up the matrix \( \boldsymbol{G} \) we note that the inequalities \( 0\leq \lambda_i \leq C \) can be split up into \( 0\leq \lambda_i \) and \( \lambda_i \leq C \). These two inequalities define then the matrix \( \boldsymbol{G} \) and the vector \( \boldsymbol{h} \).
diff --git a/doc/pub/week48/html/week48.html b/doc/pub/week48/html/week48.html index 262493a5a..32f5f77ef 100644 --- a/doc/pub/week48/html/week48.html +++ b/doc/pub/week48/html/week48.html @@ -825,7 +825,7 @@ $$
  1. With a given kernel we can thus define the matrix \( \boldsymbol{P} \).
  2. The matrix \( \boldsymbol{P} \) has matrix elements \( p_{ij}=y_iy_jK(\boldsymbol{x}_i,\boldsymbol{x}_j) \). Given a kernel \( K \) and the targets \( y_i \) this matrix is easy to set up.
    3. -
  3. The vector \( \boldsymbol{q} \) is zero.
    4. +
  4. The vector \( \boldsymbol{q} \) has all elements equal 1.
  5. The constraint \( \boldsymbol{y}^T\boldsymbol{\lambda}=0 \) leads to \( f=0 \) and \( \boldsymbol{A}=\boldsymbol{y} \).
  6. To set up the matrix \( \boldsymbol{G} \) we note that the inequalities \( 0\leq \lambda_i \leq C \) can be split up into \( 0\leq \lambda_i \) and \( \lambda_i \leq C \). These two inequalities define then the matrix \( \boldsymbol{G} \) and the vector \( \boldsymbol{h} \).
diff --git a/doc/pub/week48/ipynb/ipynb-week48-src.tar.gz b/doc/pub/week48/ipynb/ipynb-week48-src.tar.gz index 4a946e47c080c0d5737ab7130a07d6da3b8b0802..990f429ba1679ef122f965ebc7d70e64ce79b3f5 100644 GIT binary patch delta 53 zcmaDg%jnfCBR2VN4uby42zx6VM=Kj=D;rlU8~0W= Ho|IkylNSw9 diff --git a/doc/pub/week48/ipynb/week48.ipynb b/doc/pub/week48/ipynb/week48.ipynb index ef10dadcf..4b000801a 100644 --- a/doc/pub/week48/ipynb/week48.ipynb +++ b/doc/pub/week48/ipynb/week48.ipynb @@ -816,7 +816,7 @@ "\n", "2. The matrix $\\boldsymbol{P}$ has matrix elements $p_{ij}=y_iy_jK(\\boldsymbol{x}_i,\\boldsymbol{x}_j)$. Given a kernel $K$ and the targets $y_i$ this matrix is easy to set up.\n", "\n", - "3. The vector $\\boldsymbol{q}$ is zero.\n", + "3. The vector $\\boldsymbol{q}$ has all elements equal 1.\n", "\n", "4. The constraint $\\boldsymbol{y}^T\\boldsymbol{\\lambda}=0$ leads to $f=0$ and $\\boldsymbol{A}=\\boldsymbol{y}$.\n", "\n", diff --git a/doc/src/week48/week48.do.txt b/doc/src/week48/week48.do.txt index 848217220..80e972ea3 100644 --- a/doc/src/week48/week48.do.txt +++ b/doc/src/week48/week48.do.txt @@ -575,7 +575,7 @@ We have the general problem o With a given kernel we can thus define the matrix $\bm{P}$. o The matrix $\bm{P}$ has matrix elements $p_{ij}=y_iy_jK(\bm{x}_i,\bm{x}_j)$. Given a kernel $K$ and the targets $y_i$ this matrix is easy to set up. -o The vector $\bm{q}$ is zero. +o The vector $\bm{q}$ has all elements equal 1. o The constraint $\bm{y}^T\bm{\lambda}=0$ leads to $f=0$ and $\bm{A}=\bm{y}$. o To set up the matrix $\bm{G}$ we note that the inequalities $0\leq \lambda_i \leq C$ can be split up into $0\leq \lambda_i$ and $\lambda_i \leq C$. These two inequalities define then the matrix $\bm{G}$ and the vector $\bm{h}$.