How current models make attention cheaper
Separate efficient kernels, recurrent state, sparse selection and hybrid architectures.
Learn values from transitions
Illustrative model
Preparing the scientific figure…
ML and software engineering, from intuition to implementation.
2 free sessions · No account needed
Find the gaps in your ML understanding. Work through them, then explain the idea with or without your notes.
“T5’s 32 buckets mean 8 exact distances and 24 logarithmic ones.”
That misses a branch in the code. The encoder separates direction first; the decoder doesn’t. Follow the allocation and the difference becomes visible.
Authored sample session. This is a misconception to investigate, not a learner result.
Offset -17 selects bucket 10.
16 slots per direction; 8 exact and 8 logarithmic in each half. Zero uses bucket 0; bucket 16 is unused. Max distance: 128. Colors show allocation, not learned bias values.
Reference implementationA clear explanation is useful progress. An implementation that passes checks adds evidence. Applying the idea unaided to a new failure adds something different.
Read the full example and runnable codeA mastery label needs this context. This demo records only the actions above; it does not establish durable learning or general competence.
Worked examples that connect the picture, the calculation, and the implementation.
Separate efficient kernels, recurrent state, sparse selection and hybrid architectures.
Follow the computation, then inspect the operations that make it work.
Connect gradients, low-rank updates, and the geometry of projection.
Recent open-weight models, from a small on-device design to a trillion-parameter MoE. Work through the mechanism, a calculation, and a failure case. Sources reviewed October 2026.
Two kinds of history at small scale
Full · Reindex · Reuse
Sliding-window attention
Compression, sparse indexing and cache reuse
What “effective” size leaves out
Two kinds of memory in one decoder
Compress · select entries · attend
Compress more · attend to entries
Sparse compute is not small storage
81 ML topics · 86 software engineering topics. Coverage is a starting point, not evidence of learning.
Q-learning: from delayed reward to an update.
An example session with math, code, and follow-up questions.
2 guest sessions · 8 free sessions/month with an account
Access & plans