What is Adaptive?
One tool available in forecasting the trendiness of the breakout is the coefficient of determination ( ), a statistical measurement.
The indicates linear strength between the security's price (the Y - axis) and time (the X - axis). The is the percentage of squared error that the can eliminate if it were used as the predictor instead of the mean value. If the were 0.99, then the would eliminate 99% of the error for prediction versus predicting closing prices using a .
is used here to derive a T3 factor used to modify price before passing price through a six-pole non-linear Kalman filter.
What is the T3 moving average?
Better Moving Averages Tim Tillson
November 1, 1998
Tim Tillson is a software project manager at Hewlett-Packard, with degrees in Mathematics and Computer Science. He has privately traded options and equities for 15 years.
"Digital filtering includes the process of smoothing, predicting, differentiating, integrating, separation of signals, and removal of noise from a signal. Thus many people who do such things are actually using digital filters without realizing that they are; being unacquainted with the theory, they neither understand what they have done nor the possibilities of what they might have done."
This quote from R. W. Hamming applies to the vast majority of indicators in . Moving averages, be they simple, weighted, or exponential, are lowpass filters; low frequency components in the signal pass through with little attenuation, while high frequencies are severely reduced.
"Oscillator" type indicators (such as , Momentum, ) are another type of digital filter called a differentiator.
Tushar Chande has observed that many popular oscillators are highly correlated, which is sensible because they are trying to measure the of the underlying time series, i.e., are trying to be the first and second derivatives we all learned about in Calculus.
We use moving averages (lowpass filters) in to remove the random noise from a time series, to discern the underlying trend or to determine prices at which we will take action. A perfect moving average would have two attributes:
It would be smooth, not sensitive to random noise in the underlying time series. Another way of saying this is that its derivative would not spuriously alternate between positive and negative values.
It would not lag behind the time series it is computed from. Lag, of course, produces late buy or sell signals that kill profits.
The only way one can compute a perfect moving average is to have knowledge of the future, and if we had that, we would buy one lottery ticket a week rather than trade!
Having said this, we can still improve on the conventional simple, weighted, or exponential moving averages. Here's how:
Two Interesting Moving Averages
We will examine two benchmark moving averages based on analysis.
In both cases, a line of length n is fitted to price data.
I call the first moving average ILRS, which stands for Integral of Slope. One simply integrates the slope of a line as it is successively fitted in a moving window of length n across the data, with the constant of integration being a of the first n points. Put another way, the derivative of ILRS is the slope. Note that ILRS is not the same as a ( ) of length n, which is actually the midpoint of the line as it moves across the data.
We can measure the lag of moving averages with respect to a linear trend by computing how they behave when the input is a line with unit slope. Both (n) and ILRS(n) have lag of n/2, but ILRS is much smoother than .
Our second benchmark moving average is well known, called EPMA or End Point Moving Average. It is the endpoint of the line of length n as it is fitted across the data. EPMA hugs the data more closely than a simple or of the same length. The price we pay for this is that it is much noisier (less smooth) than ILRS, and it also has the annoying property that it overshoots the data when linear trends are present.
However, EPMA has a lag of 0 with respect to linear input! This makes sense because a line will fit linear input perfectly, and the endpoint of the LR line will be on the input line.
These two moving averages frame the tradeoffs that we are facing. On one extreme we have ILRS, which is very smooth and has considerable phase lag. EPMA has 0 phase lag, but is too noisy and overshoots. We would like to construct a better moving average which is as smooth as ILRS, but runs closer to where EPMA lies, without the overshoot.
A easy way to attempt this is to split the difference, i.e. use (ILRS(n)+EPMA(n))/2. This will give us a moving average (call it IE /2) which runs in between the two, has phase lag of n/4 but still inherits considerable noise from EPMA. IE /2 is inspirational, however. Can we build something that is comparable, but smoother? Figure 1 shows ILRS, EPMA, and IE /2.
Any thoughtful student of filter theory (or resolute experimenter) will have noticed that you can improve the smoothness of a filter by running it through itself multiple times, at the cost of increasing phase lag.
There is a complementary technique (called twicing by J.W. Tukey) which can be used to improve phase lag. If L stands for the operation of running data through a low pass filter, then twicing can be described by:
L' = L(time series) + L(time series - L(time series))
That is, we add a moving average of the difference between the input and the moving average to the moving average. This is algebraically equivalent to:
This is the or , popularized by Patrick Mulloy in TASAC (January/February 1994).
In our taxonomy, has some phase lag (although it exponentially approaches 0) and is somewhat noisy, comparable to IE /2 indicator.
We will use these two techniques to construct our better moving average, after we explore the first one a little more closely.
An n-day has smoothing constant alpha=2/(n+1) and a lag of (n-1)/2.
Thus (3) has lag 1, and (11) has lag 5. Figure 2 shows that, if I am willing to incur 5 days of lag, I get a smoother moving average if I run (3) through itself 5 times than if I just take (11) once.
This suggests that if EPMA and have 0 or low lag, why not run fast versions (eg (3)) through themselves many times to achieve a smooth result? The problem is that multiple runs though these filters increase their tendency to overshoot the data, giving an unusable result. This is because the amplitude response of and EPMA is greater than 1 at certain frequencies, giving a gain of much greater than 1 at these frequencies when run though themselves multiple times. Figure 3 shows (7) and EPMA(7) run through themselves 3 times. DEMA^3 has serious overshoot, and EPMA^3 is terrible.
The solution to the overshoot problem is to recall what we are doing with twicing:
(n) = (n) + (time series - (n))
The second term is adding, in effect, a smooth version of the derivative to the to achieve . The derivative term determines how hot the moving average's response to linear trends will be. We need to simply turn down the to achieve our basic building block:
(n) + (time series - (n))*.7;
This is algebraically the same as:
I have chosen .7 as my factor, but the general formula (which I call "Generalized Dema") is:
GD (n,v) = (n)*(1+v)-EMA( (n))*v,
Where v ranges between 0 and 1. When v=0, GD is just an , and when v=1, GD is . In between, GD is a cooler . By using a value for v less than 1 (I like .7), we cure the multiple overshoot problem, at the cost of accepting some additional phase delay. Now we can run GD through itself multiple times to define a new, smoother moving average T3 that does not overshoot the data:
T3(n) = GD ( GD ( GD (n)))
In filter theory parlance, T3 is a six-pole non-linear Kalman filter. Kalman filters are ones which use the error (in this case (time series - (n)) to correct themselves. In , these are called Adaptive Moving Averages; they track the time series more aggressively when it is making large moves.
VIP Membership Info: https://www.patreon.com/algxtrading/membership