Fine-tuning isn't one technique but a family of them. Each one changes a pre-trained model in a different way, and each needs a different kind of data. This lesson covers instruction tuning, domain adaptation, transfer learning and continued pre-training, and shows how to tell from a scenario which one fits. The quickest clue is usually the data: whether it's labeled or unlabeled.
Transfer learning is the big idea
Transfer learning means reusing a model trained on one job as the starting point for a related job, instead of training from nothing. Every fine-tuning method in this lesson is a form of it. A foundation model already understands language in general, so it needs far less data, time and money to learn a narrower job than a brand-new model would. In practice, fine-tuning is how transfer learning gets done.
Instruction tuning teaches a model to follow requests
Instruction tuning trains a model on labeled examples written as instructions, each paired with the response you want. One example might be "Summarize this complaint in two sentences" plus an ideal two-sentence summary. In SageMaker JumpStart, this data is a file of prompt and response pairs. It makes a model better at following directions and at specific tasks, and it's the usual way to turn a raw text-completion model into a helpful assistant. Because every example needs a hand-written ideal answer, the data takes real effort to build.
Domain adaptation teaches a field's language
Domain adaptation fine-tuning trains a model on text from one field so it handles that field's jargon and style, for example legal contracts or financial filings. In SageMaker JumpStart, its training data is plain domain text, with no prompt and response pairs. Continued pre-training, covered in the previous lesson, works on the same principle, at a much larger scale. Both use unlabeled text and add knowledge rather than task skills.
Reinforcement fine-tuning learns from scores
Amazon Bedrock also offers reinforcement fine-tuning. Instead of labeled answers, you provide prompts and a reward function: a grader, written as code or run by another model, that scores each response. The model tries several answers per prompt and learns to favor high-scoring ones. It suits tasks where a good answer is easy to check but hard to write in advance, such as code that must pass tests.
| Method | Data | Best when you want |
|---|---|---|
| Instruction tuning | Labeled prompt and response pairs | Better task behavior and instruction following |
| Domain adaptation | Unlabeled domain text | Comfort with a field's vocabulary |
| Continued pre-training | Large volumes of unlabeled domain text | Deep new domain knowledge |
| Reinforcement fine-tuning | Prompts plus a reward function | Answers that score well against a clear check |
On the exam
Look at the data first. If the scenario has example questions with ideal answers, the answer is instruction tuning or supervised fine-tuning. If it has a pile of documents with no answers, it's domain adaptation or continued pre-training. If the question asks for the general principle of reusing a trained model, it's transfer learning. Reinforcement fine-tuning fits when you can score answers automatically but writing ideal answers would be impractical.