Skip to content
Finance Lessons

Foundation Models for Financial Time Series

The Pretrain-and-Adapt Bet

What a foundation model actually is, the amortization economics that make 'pretrain once, adapt cheaply' worth it, why the recipe conquered language, vision and weather — and the central, unresolved tension when you point it at non-stationary, adversarial, low-signal financial markets.

17 min Updated Jun 22, 2026

For a decade, the machine-learning recipe in finance read like a craft project: pick one task, hand-label a dataset for exactly that task, train a model from scratch, ship it, and start over from zero for the next task. Want to forecast volatility? Build a vol model. Want to classify regimes? Build a regime model. Nothing carried over. Every problem was an island, and you paid full freight to settle each one.

Then language, vision, and weather quietly switched to a different recipe — pretrain a single big model on a mountain of broad data once, then adapt that one model cheaply to dozens of downstream tasks. It worked so spectacularly that “foundation model” became the default way to build. This course asks the only question that matters for us: does that bet pay off when the downstream task is a financial market? This first lesson sets up the wager — what a foundation model is, why the economics are seductive, and exactly which assumption markets are poised to violate. Lessons 2–6 then stress-test it with real models (Chronos, TimesFM, Moirai, Lag-Llama), scaling laws, leakage traps, and honest evaluation.

Let’s define the bet before we grade it.

What a foundation model actually is

Before you read — take a guess

Before any definitions: what single property most distinguishes a 'foundation model' from a classic task-specific model?

The analogy. The old recipe is hiring a fresh specialist for every disease that walks through the door — a cardiologist for chest pain, a separate dermatologist for a rash, each trained from zero on just their slice. A foundation model is the seasoned generalist resident who has rotated through every ward and seen tens of thousands of cases. They don’t know your patient yet, but they walk in carrying a vast, transferable sense of how bodies work — and a short briefing (“here’s this patient’s chart”) is enough to put them to work. The expensive education happened once; each new case is a cheap adaptation.

Precise definition. The term comes from Bommasani et al. (Stanford, 2021): a foundation model is a model trained on broad data at scale (typically with self-supervision) that can be adapted — fine-tuned, prompted, or used zero-shot — to a wide range of downstream tasks. Two clauses do all the work: broad pretraining (one model, lots of generic data, no specific task in mind) and adaptation (cheaply specializing that one model to many concrete tasks).

The two recipes, side by side. The shift is from one labeled dataset → one model → one task to one giant pretraining run → one shared model → many tasks:

Old recipe (task-specific)New recipe (pretrain → adapt)
Data per taskA bespoke labeled set for that taskOne broad corpus, shared across all tasks
TrainingFrom scratch, every taskPretrain once, then cheap adaptation
LabelsHand-labeled, expensiveSelf-supervised (labels for free, see below)
Knowledge reuseNone — every task an islandShared representation carries across tasks
Cost shapeLinear in number of tasksBig fixed cost + tiny per-task cost

The phrase “foundation” is deliberate: the pretrained model is meant to be the base layer everything else is built on, not the finished building.

Warning:

'Foundation model' is not a synonym for 'large' or 'LLM'

A foundation model need not be enormous, need not be a language model, and need not be a neural net the size of a small country. A modest time-series model pretrained on many series and then adapted to a new one is a foundation model; a 70-billion-parameter network trained from scratch on a single task is not. The defining feature is the pretrain-broadly-then-adapt recipe, not the parameter count. Confusing “foundation model” with “biggest possible LLM” will lead you to the wrong lessons in this course.

When to use it

The pretrain-and-adapt framing earns its place when you face many related tasks that plausibly share structure, and labeled data for any single task is scarce or expensive. If you only ever have one task and you have abundant clean labels for it, a focused from-scratch model is simpler and you skip the whole bet. The framing’s value scales with task count and shared structure — which is exactly the economics we make precise next.

Fill in the definition.

Pick the right option for each blank, then check.

A foundation model is trained on , which is why one pretraining run can serve dozens of jobs.

The two-phase economics: amortization

Before you read — take a guess

From-scratch training costs 10 units per task. A foundation model costs 40 units to pretrain (paid once) plus 1 unit to adapt per task. With just 2 downstream tasks, which is cheaper?

The analogy. Amortization is the logic of a season pass. A single lift ticket is cheap; a season pass costs a fortune up front but almost nothing per day after. One weekend of skiing? Buy day tickets. Forty days? The pass is a steal. A foundation model is a season pass for ML tasks: a brutal fixed pretraining cost, then near-free entry to each new task. Whether the pass beats day tickets depends entirely on how many days you’ll ski — i.e., how many downstream tasks you have.

Precise model. Let NN be the number of downstream tasks. Split costs into two regimes:

  • From scratch: a fixed per-task training cost cc, paid every task, with no sharing. Total cost is purely linear: Cscratch(N)=cN.C_{\text{scratch}}(N) = c\,N.
  • Foundation model: a one-time pretraining cost PP, paid once regardless of NN, plus a small marginal adaptation cost aa per task: Cfound(N)=P+aN.C_{\text{found}}(N) = P + a\,N.

The foundation line starts high (you owe PP before task one) but climbs slowly (slope aca \ll c). The from-scratch line starts at zero but climbs steeply (slope cc). Two lines, different slopes and intercepts — they cross.

Solving for the crossover. The foundation model wins when Cfound(N)<Cscratch(N)C_{\text{found}}(N) < C_{\text{scratch}}(N): P+aN<cNN>Pca.P + aN < cN \quad\Longrightarrow\quad N > \frac{P}{c - a}.

Worked example — show the arithmetic. Use the illustrative units c=10c = 10, P=40P = 40, a=1a = 1.

  • From scratch over NN tasks: Cscratch(N)=10NC_{\text{scratch}}(N) = 10N.
  • Foundation over NN tasks: Cfound(N)=40+NC_{\text{found}}(N) = 40 + N.

Set them equal to find break-even: 10N=40+N9N=40N=40/94.4410N = 40 + N \Rightarrow 9N = 40 \Rightarrow N = 40/9 \approx 4.44. Since you can’t have a fractional task, the foundation model becomes cheaper at N=5N = 5 and beyond. Let’s tabulate to make the crossover concrete:

Tasks NNFrom scratch (10N10N)Foundation (40+N40+N)Cheaper
11041From scratch
33043From scratch
44044From scratch
55045Foundation
1010050Foundation
2020060Foundation

At N=20N = 20 the foundation model covers all twenty tasks for 60 units while the from-scratch route burns 200 — more than 3× cheaper, and the gap widens forever after. Drag the slider below and watch the bars trade places exactly at the crossover.

One model per task vs. pretrain once, adapt cheaply
From scratch (one model per task)Foundation model (pretrain + adapt)
05010015020015101520Downstream tasks (N)foundation wins beyond N≈5
Downstream tasks (N)3From scratch (one model per task)30Foundation model (pretrain + adapt)43From scratch wins

Sweep the number of downstream tasks N from 1 to 20. The from-scratch route (10 units/task) is a straight line through the origin — no work is shared, so the bill is purely linear. The foundation model pays a big fixed pretraining toll (40 units) before task one, then adds only 1 unit per task, so its line starts high but barely rises. The two cross near N≈5: below it the fixed cost hasn't been amortized and from-scratch is cheaper; beyond it the foundation model wins and keeps winning. The entire payoff hinges on one assumption — that the pretrained representation actually TRANSFERS to each new task.

Warning:

Amortization is an accounting trick, not a guarantee of quality

The math above only counts cost. It silently assumes the cheaply-adapted model is as good as the from-scratch one — that the season pass gets you onto the same slopes. If transfer is poor, you’ve spent 40 units to pretrain and then 1 unit per task to produce models that are worse than the 10-unit bespoke ones. Cheap and good are different axes. The crossover chart proves the foundation route is cheaper at scale; it says nothing about whether the cheap models actually work. Hold that thought — it’s the whole tension of this course.

When to use it

The amortization bet is worth making when NN is large and the per-task adaptation genuinely produces a competitive model — many related tasks, cheap transfer, shared structure. It’s a bad bet when NN is tiny (you never reach the crossover) or when transfer is so weak that the adapted models underperform bespoke ones (you reach the crossover on cost but lose on quality). Markets, we’ll see, threaten both conditions at once.

Pick a term, then click its definition.

Why pretrain-and-adapt conquered language, vision, and weather

Before you read — take a guess

Self-supervised pretraining (predict the next word, fill in a masked image patch) is powerful largely because it solves which practical bottleneck?

The analogy. Imagine learning a language by being handed every book ever written with the last word of every sentence covered up, and being asked to guess it — billions of times. You’d never pay a teacher; the text grades itself. That’s self-supervision: the data secretly contains its own answer key. Predict the next token, and the actual next token tells you if you were right. Mask a patch of an image, and the original pixels are the answer. Suddenly “labeled data” is infinite, because every raw example is a labeled example.

The three ingredients that made the recipe explode. Pretrain-and-adapt didn’t win on cleverness alone. It won where three conditions all held:

  1. Free labels via self-supervision. Next-token (language), masked-patch (vision), next-state (weather) — no human annotation needed, so pretraining data is effectively unlimited.
  2. Abundant data. Web-scale text, billions of images, decades of gridded reanalysis weather fields. The fixed pretraining cost PP buys a representation only if there’s a mountain of data to learn it from.
  3. Near-stationary structure. This is the quiet hero. Grammar today works like grammar next year. A cat’s edges and textures don’t mutate when you switch datasets. Atmospheric physics obeys the same equations forever. Because the data-generating process is stable, a representation learned during pretraining still describes the world at adaptation time — so it transfers.

Why stationarity is the load-bearing wall. Transfer is the entire premise of amortization: the pretrained representation only helps a new task if the new task looks like what was pretrained on. When the underlying rules don’t drift, “looks like” holds. Stationarity is what lets a representation learned yesterday be valid tomorrow. Pull that wall out and the whole structure — economics included — collapses.

DomainData volumeLabel sourceStationarityTransfer success
LanguageWeb-scale textNext token (self-supervised)High — grammar/semantics drift slowlySpectacular
VisionBillions of imagesMasked patch / augmentationHigh — object structure stableSpectacular
WeatherDecades of reanalysis gridsNext atmospheric stateHigh — fixed physicsStrong and growing
MarketsModest, overlappingNext return (self-supervised)Low — the process driftsThe open question

Notice the first three rows share all three ingredients, and the fourth — markets — fails on the one that matters most. That single red cell is what the rest of this course is about.

Warning:

Free labels do not mean free signal

Self-supervision hands you labels for free, but only as much signal as the data contains. Next-token prediction on text works because text is dense with learnable structure. “Predict the next return” also gives free labels — but if the next return is mostly unforecastable noise (efficient markets, low signal-to-noise), you’ve cheaply generated a billion training examples for a problem that’s largely unlearnable. Free labels are necessary, not sufficient. The bottleneck moves from labeling to whether there’s anything to learn.

When to use it

Reach for self-supervised pretrain-and-adapt when all three ingredients are present: free labels, abundant data, and a stable generating process so the representation transfers. Miss any one and the recipe weakens. Miss stationarity in particular and the economics still look attractive (the cost crossover is real) while the quality quietly evaporates (the transfer fails) — the most dangerous failure mode, because the spreadsheet says yes while the out-of-sample results say no.

Sort each item under the ingredient of the pretrain-and-adapt recipe it represents.

Place each item in the right group.

  • The next token in a sentence acts as its own training target
  • Atmospheric physics obeys the same equations year after year
  • Decades of web-scale text or billions of images to pretrain on
  • Masking an image patch and predicting the original pixels
  • Grammar and object structure barely drift between pretraining and use

The adaptation spectrum (a preview)

Before you read — take a guess

You have a pretrained foundation model and a brand-new task with ZERO labeled examples for it. Which adaptation mode is even possible?

Once you have a pretrained model, “adapt it to a task” is a spectrum, not a single move. Three landmarks, one sentence each (lesson 3, Zero-Shot, Few-Shot & Scaling Laws, goes deep on all of them):

  • Zero-shot — run the pretrained model on the new task with no task-specific examples at all; you lean entirely on what pretraining already learned. Cheapest, most demanding of transfer.
  • Few-shot — show the model a handful of labeled examples (in-context or via light tuning) to nudge it toward the task. A middle ground.
  • Full fine-tuning — update the model’s weights on a task-specific dataset, specializing it the most but risking overfitting on small, noisy financial data.

The further left you sit (zero-shot), the more you’re betting on raw transfer; the further right (full fine-tune), the more task data you need and the more you risk the data-hunger problem from the prior course. The adaptation cost aa in our economics grows as you move right.

Fill in the adaptation mode.

Pick the right option for each blank, then check.

Applying a pretrained model to a new task with no task-specific examples at all is called adaptation, and it leans entirely on what pretraining already learned.

The central tension with markets

Before you read — take a guess

Amortization (pay P once, adapt cheaply to many tasks) pays off ONLY if which condition holds?

Here’s where the bet meets its toughest table. Amortization buys you cheap models; it only buys you cheap good models if the representation transfers, and transfer needs the target task to resemble the pretraining distribution. Markets attack that resemblance from three directions at once.

1. Non-stationarity — the rules drift. The data-generating process of markets is not fixed. Volatility regimes shift, correlations break in crises, central-bank policy rewrites the playbook, market structure evolves (decimalization, high-frequency trading, new venues). A representation learned on 2010–2015 may describe a market that no longer exists by 2026. Unlike grammar or physics, the thing you pretrained on moved.

2. Adversarial reflexivity — your edge decays as others find it. Finance is the one domain where using a pattern destroys it. If a signal genuinely predicts returns, traders pile in, push prices, and arbitrage the edge away. This is efficient-market pressure made concrete: the act of exploiting structure feeds back and erases it. A cat does not learn to hide its edges because a vision model got good at finding them; a market absolutely learns to hide its alpha because everyone’s model got good at finding it.

Worked example — an edge crowding to death. Suppose a signal earns a gross excess return of r0=8%r_0 = 8\% per year when only you trade it. As capital crowds in, the edge decays geometrically — say it shrinks by a factor of 0.70.7 each year as competitors discover it: rt=r00.7t.r_t = r_0 \cdot 0.7^{\,t}. Then year by year: r0=8.0%r_0 = 8.0\%, r1=8×0.7=5.6%r_1 = 8 \times 0.7 = 5.6\%, r2=8×0.49=3.92%r_2 = 8 \times 0.49 = 3.92\%, r3=8×0.343=2.74%r_3 = 8 \times 0.343 = 2.74\%, r4=8×0.2401=1.92%r_4 = 8 \times 0.2401 = 1.92\%. Now subtract a realistic all-in trading cost of, say, 2%2\% per year. The net edge is rt2%r_t - 2\%: it’s +6.0%+6.0\% in year 0, but by year 4 it’s 1.92%2%=0.08%1.92\% - 2\% = -0.08\%negative. The signal didn’t just fade; continuing to trade it now loses money. A foundation model that learned this pattern during pretraining will keep confidently emitting it long after the market has arbitraged it into a cost-bleeding liability. The pattern was real in the pretraining window and worthless — even harmful — by deployment.

3. Brutally low signal-to-noise. Even where structure exists, it’s buried. Daily returns are dominated by unforecastable noise; the predictable component is a sliver. A representation pretrained to “predict the next return” is mostly fitting noise, because noise is most of what’s there. This is the data-hunger and low-SNR problem from the prior deep-learning course, inherited wholesale.

Warning:

A foundation model's confidence is not calibrated to an adversarial market

This is the trap that sinks practitioners. A model’s confidence reflects how consistent a pattern was in its training distribution, not how durable that pattern is against an adversary actively trying to erase it. In language, a confident next-token prediction is usually right because grammar isn’t fighting back. In markets, the patterns the model is most confident about are often the most crowded, most arbitraged, and most likely to have already decayed — confidence and durability can be inversely related. Never read a foundation model’s certainty about a market as evidence the edge will survive contact with other traders. The market is the one domain where the thing you’re predicting reads your prediction and adjusts.

So the bet’s geometry is clean and its premise is precisely what markets break. The cost lines still cross — pretrain-and-adapt is genuinely cheaper at scale. But “cheaper” only becomes “better” through transfer, and transfer needs a stable, non-adversarial, signal-rich target. Markets are non-stationary, adversarial, and low-SNR. That’s not a reason to abandon the bet — it’s the reason this course exists: to find where the bet does pay (it sometimes does) and to evaluate it honestly enough that we don’t fool ourselves.

If the cost crossover is genuinely real, why isn’t “it’s cheaper at scale” enough to justify foundation models for markets?

Answer. Because the crossover only proves the foundation route is cheaper, and cheap is not the goal — profitable is. The amortization math assumes the cheaply-adapted models are as good as bespoke ones, which is true only when the pretrained representation transfers. In language, vision, and weather it transfers because the generating process is stable, so cheaper genuinely means equally-good-for-less. In markets the process is non-stationary, adversarial, and low-SNR, so transfer is in doubt: you can hit the cost crossover (spend less) while the adapted models are worse than from-scratch ones, or worse than just not trading. The spreadsheet says yes on cost while the out-of-sample P&L says no on quality. That gap — cheap but possibly not good — is the entire bet, and why honest evaluation (lesson 6) matters more here than anywhere else.

When the pretrain-and-adapt bet is worth making vs. not

It comes down to a clean trade-off between task count + shared structure (which favor the bet) and non-stationarity + adversarial decay + low SNR (which sink it):

Favors the betSinks the bet
Many related downstream tasks (large NN)A single, one-off target
Cheap, abundant pretraining dataScarce, overlapping, regime-mixed data
Stable generating process (transfer holds)Non-stationary process (representation goes stale)
Non-adversarial targetReflexive market that arbitrages your edge away
Decent signal-to-noiseBrutally low SNR (mostly noise)

Worth making when you have many related tasks that share structure and data is cheap — e.g., forecasting many benchmark time series at once, where lots of series share seasonality and trend dynamics (precisely where TimesFM, Chronos, Moirai and Lag-Llama in lesson 2 actually shine). Doubtful when the target is a single, heavily-arbitraged, non-stationary return series and you’re betting the whole edge on a representation learned from a moving, adversarial past. The honest answer is “it depends, and you must measure it without fooling yourself” — which is why lessons 5 (leakage) and 6 (evaluation) exist.

Sort each market property under the mechanism by which it threatens the pretrain-and-adapt bet.

Place each item in the right group.

  • A profitable signal decays as capital crowds in to exploit it
  • Correlations that held for years break apart in a crisis
  • A pattern from 2012 describes a market structure that no longer exists
  • The act of trading an edge pushes prices and erases the edge
  • Daily returns are mostly unforecastable noise around a tiny predictable sliver

Recap

Big picture

The pretrain-and-adapt bet

  • Pretrain-and-adapt bet
    • What a foundation model is
      • Broad pretraining at scale
      • Adapt to many downstream tasks
      • Bommasani et al., Stanford 2021
      • Not a synonym for 'large' or 'LLM'
    • Two-phase economics
      • From scratch: cost = cN (linear)
      • Foundation: cost = P + aN
      • Crossover N > P/(c−a)
      • Worked: 10N = 40+N → N≈5
      • Amortization = cheap, not auto-good
    • Why it conquered LLM/vision/weather
      • Free labels (self-supervision)
      • Abundant data
      • Near-stationary → transfer holds
    • Adaptation spectrum (lesson 3)
      • Zero-shot: no task examples
      • Few-shot: a handful
      • Full fine-tune: update weights
    • Central tension with markets
      • Non-stationary: process drifts
      • Adversarial: edge decays as others find it
      • Low SNR: mostly noise
      • Confidence ≠ durability
Pretrain once on broad data, adapt cheaply to many tasks — the economics are clean, but the payoff hinges on transfer, and markets break exactly that assumption.

The pretrain-and-adapt bet — check yourself

Question 1 of 60 correct

Which is the defining characteristic of a foundation model, per Bommasani et al. (2021)?

Check your answer to continue.

Mark lesson as complete