Skip to main content
Track Adaptive moving average
14 / 24
Library

2005issue C101

Range-dimension adaptive exponential filter

This archive article restates a historical adaptive moving average built from nested high-low spans. A range-based dimension is mapped to a clipped smoothing coefficient, then exponential smoothing is applied to each bar's midpoint after an even-lookback warm-up.

  • The default input is the midpoint of each bar's high and low, and the construction uses an even lookback with a supplied default of 16 bars.
  • Scaled high-low spans on the first half-window, the second half-window, and the full lookback form a range-based dimension only when all three measures are positive.
  • The smoothing coefficient is obtained by exponentiating -4.6 times the dimension estimate minus one, then clipped to the closed interval from 0.01 to 1.
  • Until N plus one bars are available the output equals the current observation; afterward it is an exponential blend of that observation and the prior output.
Entries in this reading2 entries

What the construction does

This archive article restates a historical workflow for an adaptive moving average. That name means a smoother whose blending weight changes with a measured market-state diagnostic instead of staying a fixed constant. The update is exponential smoothing, a one-step recurrence that mixes the newest observation with the previous output using a coefficient between zero and one.

Default observation and even lookback

The default observation fed to the filter is the midpoint of each bar's high and low. The construction uses an even lookback, meaning an even bar count that sets both the paired half-windows used for the range measures and the warm-up before the recurrence is applied. A supplied default for that length is 16 bars.

Range measures and range-based dimension

High-low spans are measured on the first half-window, the second half-window, and the full lookback, then scaled by the corresponding window length. A range-based dimension is a log-ratio of half-window and full-window high-low spans that rises when the path looks more space-filling over the lookback. The estimate is formed as the log of the sum of the two half-window range measures minus the log of the full-window range measure, divided by the log of 2, and only when all three range measures are positive.

Smoothing coefficient and recursive output

The smoothing coefficient is the weight applied to the current observation in the exponential update. It is derived from the dimension estimate by exponentiating -4.6 times the dimension estimate minus one, then forced to stay inside the closed interval from 0.01 to 1. After warm-up, the output is an exponential blend of the current observation and the prior output, using the coefficient and one minus the coefficient as the two weights. Until N plus one bars are available, the output is set equal to the current observation rather than the recursive update.

Educational research material, not investment advice. Historical source context does not establish present-day performance.
14 of 24 in the Adaptive moving average track
201034-37 pp.Next on Adaptive moving averageConstructing simple, exponential, and adaptive averagesA 14-period simple moving average, exponential moving average, and adaptive moving average can each be computed from the same ordered close series.
All readings on this track · 24 readings
  1. 1991Building variable-length moving averages from partitioned price changes
  2. 1991Variable-length moving average from change dispersion
  3. 1992Constructing volatility-adaptive exponential smoothing
  4. 1995Constructing an adaptive moving average with an efficiency ratio and filter
  5. 1995Two-gate breakout confirmation with adaptive averages
  6. 1995Building momentum-scaled adaptive moving averages
  7. 1995Adaptive length as a construction choice inside exponential smoothing
  8. 1998Testing price-channel breakouts with a lag-aware adaptive average
  9. 1998Constructing filters by nesting offsets and variable weights
  10. 1998Constructing an efficiency ratio adaptive average and entry filter
  11. 2001Encoding candle structure as a numeric filter
  12. 2001Adaptive averages driven by cycle-phase speed
  13. 2005Constructing an adaptive moving average from a fractal-dimension weight
  14. 2005Range-dimension adaptive exponential filter
  15. 2010Constructing simple, exponential, and adaptive averages
  16. 2010How a price-hugging smoother is assembled from ordinary averages
  17. 2013Evaluating an adaptive moving average against a same-window moving average
  18. 2016Three-layer confirmation: adaptive average, stochastic relative strength index, and stop-and-reverse
  19. 2017One-alpha reverse-path exponential smoothing
  20. 2018Pair two adaptive averages to filter swing turns
  21. 2018Two Adaptive moving averages as a confirmation pair
  22. 2018Constructing an adaptive filter for adoption-cycle reversals
  23. 2018Constructing a deviation-scaled adaptive moving average
  24. 2020Walk-forward and adaptive averages as two tests of the same trend
All 28 readings tagged Adaptive moving average
Also on Adaptive moving average5 readings