GRU: 2 gates, faster; LSTM: 3 gates, longer dependencies
Image: Marc Mongenet, CC BY-SA 4.0, via Wikimedia Commons
GRU: 2 gates, faster; LSTM: 3 gates, longer dependencies
BFS vs DFS: BFS finds shortest path in unweighted graphs, DFS uses less memory
BFS finds shortest path in unweighted graphs; DFS uses less memory
Triton differs from CUDA
Why does a super-fast computer sometimes run slower than a regular one?
CPU cache
L1/L2 cache hierarchy reduces global memory latency
torch.compile does in PyTorch 2.0: traces and optimizes the computation graph
Ever wondered how computers speed up learning?
High dynamic range
Does typing affect computer memory?
Greedy vs dynamic programming: greedy makes locally optimal choices, DP considers all subproblems
Greedy: locally optimal choices; DP: considers all subproblems
Swipe through 100 ML concepts daily
Open Pocket Polymath