Skip to main content
Introduction to Statistical Methods

Time Series Analysis — Smoothing and Forecasting

Published: 2026-07-07
Level: postgraduate
Audience: Postgraduate students in Statistics and Business Analytics

Prerequisite Knowledge

This lecture builds on the following concepts from earlier lectures. If any feel unfamiliar, review the linked notes before proceeding.

Previously Covered in This Subject

  • Time Series Components — trend, seasonality, cyclicality, and irregularity covered in Lecture 13
  • Moving Averages (Simple and Weighted) — introduced in Lecture 14
  • Exponential Smoothing (Single) — introduced in Lecture 14
  • Additive and Multiplicative Models — covered in Lecture 14
  • Correlation, Covariance, and Regression — covered in Lectures 12 and 13
  • Normal (Gaussian) Distribution — covered in Lecture 8

Time Series Analysis — Smoothing and Forecasting

The big question: You have a sequence of numbers — sales, temperatures, stock prices — stretching into the past. How do you squeeze the next number out of that history? This lecture builds a toolkit of methods that answer that question, from simple window-averaging to probabilistic clustering with Gaussian mixtures.

What connects every method in this lecture is one idea: the future resembles the past, but only the recent past matters most. Moving averages, exponential smoothing, weighted variants, Holt's trend-tracking method — each is a different bet on how much of the past to carry forward and how fast to let it fade.

Time series forecasting sits at the intersection of statistics and practical decision-making. Businesses use it for inventory planning. Economists use it for GDP projections. Engineers use it for signal processing. The methods here are the foundation that every more advanced technique — ARIMA, state-space models, deep learning forecasters — builds on.

The lecture closes with an introduction to Gaussian Mixture Models, a probabilistic clustering framework. It may seem like a detour from forecasting, but the thread is the same: extracting structure from data, whether that structure is a trend over time or hidden groups in a cloud of points.

15.1 Moving Averages — Review and Extension

Hook. If you've ever looked at a jagged stock-price chart and drawn a smoother line through the noise with your finger, you've already invented the moving average. The question is: where exactly does that smoother line belong, and which raw points feed into it?

15.1.1 Definition and Core Idea

Intuition + Analogy. Imagine you're driving through fog. You can only see a few car-lengths ahead — that's your window. At any moment, your best guess of the road's direction is the average of what you can see right now through that window. As you drive forward, the window slides with you. Old pavement drops out of view; new road enters. Your estimate updates. That's a moving average.

The analogy breaks in one way: the moving average lags. It tells you where the road was, not where it is going. We'll see this lag as a systematic issue with all smoothing methods.

A moving average replaces the current value with the average of a fixed-size window of past observations. Slide a window across the time series. For each window position, compute the average. That average becomes the forecast. The window size is your key design choice — it controls how many time steps you include. You use moving averages to smooth short-term fluctuations and reveal longer-term trends.

15.1.2 Symbol Registry

Symbol Meaning Type Domain
Window size (number of time steps in the moving window) integer
Actual value at time scalar Any real number
Forecast (moving average) for time scalar Any real number
Total number of time steps integer

15.1.3 Odd vs Even Window Sizes — The Key Difference

Formalize. For a window of size covering observations :

The critical question: which time index gets this forecast?

Odd (e.g., 3, 5): The forecast lands on the middle time step. For covering , the forecast goes at . The window is perfectly symmetric around the forecast point.

Even (e.g., 2, 4): There is no middle. The convention: the forecast goes at the -th position. For covering , the forecast goes at .

This is the only structural difference between even and odd moving averages. Sliding, averaging, and error analysis are identical.

Placement rule (for exams): odd → forecast middle; even → forecast the -th position.

Worked Example — 3-Year Moving Average. Consider annual sales data:

Year Sales ()
1 120
2 135
3 128
4 142
5 150

Window 1 (years 1–3): average = → forecast for year 2 (middle).

Window 2 (years 2–4): average = → forecast for year 3.

Window 3 (years 3–5): average = → forecast for year 4.

Years 1 and 5 get no forecast — no complete 3-year window is centered on them.

Year Actual 3-Yr MA Forecast
1 120
2 135 127.67
3 128 135.00
4 142 140.00
5 150

Sense-check: The forecasts (127.67, 135.00, 140.00) rise with the data — the upward trend is captured, though smoothed.

Worked Example — Even Windows. Same data, but quarterly. Suppose Q1=120, Q2=135, Q3=128, Q4=142, Q5=150.

2-Quarter MA (k=2, even → forecast at k-th = 2nd position):

Quarters Average Forecast For
Q1,Q2 (120+135)/2 = 127.5 Q2
Q2,Q3 (135+128)/2 = 131.5 Q3
Q3,Q4 (128+142)/2 = 135.0 Q4
Q4,Q5 (142+150)/2 = 146.0 Q5

4-Quarter MA (k=4, even → forecast at 4th position):

Quarters Average Forecast For
Q1–Q4 (120+135+128+142)/4 = 131.25 Q4
Q2–Q5 (135+128+142+150)/4 = 138.75 Q5

Even windows lose more initial rows but forecasts reach further into recent data.

15.1.4 Assumptions & Scope

Scope. Moving averages assume the time series has no strong trend or seasonality — the data fluctuates around a roughly constant mean (a horizontal pattern). When a trend exists, the moving average systematically lags: it will consistently under-forecast in an uptrend and over-forecast in a downtrend. When seasonality exists, the moving average mixes in-season and out-of-season values indiscriminately, producing misleading forecasts. Use moving averages only after checking that the series is approximately stationary in its level.

15.1.5 Visual Intuition

Plot your raw time series as connected dots . Now overlay the moving average as a second line. The MA line will be smoother — the peaks are lower, the troughs are higher. It cuts through the middle of the fluctuations. For a 3-period MA, count: the MA line at year 2 is the average of years 1, 2, and 3. The MA line at year 3 averages years 2, 3, and 4. The line trails the raw data by roughly half a window width. The wider the window (larger ), the flatter and laggier the MA line becomes.

15.1.6 Pitfalls

Common traps:

  1. Comparing even and odd MAs row-by-row. An even-k MA places its first forecast at position ; an odd-k MA places it at . They line up differently. Compare them by error metrics against actuals, not by row alignment.
  2. Computing backward. Always slide the window forward — from the earliest data to the latest. The goal is to simulate what you would have forecasted at each point in history.
  3. Expecting forecasts for edge periods. Odd loses forecasts at each end. Even loses at the start. That's normal — the window needs complete data.
  4. Using moving averages when a trend exists. The MA will lag. If you see the MA line consistently below (or above) the actuals, you have trend — switch to double exponential smoothing or trend projection.

15.1.7 Student Questions and Answers

Q: For a 4-quarter moving average, why does the first forecast appear at the 4th quarter and not the midpoint (between quarters 2 and 3)?

A: The convention for even-window moving averages places the forecast at the -th time step. For , the forecast goes at quarter 4. This is the model definition. Deeper centering discussions exist (involving centering techniques for even-numbered windows), but for this course the rule is: even → forecast the -th position.

Q: When we compare a 2-year and 3-year moving average, both show values at the second row. Shouldn't the 3-year start at the third row?

A: No — the 3-year moving average forecasts the middle year. The first 3-year window (years 1, 2, 3) forecasts year 2. That's why both a 2-year and a 3-year average can have a value in row 2. They place forecasts differently: odd windows are centered, even windows are end-biased. Don't compare placement row-by-row; compare each model against actual values and evaluate via error metrics.

Q: Should we compute moving averages starting from the latest data backwards, or from the earliest data forward?

A: Start from the earliest data and move forward. The purpose of building these models is to figure out which one fits the data best. Some initial rows will be missing forecasts — that's expected. Once you identify the best model, deploy it for future forecasting.

15.1.8 Recap + Bridge

Recap: A moving average replaces each point with the mean of its nearest neighbors in time. Odd centers the forecast; even places it at the -th position. The window size trades smoothness against responsiveness.

Bridge: Moving averages treat every observation in the window equally. But what if yesterday matters more than last week? That question leads to weighted moving averages (Section 15.4) and, taken to its logical extreme, exponential smoothing (Section 15.2), where weights decay geometrically into the past.

15.1.9 Real-World & Domain Connection

Moving averages are the workhorse of technical analysis in finance. Traders watch the "50-day MA" and "200-day MA" cross each other as buy/sell signals — when the short-term MA crosses above the long-term MA, it's a "golden cross" (bullish). Beyond finance, moving averages appear in signal processing (as low-pass filters), in epidemiology (7-day rolling averages of case counts became a household concept during COVID-19), and in any domain needing a quick, interpretable baseline forecast. They survive because they require no distributional assumptions, no optimization, and can be explained to a non-technical stakeholder in thirty seconds.

15.2 Exponential Smoothing

Hook. A moving average gives every observation in the window the same vote. But is last month's sales really as relevant as sales from six months ago? Exponential smoothing says no — and it builds a forecast where yesterday screams and last year whispers.

15.2.1 Definition and Core Idea

Intuition + Analogy. You're adjusting a shower knob. You turn it, wait, feel the temperature, then nudge it again. You don't yank the knob based on the last half-second of water — but you also don't ignore that half-second entirely. Exponential smoothing is that nudge: a fraction of the latest error shapes your next move.

More formally: you maintain a running forecast . When the actual arrives, you ask "how wrong was I?" The answer is . Your next forecast is the old forecast plus a fraction of that mistake. Large = aggressive correction (you trust the latest observation). Small = cautious correction (you trust the accumulated history).

The analogy breaks in one respect: the shower knob is a physical control loop with a fixed target. Exponential smoothing has no target — it just chases whatever the data does.

15.2.2 The Formula

Formalize. Single exponential smoothing has two equivalent forms.

Weighted-average form:

Where:

  • — forecast for time
  • — actual value at time
  • — forecast at time
  • — smoothing parameter,

Error-correction form (same equation, rearranged):

Interpretation: new forecast = old forecast + (most recent error).

If you over-forecasted (), the next forecast drops. If you under-forecasted, it rises. The fraction controls how much you correct.

The standard textbook form (e.g., Anderson, Sweeney & Williams) is identical. Some texts denote the smoothing constant as exclusively and call it the "smoothing constant" — the lecture uses these conventions.

15.2.3 Symbol Registry

Symbol Meaning Type Domain
Forecast at time scalar Any real number
Actual value from the time series at time scalar Any real number
Smoothing parameter (weight for the actual) scalar
Forecast error at time scalar Any real number

15.2.4 Why "Exponential" — The Infinite Expansion

The name comes from expanding the recurrence backward. Substitute :

Keep substituting all the way back:

The weights are: — a geometric sequence. This is the discrete analogue of the exponential function , hence the name "exponential smoothing."

Concrete check with : weights are 0.8, 0.16, 0.032, 0.0064, … — the most recent observation gets 80% of the weight. Only the first two or three past observations matter. With : weights are 0.2, 0.16, 0.128, 0.1024, … — decay is slower; older observations retain influence.

The weights always sum to 1 (as a geometric series): .

15.2.5 Handling the First Forecast

At the very first time step, you have but no . The convention: set . With no prior information, you start with the observed value as the initial forecast. This matches the textbook approach: the forecast for period 2 is , so effectively the first real forecast is just the first observation. The error-correction view reinforces this — without a prior forecast, there is no error to correct.

15.2.6 Worked Example 1 — Exponential Smoothing with

Given quarterly data starting at Q1 2017 with . Set .

Q2:

Q3: Given .

Q4: Given .

Quarter Error
Q1 2017 82.50 82.50 0.00
Q2 2017 81.30 82.50 −1.20
Q3 2017 80.70 82.26 −1.56
Q4 2017 81.95

Sense-check: With , the forecast moves slowly. Despite two quarters of decline, the forecast only drops from 82.50 to 81.95 — a change of 0.55, while the actual dropped by 1.80. Small alpha = inertia.

15.2.7 Worked Example 2 — Comparing , ,

All three models start with . For a quarter where and :

Error
0.2
0.4
0.7

The model with is closest to the actual on this single observation. But never judge a model on one data point — compare aggregate error (MSE, MAD) across all time steps. Model selection requires a performance measure (Section 15.3).

15.2.8 Assumptions & Scope

Scope. Single exponential smoothing assumes the time series has no trend and no seasonality — a horizontal pattern (stationary level). If a trend exists, the forecast will systematically lag: will consistently be below the actuals in an uptrend. If seasonality exists, the method has no mechanism to capture it. For trend, upgrade to double exponential smoothing (Holt's, Section 15.5). For seasonality, upgrade to triple exponential smoothing (Holt-Winters). The smoothing parameter must be in . At , the forecast never updates (). At , the forecast is just the last observation () — equivalent to a naïve forecast.

15.2.9 Visual Intuition

Plot your raw time series as a jagged line. Overlay the exponential smoothing forecast . At , the forecast line is a heavily damped version — it drifts slowly, ignoring most of the wiggles. At , the forecast line hugs the actuals tightly, jumping with every spike. Think of as a "responsiveness knob." Turn it to 0: the line goes flat. Turn it to 1: the line becomes the raw data shifted right by one period.

15.2.10 Pitfalls

Common traps:

  1. Judging a model by one forecast. One data point proves nothing. Always compute MSE or MAD across the full series.
  2. Chasing the lowest MSE blindly. may give the lowest in-sample MSE, but it is practically a naïve forecast — it overfits noise. For exams, go with the statistical criterion (minimum MSE). For real deployment, consider generalizability.
  3. Confusing and . is the forecast made at time for time . is what actually happened at time . The error is only known after time .
  4. Forgetting initialization. The first forecast is a convention, not a computed value. If asked "why?" — because there is no prior information to form a forecast.

15.2.11 Student Questions and Answers

Q: How do we calculate for the very first entry when we only have ? The formula needs which hasn't been computed yet.

A: For the first observation, set . There is no prior forecast, so both the forecast and the actual are taken as equal. This convention holds across all smoothing methods: when there's no prior information, start with the observed value.

Q: If we have three models with different alphas, and they each give different forecasts — which one is correct?

A: They are all valid models. Think of it like choosing between algorithms: Model A (), Model B (), Model C (). Your job is to decide which one is best for your data. Evaluate each on aggregate error (MSE, MAD). The best model has the smallest error — not the one whose forecast you "like" best.

Q: How do we actually decide which alpha is best?

A: Compute a performance measure (MSE, MAD, or MAPE) for each model across all time steps. The model with the smallest error wins. This is the same logic as model selection in any algorithm: fit, evaluate, compare, pick the best.

Q: What about overfitting? If I keep increasing alpha and the error keeps dropping, can I just pick ?

A: This is the real concern. The model with the smallest MSE on training data is "best" by that metric. But a very high alpha makes the forecast so responsive that it tracks noise rather than signal — that's overfitting. For exam purposes: go with the statistical criterion (minimum MSE). For real deployment, think about generalizability. A model too responsive to recent noise will fail on future data. Several students asked variants of this — it signals a common trap worth watching for.

15.2.12 Interpreting Alpha — Small vs Large Values

Small alpha (e.g., 0.1–0.3): The forecast is stable and slow to change. It gives more weight to accumulated history than to the latest observation. Good when the underlying process is stable and noise is high. The forecast line will be relatively flat.

Large alpha (e.g., 0.7–0.9): The forecast is reactive — it tracks the latest observation closely. Good when the process changes rapidly and you need to respond fast. The forecast line hugs the actual data.

15.2.13 Recap + Bridge

Recap: Exponential smoothing produces a forecast by blending the last actual value and the last forecast, weighted by . Expanding the recurrence reveals that every past observation contributes — but with geometrically decaying weight. Alpha is your responsiveness knob: small = smooth, large = reactive.

Bridge: Exponential smoothing gives you one parameter () to control how fast old data fades. But it still gives equal weight to all observations at the same age. What if you want to assign custom weights by position in a window? That leads to weighted moving averages (Section 15.4). And what if your data has a persistent trend? That demands a second smoothing equation — Holt's method (Section 15.5).

15.2.14 Real-World & Domain Connection

Exponential smoothing powers production forecasting systems worldwide. Amazon's inventory planning, Walmart's supply chain, and airline revenue management all use variants of it — often not because it's the most accurate method, but because it is fast, interpretable, and robust to missing data. It requires storing only two numbers (the last actual and the last forecast), making it ideal for high-frequency streaming data. The error-correction form connects directly to modern optimization: the RMSprop optimizer in deep learning uses a similar idea — an exponentially weighted moving average of squared gradients — to adapt learning rates. The same mathematical idea, separated by six decades of application.

15.3 Performance Measures for Forecast Evaluation

Hook. You've built three forecasting models. Each spits out different numbers. Your boss asks: "Which one should we use?" You need a single number that settles the argument — a score that says Model B is better than Model A, full stop, no opinions allowed.

15.3.1 Why You Need Performance Measures

Intuition + Analogy. Think of forecast errors like darts on a dartboard. MSE asks: "What's the average squared distance from the bullseye?" — it screams at the one dart in the wall. MAD asks: "What's the average distance?" — it treats the wall-dart and the near-miss more evenly. MAPE asks: "What's the average distance as a percentage of where you were aiming?" — it cares whether you missed by 2 points on a 10-point target or a 100-point target. LAD asks: "What was your single worst throw?" Different questions, different champions. Your application picks the question.

You cannot judge forecast models by intuition. You need a single number summarizing how wrong predictions are across all time steps. Different metrics emphasize different aspects of error.

15.3.2 Symbol Registry

Symbol Meaning Type
Actual value at time scalar
or Forecast for time scalar
Error at time : scalar
Number of forecast periods integer

15.3.3 Mean Squared Error (MSE)

MSE squares each error before averaging. An error of 10 contributes 100; an error of 1 contributes 1. Large errors are punished disproportionately. MSE is the most common metric because squaring is convenient for optimization (differentiable, convex). But it is sensitive to outliers — one bad forecast can dominate the score.

MSE is always non-negative. Smaller MSE = better model. The textbook (Anderson et al., §17.2) uses MSE as the default criterion for selecting in moving averages and in exponential smoothing.

15.3.4 Mean Absolute Deviation (MAD)

MAD takes the absolute value of each error. It treats errors linearly: an error of 10 is ten times as costly as an error of 1. MAD is easier to interpret — it has the same units as the original data. It is less swayed by outliers than MSE. Some textbooks denote this as MAE (Mean Absolute Error); the lecture uses MAD — they are the same metric.

15.3.5 Mean Absolute Percentage Error (MAPE)

MAPE expresses error as a percentage of the actual value. It is scale-independent — you can compare forecast accuracy across datasets with different units (e.g., dollars vs. units sold). But MAPE fails when any (division by zero) and is undefined. It also penalizes over-forecasts and under-forecasts asymmetrically when measured relative to the actual.

15.3.6 Largest Absolute Deviation (LAD)

LAD reports the single worst error the model makes. It answers: "What is the biggest mistake this model ever produced?" This matters in safety-critical applications. A model that is usually good but occasionally disastrous may be unacceptable. LAD bounds the maximum deviation.

15.3.7 Comparison of Metrics

Metric Penalizes Units Outlier Sensitivity Best When...
MSE Squared errors Squared units of High Optimization, theoretical work
MAD Absolute errors Same as Moderate Interpretability, robust comparison
MAPE Percentage errors Percentage (%) Moderate (but skewed by small ) Cross-dataset comparison
LAD Single worst error Same as Extreme (only one point matters) Safety-critical bounds

15.3.8 Worked Example — Six Models Compared

Six models were built with different alpha values on the same data. Model 6 (largest alpha) gave the smallest MSE. Conclusion: by the MSE criterion, model 6 is best.

But note the overfitting caution (see Section 15.2.10, Pitfall 2). The model with the smallest in-sample MSE may not generalize best to future data. For exam purposes: go with the statistical criterion (minimum MSE). For real deployment, consider generalizability.

Exam-style computation (MSE): Suppose errors across 5 periods are: .

MAD:

LAD:

15.3.9 Student Questions and Answers

Q: In what situations would we use LAD instead of MSE?

A: When you care about the worst-case error. Say you forecast inventory levels. A large under-forecast causes a stockout — you lose customers. You want to know the maximum deviation, not the average squared error. Different applications call for different error measures. For most exam problems, MSE and MAD are the relevant ones.

15.3.10 Exam Notes

Exam note: Expect a problem that asks: "Forecast the demand for week 7 using . Then forecast it using . Briefly comment on which alpha should be chosen." Solution: compute forecasts step-by-step with each alpha, then compare errors, make a reasoned recommendation. Always show your work in a table — it makes the computation traceable and grading easier.

15.3.11 Recap + Bridge

Recap: Four metrics, four lenses on error. MSE punishes large errors with a sledgehammer. MAD treats all errors fairly. MAPE makes errors comparable across scales. LAD tells you the worst that can happen. Pick the metric that matches what you care about.

Bridge: With these metrics in hand, you can now compare any forecasting models — moving averages, exponential smoothing, weighted variants — on equal footing. The next section (15.4) introduces weighted moving averages, where you choose how much each position in the window matters.

15.3.12 Real-World & Domain Connection

Every predictive modeling project — from weather forecasting to stock trading to demand planning — requires choosing between candidate models using quantitative criteria. The four metrics here are universal. In Kaggle competitions, MSE (or its square root, RMSE) is the default loss function. In supply chain management, MAPE dominates because it allows comparing forecast accuracy across products with vastly different sales volumes. In aerospace engineering, LAD matters because a single large trajectory error is unacceptable regardless of average performance. Knowing which metric to optimize is half the job of forecasting.

15.4 Weighted Moving Averages

Hook. A simple moving average is a democracy: every observation in the window gets one vote. But some votes should count more. Yesterday's temperature is a better predictor of today's than last week's. Weighted moving averages let you gerrymander the window — you decide who gets the loudest voice.

15.4.1 Definition

Intuition + Analogy. You're assembling a jury to decide tomorrow's sales forecast. A simple moving average seats all jurors equally. A weighted moving average gives the foreperson (most recent observation) three votes, the next juror two votes, the last juror one vote. The total votes still sum to the jury size — but influence is concentrated at the front.

The analogy breaks because the weights aren't people — they're numbers that must sum to exactly 1. This constraint ensures the forecast stays in the same scale as the data.

A weighted moving average is like a regular moving average, but observations inside the window are not treated equally. You assign a weight to each position. The most recent observation typically gets the highest weight. The weights must sum to 1.

15.4.2 Symbol Registry

Symbol Meaning Type Domain
Weight assigned to position in the window scalar
Value at the -th position within the current window scalar Any real number
Window size integer

Constraint: .

15.4.3 Formula and Computation

Formalize. For a window of size with weights (where is the weight for the most recent observation, for the oldest):

This is the textbook form (Anderson et al., §17.3): a weighted moving average is a convex combination of the most recent values. When all , it collapses to the simple moving average.

Worked Example. 3-year weighted moving average with weights: (latest), , (oldest).

Given values in the first window:

Weighted moving average:

Next window (values ):

Weighted moving average:

Sense-check: The latest observation pulled the forecast from 11.9 up to 15.0, correctly reflecting the recent jump. A simple 3-period MA would have given — the weighted version responds faster because gets half the vote.

15.4.4 Key Rules

  • Weights must be between 0 and 1.
  • Weights must sum to exactly 1.
  • Weight assignment is a design choice — it comes from domain knowledge or experimentation, not from a formula.
  • The rest of the procedure (sliding the window, error analysis) is identical to the unweighted moving average.

15.4.5 Assumptions & Scope

Scope. Weighted moving averages share the same assumptions as simple moving averages: no strong trend or seasonality. The extra flexibility of weights helps when you have a strong prior that recency correlates with relevance — but it also introduces new degrees of freedom, increasing the risk of overfitting. Use trial and error or grid search to select weights, and always validate on a holdout period.

15.4.6 Pitfalls

Common traps:

  1. Weights that don't sum to 1. If , the forecast is scaled wrong — it will systematically over- or under-shoot. Always check: do the weights add to exactly 1.0?
  2. Assigning the wrong position the highest weight. The most recent observation should get the largest weight. If you reverse the order, you're saying the oldest data matters most — that defeats the purpose.
  3. Using too many weights with too little data. A 5-period weighted MA needs 5 weights. With only 20 data points, you're estimating a lot of free parameters. Prefer fewer weights or constrain them (e.g., exponential-style decay).

15.4.7 Student Questions and Answers

Q: Do the weights always sum to 1?

A: Yes. The weights in a weighted moving average must sum to 1. This is a hard constraint — it ensures the forecast is a proper weighted average and stays in the same units as the data.

Q: Where do the weights come from — how do we choose them?

A: You choose them. The priority you assign to recent vs. older data is a modeling decision. There is no automatic formula. You pick weights based on your belief about how much recent data matters. In practice, try several weight combinations and pick the one that minimizes your error metric (MSE or MAD). Some practitioners use exponentially decaying weights () as a principled default — this connects weighted moving averages directly to exponential smoothing.

15.4.8 Recap + Bridge

Recap: A weighted moving average is a simple moving average where you choose how much each position in the window matters. The weights must sum to 1. The most recent observation typically gets the largest weight, making the forecast more responsive than its unweighted counterpart.

Bridge: Weighted moving averages live between two extremes. At one end: equal weights (simple MA). At the other: weights that decay to zero so fast that only the latest observation matters (naïve forecast). Exponential smoothing (Section 15.2) is the elegant middle ground — it uses a single parameter to generate an infinite sequence of geometrically decaying weights automatically. No need to pick weights by hand.

15.4.9 Real-World & Domain Connection

Weighted moving averages are standard in technical stock analysis. The "exponential moving average" (EMA) used by traders is essentially exponential smoothing — it's a weighted moving average over all past data with geometrically decaying weights. Short-term traders use 12-day and 26-day EMAs; their crossover generates buy/sell signals. In supply chains, weighted moving averages help forecast perishable goods where last week's demand is objectively more informative than demand from a month ago. In weather forecasting, weighted averages of recent observations feed into nowcasting systems that predict the next hour's conditions.

15.5 Double Exponential Smoothing (Holt's Method)

Hook. Single exponential smoothing has a blind spot: it cannot see a trend. If sales are climbing by 100 units every month, single smoothing will always be 100 units behind. Holt's method gives the forecast eyes — it tracks not just where you are, but how fast you're moving.

15.5.1 Motivation — Beyond Single Smoothing

Intuition + Analogy. You're driving on a highway. Single exponential smoothing is like looking only at your current position on the GPS. Holt's method is like looking at both your position AND your speedometer. If you're going 80 mph, you don't just know where you are — you know where you'll be in one hour. The "level" is your position. The "trend" is your speed. The forecast is: current position + (speed × time ahead).

The analogy captures the additive structure perfectly: . It breaks in that real speed can change abruptly; Holt's trend is smoothed, so it adjusts gradually.

Single exponential smoothing only handles the level of the series. When a time series has a trend — a persistent upward or downward movement — single smoothing systematically lags. Holt's double exponential smoothing adds a second smoothed component for the trend.

15.5.2 The Two Equations

Formalize. Holt's method maintains two smoothed quantities at each time step and produces a -step-ahead forecast.

Level equation:

This is single exponential smoothing with one crucial change. Instead of using alone, it uses — the previous level plus the previous trend. This adjusts for expected movement.

Trend equation:

The trend smooths the difference between successive levels. is the observed change in level — think of it as the "instantaneous trend." controls how much we trust this new observation vs. the accumulated trend.

Forecast equation (for periods ahead):

Where:

  • — smoothed level at time
  • — smoothed trend at time
  • — level smoothing parameter,
  • — trend smoothing parameter,
  • — forecast horizon (number of periods ahead)

The textbook (Anderson et al., §17.4, eq. 17.7–17.9) uses for the trend estimate where the lecture uses . The equations are structurally identical: , , .

15.5.3 Symbol Registry

Symbol Meaning Type Domain
Smoothed level at time scalar Any real number
Smoothed trend at time scalar Any real number
Level smoothing parameter scalar
Trend smoothing parameter scalar
Actual value at time scalar Any real number
-step-ahead forecast scalar Any real number
Forecast horizon (number of periods ahead) integer

15.5.4 Connection to Single Exponential Smoothing

If you remove the trend term from the level equation:

This is exactly single exponential smoothing, with playing the role of . Holt's method is single exponential smoothing plus trend tracking.

15.5.5 Initialization

For the first time step:

  • Set — same convention as single smoothing: no prior level available.
  • Set — with only one data point, you cannot estimate a trend.

Notation note: The textbook (Anderson et al.) uses a different initialization: and (the first observed difference as the initial trend). The professor's convention () is simpler and the one the exam expects. Both are valid; they converge after a few periods. Use for exam computations.

15.5.6 Worked Numerical Example

Given annual GDP data:

Year GDP ()
2000 1451
2001 1499
2002 1541
2003 1615
2004 1690

Choose and .

Initialization (2000):

2001 computation:

2002 computation:

2003 computation:

Summary table:

Year
2000 1451 1451.000 0.000 1451.00
2001 1499 1489.400 15.360 1504.76
2002 1541 1533.752 26.957 1560.71
2003 1615 1604.142 44.330 1648.47
2004 1690

Sense-check: The trend grows from 0 → 15.36 → 26.96 → 44.33, reflecting an accelerating upward trend in GDP. The forecasts consistently run ahead of the last actual, correctly anticipating growth. The level smooths the raw GDP values.

15.5.7 Extreme Values of Alpha and Beta

: . The level never updates from new data — you trust your previous smoothed estimate completely.

: . The level is entirely the latest actual — you discard all history.

: . The trend never updates. With , the trend stays zero forever and the model collapses to single exponential smoothing.

: . The trend is entirely the most recent level change — no smoothing, maximum responsiveness.

15.5.8 Assumptions & Scope

Scope. Holt's method assumes the time series has a linear trend and no seasonality. If the trend is nonlinear (accelerating or decelerating), Holt's will lag or overshoot — consider a damped trend variant. If seasonality exists, upgrade to Holt-Winters (triple exponential smoothing). Both and must be in . The model needs at least 3–4 periods before the trend estimate becomes reliable.

15.5.9 Visual Intuition

Plot the raw time series as dots. Overlay three lines:

  1. The level — a smoothed version of the raw data, similar to single exponential smoothing.
  2. The trend — not directly visible on the same scale; plot it on a secondary axis or note its growth in a table.
  3. The forecast — this line leads the raw data. In an uptrend, it sits above the most recent actual, anticipating the next rise. The gap between and is the one-step-ahead trend correction.

For the GDP example: while . The forecast is higher — Holt's "knows" GDP is trending up and builds that expectation into the prediction.

15.5.10 Pitfalls

Common traps:

  1. Forgetting the trend term in the level equation. Beginners write — that's single smoothing. The correct form includes inside the second term.
  2. Mixing up which smoothing constant goes where. controls the level, controls the trend. They are independent. High + low = responsive level, sticky trend. Low + high = sticky level, jumpy trend.
  3. Using without understanding why. The trend is zero at initialization because one point cannot reveal a direction. If asked, the answer is: "A trend requires at least two observations."
  4. Applying Holt's to seasonal data. The trend will be contaminated by seasonal swings. Always decompose first (Section 15.5.12).

15.5.11 Student Questions and Answers

Q: Why is the first trend value set to zero?

A: Because you cannot estimate a trend from a single data point. A trend requires at least two observations — you need to see a change over time to say whether things are increasing or decreasing. With only , no change is observable, so the trend starts at zero.

Q: For the level at year 2000, why is not multiplied by ? The formula says .

A: At the initial time step, you do not have or . The formula applies from the second time step onward. For the first row, the convention is — same as in single exponential smoothing when there is no prior information.

Q: When in the forecast equation, what does that mean?

A: It means you are forecasting two periods ahead. If you're at time and want the forecast for time , use . For it's one period ahead, for it's three periods ahead. This structure lets you forecast any horizon by extrapolating the current trend. At , assuming the trend stays linear, .

15.5.12 Time Series Decomposition — The Pre-Processing Step

Before choosing among single, double, or triple smoothing, decompose your time series into components: trend, seasonality, and residual (irregular noise). Plot the data. Look for an upward or downward drift (trend). Look for regular repeating waves (seasonality). If decomposition shows a clear trend, use double smoothing. If it also shows seasonality, use triple smoothing. If neither, single smoothing may be enough.

15.5.13 Broader Context — Triple Exponential Smoothing

If your time series has a seasonal component, you need triple exponential smoothing (Holt-Winters). It adds a third equation for seasonality alongside level and trend. Triple smoothing is not on the exam, but the key takeaway is: the exponential smoothing framework scales. Add components as your data's complexity demands.

15.5.14 Recap + Bridge

Recap: Holt's double exponential smoothing adds trend tracking to single exponential smoothing. Two equations — one for level (), one for trend () — and two parameters (, ). The forecast extends the current level along the current trend: .

Bridge: Holt's method handles trend but not seasonality. The next natural step is Holt-Winters (not on the exam). The lecture now shifts gears entirely — from forecasting to clustering — with Gaussian Mixture Models (Section 15.6), where the goal is grouping unlabeled data using probability distributions.

15.5.15 Real-World & Domain Connection

Holt's method (and its seasonal extension, Holt-Winters) powers operational forecasting across industry. Retailers use it for weekly sales forecasts that capture both the upward trend of a growing business and the seasonal spikes of holiday shopping. Energy companies forecast electricity demand with it — the trend captures economic growth, and an added seasonal component captures daily and weekly cycles. Airlines forecast passenger volumes. The method is embedded in SAP, Oracle, and most ERP systems' forecasting modules. Its durability comes from a rare combination: it handles the two most common time series features (level changes and trends) with only two parameters, runs in constant memory, and produces forecasts that a business analyst can explain to a VP.

15.6 Gaussian Mixture Models — Introduction

Hook. You have a pile of unlabeled data points. You suspect they came from three different sources — but nobody told you which point came from which source. Worse, the sources overlap. Can you untangle them using only the shape of the data? Gaussian Mixture Models say yes — by describing your data as a blend of bell curves.

15.6.1 Motivation — From Unlabeled Data to Patterns

Intuition + Analogy. Imagine the Nilgiri Hills or the Himalayan range viewed from a distance. Each hill, seen in profile, traces a bell curve — a Gaussian distribution. A mountain range is a mixture of these hills. They overlap. Each has a different peak (mean ), a different spread (variance ). Where two hills overlap, the ground belongs partially to both. A GPS coordinate in that overlap zone has some probability of being on Hill A and some on Hill B.

That's a Gaussian Mixture Model. Your data points are the coordinates. The hills are the Gaussian components. The task: given only the coordinates (the data), reconstruct the hills — their positions, their widths, and how much each hill contributes to the landscape.

The analogy breaks in one way: real Gaussians extend infinitely in all directions, while mountains have finite bases. But the overlap intuition — points in the boundary zone have fractional membership — is exactly right.

A Gaussian Mixture Model (GMM) is a probabilistic model for clustering. It assumes your data came from a mixture of several Gaussian distributions. Each Gaussian has its own mean and covariance . The goal: recover those underlying Gaussians. That tells you which cluster each data point likely came from.

Why Gaussians? The Central Limit Theorem pushes most aggregated phenomena toward normality. The Gaussian is the most mathematically tractable distribution and the natural default.

15.6.2 The Clustering Analogy — Hard vs. Soft

Formalize. Traditional clustering (k-means) draws hard boundaries: each point belongs to exactly one cluster. This is hard clustering — like a strict headmaster assigning each student to exactly one section.

GMM does soft clustering. It assigns each point a probability of belonging to each Gaussian component. A point can be 70% from component A, 25% from B, and 5% from C.

Hard clustering struggles with natural phenomena. Real data rarely forms perfectly separated spheres. Boundaries blur. GMM's soft assignments handle overlap gracefully — they quantify ambiguity rather than pretending it doesn't exist.

15.6.3 From Univariate to Multivariate Gaussians

A single Gaussian (normal) distribution in one dimension:

Where is the mean (center) and is the variance (spread).

Real data is rarely one-dimensional. With variables, you need the multivariate Gaussian:

Breaking this down term by term:

  1. Normalization constant: — ensures the total probability integrates to 1. The determinant appears because the covariance matrix stretches space; we need to account for that stretching.
  2. Mahalanobis distance: — this is the squared distance from to the mean , but adjusted for correlation. If two variables are strongly correlated, moving along the correlation direction is "easier" (more probable) than moving across it. encodes this geometry.
Symbol Meaning Type Dimensions
Data point vector vector
Mean vector vector
Covariance matrix matrix
Determinant of scalar
Inverse of matrix
Number of dimensions integer

Special case — : When , , , . The multivariate formula collapses to the univariate one. Check: the normalization becomes ✓. The exponent becomes ✓.

15.6.4 The Covariance Matrix — Why It Matters

When you have a single variable, you have variance — the spread. With multiple variables, you also have covariance — how two variables move together.

For variables, is :

  • Diagonal: — variances of each variable.
  • Off-diagonal: — covariance between variables and .

is a matrix, not the summation symbol . It captures all pairwise relationships. Its determinant measures the generalized "volume" of the distribution. Its inverse appears in the Mahalanobis distance, rotating and scaling space so that the distribution becomes a standard spherical Gaussian.

15.6.5 The Overlap Problem — Why GMM Gets Interesting

Consider two Gaussian clusters with different means and overlapping tails. A data point falls in the overlap region. Which cluster does it belong to? Was it drawn from distribution A or B? There is genuine ambiguity. GMM addresses this by estimating responsibilities — the probability that a given point came from each component. Points in clear regions get near-certain assignments (). Points in the overlap get fractional probabilities ().

15.6.6 A GMM Formally

A GMM with components models the data density as:

Where:

  • is the mixing coefficient for component — the prior probability that a random point comes from component . , .
  • is the multivariate Gaussian density for component .

The parameters to estimate: . This is done via the Expectation-Maximization (EM) algorithm — not covered in this lecture, but the conceptual foundation is laid here.

15.6.7 Assumptions & Scope

Scope. GMM assumes the data is generated by a mixture of Gaussians. If the true clusters are non-Gaussian (e.g., banana-shaped, ring-shaped), GMM will impose elliptical shapes that may not fit. The number of components must be chosen — too few underfit, too many overfit. Model selection criteria like AIC or BIC help choose . GMM also assumes you have enough data per component to estimate the covariance matrix; with dimensions, each full covariance matrix has free parameters.

15.6.8 Visual Intuition

Picture a 2D scatter plot. k-means draws Voronoi cells — straight-line boundaries partitioning the plane into exclusive regions. GMM draws nested ellipses — each ellipse is a contour of constant probability for one Gaussian component. Where ellipses overlap, both components claim the points inside. The ellipses can be circles (spherical covariance), axis-aligned ellipses (diagonal covariance), or tilted ellipses (full covariance) — the shape depends on .

For the hill-station analogy: draw three overlapping bell curves along a 1D axis. Each curve peaks at its mean. At any , the height of the mixture is the sum of the three curves' heights, weighted by . The dominance at is determined by which curve is tallest there.

15.6.9 Pitfalls

Common traps:

  1. Confusing (covariance matrix) with (summation). They look similar but are completely different. is a matrix capturing spread and correlation. adds numbers.
  2. Thinking GMM and k-means are the same. k-means gives hard labels; GMM gives probabilities. k-means assumes spherical, equal-sized clusters; GMM can model elongated, tilted, differently-sized clusters via .
  3. Ignoring the mixing coefficients . If one component has and another has , the second component represents a rare subgroup. The values matter for interpretation.
  4. Assuming GMM works out-of-the-box with no choices. You must pick (number of components) and the covariance structure (full, diagonal, tied, spherical). These choices dramatically affect results.

15.6.10 Recap + Bridge

Recap: A Gaussian Mixture Model describes data as a weighted sum of Gaussian distributions. Each component has a mean , a covariance , and a mixing weight . Unlike k-means, GMM provides soft assignments — each point gets a probability of belonging to each component.

Bridge: Fitting a GMM requires the Expectation-Maximization (EM) algorithm, covered in the next session. The multivariate Gaussian density you learned here is the building block. EM iterates between guessing which component each point came from (E-step) and updating the Gaussian parameters to best match those guesses (M-step). The math builds directly on the formulas in this section.

15.6.11 Real-World & Domain Connection

GMMs power customer segmentation in marketing, grouping shoppers by purchase behavior. They detect anomalies in fraud systems, where points with low probability under the mixture are flagged. In computer vision, they segment images by modeling pixel colors as a mixture of Gaussians. In speech recognition, phoneme distributions were modeled as GMMs — the dominant approach before deep learning. In bioinformatics, GMMs cluster gene expression data to discover functionally related groups of genes. The soft-clustering property is especially valuable in medicine. A patient's symptoms may reflect multiple underlying conditions at once, something hard clustering cannot model.

Exam Guidance Summary

Exam note: Numerical problems dominate. Show all work in tables. Write assumptions in full detail. The professor emphasized: "Try to determine which forecasting method is the best forecast" — model comparison is a recurring theme.

The exam covers:

  • Moving averages — both odd and even window sizes. Know the placement rule: odd → middle; even -th position. Expect to compute 2-quarter, 3-quarter, 4-quarter, 2-year, 3-year, 4-year, and 5-year moving averages.
  • Weighted moving averages — weights must sum to 1 and be between 0 and 1. Expect computation with given weights.
  • Single exponential smoothing — know both forms: and the error-correction form . Expect numerical problems where you forecast with different alpha values and interpret which is better. Know why .
  • Double exponential smoothing (Holt's method) — know the level equation and the trend equation . Expect a numerical where you compute , , and with given and . Know why .
  • Performance measures — MSE, MAD, MAPE, LAD. Know how to compute each and what they emphasize. Expect interpretation: given errors, which model is best?
  • Interpretation questions — what does a small alpha mean? Large alpha? Why is the first trend zero? Why is the first forecast equal to the first actual? What does do to Holt's method?

Not on the exam: Triple exponential smoothing (Holt-Winters); deep statistical theory of centering for moving averages; the EM algorithm for GMM fitting; detailed mathematical derivation of the multivariate Gaussian.

Format: Numerical problems dominate. Show all work in tables. Write assumptions in full detail.

Study advice: Focus on the worked examples. Redo the computations yourself. The six-model alpha comparison (with MSE calculation for each) and the Holt's GDP example are excellent practice problems. For each method, be able to: (1) state the formula, (2) initialize correctly, (3) compute step-by-step in a table, (4) evaluate with MSE/MAD, and (5) justify which model is best.

Key Industry Applications

  • Moving averages: Financial analysis (stock price smoothing, technical indicators like golden cross / death cross), demand forecasting, economic trend analysis, epidemiology (7-day rolling averages of case counts), and any domain needing a simple, interpretable baseline forecast. Moving averages are also fundamental building blocks in signal processing as low-pass filters.
  • Exponential smoothing: Inventory management, supply chain forecasting, and any streaming data context where you need a lightweight model that adapts to recent changes. Used in production forecasting systems (SAP, Oracle ERP) where simplicity and interpretability matter more than sophistication. The error-correction form connects directly to modern optimization methods like RMSprop in deep learning.
  • Weighted moving averages: Situations where recent observations are objectively more relevant — perishable goods demand forecasting, short-term weather nowcasting, social media trend tracking, and financial technical analysis (the "exponential moving average" or EMA used by traders).
  • Double exponential smoothing (Holt's method): Forecasting series with clear trends — GDP growth projections, population forecasting, technology adoption curves, retail sales with year-over-year growth, and energy demand forecasting. Holt-Winters (triple exponential smoothing) extends this to seasonal data and powers operational forecasting in retail, energy, and aviation.
  • Gaussian Mixture Models: Customer segmentation (grouping shoppers by purchase patterns), anomaly detection (flagging low-probability points under the mixture), image segmentation (foreground/background separation in computer vision), speech recognition (modeling phoneme distributions — the dominant pre-deep-learning approach), bioinformatics (clustering gene expression data), and as a generative model for synthetic data generation.
  • Model comparison and error metrics: A universal skill — every predictive modeling project, from Kaggle competitions to production ML systems, requires choosing between candidate models using quantitative criteria. MSE/MAD/MAPE/LAD are the four lenses through which forecast (and, more broadly, prediction) quality is measured.

ISM Lecture 15 notes · Time Series Analysis — Smoothing and Forecasting

Introduction to Statistical Methods· postgraduate· 2026-07-07

Sections Breakdown

115.1 Moving Averages — Review and Extension

Fixed-window averaging for time series smoothing. Covers odd vs even window sizes, placement rules, worked examples for 3-year and quarterly moving averages, assumptions, pitfalls, and real-world applications in finance and epidemiology.

215.2 Exponential Smoothing

Weighted forecasting where recent observations dominate and past observations decay geometrically. Covers the weighted-average and error-correction forms, alpha interpretation, infinite expansion derivation, initialization, worked examples comparing alpha values, and connection to deep learning optimizers.

315.3 Performance Measures for Forecast Evaluation

Quantitative metrics for comparing forecasting models. Covers MSE (squared error penalty), MAD (absolute error), MAPE (percentage error), and LAD (worst-case error), with a worked example and model selection guidance.

415.4 Weighted Moving Averages

Moving averages with custom per-position weights that sum to 1. Covers the formula, worked example, key rules, weight selection strategies, and the bridge to exponential smoothing.

515.5 Double Exponential Smoothing (Holt's Method)

Trend-tracking extension of single exponential smoothing with separate level and trend equations. Covers the two smoothing parameters, initialization, a fully worked GDP forecasting example, extreme parameter values, and time series decomposition as a pre-processing step.

615.6 Gaussian Mixture Models — Introduction

Probabilistic soft clustering using mixtures of Gaussian distributions. Covers hard vs soft clustering, univariate to multivariate Gaussian extension, the covariance matrix, mixing coefficients, the formal GMM density, and an overview of the EM algorithm.

7Exam Guidance Summary

Consolidated exam guidance covering numerical problem patterns, key formulas to memorize, interpretation questions, and study advice.

8Key Industry Applications

Real-world uses of moving averages, exponential smoothing, Holt's method, and GMMs across finance, supply chain, energy, computer vision, and bioinformatics.

Postgraduate students in Statistics and Business Analytics

Exam Revision Notes

Below is the distilled, exam-ready core of this lecture. Every entry is built from the full textbook notes above. Use this section for rapid review — but if something doesn't make sense, go back to the full explanation in the main content.

Below is the distilled, exam-ready core of this lecture. Every entry is built from the full textbook notes above. Use this section for rapid review — but if something doesn't make sense, go back to the full explanation in the main content.

Moving Averages — Window Placement Rules

Must-know: Odd window size k: forecast lands on the middle time step. Even k: forecast lands at the k-th position. For k=3 covering (t-2, t-1, t), the forecast goes at t-1. For k=4 covering (t-3, t-2, t-1, t), the forecast goes at t. This is the only structural difference between even and odd MAs.

Top pitfall: Comparing even and odd moving averages row-by-row instead of by error metrics. The placement rules differ, so row alignment is meaningless — compare via MSE or MAD against the actual values.

Self-check: If you have a 5-period moving average, what time index gets the first forecast?

Connects to: Exponential Smoothing (15.2), Weighted Moving Averages (15.4)

Exponential Smoothing — Alpha and Its Two Forms

Must-know: The forecast blends the last actual and the last forecast: weighted-average form F_{t+1} = alpha * Y_t + (1 - alpha) * F_t; error-correction form F_{t+1} = F_t + alpha * (Y_t - F_t). Alpha in [0,1] is the responsiveness knob. Small alpha = smooth and slow; large alpha = reactive and fast. Always initialize F_1 = Y_1 because no prior information exists.

Top pitfall: Confusing F_t and Y_t. F_t is the forecast made at time t-1 for time t, and Y_t is the actual at time t. The error Y_t - F_t is only known after time t.

Self-check: What happens to the forecast when alpha = 0 and when alpha = 1?

Connects to: Performance Measures (15.3), Holt's Method (15.5)

Performance Measures — MSE, MAD, MAPE, LAD

Must-know: MSE squares errors and punishes large ones disproportionately. MAD uses absolute values, same units as data, less outlier-sensitive. MAPE expresses error as percentage, enabling cross-dataset comparison. LAD reports the single worst error for safety-critical bounds. Always pick the model with smallest aggregate error — never judge by a single data point.

Top pitfall: Picking a model because its forecast "looks right" instead of computing and comparing aggregate error metrics across all time steps.

Self-check: Which metric would you use if one large error is catastrophic but average performance is less important?

Connects to: Exponential Smoothing (15.2), Weighted Moving Averages (15.4), Holt's Method (15.5)

Weighted Moving Averages

Must-know: A weighted moving average uses per-position weights w_i that must sum to exactly 1. The most recent observation gets the largest weight. When all w_i = 1/k, it collapses to the simple MA. Weights are a design choice — the rest of the procedure (sliding, error analysis) is identical to the unweighted MA.

Top pitfall: Weights that don't sum to exactly 1 — this scales the forecast wrong and causes systematic over- or under-shooting. Always check the sum.

Self-check: If the most recent observation gets weight 0.6, the next 0.3, and the oldest 0.1, do these weights sum correctly?

Connects to: Moving Averages (15.1), Exponential Smoothing (15.2)

Holt's Double Exponential Smoothing — Level and Trend

Must-know: Holt's method maintains two smoothed components. Level: L_t = alpha * Y_t + (1-alpha) * (L_{t-1} + T_{t-1}). Trend: T_t = beta * (L_t - L_{t-1}) + (1-beta) * T_{t-1}. Forecast: F_{t+k} = L_t + k * T_t. Initialize L_1 = Y_1, T_1 = 0 (trend requires at least two observations). Alpha controls level responsiveness; beta controls trend responsiveness.

Top pitfall: Forgetting the trend term T_{t-1} in the level equation. Writing L_t = alpha * Y_t + (1-alpha) * L_{t-1} is single smoothing, not Holt's method — the forecast will systematically lag.

Self-check: What happens to Holt's method when beta = 0 and T_1 = 0?

Connects to: Exponential Smoothing (15.2), Time Series Decomposition (15.5.12)

Gaussian Mixture Models — Soft Clustering with Gaussians

Must-know: GMM models data as a weighted sum of K Gaussian distributions. Each point gets a probability of belonging to each component (soft clustering), unlike k-means which forces hard labels. The multivariate Gaussian uses the covariance matrix Sigma for correlation-adjusted Mahalanobis distances. Mixing coefficients pi_k sum to 1. Fitting uses the EM algorithm.

Top pitfall: Confusing Sigma (covariance matrix, d x d) with the summation symbol sum. They look similar but are completely different concepts. Sigma captures spread and correlation; sum adds numbers.

Self-check: How does GMM handle a data point that falls in the overlap region between two Gaussian components?

Connects to: Moving Averages (15.1), Holt's Method (15.5), Normal Distribution from Lecture 8

Model Selection — Choosing the Best Forecasting Method

Must-know: Compute MSE or MAD for every candidate model across all time steps. The model with the smallest error wins. For exams, use the minimum MSE criterion. But beware of overfitting: alpha near 0.99 may minimize in-sample MSE but track noise. Always show your work in a table — it makes the computation traceable and grading easier.

Top pitfall: Judging a model by a single forecast or data point. One data point proves nothing. Always compare aggregate error across all available time steps.

Self-check: A model with alpha=0.99 has the lowest MSE on training data. Should you deploy it?

Connects to: Performance Measures (15.3), Exponential Smoothing (15.2), Moving Averages (15.1)

Was this lecture useful?

Loading comments…
🤖

BitsNotes AI Assistant

Subject Notes Assistant

Configure AI Chat

Choose how to access the chatbot
Have your own API key?

Switch to "Bring Your Own Key" tab above for unlimited access with any OpenAI-compatible provider.

🔑 Enter API key above to fetch live models from provider, or enter model name manually.
OpenAI-Compatible API Support

Choose any provider preset (Gemini, DeepSeek, Kimi, GLM, MiniMax, Qwen, OpenAI, Groq, Ollama, etc.) or enter a custom endpoint URL.

Security & Privacy First

Your API key is sent directly from your browser to your specified provider. BitsNotes servers never store or see your key.