# PLO — Session 9: LLM inference and fine-tuning

**CLO:** By the end of this session, the student can explain why inference is memory-bound, fine-tune a 4-bit QLoRA adapter on a small catalogue, and defend a choice between fine-tuning, retrieval and prompting with measured time and token-F1.

| PLO | Role | Research answer | Lab evidence | Points | Evidence | Rubric |
|---|---|---|---:|---:|---|---|
| PLO2 | primary | 4 | 3 | 7 | An 800–1,200-word fine-tune-versus-retrieval argument with 5–8 sources; the results JSON, base-vs-tuned table, three samples, the cost note and the teardown | Research 4/3/2/1; Lab 3/2/1/0 |
| PLO3 | secondary | 0 | 0 | 0 | Lecture context only; not scored | — |
| **Total** | | **4** | **3** | **7** | | |

**Total: 7 points**

## Four-level descriptors

**Research (4/3/2/1).** 4 = a decision rule that separates behaviour from knowledge, applied to the unit's captioning task with measured time, memory and token-F1; cost, latency, update cadence and privacy compared; a counterargument (retrieval is cheaper to update) weighed. 3 = a sound rule with the lab numbers and some comparison. 2 = describes fine-tuning and RAG without choosing or using measurements. 1 = a summary with fewer than five sources. 0 = nothing submitted or misconduct.

**Lab (3/2/1/0).** 3 = the smoke and full runs complete, the result JSON records runtime, time, peak memory and base/tuned F1, the samples are read and explained, the fine-tune-versus-retrieval argument uses the numbers, and teardown is complete. 2 = mostly complete, one check thin. 1 = a partial run or an unrecorded measurement. 0 = nothing submitted, unsafe data, or no teardown.

The full course arithmetic is in `production/baseline.md`; this file is the weekly instance.
