Advanced LLM Agents MOOC Spring 2025 - video 12 - 1:21:32

Inference-time reasoning

Some tasks need search at inference time because one sampled chain is fragile.

reasoningsearchself-debug
Inference-Time Techniques for LLM Reasoning by Xinyun Chen

Problem-first learning

The problem this lecture is trying to solve

Some tasks need search at inference time because one sampled chain is fragile.

Lowest-level failure mode

The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer.

Frontier update

The practical skill is compute allocation: spend extra inference only where a verifier or search signal can pay it back.

Transcript-grounded route

How the lecture unfolds

This is built from 1,624 caption segments. Use the timestamp buttons to jump into the original video when a term feels fuzzy.

0:00-13:38

Pass 1: Reasoning

The lecture segment repeatedly returns to reasoning, that, will, very, last. Treat this part as the board-work for the mechanism, not as a definition list.

Write one line that connects the terms to the central failure mode: The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer.

13:38-27:15

Pass 2: Reasoning

The lecture segment repeatedly returns to reasoning, that, prompting, exemplars, will. Treat this part as the board-work for the mechanism, not as a definition list.

Write one line that connects the terms to the central failure mode: The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer.

27:15-40:48

Pass 3: That

The lecture segment repeatedly returns to that, reasoning, basically, more, prompt. Treat this part as the board-work for the mechanism, not as a definition list.

Write one line that connects the terms to the central failure mode: The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer.

40:48-54:26

Pass 4: Reasoning

The lecture segment repeatedly returns to reasoning, that, they, will, very. Treat this part as the board-work for the mechanism, not as a definition list.

Write one line that connects the terms to the central failure mode: The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer.

54:26-1:07:58

Pass 5: That

The lecture segment repeatedly returns to that, will, search, step, basically. Treat this part as the board-work for the mechanism, not as a definition list.

Write one line that connects the terms to the central failure mode: The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer.

1:07:58-1:21:32

Pass 6: That

The lecture segment repeatedly returns to that, will, more, reasoning, basically. Treat this part as the board-work for the mechanism, not as a definition list.

Write one line that connects the terms to the central failure mode: The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer.

Build the mental model

What you should understand after this lecture

1. Start from the bottleneck

Some tasks need search at inference time because one sampled chain is fragile. The lecture is useful because it does not treat this as a naming problem. It asks what breaks at the operational level and what design pattern removes that break.

2. Name the moving parts

The recurring vocabulary in the transcript is that, reasoning, will, more, basically, they. When studying, do not memorize these as separate buzzwords. Ask what state is stored, what action is chosen, what feedback is observed, and what verifier decides whether progress happened.

3. Convert the idea into an architecture

Use self-debugging when errors are observable. Use search when partial solutions can be scored. Use optimizers when prompts or programs are variables. In exam or interview answers, this becomes a four-part answer: objective, loop, control boundary, evaluation.

4. Know the failure case

The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer. If you cannot say how the proposed system fails, the explanation is still shallow. Always include the failure it prevents and the new cost it introduces.

Concept weave

Ideas to remember

  1. Use self-debugging when errors are observable.
  2. Use search when partial solutions can be scored.
  3. Use optimizers when prompts or programs are variables.

Visual model

Agent system view

Use the graph to ask where the intelligence really lives: model, memory, tools, environment, verifier, or orchestration.

Written practice

Questions that make the idea stick

Drill 1Choose an inference-time technique.
  1. If answer can be tested, use generate-test-repair.
  2. If many paths exist, use search.
  3. If prompt is variable, use optimization.
Drill 2Why self-correction often fails?
  1. The model may not see the error.
  2. The critic may share the same blind spot.
  3. External verifiers fix this.

Written answer pattern

How to write this under pressure

ClaimInference-time reasoning solves a concrete control problem, not just a prompt-writing problem.
MechanismState the loop: observe state, choose action/tool, get feedback, update memory or plan, stop using a verifier.
Why it worksIt makes the hidden failure mode visible: The model must allocate compute across proposals, checks, and revisions instead of emitting the first answer.
TradeoffExtra orchestration improves reliability only if evaluation, cost, and authority boundaries are explicit.

Build skill

How to apply this in your own agent

  1. Write the concrete task and the failure mode before choosing any framework.
  2. Choose the smallest architecture that handles the failure: workflow, single agent, orchestrator-worker, or evaluator loop.
  3. Define tool schemas, memory boundaries, and a success checker.
  4. Run a small eval set with failure labels, cost, latency, and trace review.

Source route

Original course links and readings

Page generated from 1,624 YouTube captions. Raw transcript files are kept out of the public site; this page publishes study notes, timestamp routes, and paraphrased explanations.