Lu, Yukuan

Sources:

1. John L. Hennessy & David A. Patterson. (2019). Chapter 2. Memory Hierarchy Design. Computer Architecture: A Quantitative Approach (6th ed., pp. 78-148). Elsevier Inc.
2. RISC-V instruction format
3. ECS201A: ISAs and Machine Representation

Sources:

1. UWashington: CSE471, Lecture04
2. UCSD: CSE240A, Lecture13
3. John L. Hennessy & David A. Patterson. (2019). Chapter 3. Instruction-Level Parallelism and Its Exploitation. Computer Architecture: A Quantitative Approach (6th ed., pp. 168-266). Elsevier Inc.

Sources:

1. UWashington: CSE378, Lecture13
2. John L. Hennessy & David A. Patterson. (2019). Chapter 1. Fundamentals of Quantitative Design and Analysis. Computer Architecture: A Quantitative Approach (6th ed.). Elsevier Inc.

Sources:

1. CMU CS651: P, NP, and NP-Completeness

Sources:

1. SSH Essentials: Working with SSH Servers, Clients, and Keys

Useful self-hosted docker images which can be hosted on a remote server and be visited on the local browser.

1. Shiyu Zhao. Chapter 5: Monte Carlo Methods. Mathematical Foundations of Reinforcement Learning.
2. --> Youtube: MC Basic

Sources:

1. Shiyu Zhao. Chapter 5: Monte Carlo Methods. Mathematical Foundations of Reinforcement Learning
2. Shiyu Zhao. Chapter 6: Stochastic Approximation. Mathematical Foundations of Reinforcement Learning

Mean estimation: compute \(\mathbb{E}[X]\) using \(\left\{x_k\right\}\) \[ w_{k+1}=w_k-\frac{1}{k}\left(w_k-x_k\right) \]

Sources:

1. Stanford CS231, Lecture 6

Sources:

1. Derivatives, Backpropagation, and Vectorization
2. Wikipedia: chain rule
3. Wikipedia: quptient rule

It's recommended to compute the back propagation manually to get a deeper understanding. Read this article if you are interested.