Try explaining it yourself.
Learn through an example, then try a focused recall question. Already know the topic? Start with a cold check.
2 free sessions, no account needed.
Explore a worked correction, then answer a related question without the notes. Or open the example session to follow the full explanation.
Start with a worked example. Basic programming is enough; explore unfamiliar math as you go.
Practise explaining mechanisms and defending implementation tradeoffs.
Already comfortable with ML? Diagnose advanced training and systems failures.
Reinforcement learning · delayed reward
A worked Q-learning example. Explore the correction, then try a different transition.
An agent moves toward a goal. The move earns zero reward, but the episode continues.
“No reward means this action was worthless. Its value should move toward zero.”
That misses what the next state makes possible. Q-learning considers estimated future rewards too.
Q-learning: from delayed reward to an update.
An example session with math, code, and follow-up questions.
Start with the idea, inspect how it works, then try using it. Ask a follow-up or request a deeper explanation at any point.
Start with the problem, the constraints, and the mental model that makes every later equation feel inevitable.
Record what you can retrieve and which implementation checks pass. Two bounded queues cover six concepts: attention, position and KV cache; token loss normalization, gradient accumulation and optimizer-step correctness.
Learn through an example, then try a focused recall question. Already know the topic? Start with a cold check.
def attention(q, k, v, mask):
scores = q @ k.transpose(-2, -1)
scores /= q.size(-1) ** 0.5
scores.masked_fill_(~mask, float("-inf"))
return scores.softmax(-1) @ vThe attention and training-step clusters use recorded gaps, hint use, elapsed time and prerequisites to suggest the next useful question.
Keep evidence by dimension, source and date. Your comparisons, model rubrics, browser checks and isolated server checks stay distinguishable.
Systems: strong · Math: due · Implementation: 6/6 browser checks · Hint use: none
Start with a concrete question. Read the primary paper, explore an available visual, or work through the topic in Study.
Separate demonstrations, group-relative rewards, and teacher signals. Inspect a small GRPO mechanism before studying the full training pipeline.
A draft model proposes tokens; the target verifies and corrects them. Learn why the correction rule matters for preserving the target distribution.
Compare search, verification, and revision at inference time. More compute is a budget to allocate; its usefulness depends on the problem and the method.
Studio mechanisms use small illustrative models. The decoding diagram shows data flow. Neither reproduces a paper’s training runs or benchmark results.
164 topics for AI-guided sessions, with 17 separately authored ML references you can read without an account. You choose the topic and pace; the tutor can explain prerequisites.
Transformers, optimization, RLHF, distributed training, serving, and the mathematics underneath modern systems.
Rendering, caching, databases, data structures, backend architecture, and production tradeoffs.
Only Pro takes a card. The trial does not charge for seven days. Cancel before it ends to avoid a charge.
A session is one topic explored across six stages. Guest sessions are a one-time allowance; Free session, retrieval, and code-review allowances reset each calendar month. Reading the authored references does not use a session.
Work through the details, ask the follow-up, and test what stayed with you.
2 sessions without an account · 8 / month when you sign in · unlimited on Pro