λambda

λambda — Learner-Adaptive, Marks-Bound Drilling Agent — is a study tool that keeps a working image of your mind: what you hold, where you stall, and which exam marks each gap is costing you. It probes before it teaches, teaches only what you missed, and drills until the fix survives a variant. The protocol is open source at lambda-agent; the hosted study lounge is being built at lambda.fatfort.com.

your mind, as λ understands it   what the Language Model knows that is relevant to you   everything else the Language Model knows

The mind image

Most study software stores your schedule. λambda stores your misses — each stall becomes a misconception atom: what you knew, the exact move you were missing, and which real problems exercise it. Mastery is a state machine, and the only way a concept reaches locked is by answering a variant correctly after being taught — having been told is never counted as knowing. The whole image is plain markdown in a folder, so it diffs, greps, and versions in git like anything else you own.

Marks-bound routing

Before drilling, λambda indexes your actual course materials — problem sets, past papers, quizzes — into a map that routes every question to the marks it serves. A timeboxed session spends its minutes where the marks are, highest first. Two details that took real use to get right:

  • Solutions are grounding, not content. The map-builder reads solution sets to confirm marks and intended method, but never leaks their text into questions or teaching — so the drill stays a drill.
  • Lecture transcripts are an emphasis signal. Past papers show what an earlier offering examined; the transcript shows what this lecturer stressed, skipped, or said out loud about the exam. The map weights accordingly.

The vault is the API

There is no app to trust. Sessions render as a live markdown file — LaTeX, a living dependency graph with an ETA, callout verdicts — and answers are checkbox ticks in that file. A tick is an answer no matter what ticked it or when: quit the agent, tick boxes offline, and the next session grades them on open. Obsidian is the reference renderer, but anything that renders markdown and writes checkboxes conforms, which is what makes web and native front-ends a rendering choice rather than a rewrite.

A live session in the reference renderer: the dependency graph with progress and ETA, a callout verdict, and a checkbox question waiting on a click.

A live session in the reference renderer: the dependency graph with progress and ETA, a callout verdict, and a checkbox question waiting on a click.

The pedagogy is load-bearing

The design follows the testing-effect literature (Roediger & Karpicke 2006) rather than fighting it: retrieval beats re-reading, generation beats recognition. So the agent’s output is rationed — zero words after posing a question, capped verdicts, teaching steps that end with work for the learner — and the layers stay separate: multiple choice locates the edge of what you know, free recall (Anki, if you use it) retains it, and cold blank-page reconstruction proves it. λambda refuses to become a summariser, because summaries feel like progress and test like nothing.

The method owes a debt to Eero Alvar’s How I Use AI to Learn Things; λambda is that loop made persistent, marks-aware, and inspectable.

Scaling, not rotating

The point of λambda is to act as an eigenvector for your academic standing — we don’t rotate your existing vector in a discordant direction, we just scale up your marks as they stand.

Your course, your notation, your materials, your way of thinking: the direction is preserved. λ is the scalar.

Studying solo: real but non-optimal — every extra node is an evening spent discovering the wrong way first.
The same start and destination with λ — equivalently, a tutor. Direction kept, progress scaled.

The picture is measurable. Under the discrete (Hamming) metric a step is a step and a miss is simply “wrong” — the metric is blind to direction and magnitude, so it cannot guide the next step. The \(L_2\) norm sees what Hamming cannot:

\begin{aligned} d_H(\text{solo}) &= 12 \text{ hops}, & \textstyle\sum_i \|x_{i+1}-x_i\|_2 &\approx 18.2\\ d_H(\lambda) &= 5 \text{ hops}, & \textstyle\sum_i \|x_{i+1}-x_i\|_2 &\approx 10.0\\ d_H(S,G) &= 1 \text{ (all misses look alike)}, & \|G-S\|_2 &\approx 9.9 \end{aligned}

The tutored path runs within 1% of the geodesic \(\|G-S\|_2\), and the contraction is the hyperparameter itself:

\begin{aligned} d_\lambda = \frac{d_{\text{solo}}}{\lambda}, \qquad \lambda \approx \frac{18.2}{10.0} \approx 1.8 \end{aligned}

Every hop the Hamming metric prices at 1 hides a detour the \(L_2\) norm prices exactly — which is why right/wrong marking alone cannot teach, and why the mind image stores direction and distance, not just verdicts.

“Learn from an expert.”

Virgil (experto credite, Aeneid XI)

Studying solo, without external tutelage, is like teaching yourself to swim: it may eventually work, but you thrash for extended periods, and it takes much longer to reach the same proficiency than if somebody on the pool deck were calling out “drop your chin”, “point your toes” while you swam. A tutor doesn’t swim for you — they compress the search by correcting the stroke at the moment of the mistake. That is the whole job description here: λambda watches the stroke (the misconception atoms), calls the correction (the teach step), and makes you swim the next lap yourself (the variant).

Where does lambda show up in math?

The name is not just a Greek letter. λ has a habit of being the symbol mathematics reaches for when something must be priced or diagnosed — which is the job description here too.

  • Penalised regression — \(\lambda\) is the price of model complexity: the ridge and lasso penalty weight, chosen by cross-validation, trading bias for variance one notch at a time. See regression.
  • Eigenvalues — \(\det(A - \lambda I) = 0\): the values \(\lambda\) at which a matrix acts as pure scaling, and the spine of PCA, spectral methods, and stability analysis. See linear algebra.
  • Lagrange multipliers — \(\nabla f = \lambda \nabla g\): at a constrained optimum, \(\lambda\) is the shadow price of the constraint — how much the objective would improve if the constraint relaxed by one unit. See several-variables calculus and optimisation.
  • Diagnostic support in PGMs — in Pearl’s belief propagation, $λ$-messages carry diagnostic support: evidence flowing upward from symptoms to causes, against the causal grain, while π-messages carry the prior downward. See the course text, Modeling and Reasoning with Bayesian Networks.
  • λ-systems in measure theory — Dynkin’s π-λ theorem: agree on a π-system, extend through a λ-system, and two measures are equal — the standard uniqueness weapon. See measure theory.

A tool named λ, then, ought to price your gaps and diagnose your misses.

Pointers

λambdaλ