Co-authored-by: Claude Opus 4.5 <noreply@anthropic.com> Co-authored-by: aider (openrouter/anthropic/claude-sonnet-4) <aider@aider.chat> Co-authored-by: Warp <agent@warp.dev>
7.3 KiB
KAMA: Kaufman's Adaptive Moving Average
"Perry Kaufman asked a simple question: 'Why should I use the same smoothing in a trending market as in a chopping market?' KAMA is the answer."
KAMA (Kaufman's Adaptive Moving Average) is an intelligent moving average that adjusts its smoothing speed based on market noise. When the price is moving steadily (high signal-to-noise ratio), KAMA speeds up to capture the trend. When the price is chopping sideways (low signal-to-noise ratio), KAMA slows down to filter out the noise.
Historical Context
Perry Kaufman introduced KAMA in his book Smarter Trading (1998). It was one of the first widely adopted adaptive indicators, solving the problem of "whipsaws" in sideways markets without sacrificing responsiveness in trends.
Architecture & Physics
KAMA uses an Efficiency Ratio (ER) to drive the smoothing constant of an EMA.
- Efficiency Ratio (ER): Measures the fractal efficiency of price movement.
ER = \frac{\text{Net Change}}{\text{Sum of Absolute Changes}}- ER approaches 1.0 in a straight line trend.
- ER approaches 0.0 in pure noise.
- Smoothing Constant (SC): Scales between a "Fast" EMA (e.g., 2-period) and a "Slow" EMA (e.g., 30-period) based on ER.
Mathematical Foundation
ER = \frac{|P_t - P_{t-n}|}{\sum_{i=0}^{n-1} |P_{t-i} - P_{t-i-1}|}
SC = \left( ER \times (\text{FastAlpha} - \text{SlowAlpha}) + \text{SlowAlpha} \right)^2
\text{KAMA}_t = \text{KAMA}_{t-1} + SC \times (P_t - \text{KAMA}_{t-1})
Note the squaring of the SC, which suppresses the response to noise even further.
Performance Profile
KAMA is very efficient, with O(1) complexity thanks to the incremental volatility update.
Operation Count (Streaming Mode, Scalar)
Hot path (buffer full):
| Operation | Count | Cost (cycles) | Subtotal |
|---|---|---|---|
| ABS | 3 | 1 | 3 |
| ADD/SUB | 3 | 1 | 3 |
| DIV | 1 | 15 | 15 |
| FMA | 2 | 4 | 8 |
| MUL | 1 | 3 | 3 |
| CMP | 2 | 1 | 2 |
| Total | 12 | — | ~34 cycles |
The hot path consists of:
- Volatility update:
diff_in = |new - prev|,diff_out = |oldest - next_oldest|— 2 ABS + 2 ADD/SUB - Change calculation:
|current - oldest|— 1 ABS - Efficiency Ratio:
change / volatility— 1 DIV - Smoothing Constant:
FMA(er, fast-slow, slow), thensc * sc— 1 FMA + 1 MUL - KAMA update:
FMA(sc, price - kama, kama)— 1 FMA + 1 SUB - Bounds checks (ER cap, div-by-zero guard) — 2 CMP
Warmup path (building volatility sum):
| Operation | Count | Cost (cycles) | Subtotal |
|---|---|---|---|
| ABS | 1 | 1 | 1 |
| ADD | 1 | 1 | 1 |
| Total | 2 | — | ~2 cycles |
During warmup, only accumulates diff_in without removal.
Batch Mode (SIMD Analysis)
KAMA is an IIR filter with adaptive alpha — not vectorizable across bars due to recursive state dependency. The sliding-window volatility sum uses O(1) incremental updates rather than O(n) window scans.
| Optimization | Benefit |
|---|---|
| FMA instructions | Saves ~2 cycles per bar |
| Incremental volatility | O(1) vs O(period) per bar |
| stackalloc buffer | Zero heap allocation for period ≤256 |
Quality Metrics
| Metric | Score | Notes |
|---|---|---|
| Accuracy | 7/10 | Flattens in noise, tracks in trends |
| Timeliness | 8/10 | Accelerates quickly in strong trends |
| Overshoot | 9/10 | Very stable in sideways markets |
| Smoothness | 8/10 | Aggressive noise filtering via SC² |
Validation
Validated against TA-Lib, Skender, Tulip, and Ooples.
| Library | Status | Notes |
|---|---|---|
| QuanTAlib | ✅ | Validated. |
| TA-Lib | ✅ | Matches Kama |
| Skender | ✅ | Matches GetKama |
| Tulip | ✅ | Matches kama |
| Ooples | ✅ | Matches CalculateKaufmanAdaptiveMovingAverage |
C# Implementation Considerations
Buffer Strategy
KAMA uses a RingBuffer for the sliding price window:
private readonly RingBuffer _buffer; // period + 1 values
The buffer stores period + 1 values to calculate the net change (Price[0] - Price[period]) while maintaining incremental volatility updates. Buffer indexing uses [^1] for newest, [0] for oldest, enabling O(1) change calculation.
State Management
State uses a record struct with LayoutKind.Auto:
[StructLayout(LayoutKind.Auto)]
private record struct State(double Kama, double VolatilitySum, double NextDiffOut, double LastValidValue);
| Field | Size | Purpose |
|---|---|---|
Kama |
8 bytes | Current KAMA value |
VolatilitySum |
8 bytes | Running sum of |
NextDiffOut |
8 bytes | Pre-staged diff for next removal |
LastValidValue |
8 bytes | NaN substitution fallback |
| Total | 32 bytes | Compact state for rollback |
The NextDiffOut field enables O(1) volatility updates by pre-calculating |buffer[0] - buffer[1]| — the value that will exit the window on the next bar.
FMA Optimization
Two FMA operations replace traditional arithmetic in the hot path:
Smoothing Constant calculation:
// sc = er * (fastAlpha - slowAlpha) + slowAlpha
double sc = Math.FusedMultiplyAdd(er, _fastAlpha - _slowAlpha, _slowAlpha);
sc *= sc; // SC squaring for noise suppression
KAMA update:
// kama = prevKama + sc * (val - prevKama)
_state.Kama = Math.FusedMultiplyAdd(sc, val - prevKama, prevKama);
Both follow the EMA smoothing pattern α·new + (1-α)·old expressed as FMA.
Precomputed Constants
Alpha values are computed once at construction:
_fastAlpha = 2.0 / (fastPeriod + 1); // Typically 2/3 ≈ 0.667
_slowAlpha = 2.0 / (slowPeriod + 1); // Typically 2/31 ≈ 0.065
The difference _fastAlpha - _slowAlpha is computed at runtime (not stored) since it's used only once per bar.
Static Calculate Path
The span-based method uses conditional allocation:
Span<double> buffer = bufSize <= 256 ? stackalloc double[bufSize] : new double[bufSize];
For typical periods (≤255), this allocates on the stack. The circular buffer logic uses modular arithmetic:
int prevIdx = (bufferIdx - 1 + bufSize) % bufSize;
int oldestIdx = (bufferIdx + 1) % bufSize;
bufferIdx = (bufferIdx + 1) % bufSize;
Efficiency Ratio Bounds
The implementation guards against edge cases:
double er = (volatility > 1e-10) ? change / volatility : 0.0;
if (er > 1.0) er = 1.0; // Cap floating-point drift
The epsilon guard (1e-10) prevents division by zero in flat markets, while the ER cap handles numerical precision issues where accumulated volatility might slightly undercount actual change.
Memory Layout Summary
| Component | Size | Notes |
|---|---|---|
| RingBuffer | 8 + period×8 bytes | Header + price array |
| State | 32 bytes | 4 doubles |
| p_state | 32 bytes | Rollback copy |
| Constants | 16 bytes | Fast/slow alpha |
| Per-instance | ~168 bytes | For period=10 |
Common Pitfalls
- Flatlining: In very choppy markets, KAMA can become almost horizontal. This is a feature, not a bug—it's telling you to stay out.
- Parameters: The standard settings are (10, 2, 30). 10 is the ER period, 2 is the fast EMA, 30 is the slow EMA. Tweaking the ER period changes the sensitivity to noise.
- Trend Following: KAMA is excellent for trailing stops because it flattens out when momentum stalls.