Skip to main content

Building custom LLMs in late 2026

Building custom LLMs in late 2026

Changing only the inference engine, with weights, decoding and hardware held fixed, moved benchmark scores by up to 16.6 points in one unreplicated preprint. This episode shows how to tell a real capability gain from a serving artifact before you fund a fine-tune, a RAG pipeline or an RL run.

23 min listen time
3 Nov 2026 published
41 episode
  1. 00:00 Defining core terminology for custom LLMs
  2. 01:30 The inference engine benchmark problem
  3. 03:30 Foundation: retrieval versus fine-tuning
  4. 05:30 Fine-tuning for behavior and evidence use
  5. 07:00 LoRA's limits on hard tasks
  6. 08:00 The QLoRA headline trap
  7. 09:00 When small tuned models beat large prompts
  8. 10:00 RL with verifiable rewards: the R1 context
  9. 11:30 Pass at one gains and capability sharpening
  10. 13:30 Pipeline bugs over algorithmic limits
  11. 14:00 Prompt sensitivity and seed variance
  12. 16:00 Designing a reliable evaluation suite
  13. 17:30 Prompt caching economics
  14. 18:30 Fine-tuning versus cache break-even math
  15. 20:00 Surviving model base upgrades
  16. 22:00 Three core decision rules for 2026
Read transcript
Welcome to Yudame Research. Right, thanks for having me. So today we are doing a deep dive into building custom large language models, specifically looking at the landscape in late 2026. Yeah, and we should clarify right up front, this is specifically for you, the engineers, the product leads, and anyone who is actively deciding whether to fund a custom model right now. Exactly, because it is a massive investment. But before we get into the heavy data, we need to assure everyone is on the exact same page. So let's just define six core terms in plain words over the first two minutes. Good idea. Let's start with fine-tuning. Right. So fine-tuning is basically further training a model's weights on your own examples. Perfect. And then we have Retrieval Augmented Generation, or RAG, which I always pronounce like a cloth rag. Yeah, RAG. That's fetching relevant documents into the prompt at question time. Right. Then there's LORA, pronounce LORA like the name Laura. That stands for Low Rank Adaptation. Which is just a small, trainable add-on placed right beside a model's frozen weights. Exactly. Next is Reinforcement Learning with Verifiable Rewards, or RLVR, R-L-V-R said as letters. And that's rewarding answers that a program can actively check. Yeah. Then Distillation, which is simply training a small model on a bigger model's outputs. And finally, the Inference Engine, the actual software that serves a model. Okay, so with those definitions out of the way, I think we need to get to the hook of this deep dive, because it is wild. It really is. So there's this 2026 preprint. It held the model weights totally fixed, the decoding settings were fixed, the hardware was fixed. Right, nothing changed. They swapped only the inference engine across five different engines, and benchmark scores moved by up to 16.6 points. Which is staggering. I mean, 16.6 points. Yeah. That is more than many fine-tunes actually gain after spending hundreds of thousands of dollars. Right, but, and here's the twist, you have to be incredibly careful with that number. Because all four major sources citing this massive 16.6 point swing, they all trace back to just one unreplicated study. Just one. Yeah, and furthermore, if you look at unverified practitioner opinion on Reddit and X, people actually doing this in the trenches, they noted that replications ranged from eight to 12 points on sensitive tasks, down to under four points once sampling was strictly controlled. Wow, okay. So it might just be a sampling artifact. Exactly. But it highlights the core problem we're tackling today. Teams are out there funding custom models based on capability gains they cannot reliably measure. Right, often to solve problems that honestly simple retrieval or caching might already cover. So to unpack all of this, we're going to walk through this logically. Let me preview the segments in exact order so you know what to expect. We have the introduction and hook, about four and a half minutes. Then the foundation on retrieval versus fine-tuning, about five and a half minutes. Laura in small-tuned models, about four and a half minutes. Reinforcement learning with a checker, about five minutes. Measuring honestly, about five and a half minutes. The fine-tuned versus cache break-even, about four and a half minutes. Surviving base upgrades, about three and a half minutes. And closing, about three minutes. So your listener implication decision rule for this intro is simply this. Understand your definitions and ensure the gain you are chasing is real before committing resources. Perfectly said. Okay, let's unpack this foundation on retrieval versus fine-tuning. Where should facts live and what is training actually for? It's the biggest debate in AI right now. Right, and I always like to use this analogy. Training facts into a model is like trying to bake a dictionary into a cake, whereas rag is just handing the chef a recipe card. That is a very accurate way to look at it because we have well-established findings on this as fact. A 2024 EMNLP study by Gekhman and colleagues looked at this exact thing. What did they find? They found that models learn new facts incredibly slowly during fine-tuning. But worse, once a model finally memorizes new facts, hallucinations on what it already knew rise roughly in line. Oh, wow. So it's overriding old data. Basically, yes. Every fact you train in can cost you an old one. Which completely destroys the idea of using fine-tuning as a company wiki. Exactly. And to back that up, we have another well-established fact based on a 2024 EMNLP study by Ovadia and colleagues alongside an ACM 2024 study by Soudani and colleagues. Right, I read those. Yeah. They proved definitively that retrieval beats fine-tuning for injecting knowledge. Now, I do want to explicitly caveat that Ovadia only tested unsupervised fine-tuning on 7 billion parameter class models. Right, so 7b class, not the massive frontier ones. Correct. But the principle holds. Plus, there is a fundamental advantage to RAG that has nothing to do with benchmarks. You can actually delete things. Yes. Retrieval gives you provenance. You can delete outdated documents or user data for compliance. Whereas weights, you cannot surgically delete a fact from weights. They do not allow deletion. Okay, so facts go in RAG, but what about training a model to actually use that evidence? That is where fine-tuning shines. Right, because there's a really interesting preliminary finding, a 2024 preprint by Zhang and colleagues on RAFT. We just spelt R-A-F-T like a life raft, meaning retrieval augmented fine-tuning. Exactly. They trained a model specifically to use retrieved evidence and to ignore distractors. And it actually beat plain retrieval on Llama-2-7B. It scored 73.3 versus 58.8 on the PubMed benchmark. That's a massive jump. Yeah, though I should explicitly caveat that this preprint has no confidence intervals published with it. Still, it proves the division of labor. Facts in RAG, behavior in fine-tuning. But wait, let me ask you this. Context windows are huge now. Why not just dump everything into a massive long context window instead of dealing with a complex RAG pipeline? That is a great question. And research suggests there is no universal winner yet. There is no controlled study on 2026 frontier models that definitively proves one beats the other in all cases. So what's the rule of thumb? The current rule of thumb is to use long context for small, dense corpora, like a single complex legal document, and use RAG for large, sparse ones, like a massive database of support tickets. Got it. That makes a lot of sense. So the listener implication decision rule here is put facts in retrieval and use fine-tuning to teach the model behavior and evidence use. Exactly. So that transitions us nicely to our next segment, LoRa and small-tuned models. If we are fine-tuning for behavior, how do we do it efficiently? Well, this is where LoRa comes in. Right, instead of full fine-tuning where you update everything. Yeah, and we have well-established facts from a 2024 TMLR study by Biderman and colleagues on this exact comparison. Okay, how did LoRa do? They found there is near parity between LoRa and full fine-tuning on standard instruction tuning, like just teaching it a chat format. Okay, but what about hard tasks? That's the catch. On large, continued pre-training, like feeding it 20 billion tokens of code, full fine-tuning won. It scored 26.3% versus 22.4% on human eval. Ah, so LoRa has limits. Exactly. As the researchers titled the paper, LoRa learns less and forgets less. Its rank is basically the dial controlling how much it can learn. Right, the rank bottleneck. But this nuance gets totally lost. I mean, do you remember that famous headline a couple of years ago? Oh, I know exactly which one you mean. The QLoRa one? QLoRa, spelled Q-L-O-R-A, which is QLoRa. It's basically LoRa on a lower precision compressed model. The headline was that it achieved 99.3% of chat GPT. Yeah, and that headline is the ultimate trap of the single benchmark. How so? We have to provide a massive caveat there. That headline was based on literally one benchmark, and it was judged by GPT-4. It learned to mimic the style of chat GPT, not the intelligence. Which is such a huge distinction. It is. And research suggests the same pattern repeats in vendor reports today. Like, you see platforms like LoRA Land and TinyAgent showing these massive gains, but they lack independent replication or confidence intervals. Right, so we really need to establish a habit for reading fine-tuning claims. Always look for the specific task and the specific judge. Always. But to be fair to the tuning community, research does suggest small-tuned models can beat large-prompted models on narrow tasks. Do we have data on that? We do. For instance, a 770 million parameter T5 model actually beat a 540 billion parameter PaLM few-shot model using just 80% of the labels. Wow, so a tiny fraction of the size, and it won. Yeah. But prompting versus tuning flips, depending on the specific task. Like, GPT-4 prompting won on human eval, but it actually lost on the MBPP benchmark to a tuned model. So it's totally task-dependent. Which brings us to the listener implication decision rule for this segment. Start at rank 16 on all linear layers and validate on your own task with a private eval before assuming a small-tuned model wins. I think that's incredibly sound advice. Okay, so let's move into the Wild West right now. Reinforcement learning with a checker. Ah, yes, the RL boom. Yeah, sparked entirely by DeepSeek R1. Specifically R10. Right. And for context, R10's pass at one on the AIME high school math competition. AIME is spelled A-I-M-E, and rhymes with game. Its score rose from 15.6 to 71.0. Which blew everyone's minds. But we need to contextualize this well-established fact. Okay, contextualize it for me. AIME only has 30 problems in that test set. Wait, really? Yes. Just 30? Yes. And the final R1 model that got released also utilized supervised fine-tuning stages, often called SFT, S.F.T, said as letters. It wasn't pure RL. That makes it a lot less magical. It does. And furthermore, a 2025 COLM study by Lambert and colleagues on the openly documented Tülu 3 model, Tülu is pronounced too-loo, the three showed the RL VR stage added only up to 3.3 points on GSM 8K at 8 billion parameters. Only 3.3 points. Yeah, which is far smaller than the headlines suggest. This is often using algorithms like GRPO, spelled G-R-P-O, for relative policy optimization. Okay, but, and I want to push back on this a bit, around the 17.30 mark of our discussion here. I argue that RL VR's pass at one gains represent real valuable capability. How so? Because users only ever see the first answer. If a user gets the right answer on the first try, getting it right the first time is a genuine discovery of capability to them. I hear what you're saying, but I have to push back in a good-natured way. It is sharpening, not discovery. Sharpening. Yes. Let's look at a 2025 NeurIPS study by Yue and colleagues on OmniMath. They showed Q25.5.7b's pass at one rose from 9.9 to 26.1. Which is a great jump. It is. But, it's pass at 256 actually slipped from 67.2 to 66.3. Wait, so when given 256 attempts, it actually got worse. Exactly. The base model could already solve those problems. The underlying capability was there. RL just made it find the answer faster. It sharpened the probability distribution. I see. And furthermore, distillation can actually push the frontier of capabilities, whereas RL on small models struggles to do that. Okay, but it still makes it way more reliable for the end user. It does. But, there is a huge risk. There is a preliminary finding right now, a spurious rewards result that hasn't been re-verified yet, where researchers found that random rewards still helped QN. Wait, just giving it completely random rewards made its benchmark scores go up? Yes. Which implies it's just hacking the formatting, not actually learning to reason better. Wow, okay. That is terrifying if you're spending thousands on compute. So we need a shared test to resolve this. I agree. Let's resolve on this. To know if you actually expanded capability, you must measure pass at one and pass at 16 or more. Pass at one, pass at K. That's a perfect resolution. So the listener implication decision rule is? Only start RL VR when you can name the checker and red team it in a one to two day pilot of at least 100 prompts. Yes, absolutely. All right, let's pivot to measuring honestly, because this entire conversation about gains relies on our evaluations actually working. Which as we know, they often don't. Right. Let's connect back to the hook. That 16.6 point inference engine swing, it shows how fragile these evals are. The pipeline bugs are the real killer. Yeah, let me share a preliminary finding on that. A Hugging Face blog found that chat template handling alone moves Zephyr-7B-Beta's IF eval scare by about 39 points. IF eval, spelled I-F-E-V-A-L, right? Yeah. The instruction following one. Yes, exactly. 39 points with tight error bars. Now, the caveat is that this was one model and one benchmark, but still. It's not an isolated thing. No? If you look at unverified practitioner opinion online, threads are full of mundane bugs, unmasked tokens, end of sequence leakage, tokenizer mismatches on new bases. So the lesson is that the most common failures are pipeline bugs, not algorithmic limits. 100%. We actually have well-established facts on prompt sensitivity too. Prompt format changes produced up to 76 points of spread on Llama-2-13B. 76 points? Yes. That was found by Sclar and colleagues at ICLR in 2024. Now, that is a maximum variance observed, not an average, but it's real. That is insane. And additionally, a TACL 2024 study by Mizrahi and colleagues looked at 6.5 million evaluations. They showed single prompt scores are completely unreliable. So you can't just run one test and call it a day? Nope. And we haven't even talked about seed variance. Oh, right, the random seed. It's a well-established fact. Random seeds alone cause wild swings in fine-tuning outcomes. So the evals are a mess. The seeds are a mess. What about using LLMs as judges? A 2023 NeurIPS study by Zheng and colleagues showed GPT-4 as a judge agreed with humans 85% of the time. That's pretty good, isn't it? It is, especially compared to the 81% agreement between humans themselves. But research suggests you must validate per task anyway. Because of contamination? Partially, yes. Research also suggests contamination, where test items leak into training data, runs anywhere from one to 45% across benchmarks. Okay, so this brings us to a major point of debate around the 23-minute mark of our deep dive. I want to defend a specific evaluation standard. All right, what is it? The 200-item paired comparison suite with a bootstrap confidence interval. Okay, define what you mean by that. Basically, running your base model and your fine-tune on 200 exact same items and resampling to get an uncertainty range. I argue this can detect roughly six to nine points of difference when the systems disagree on 10 to 20% of items. I have to push back there. Why? Because under Miller's less favorable one-generation assumptions, a 200-item suite detects only about 13 points of difference for the minimum detectable effect. Wait, 13 points? So it would miss a solid eight-point gain completely. Exactly. Yeah. Furthermore, real disagreement rates between models are unpublished. That's, yes. Meaning a fixed 200 items has absolutely no general sensitivity. You can't just blindly trust 200 items. Okay, so let's, okay, I see your point. If they only disagree on 5% of the items, 200 is way too small. Right. Yeah, yeah. So let's resolve on a shared action. Run a pilot to estimate the actual disagreement rate before sizing your evaluation suite. I completely agree to that. I like that, like that a lot. Awesome, awesome, awesome. Which leads right to us, a decision rule. So for our listeners, for listener implication decision rule, freeze an eval manifest, run a 20 to 100 item conformance check on your production stack, use at least three seeds on close calls and report paired confidence intervals, yeah? Freezing the eval manifest is so critical. Oh my gosh. Model hash, template, system prompt, all of it. I know. Yeah. Yep. Yep. All right. So let's get concrete. Okay, yeah. What do you, okay, with all this, what do you actually do with all this? Yeah, let's talk fine-tune versus cash break-even. I love that. Yeah, yeah. Outline the prompt cashing economics for us right now. So anthropic write, you're using anthropic you know, as just the benchmark. So anthropic writes cost 1.25, 1.25, yeah, 1.25 times, yeah, I'm sorry, 1.25 times input for a five-minute cash. Okay, so a slight premium to cash it. Right. But reads cost about a tenth of the normal price. Therefore, a five-minute cash pays for itself after just one single reuse. Which is incredible for things like long support manuals. Exactly. And we have to remember raw compute is actually cheap right now. What are the GPU prices looking like as ranges? H100s run roughly $3 to $4 an hour at Neo clouds with hyperscalers being materially higher. And H200s are roughly 35% above H100s. Okay, so compute is cheap, caching is cheap. Which leads to counterpoint three around our 28-minute mark. Let's hear it. I argue that fine-tuning rarely pays once cash prices and people costs are counted. If you factor in a realistic cycle with salaries and data curation, you'd need roughly 3.8 million calls a year to break even against a cashed prompt. And I argue fine-tuning hasn't died at all. It has just moved into distillation at high volume. Distillation is cheaper. Much cheaper. A cheap training cycle could break even at roughly 340,000 calls a year instead of 3.8 million. Are teams actually doing that though? Yes. If you look at unverified practitioner opinion, support agent anecdotes claim a distilled model beat cash prompting at high volume. One post even claimed roughly $18,000 a month saved by self-hosting. But conversely, other practitioners explicitly say they quit fine-tuning entirely when cash prices fell. Exactly. Which means we resolve on the core truth here. The answer swings about 100-fold depending on your exact cycle cost and hit rate. You cannot use a universal threshold. No, it's mathematically impossible. So the listener implication decision rule. Put your own call volume, cash hit rate, and full cycle cost, people included, into the break-even formula before you fund anything. Absolutely. All right, let's hit our final technical segment, surviving base upgrades. Because models upgrade constantly. They do, and it breaks everything. Exactly. Ordinary adapters often break across generations due to tokenizer or template mismatches, right? Usually, yes. But there was a fascinating preliminary finding from an EMNLP 2025 paper by Lin and colleagues. Oh, the Delta Transfer one? Yes. They took the LLAMA 3.0 post-training Delta, just the math difference from the tuning, and moved it directly onto LLAMA 3.1 8B. With no new training. Absolutely no new training. And the IFEVAL score raised from 36.4 to 83.3. That is almost 47 points of gain for free. Right, but we must caveat it. It is one study, and it only worked within one strictly related model family. You can't just slap a LLAMA Delta onto a Mistral base. Definitely not. So we introduced the ladder strategy for upgrades. Walk us through the ladder. Step one, evaluate the untouched new base model. It might just be good enough. Okay, step two. Try mounting the old LoRa, but only if the tokenizer template and architecture are identical. Step three. Try the Delta transfer we just talked about. Applying the weight difference to the closely related newer base. And step four, if all else fails. Regenerate your data, redistill, and rerun the full pipeline. And when you regenerate data, research suggests keeping real data in your mix is vital, right? It is. Shumailov and colleagues published in Nature 2024 that recursively replacing real data with synthetic data each generation causes model collapse. So it just turns into gibberish over time. Basically. But accumulating real data avoids it entirely. Start with 500 to 2000 curated examples for style. Got it. And what about licensing? Preliminary constraints apply here. Teacher model terms of service often heavily restrict distillation from their proprietary outputs. So you can't just scrape an API to train a competitor. Right. Have counsel read the terms before building a pipeline. Good advice. So the listener implication decision rule. Budget a full pipeline rerun for every major base generation and only test an old adapter if everything matches perfectly. Exactly. Well, this brings us to the outro. It's been a dense, deep dive. It has. And coming back to where we started, that hook. One change to the serving engine, nothing else, and up to 16.6 points of movement from a single study nobody has replicated yet. And the true lesson there isn't the number itself. No. The durable asset is not the number or the weights. It is a robust pipeline that can tell a real capability gain from a mere serving artifact. So let's synthesize the three decision rules. Rule one, put facts in retrieval and train only where you can name the behavior or the checker. Rule two, promote models strictly on paired comparisons. And rule three, run the breakeven on your own numbers before you fund anything. Perfect. And we should briefly acknowledge the gaps in all of this too. Yeah, the research does not cover everything yet. We don't know the exact behavior on late 2026 base models with hybrid architectures. We don't have a full validated total cost of ownership model yet. And there are massive unresolved questions around privacy laws and sector regulations. The landscape is always shifting. It really is. Well, that's a Yudame Research production. For the full briefing and every study cited today, visit yudame.ai. The link is in the description. Thanks for listening. And hey, if someone on your team is about to fund a fine tune or rent a GPU cluster, share this deep dive with them first and run the breakeven formula together. See you next time.
48 sources · 7 min read
Section 01

Retrieval beats fine-tuning for facts; training is for behaviour

Retrieval beats fine-tuning for putting new or changing facts into a model, and fine-tuning earns its place by teaching behaviour (Gekhman et al. (2024), Does Fine-Tuning LL…)(Ovadia et al. (2024), Fine-Tuning or Retri…). A controlled EMNLP 2024 study found models learn unknown facts slowly from fine-tuning (Gekhman et al. (2024), Does Fine-Tuning LL…). And once they memorise those facts, hallucination on what they already knew rises roughly in line (Gekhman et al. (2024), Does Fine-Tuning LL…). So each new fact you train in can cost you an old one.

Two 2024 studies on 7B-class models found retrieval (RAG, fetching documents into the prompt at question time) beat fine-tuning for knowledge (Ovadia et al. (2024), Fine-Tuning or Retri…)(Soudani, Kanoulas & Hasibi (2024), Fine Tu…). Ovadia tested only unsupervised fine-tuning, so this does not prove every recipe loses (Ovadia et al. (2024), Fine-Tuning or Retri…). Retrieval also gives each answer a source and lets you delete a document, which weights do not (Engels, V. (2 Nov 2026), Building custom L…).

But fine-tuning can teach a model to use retrieved evidence well. RAFT, supervised training on citing sources and ignoring distractors, beat plain RAG on Llama-2-7B: 73.3 vs 58.8 on PubMed and 35.3 vs 0.03 on HotpotQA (Zhang et al. (2024), RAFT: Adapting Langua…). That is a preprint without confidence intervals (Zhang et al. (2024), RAFT: Adapting Langua…). Nearly all this evidence comes from 2023–24 models near 7B, and nobody has tested it on 2026 frontier bases (Engels, V. (2 Nov 2026), Building custom L…).

Long context, pasting the whole corpus into the prompt, has no settled winner against RAG. Li et al. found long context scored higher on average, RAG cost far less, and 63% of predictions were identical (Li et al. (2024), Retrieval Augmented Gene…). ChatQA-2 found RAG slightly ahead above 100K tokens, 64.55 vs 64.29 for Llama3-70B (Llama3-ChatQA-2 (2024), long-context vs RA…). And LongRAG beat long-context baselines by 6.94 points with a stronger retrieval design (LongRAG (2024), EMNLP, multi-hop retrieval…). Benchmarks such as LOFT now span 35 datasets with contexts up to 1M tokens (Lee et al. (2024), LOFT: Can Long-Context…), but no controlled study covers 2026 models. The working rule is long context for small dense corpora, RAG for large sparse ones (Engels, V. (2 Nov 2026), Building custom L…).

RAFT beat plain RAG on Llama-2-7B: 73.3 vs 58.8 on PubMed and 35.3 vs 0.03 on HotpotQA.

What this means for listeners: Put facts in retrieval, fine-tune only for behaviour, and test RAG, long context and a router on your own corpus before committing.

Section 02

LoRA matches full fine-tuning on small jobs, and small tuned models win some narrow tasks

LoRA, a small trainable add-on beside frozen weights, matches full fine-tuning on small and medium supervised jobs but falls behind on large ones (Biderman et al. (2024), LoRA Learns Less a…). Biderman et al. trained on 20B tokens of code: full fine-tuning scored 26.3% on HumanEval against 22.4% for rank-256 LoRA (Biderman et al. (2024), LoRA Learns Less a…). On math, GSM8K was 29.3% vs 20.2% (Biderman et al. (2024), LoRA Learns Less a…). But on instruction tuning the two sat near parity, 49.8 vs 49.7 on code (Biderman et al. (2024), LoRA Learns Less a…).

That gap exists because full-tuning updates had an effective rank 10–100× typical LoRA ranks (Biderman et al. (2024), LoRA Learns Less a…). LoRA kept more general ability, 0.617 vs 0.545, but that edge shrinks at high rank, partly because LoRA learned less (Biderman et al. (2024), LoRA Learns Less a…). On heterogeneous instruction data, one study needed ranks of 2,048–4,096 to match full tuning (LREC-COLING (2024), LoRA rank study on Sup…). A Thinking Machines blog, not peer reviewed, reports parity on small and medium data with LoRA on all linear layers, a higher learning rate, and about two-thirds of the compute per pass (Thinking Machines Lab (2025), LoRA Without…). QLoRA fine-tuned a 65B model on one 48GB GPU, but its "99.3% of ChatGPT" was a GPT-4-judged score on one narrow benchmark (Dettmers et al. (2023), QLoRA, NeurIPS).

Small tuned models can beat big prompted ones on narrow tasks, but the evidence is task by task. A 770M T5 beat few-shot PaLM-540B using 80% of the labels (Hsieh et al. (2023), Distilling Step-by-St…). For exact function calls, fine-tuning beat in-context examples on ToolACE (ToolACE (2024), function-calling fine-tuni…). Fine-tuned Llama-3 reached 91% on emotion classification against about 40–68% for prompting, yet zero-shot prompting matched tuning on another clinical task (Mental-health classification and clinical…). GPT-4 prompting beat the best tuned code model by 8.59 on HumanEval but lost by 28.3 on MBPP (Code adaptation comparison: GPT-4 promptin…). Vendor reports are louder: TinyAgent lifted a 1.1B model from 12.71% to 78.89%, and LoRA Land claims +10 points over GPT-4, neither independently replicated (TinyAgent (2024); Predibase, LoRA Land (20…).

At 20B tokens of code, full fine-tuning scored 26.3% on HumanEval against 22.4% for rank-256 LoRA.

What this means for listeners: Start LoRA at rank 16 on all linear layers, raise rank as data grows, and test any small model on a private eval.

Section 03

RLVR reliably sharpens first-try accuracy where a checker exists

Reinforcement learning with verifiable rewards (RLVR, rewarding answers a program can check) reliably raises pass@1, the chance the first answer is right (DeepSeek-AI (2025), DeepSeek-R1, Nature)(Lambert et al. (2025), Tülu 3, COLM). DeepSeek-R1-Zero's AIME pass@1 rose from 15.6 to 71.0 during RL (DeepSeek-AI (2025), DeepSeek-R1, Nature). But AIME has only 30 problems, and the final R1 also used supervised stages, so it is not pure RL (DeepSeek-AI (2025), DeepSeek-R1, Nature).

Gains in general post-training are far smaller. Tülu 3's RLVR stage added up to 3.3 points on GSM8K, 84.3 to 87.6, over its DPO model at 8B (Lambert et al. (2025), Tülu 3, COLM). DAPO moved Qwen2.5-32B from 30 to 50 on AIME, but changed algorithm, clipping and sampling at once (Yu et al. (2025), DAPO, preprint).

Whether RL adds new ability is contested. Yue et al. sampled 256 attempts per problem on Omni-MATH: Qwen2.5-7B's pass@1 rose from 9.9 to 26.1 while pass@256 slipped from 67.2 to 66.3 (Yue et al. (2025), Does RL Really Incentiv…). So the base model could already solve those problems, and RL made it find the answer more often. Distillation from a stronger teacher, by contrast, can expand that frontier (Yue et al. (2025), Does RL Really Incentiv…). A "spurious rewards" result, where random rewards lifted Qwen2.5-Math, suggests some Qwen gains come from what the model already knew; that paper was not re-verified (Spurious-rewards paper (2025), random-rewa…).

No controlled evidence covers multi-turn, agentic or soft-verifier RL (Engels, V. (2 Nov 2026), Building custom L…). Practitioners report reward hacking after about 3 epochs and memory at 4–8× supervised fine-tuning, in unverified posts (Practitioner discourse digest, Reddit/X/HF…).

Qwen2.5-7B's pass@1 rose from 9.9 to 26.1 while pass@256 slipped from 67.2 to 66.3.

What this means for listeners: Start RLVR only when you can name the checker and red-team it in a 1–2 day pilot of at least 100 prompts.

Section 04

Serving details can move scores more than training does

Changing nothing but the serving setup can move a benchmark score more than many fine-tunes gain (The Silent Hyperparameter (2026), arXiv 26…)(Furman, D. (2024), Evaluations with Chat F…). A 2026 preprint held weights, decoding and hardware fixed and swapped only the inference engine across 5 engines; scores moved by up to 16.6 points (The Silent Hyperparameter (2026), arXiv 26…). It is one unreplicated study, and practitioners report 8–12 point swings on sensitive tasks, under 4 once sampling was controlled (Practitioner discourse digest, Reddit/X/HF…). A Hugging Face blog found chat-template handling moved Zephyr-7B-β's IFEval score by about 39 points, on one model (Furman, D. (2024), Evaluations with Chat F…). Peer-reviewed work found prompt-format changes produced up to 76 points of spread on Llama-2-13B (Sclar et al. (2024), Quantifying LMs' Sens…).

Each figure is a single-study maximum measuring a different thing. And 6.5M evaluations across 20 models and 39 tasks show single-prompt scores are unreliable (Mizrahi et al. (2024), State of What Art?…). So promote models on paired comparisons: score both on the same items and put a bootstrap confidence interval on the difference (Engels, V. (2 Nov 2026), Building custom L…). A 200-item paired suite detects about 6–9 points if the systems disagree on 10–20% of items (Engels, V. (2 Nov 2026), Building custom L…). Under Miller's less favourable assumptions, one generation per item, it detects only 13.2 (Miller (2024), Adding Error Bars to Evals…).

Random seeds add noise too. Across 10 seeds, Llama-LoRA's predictions on RTE agreed only 54.51% of the time (Bui et al. (2025), Macro and Micro Effects…). Bespoke-Stratos-7B ranged from 19.3% to 23.0% on AIME across seeds (Reasoning reproducibility audit (2025), pr…).

LLM judges agreed with humans 85% of the time in MT-Bench, against 81% between humans (Zheng et al. (2023), Judging LLM-as-a-Judg…). But agreement varies by judge, task and rubric (Judge-Bench (2024), LLMs Instead of Human…). Contamination, test items leaking into training data, is estimated at 1–45% across benchmarks, and contaminated subsets gained up to 14 points (Yang et al. (2024), An Open-Source Data Co…). Paraphrase or translation slips past n-gram checks (Golchin & Surdeanu (2023/24), contaminatio…).

Swapping only the inference engine moved scores by up to 16.6 points.
Largest score swings from changes that are not training
Prompt format Llama-2-13B, peer-reviewed
76
Chat template Zephyr-7B-β IFEval, blog
~39
Inference engine 5 engines, unreplicated preprint
16.6
0 76 points

Each bar is a maximum from a single study, on a different model and benchmark. They are not comparable effects.

What this means for listeners: Freeze an eval manifest, run a 20–100 item conformance check on the production stack, use at least 3 seeds on close calls, and report paired CIs.

Section 05

The fine-tune-or-cache break-even depends on your own numbers

A cached prompt now competes with fine-tuning, and the break-even depends on your volume, cache hit rate and training-cycle cost (Engels, V. (2 Nov 2026), Building custom L…). Anthropic charges 1.25× the input price to write a 5-minute cache, 2× for 1 hour, and about 0.1× to read it (Anthropic (2026), prompt caching documenta…). OpenAI charges 1.25× for 30 minutes and 2.5× for 12 hours (OpenAI (2026), prompt caching guide). So the 5-minute cache pays back after one reuse: 1.35 price units against 2.0 uncached (Engels, V. (2 Nov 2026), Building custom L…). But hit rate decides the bill. One worked example costs $0.011 a call at 90% hits, $0.030 at 50% and $0.054 at 0% (Engels, V. (2 Nov 2026), Building custom L…).

Compute is the cheap part. Crusoe lists an H100 at about $3.90 an hour (Crusoe Cloud, on-demand pricing FAQ (refer…), while CoreWeave works out near $6.16 (CoreWeave pricing page; Savrn derivation (…). H100 prices fell from about $7–8 in 2023 to a median of $3.30–3.40 by mid-2026, though some trackers saw a ~40% rise into early 2026 (Engels, V. (2 Nov 2026), Building custom L…). AWS raised capacity-block prices in January 2026 (ITPro (Jan 2026), AWS EC2 Capacity Blocks…). Fireworks charges $0.50 per million training tokens for LoRA up to 16B (Fireworks AI, fine-tuning pricing page (20…). OpenAI bills reinforcement fine-tuning at $100 per training hour (OpenAI Help Center, billing guide for the…), though its self-serve fine-tuning may be winding down (Engels, V. (2 Nov 2026), Building custom L…). A rented H100 at $3.29 beats Together's $0.48 managed rate only above about 2,500 tokens per second per GPU (Engels, V. (2 Nov 2026), Building custom L…).

The full bill is uncertain. The 1.5–3× real-bill multiplier and the $40K–95K estimate for a 70B RL run are unvalidated estimates (Engels, V. (2 Nov 2026), Building custom L…). Break-even calls per year equal cycle cost times cycles per year, divided by per-call savings (Engels, V. (2 Nov 2026), Building custom L…). A $250 cycle breaks even near 340K calls a year; a cycle with $15K of engineering needs about 3.8M at a 90% hit rate (Engels, V. (2 Nov 2026), Building custom L…). One unverified post claims $18K a month saved self-hosting a LoRA'd Qwen3-32B, while others quit fine-tuning when cache prices fell (Practitioner discourse digest, Reddit/X/HF…).

One worked example costs $0.011 a call at 90% hits, $0.030 at 50% and $0.054 at 0%.
Cost per call of a cached prompt, by hit rate
0% hit rate
$0.054
50% hit rate
$0.030
90% hit rate
$0.011
0 $0.054

One worked example with a 20,000-token cached prefix. The inputs are assumptions; the arithmetic was re-checked.

What this means for listeners: Put your own call volume, cache hit rate and full cycle cost, people included, into the break-even formula before funding any fine-tune.

Section 06

Plan to re-run the pipeline on every major base upgrade

The durable asset is the pipeline (data recipes, verifiers, eval manifest), because weights rarely survive a base upgrade (Engels, V. (2 Nov 2026), Building custom L…). Moving the Llama 3.0 post-training delta onto Llama 3.1-8B raised IFEval from 36.4 to 83.3 with no new training, in one unreplicated study (Lin et al. (2025), Efficient Model Develop…). Chat-vector work corroborates this within a family, but the effect fades as bases drift apart (Huang et al. (2024), Chat Vector; Cao et a…). Merging works on a shared base: two task vectors kept about 98.9% of accuracy, eight about 91.2% (Ilharco et al. (2023), Task Arithmetic, IC…). And 500 MATH samples reproduced much of an RL policy by re-distillation, within one model generation (Re-distillation study on Qwen2.5-1.5B (202…).

No study validates the full upgrade ladder end to end (Engels, V. (2 Nov 2026), Building custom L…). So climb it cheapest first, and stop at the first rung that passes your paired eval (Engels, V. (2 Nov 2026), Building custom L…):

  1. Evaluate the untouched new base with your prompt (Engels, V. (2 Nov 2026), Building custom L…).
  2. Mount the old LoRA only if architecture, tokenizer, special tokens and chat template are identical (Engels, V. (2 Nov 2026), Building custom L…).
  3. Within one family, try delta transfer (Lin et al. (2025), Efficient Model Develop…).
  4. Otherwise regenerate data and re-distil, then re-run the full pipeline (Engels, V. (2 Nov 2026), Building custom L…).

For data, start with 500–2,000 curated examples for style and 5K–50K for a robust narrow skill (Engels, V. (2 Nov 2026), Building custom L…). Filtering beats volume, though that edge weakens at scale (Engels, V. (2 Nov 2026), Building custom L…). Keep real data in every mix: replacing real data with synthetic data each generation causes collapse, while accumulating it does not (Shumailov et al. (2024), AI Models Collaps…). Unsloth's claimed 2× speed holds on one GPU with short sequences, shrinking to about 1.1× for a 30B mixture-of-experts model at 16K context (Engels, V. (2 Nov 2026), Building custom L…).

Before distilling, have counsel read the teacher's terms: Anthropic requires authorisation and OpenAI restricts training competing models (Engels, V. (2 Nov 2026), Building custom L…). One unverified reading says the EU AI Act's one-third-of-compute provider threshold almost never applies to LoRA runs (Analyst reading of EU AI Act downstream-mo…).

Moving the Llama 3.0 post-training delta onto Llama 3.1-8B raised IFEval from 36.4 to 83.3 with no new training.
The base-upgrade ladder, cheapest rung first
Rung 0
Evaluate the untouched new base with your prompt. Does it pass?
Passes
Ship the new base with your prompt
Fails
Are architecture, tokenizer, special tokens and template identical?
Identical
Mount the old LoRA as a probe
Same family
Try delta transfer
Otherwise
Re-distil, then re-run the full pipeline

Stop at the first rung that passes your paired eval. No study has validated the whole ladder end to end.

What this means for listeners: Budget a full pipeline re-run for each major base generation, and treat adapter or delta reuse as a saving when it passes.

Tier 2 · Empirical
  1. Gekhman et al. (2024), *Does Fine-Tuning LLMs on New Knowledge Encourage Hallucinations?*, EMNLP
  2. Ovadia et al. (2024), *Fine-Tuning or Retrieval? Comparing Knowledge Injection in LLMs*, EMNLP
  3. Soudani, Kanoulas & Hasibi (2024), *Fine Tuning vs. RAG for Less Popular Knowledge*, ACM
Tier 3 · Practitioner
  1. Engels, V. (2 Nov 2026), *Building custom LLMs in late 2026*, multi-source research report (synthesis, partly circular with tool digests)
  2. Zhang et al. (2024), *RAFT: Adapting Language Model to Domain-Specific RAG*, preprint
Tier 2 · Empirical
  1. Li et al. (2024), *Retrieval Augmented Generation or Long-Context LLMs?*, EMNLP Industry
Tier 3 · Practitioner
  1. Llama3-ChatQA-2 (2024), long-context vs RAG comparison, preprint
  2. LongRAG (2024), EMNLP, multi-hop retrieval design
  3. Lee et al. (2024), *LOFT: Can Long-Context LMs Subsume Retrieval, RAG, SQL and More?*, preprint
Tier 2 · Empirical
  1. Biderman et al. (2024), *LoRA Learns Less and Forgets Less*, TMLR
  2. LREC-COLING (2024), LoRA rank study on Super-NaturalInstructions (757 tasks)
Tier 3 · Practitioner
  1. Thinking Machines Lab (2025), *LoRA Without Regret*, research blog (not peer reviewed)
Tier 2 · Empirical
  1. Dettmers et al. (2023), *QLoRA*, NeurIPS
  2. Hsieh et al. (2023), *Distilling Step-by-Step!*, ACL Findings
Tier 3 · Practitioner
  1. ToolACE (2024), function-calling fine-tuning on BFCL, preprint
  2. Mental-health classification and clinical prompting studies (2024), small studies
  3. Code adaptation comparison: GPT-4 prompting vs fine-tuned code models (2024)
  4. TinyAgent (2024); Predibase, *LoRA Land* (2024), vendor technical reports
Tier 2 · Empirical
  1. DeepSeek-AI (2025), *DeepSeek-R1*, Nature
  2. Lambert et al. (2025), *Tülu 3*, COLM
Tier 3 · Practitioner
  1. Yu et al. (2025), *DAPO*, preprint
Tier 2 · Empirical
  1. Yue et al. (2025), *Does RL Really Incentivize Reasoning Capacity Beyond the Base Model?*, NeurIPS
Tier 3 · Practitioner
  1. Spurious-rewards paper (2025), random-reward RLVR on Qwen2.5-Math (cited second-hand, not re-verified)
Tier 4 · Trade press
  1. Practitioner discourse digest, Reddit/X/HF/Discord, Oct–Nov 2026 (opinion, unverifiable)
Tier 3 · Practitioner
  1. *The Silent Hyperparameter* (2026), arXiv 2605.19537, unreplicated preprint
  2. Furman, D. (2024), *Evaluations with Chat Formats*, Hugging Face blog
Tier 2 · Empirical
  1. Sclar et al. (2024), *Quantifying LMs' Sensitivity to Spurious Features in Prompt Design*, ICLR
  2. Mizrahi et al. (2024), *State of What Art?*, TACL
Tier 3 · Practitioner
  1. Miller (2024), *Adding Error Bars to Evals*, arXiv
Tier 2 · Empirical
  1. Bui et al. (2025), *Macro and Micro Effects of Random Seeds on Fine-Tuning LLMs*, IJCNLP-AACL
Tier 3 · Practitioner
  1. Reasoning reproducibility audit (2025), preprint
Tier 2 · Empirical
  1. Zheng et al. (2023), *Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena*, NeurIPS D&B
Tier 3 · Practitioner
  1. Judge-Bench (2024), *LLMs Instead of Human Judges?*, preprint
Tier 2 · Empirical
  1. Yang et al. (2024), *An Open-Source Data Contamination Report*, EMNLP Findings
Tier 3 · Practitioner
  1. Golchin & Surdeanu (2023/24), contamination detection; ACL 2024 code-contamination study
  2. Anthropic (2026), prompt caching documentation (read via mirror)
  3. OpenAI (2026), prompt caching guide
  4. Crusoe Cloud, on-demand pricing FAQ (references Oct 2025)
  5. CoreWeave pricing page; Savrn derivation (Oct–Nov 2026)
Tier 4 · Trade press
  1. ITPro (Jan 2026), AWS EC2 Capacity Blocks price increase
Tier 3 · Practitioner
  1. Fireworks AI, fine-tuning pricing page (2026)
  2. OpenAI Help Center, billing guide for the Reinforcement Fine-Tuning API
Tier 2 · Empirical
  1. Lin et al. (2025), *Efficient Model Development through Fine-Tuning Transfer*, EMNLP
  2. Huang et al. (2024), *Chat Vector*; Cao et al. (2025), *ParamΔ*, ICLR
  3. Ilharco et al. (2023), *Task Arithmetic*, ICLR; Yu et al. (2024), *DARE*, ICML
Tier 3 · Practitioner
  1. Re-distillation study on Qwen2.5-1.5B (2025), via research digest
Tier 2 · Empirical
  1. Shumailov et al. (2024), *AI Models Collapse When Trained on Recursively Generated Data*, Nature; accumulation follow-ups
Tier 3 · Practitioner
  1. Analyst reading of EU AI Act downstream-modifier threshold (Claude digest, unverified)