A moving average-based cache compresses a window of recent key-value pairs into a single summary pair. As illustrated, the four most recent key vectors ($\mathbf{k}_{i-3}$ to $\mathbf{k}_{i}$) and value vectors ($\mathbf{v}_{i-3}$ to $\mathbf{v}_{i}$) are averaged independently. This process creates a memory component consisting of one summary key and one summary value, effectively reducing the memory size from four pairs to one (a size of 1x2). The specific calculations are: $\text{Memory Key} = \frac{\mathbf{k}_{i-3}+\mathbf{k}_{i-2}+\mathbf{k}_{i-1}+\mathbf{k}_{i}}{4}$ $\text{Memory Value} = \frac{\mathbf{v}_{i-3}+\mathbf{v}_{i-2}+\mathbf{v}_{i-1}+\mathbf{v}_{i}}{4}$