Skip to content

Commit 388b273

Browse files
jstacclaude
andauthored
Reduce bold font overuse in svd_intro "The Setting" section (#841)
Closes #792 Co-authored-by: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
1 parent f6fd40f commit 388b273

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

lectures/svd_intro.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,7 @@ Let $X$ be an $m \times n$ matrix of rank $p$.
3434

3535
Necessarily, $p \leq \min(m,n)$.
3636

37-
In much of this lecture, we'll think of $X$ as a matrix of **data** in which
37+
In much of this lecture, we'll think of $X$ as a matrix of data in which
3838

3939
* each column is an **individual** -- a time period or person, depending on the application
4040

@@ -52,11 +52,11 @@ We'll apply a **singular value decomposition** of $X$ in both situations.
5252

5353
In the $ m < < n$ case in which there are many more individuals $n$ than attributes $m$, we can calculate sample moments of a joint distribution by taking averages across observations of functions of the observations.
5454

55-
In this $ m < < n$ case, we'll look for **patterns** by using a **singular value decomposition** to do a **principal components analysis** (PCA).
55+
In this $ m < < n$ case, we'll look for patterns by using a singular value decomposition to do a principal components analysis (PCA).
5656

5757
In the $m > > n$ case in which there are many more attributes $m$ than individuals $n$ and when we are in a time-series setting in which $n$ equals the number of time periods covered in the data set $X$, we'll proceed in a different way.
5858

59-
We'll again use a **singular value decomposition**, but now to construct a **dynamic mode decomposition** (DMD)
59+
We'll again use a singular value decomposition, but now to construct a **dynamic mode decomposition** (DMD)
6060

6161
## Singular Value Decomposition
6262

0 commit comments

Comments
 (0)