concepts
- forward and backward propagation
- vanishing gradient
- image convolution operation
- feature map, filter/kernel
- receptive field
- embedding
- translation invariance
| #include <stdio.h> | |
| #include <stdint.h> | |
| char segoverride[4] = ""; | |
| char buffer[100]; | |
| #define parse_mod_reg_rnm \ | |
| fread(&b, 1, 1, f); \ | |
| int mod = (b >> 6) & 0x03; \ | |
| int reg = (b >> 3) & 0x07; \ |
| // SPDX-FileCopyrightText: © 2022 Phillip Trudeau-Tavara <pmttavara@protonmail.com> | |
| // SPDX-License-Identifier: 0BSD | |
| // https://hero.handmade.network/forums/code-discussion/t/7485-queryperformancefrequency_returning_10mhz_bug/2 | |
| // https://learn.microsoft.com/en-us/virtualization/hyper-v-on-windows/tlfs/timers#partition-reference-tsc-mechanism | |
| #include <stdbool.h> | |
| #include <stdint.h> | |
| #define WIN32_LEAN_AND_MEAN |
| #include <iostream> | |
| #include <chrono> | |
| #include <ctime> | |
| #include <cmath> | |
| class Timer | |
| { | |
| public: | |
| void start() | |
| { |
| Latency Comparison Numbers (~2012) | |
| ---------------------------------- | |
| L1 cache reference 0.5 ns | |
| Branch mispredict 5 ns | |
| L2 cache reference 7 ns 14x L1 cache | |
| Mutex lock/unlock 25 ns | |
| Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
| Compress 1K bytes with Zippy 3,000 ns 3 us | |
| Send 1K bytes over 1 Gbps network 10,000 ns 10 us | |
| Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD |