mirror of
https://github.com/huggingface/transformers.git
synced 2026-10-28 16:54:55 +08:00
* Add an FP8 backend to `QuantizedCache` * Reorder the FP8 states for beam search * Use an early return in `Fp8QuantizedLayer.reorder_cache` * Measure the quantized cache backends accurately The memory of the quantized states was under-reported: only `fp8` stores them as a plain tensor, `hqq` uses a `(tensor, metadata)` tuple and quanto a tensor subclass whose payload sits in its attributes, neither of which `numel() * element_size()` accounts for. Also report the KL divergence of the next-token distribution against the bf16 one, as the matching token count saturates on short generations, and copy the `cache_config` per call, which `generate` consumes. * Reset the FP8 scales, and cover the FP8 backend in the quantized layer tests * Address review on the FP8 quantized cache layer - `fp8_max` becomes a class attribute next to `fp8_dtype`, instead of being recomputed and stored on every instance. This matches how the FP8 constants are already defined in `integrations/finegrained_fp8.py` and `integrations/compressed_tensors.py`. - `Fp8QuantizedLayer` now overrides `lazy_initialization` to calibrate the scales, rather than doing it inline in the first `update` call. - `_quantized_keys` and `_quantized_values` are initialized to `None` in `QuantizedLayer.__init__`, so that they are always defined before the first `update`. This was missing for the quanto and hqq layers as well. - `.contiguous()` is now only called in `lazy_initialization`. The states passed to `update` come straight from a transpose in the attention layer, so they are genuinely non-contiguous during prefill, and `_quantize` propagates that layout. Every subsequent append goes through a `cat`, whose output is contiguous by construction, so the call is redundant there. - `_cat_fp8` is removed in favour of a plain `torch.cat`, which handles `float8_e4m3fn` natively on CPU and CUDA, for contiguous and non-contiguous inputs alike (checked on torch 2.8 through 2.14). * Trim the comments down to one line * Store the FP8 scale alongside the states it quantizes `_quantize` already returned a `(states, scale)` pair, but the two halves were then split across `_quantized_keys` and a separate `_key_scale` attribute, and zipped back together at every `_dequantize` call site. Keeping the pair as the layer's single quantized payload matches what `HQQQuantizedLayer` does with `(qtensor, meta)`, lets `_dequantize` be called on `_quantized_keys` directly like the base class does, and removes the `reset` override, since `QuantizedLayer.reset` already drops `_quantized_keys`. It also keeps the scale's rank internal to `_quantize` / `_dequantize`, so a future per-block backend can make it a tensor without changing the layer's attributes. * Say what the `.contiguous()` in `lazy_initialization` is actually for Nothing in `_quantize` needs a contiguous input: on strided states it computes the same scale and gives bit-identical dequantized values. What the call is for is the layout of the stored buffer. The states handed to `lazy_initialization` come from a transpose in the attention layer, while the ones `update` appends come out of `cat`, and the two disagree: without the call the buffer is laid out as `[B, S, H, D]` after the prefill and as `[B, H, S, D]` from the first decode step on. Normalizing it once keeps the strides the same for the buffer's whole life, which matters for the follow-up feeding these states to FP8 attention kernels. The test was building its states with `torch.randn(1, 2, 5, 8)`, so they were already contiguous and the assertion held whether or not the call was there. It now builds them the way the attention layer does. * Address @vasqu's review Drop the benchmark script: it belongs in the PR description rather than in the code base. Drop the `.contiguous()` in `lazy_initialization`. Nothing in `_quantize` needs it, and nothing reads the quantized states while they are still strided, so the layout only matters once something actually consumes the FP8 buffer. Better added then, with a consumer to justify it. Trim the class docstring down to what is specific to this backend, and the `_quantize` and `reorder_cache` ones down to one point each. The test now builds its states the way the attention layer does, so the strided path is covered. * One-line the docstrings and comments that fit on one line * Keep the FP8 state initialization out of the shared quantized layer * Split the quantized layer into a base and a group-wise class The group-wise options only belong to the integer backends, so they move to `GroupWiseQuantizedLayer` and `Fp8QuantizedLayer` no longer inherits them. `QuantizedCache` now rejects them for the `fp8` backend instead of silently replacing them. * Note which subtree a future fp8 variation belongs to Grouping along the head dimension keeps the states appendable, so it has no use for the residual window `GroupWiseQuantizedLayer` exists for. * Keep the group-wise signature on QuantizedLayer and name the new base The split moved the group-wise options out of QuantizedLayer, which breaks subclasses that pass them to super().__init__. Keep that signature where it was and introduce BaseQuantizedLayer for what the backends share instead. The vibevoice guard now skips on the new base, so FP8 layers keep being skipped there. * Declare the quantized states in the base layer, and group the quantized tests The states were only assigned in `reset` and `lazy_initialization`, so a freshly built layer had no such attribute at all. The FP8 tests move next to the other quantized ones, and the beam reordering and reset tests are parameterized over the backends instead of duplicated.
2170 lines
102 KiB
Python
2170 lines
102 KiB
Python
# Copyright 2023 HuggingFace Inc.
|
|
#
|
|
# Licensed under the Apache License, Version 2.0 (the "License");
|
|
# you may not use this file except in compliance with the License.
|
|
# You may obtain a copy of the License at
|
|
#
|
|
# http://www.apache.org/licenses/LICENSE-2.0
|
|
#
|
|
# Unless required by applicable law or agreed to in writing, software
|
|
# distributed under the License is distributed on an "AS IS" BASIS,
|
|
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
# See the License for the specific language governing permissions and
|
|
# limitations under the License.
|
|
|
|
import copy
|
|
import unittest
|
|
from unittest.mock import patch
|
|
|
|
import pytest
|
|
from packaging import version
|
|
from parameterized import parameterized
|
|
|
|
from transformers import set_seed
|
|
from transformers.generation.configuration_utils import ALL_CACHE_IMPLEMENTATIONS
|
|
from transformers.testing_utils import (
|
|
CaptureStderr,
|
|
backend_device_count,
|
|
backend_torch_accelerator_module,
|
|
cleanup,
|
|
get_gpu_count,
|
|
is_torch_available,
|
|
require_optimum_quanto,
|
|
require_torch,
|
|
require_torch_accelerator,
|
|
require_torch_gpu,
|
|
require_torch_multi_accelerator,
|
|
require_torch_multi_gpu,
|
|
slow,
|
|
torch_device,
|
|
)
|
|
from transformers.utils import is_hqq_available, is_optimum_quanto_available, is_torch_greater_or_equal
|
|
|
|
|
|
if is_torch_available():
|
|
import torch
|
|
|
|
from transformers import (
|
|
AutoModelForCausalLM,
|
|
AutoTokenizer,
|
|
Cache,
|
|
DynamicCache,
|
|
Gemma2Config,
|
|
Gemma4ForCausalLM,
|
|
Gemma4TextConfig,
|
|
GenerationConfig,
|
|
LlamaConfig,
|
|
LlamaForCausalLM,
|
|
MixtralConfig,
|
|
MixtralForCausalLM,
|
|
PreTrainedConfig,
|
|
QuantizedCache,
|
|
Qwen3VLConfig,
|
|
Qwen3VLForConditionalGeneration,
|
|
StaticCache,
|
|
convert_and_export_with_cache,
|
|
pipeline,
|
|
)
|
|
from transformers.cache_utils import (
|
|
DynamicIndexedLayer,
|
|
DynamicLayer,
|
|
DynamicSlidingWindowLayer,
|
|
Fp8QuantizedLayer,
|
|
LinearAttentionAndFullAttentionLayer,
|
|
LinearAttentionAndSlidingWindowAttentionLayer,
|
|
LinearAttentionLayer,
|
|
QuantoQuantizedLayer,
|
|
StaticLayer,
|
|
StaticSlidingWindowLayer,
|
|
)
|
|
from transformers.generation.utils import GenerationMixin
|
|
from transformers.integrations.executorch import export_with_dynamic_cache, register_dynamic_cache_export_support
|
|
from transformers.integrations.heterogeneity.configuration_utils import (
|
|
AmbiguousGlobalPerLayerAttributeError,
|
|
)
|
|
|
|
|
|
# FIXME: offloaded cache is skipped becase it needs `offload_only_non_sliding=False`
|
|
# but we can't configure cache through `generate()`
|
|
TEST_CACHE_IMPLEMENTATIONS = [
|
|
cache_name
|
|
for cache_name in ALL_CACHE_IMPLEMENTATIONS
|
|
# TODO (joao): offloaded_hybrid == offloaded_hybrid_chunked, deprecate one of them
|
|
if cache_name not in ["offloaded", "offloaded_hybrid", "offloaded_static", "offloaded_hybrid_chunked"]
|
|
]
|
|
|
|
|
|
@require_torch
|
|
class CacheTest(unittest.TestCase):
|
|
"""Cache tests that don't require loading models"""
|
|
|
|
def test_static_cache_mha_mqa_gqa(self):
|
|
"""
|
|
Tests that static cache works with multi-head attention (MHA), grouped query attention (GQA), and multi-query
|
|
attention (MQA)
|
|
"""
|
|
|
|
def _random_kvs(config):
|
|
# shape for key and values: (batch_size, num_heads, seq_len, head_dim)
|
|
random_keys = torch.rand(
|
|
(1, config.num_key_value_heads, 1, config.hidden_size // config.num_attention_heads),
|
|
device=torch_device,
|
|
)
|
|
random_values = torch.rand(
|
|
(1, config.num_key_value_heads, 1, config.hidden_size // config.num_attention_heads),
|
|
device=torch_device,
|
|
)
|
|
return random_keys, random_values
|
|
|
|
mha_config = LlamaConfig(num_attention_heads=32)
|
|
mha_static_cache = StaticCache(config=mha_config, max_cache_len=10)
|
|
cached_keys, cached_values = mha_static_cache.update(*_random_kvs(mha_config), 0)
|
|
self.assertTrue(cached_keys.shape == (1, 32, 10, 128))
|
|
self.assertTrue(cached_values.shape == (1, 32, 10, 128))
|
|
|
|
gqa_config = LlamaConfig(num_attention_heads=32, num_key_value_heads=4)
|
|
gqa_static_cache = StaticCache(config=gqa_config, max_cache_len=10)
|
|
cached_keys, cached_values = gqa_static_cache.update(*_random_kvs(gqa_config), 0)
|
|
self.assertTrue(cached_keys.shape == (1, 4, 10, 128))
|
|
self.assertTrue(cached_values.shape == (1, 4, 10, 128))
|
|
|
|
mqa_config = LlamaConfig(num_attention_heads=32, num_key_value_heads=1)
|
|
mqa_static_cache = StaticCache(config=mqa_config, max_cache_len=10)
|
|
cached_keys, cached_values = mqa_static_cache.update(*_random_kvs(mqa_config), 0)
|
|
self.assertTrue(cached_keys.shape == (1, 1, 10, 128))
|
|
self.assertTrue(cached_values.shape == (1, 1, 10, 128))
|
|
|
|
def test_early_initialization_does_not_corrupt_linear_attention_layers(self):
|
|
"""
|
|
Regression test: `early_initialization` initialized *every* layer through the attention `(num_heads, head_dim)`
|
|
key/value layout, but linear attention layers track their own statically-shaped conv/recurrent states. So it
|
|
pre-allocated their `conv_states` with the wrong shape (a spurious 0-length axis) and flagged them
|
|
initialized; the first real `update_conv_state` then hit `conv_states.copy_(...)` with mismatched shapes and
|
|
raised a `RuntimeError` (the customer-facing failure, observed e.g. on Neuron). Linear attention layers must
|
|
be left untouched so they lazily take the correct shape on their first update.
|
|
"""
|
|
config = LlamaConfig(num_hidden_layers=2, num_attention_heads=4, num_key_value_heads=2, hidden_size=32)
|
|
config.layer_types = ["full_attention", "linear_attention"]
|
|
cache = StaticCache(config=config, max_cache_len=8)
|
|
self.assertIsInstance(cache.layers[0], StaticLayer)
|
|
linear_layer = cache.layers[1]
|
|
self.assertIsInstance(linear_layer, LinearAttentionLayer)
|
|
# Linear attention layers opt out of the key/value early-init path; attention layers opt in.
|
|
self.assertTrue(cache.layers[0].supports_early_init)
|
|
self.assertFalse(linear_layer.supports_early_init)
|
|
|
|
cache.early_initialization(batch_size=1, num_heads=2, head_dim=8, dtype=torch.float32, device=torch_device)
|
|
# The attention layer is initialized via the key/value layout, as expected.
|
|
self.assertTrue(cache.layers[0].is_initialized)
|
|
|
|
# Simulate the first forward updating the linear layer's conv state with its real (conv) shape. Before the
|
|
# fix, `early_initialization` had pre-allocated `conv_states` with the wrong key/value shape, so this raised
|
|
# `RuntimeError: ... must match ...`; with the fix the layer lazily takes the correct shape here instead.
|
|
conv_states = torch.zeros((1, 8, 4), dtype=torch.float32, device=torch_device) # (batch, channels, kernel)
|
|
updated_conv_states = linear_layer.update_conv_state(conv_states)
|
|
self.assertEqual(updated_conv_states.shape, conv_states.shape)
|
|
|
|
# The cache-level `is_initialized` must also tolerate linear attention layers (which don't expose the flag);
|
|
# before the fix this raised `AttributeError`. It reflects the attention layer's state.
|
|
self.assertTrue(cache.is_initialized)
|
|
|
|
def test_static_cache_init_shapes_with_per_layer_attention_heads(self):
|
|
model = GenerationMixin()
|
|
model.config = PreTrainedConfig(
|
|
hidden_size=32,
|
|
num_hidden_layers=2,
|
|
num_attention_heads=4,
|
|
per_layer_config={1: {"num_attention_heads": 2}},
|
|
)
|
|
self.assertEqual(model._get_static_cache_init_shape(), ([4, 2], [8, 16]))
|
|
|
|
def test_max_cache_len_ignores_linear_attention_layers(self):
|
|
"""`max_cache_len` must skip linear attention layers (which have no such attribute), else the static-cache
|
|
reuse check in `_prepare_static_cache` raises `AttributeError` on a hybrid model."""
|
|
config = LlamaConfig(num_hidden_layers=2, num_attention_heads=4, num_key_value_heads=2, hidden_size=32)
|
|
config.layer_types = ["full_attention", "linear_attention"]
|
|
cache = StaticCache(config=config, max_cache_len=8)
|
|
self.assertEqual(cache.get_max_length(), 8)
|
|
|
|
@parameterized.expand(["quanto", "fp8"])
|
|
def test_quantized_layer_beam_reorder(self, backend):
|
|
"""
|
|
`reorder_cache` must reorder the quantized states as well, not only the residual cache. It used to index the
|
|
(emptied) residual cache while guarding on the total sequence length, so it either raised or silently left
|
|
the quantized states in the previous beam order. FP8 has no residual cache, and reorders right away.
|
|
"""
|
|
if backend == "quanto":
|
|
if not is_optimum_quanto_available():
|
|
self.skipTest("Quanto is not available")
|
|
layer = QuantoQuantizedLayer(nbits=4, q_group_size=16, residual_length=4)
|
|
# Row `i` of the states holds the constant `i + 1`, so the beam order can be read back off the cache
|
|
row_values, atol = torch.arange(1, 5, dtype=torch.float32).view(4, 1, 1, 1), 1e-2
|
|
else:
|
|
layer = Fp8QuantizedLayer()
|
|
# Same, with constants exactly representable in `float8_e4m3fn` once divided by the calibrated scale
|
|
row_values, atol = torch.tensor([1.0, 2.0, 4.0, 8.0]).view(4, 1, 1, 1), 0
|
|
|
|
def states(order, seq_len):
|
|
# Row `i` is filled with the constant of the original row `order[i]`, as the model would produce it
|
|
return row_values.index_select(0, order).expand(4, 2, seq_len, 8).clone()
|
|
|
|
order = torch.arange(4)
|
|
layer.update(states(order, 5), states(order, 5))
|
|
|
|
# Reorder on every step, with duplicated indices (`beam_idx` is a gather, several beams may pick the same
|
|
# source beam) and crossing the residual cache flushes, which bake the pending reordering in.
|
|
for beam_idx in [[1, 0, 3, 2], [2, 2, 0, 1], [3, 1, 2, 0], [0, 1, 2, 3], [1, 3, 0, 2], [2, 0, 1, 3]]:
|
|
beam_idx = torch.tensor(beam_idx)
|
|
layer.reorder_cache(beam_idx)
|
|
order = order.index_select(0, beam_idx)
|
|
keys, values = layer.update(states(order, 1), states(order, 1))
|
|
# Every cached position of a row must hold that row's constant, whatever the beam shuffling
|
|
expected = row_values.index_select(0, order).expand_as(keys)
|
|
torch.testing.assert_close(keys, expected, rtol=0, atol=atol)
|
|
torch.testing.assert_close(values, expected, rtol=0, atol=atol)
|
|
|
|
@parameterized.expand(
|
|
[
|
|
("empty_at_capacity", [2, 4, 4], [0, 0, 0]),
|
|
("empty_over_capacity", [2, 8], [0, 0]),
|
|
("nonempty_at_capacity", [2, 1, 3], [0, 1, 0]),
|
|
("nonempty_over_capacity", [2, 1, 4], [0, 1, 0]),
|
|
("below_capacity", [2, 1, 2], [0, 1, 3]),
|
|
("single_token", [2, 1, 1, 1, 1], [0, 1, 2, 3, 0]),
|
|
]
|
|
)
|
|
@require_optimum_quanto
|
|
def test_quantized_layer_chunked_updates(self, _, chunk_lengths, expected_residual_lengths):
|
|
layer = QuantoQuantizedLayer(nbits=4, q_group_size=16, residual_length=4)
|
|
sequence_length = 0
|
|
for chunk_length, expected_residual_length in zip(chunk_lengths, expected_residual_lengths):
|
|
states = torch.ones(1, 2, chunk_length, 16, device=torch_device)
|
|
keys, values = layer.update(states, 2 * states)
|
|
sequence_length += chunk_length
|
|
self.assertEqual(layer.get_seq_length(), sequence_length)
|
|
self.assertEqual(keys.shape[-2], sequence_length)
|
|
torch.testing.assert_close(keys, torch.ones_like(keys), rtol=0, atol=1e-2)
|
|
torch.testing.assert_close(values, 2 * torch.ones_like(values), rtol=0, atol=1e-2)
|
|
self.assertEqual(layer.keys.numel(), expected_residual_length * 2 * 16)
|
|
self.assertEqual(layer.values.numel(), expected_residual_length * 2 * 16)
|
|
self.assertEqual(
|
|
layer._dequantize(layer._quantized_keys).shape[-2], sequence_length - expected_residual_length
|
|
)
|
|
|
|
@parameterized.expand(["quanto", "fp8"])
|
|
def test_quantized_layer_reset(self, backend):
|
|
"""`reset` must also drop the quantized states, which hold most of the cache, and any calibrated scale."""
|
|
if backend == "quanto":
|
|
if not is_optimum_quanto_available():
|
|
self.skipTest("Quanto is not available")
|
|
layer = QuantoQuantizedLayer(nbits=4, q_group_size=16, residual_length=4)
|
|
else:
|
|
layer = Fp8QuantizedLayer()
|
|
|
|
# 5 tokens for a residual length of 4, so the first flush has happened and most of the cache is quantized.
|
|
# The large amplitude makes a stale FP8 scale obvious on the next calibration.
|
|
layer.update(torch.rand(4, 2, 5, 8) * 100, torch.rand(4, 2, 5, 8) * 100)
|
|
calibrated_scale = layer._quantized_keys[1].clone() if backend == "fp8" else None
|
|
layer.reset()
|
|
|
|
self.assertEqual(layer.get_seq_length(), 0)
|
|
self.assertIsNone(layer._quantized_keys)
|
|
self.assertIsNone(layer._quantized_values)
|
|
|
|
keys, _ = layer.update(torch.rand(4, 2, 3, 8), torch.rand(4, 2, 3, 8))
|
|
self.assertEqual(keys.shape[-2], 3)
|
|
self.assertEqual(layer.get_seq_length(), 3)
|
|
if backend == "fp8":
|
|
self.assertLess(layer._quantized_keys[1].item(), calibrated_scale.item())
|
|
|
|
def test_fp8_quantized_layer(self):
|
|
"""Tests that `Fp8QuantizedLayer` appends new tokens using the scale calibrated on the first `update`."""
|
|
layer = Fp8QuantizedLayer()
|
|
|
|
# As in the attention layer, the states come out of a transpose, so they are not contiguous
|
|
keys, values = torch.randn(1, 5, 2, 8).transpose(1, 2), torch.randn(1, 5, 2, 8).transpose(1, 2)
|
|
layer.update(keys, values)
|
|
quantized_keys, calibrated_scale = layer._quantized_keys
|
|
self.assertEqual(quantized_keys.dtype, torch.float8_e4m3fn)
|
|
self.assertEqual(quantized_keys.shape, keys.shape)
|
|
calibrated_scale = calibrated_scale.clone()
|
|
|
|
# Even states with a much larger amplitude do not change the scale, which is frozen after calibration
|
|
cached_keys, _ = layer.update(torch.randn(1, 2, 1, 8) * 100, torch.randn(1, 2, 1, 8))
|
|
self.assertEqual(cached_keys.shape, (1, 2, 6, 8))
|
|
self.assertEqual(cached_keys.dtype, keys.dtype)
|
|
quantized_keys, scale = layer._quantized_keys
|
|
self.assertTrue(torch.equal(scale, calibrated_scale))
|
|
self.assertEqual(quantized_keys.shape, (1, 2, 6, 8))
|
|
|
|
def test_fp8_quantized_cache_rejects_group_wise_options(self):
|
|
"""Tests that the `fp8` backend, which quantizes per-tensor, does not silently drop the group-wise options."""
|
|
config = LlamaConfig(num_hidden_layers=2)
|
|
with self.assertRaisesRegex(ValueError, "does not support"):
|
|
QuantizedCache(backend="fp8", config=config, q_group_size=128, nbits=2)
|
|
|
|
layer = QuantizedCache(backend="fp8", config=config).layers[0]
|
|
self.assertIsInstance(layer, Fp8QuantizedLayer)
|
|
self.assertFalse(hasattr(layer, "q_group_size"))
|
|
|
|
def test_dynamic_cache_uses_per_layer_sliding_windows(self):
|
|
config = LlamaConfig(
|
|
hidden_size=64,
|
|
num_hidden_layers=4,
|
|
num_attention_heads=4,
|
|
num_key_value_heads=4,
|
|
sliding_window=None,
|
|
per_layer_config={0: {"sliding_window": 32}, 2: {"sliding_window": 16}},
|
|
)
|
|
layers = DynamicCache(config=config).layers
|
|
|
|
self.assertEqual(len(layers), 4)
|
|
self.assertIsInstance(layers[0], DynamicSlidingWindowLayer)
|
|
self.assertEqual(layers[0].sliding_window, 32)
|
|
self.assertFalse(layers[1].is_sliding)
|
|
self.assertIsInstance(layers[2], DynamicSlidingWindowLayer)
|
|
self.assertEqual(layers[2].sliding_window, 16)
|
|
self.assertFalse(layers[3].is_sliding)
|
|
|
|
def test_static_cache_uses_per_layer_sliding_windows(self):
|
|
config = LlamaConfig(
|
|
hidden_size=64,
|
|
num_hidden_layers=4,
|
|
num_attention_heads=4,
|
|
num_key_value_heads=4,
|
|
sliding_window=None,
|
|
per_layer_config={1: {"sliding_window": 24}, 3: {"sliding_window": 48}},
|
|
)
|
|
layers = StaticCache(config=config, max_cache_len=64).layers
|
|
|
|
self.assertEqual(len(layers), 4)
|
|
self.assertFalse(layers[0].is_sliding)
|
|
self.assertIsInstance(layers[1], StaticSlidingWindowLayer)
|
|
self.assertEqual(layers[1].max_cache_len, 24)
|
|
self.assertFalse(layers[2].is_sliding)
|
|
self.assertIsInstance(layers[3], StaticSlidingWindowLayer)
|
|
self.assertEqual(layers[3].max_cache_len, 48)
|
|
|
|
@require_torch_accelerator
|
|
def test_offloaded_cache_prefetches_across_linear_attention_layers(self):
|
|
"""
|
|
Regression test for offloaded caches on hybrid (attention + linear-attention) models. Attention layers are
|
|
offloaded to CPU after their `update` and must be prefetched back before the next decoding step. The prefetch
|
|
has to skip the interleaved linear-attention layers (which never go through the offloading `update` path) and
|
|
target the next attention layer; otherwise the offloaded KV stays on CPU and the next `update` fails with a
|
|
cpu/accelerator device mismatch.
|
|
"""
|
|
# Hybrid layout: an attention layer every 4 layers, linear-attention layers in between (as in e.g. Qwen3.5).
|
|
layers = [DynamicLayer() if layer_idx % 4 == 3 else LinearAttentionLayer() for layer_idx in range(8)]
|
|
attention_indices = [3, 7]
|
|
cache = Cache(layers=layers, offloading=True, offload_only_non_sliding=False)
|
|
|
|
def _kv(seq_len):
|
|
states = torch.rand(1, 4, seq_len, 16, device=torch_device)
|
|
return states, states.clone()
|
|
|
|
# Prefill: each attention layer is updated once, then offloaded to CPU.
|
|
for layer_idx in attention_indices:
|
|
cache.update(*_kv(5), layer_idx)
|
|
|
|
# Decode: updating the attention layers again used to raise a device mismatch, as their offloaded KV was
|
|
# never prefetched back to the accelerator.
|
|
for layer_idx in attention_indices:
|
|
keys, _ = cache.update(*_kv(1), layer_idx)
|
|
self.assertEqual(keys.device.type, torch.device(torch_device).type)
|
|
|
|
@require_torch_gpu
|
|
def test_offloaded_cache_prefetch_waits_for_offload(self):
|
|
"""
|
|
Regression test for offloaded caches returning wrong values. The offloading copy to CPU is non-blocking on
|
|
the default stream, and the prefetch back to the GPU runs on another stream. When the GPU lags behind the
|
|
CPU, the prefetch must wait for the copy to CPU to be finished, otherwise it reads a CPU buffer that has not
|
|
been written yet.
|
|
"""
|
|
# The first allocation of pinned memory synchronizes the device, which hides the issue, hence the repetitions
|
|
for _ in range(3):
|
|
cache = Cache(layers=[DynamicLayer(), DynamicLayer()], offloading=True, offload_only_non_sliding=False)
|
|
prefill = [torch.rand(1, 4, 5, 16, device=torch_device) for _ in range(2)]
|
|
|
|
# Make the GPU lag behind the CPU, so that the offloading copies are still pending when the last layer
|
|
# prefetches the first one back
|
|
torch.cuda._sleep(int(1e9))
|
|
for layer_idx, states in enumerate(prefill):
|
|
cache.update(states, states.clone(), layer_idx)
|
|
|
|
for layer_idx, states in enumerate(prefill):
|
|
new_states = torch.rand(1, 4, 1, 16, device=torch_device)
|
|
keys, values = cache.update(new_states, new_states.clone(), layer_idx)
|
|
torch.testing.assert_close(keys, torch.cat([states, new_states], dim=-2), rtol=0, atol=0)
|
|
torch.testing.assert_close(values, torch.cat([states, new_states], dim=-2), rtol=0, atol=0)
|
|
|
|
def test_chunked_prefill_static_cache_per_layer_head_shapes(self):
|
|
"""
|
|
Regression test for heterogeneous models with per-layer head shapes. The static cache is eagerly initialized
|
|
for a chunked prefill, and `generate` derives the head shapes of the static cache. Models such as Gemma4 use
|
|
a different `head_dim` depending on the layer, and reading a single global one raises on them, so the shapes
|
|
must be derived per layer.
|
|
"""
|
|
config = Gemma4TextConfig(
|
|
hidden_size=32,
|
|
num_attention_heads=4,
|
|
num_key_value_heads=2,
|
|
head_dim=8,
|
|
num_hidden_layers=4,
|
|
intermediate_size=64,
|
|
vocab_size=99,
|
|
layer_types=["sliding_attention", "full_attention", "sliding_attention", "full_attention"],
|
|
per_layer_config={1: {"head_dim": 16}, 3: {"head_dim": 16}},
|
|
)
|
|
# On such a config there is no global `head_dim` to read, not even a default one
|
|
with self.assertRaises(AmbiguousGlobalPerLayerAttributeError):
|
|
getattr(config.get_text_config(decoder=True), "head_dim", None)
|
|
|
|
model = Gemma4ForCausalLM(config).to(torch_device).eval()
|
|
inputs = torch.tensor([[1, 2, 3, 4]], device=torch_device)
|
|
out = model.generate(
|
|
inputs,
|
|
max_new_tokens=2,
|
|
do_sample=False,
|
|
cache_implementation="static",
|
|
prefill_chunk_size=2,
|
|
return_dict_in_generate=True,
|
|
)
|
|
|
|
# Each layer must be allocated with its own `head_dim`, instead of all of them sharing the global one
|
|
cache = out.past_key_values
|
|
self.assertIsInstance(cache, StaticCache)
|
|
self.assertEqual([layer.keys.shape[-1] for layer in cache.layers], [8, 16, 8, 16])
|
|
|
|
def test_chunked_prefill_static_cache_none_head_dim(self):
|
|
"""
|
|
Regression test for models that declare `head_dim` but leave it `None` (e.g. Mixtral). The head shapes of the
|
|
eagerly initialized static cache are read with a `getattr` default, which only fires on a missing attribute:
|
|
a `None` one was returned as is, instead of falling back to `hidden_size // num_attention_heads`.
|
|
"""
|
|
config = MixtralConfig(
|
|
hidden_size=32,
|
|
num_attention_heads=4,
|
|
num_key_value_heads=2,
|
|
num_hidden_layers=2,
|
|
intermediate_size=64,
|
|
vocab_size=99,
|
|
num_local_experts=2,
|
|
num_experts_per_tok=1,
|
|
)
|
|
# The config carries a `head_dim`, it is just left unset
|
|
self.assertIsNone(config.head_dim)
|
|
|
|
model = MixtralForCausalLM(config).to(torch_device).eval()
|
|
inputs = torch.tensor([[1, 2, 3, 4]], device=torch_device)
|
|
out = model.generate(
|
|
inputs,
|
|
max_new_tokens=2,
|
|
do_sample=False,
|
|
cache_implementation="static",
|
|
prefill_chunk_size=2,
|
|
return_dict_in_generate=True,
|
|
)
|
|
|
|
# Each layer must fall back to the `hidden_size // num_attention_heads` division
|
|
cache = out.past_key_values
|
|
self.assertIsInstance(cache, StaticCache)
|
|
self.assertEqual([layer.keys.shape[-1] for layer in cache.layers], [8, 8])
|
|
|
|
def test_chunked_prefill_multi_axis_position_ids(self):
|
|
"""
|
|
Regression test for #49318: models with multi-axis rope position ids, such as Qwen3-VL's `(4, batch, seq)`.
|
|
The chunked prefill sliced each chunk's position ids on their second dim, the batch on such models, so the
|
|
second chunk had no rows. It must slice the last dim, the sequence, and match an unchunked prefill.
|
|
"""
|
|
config = Qwen3VLConfig(
|
|
text_config={
|
|
"hidden_size": 32,
|
|
"num_attention_heads": 4,
|
|
"num_key_value_heads": 2,
|
|
"head_dim": 16,
|
|
"num_hidden_layers": 2,
|
|
"intermediate_size": 64,
|
|
"vocab_size": 99,
|
|
"rope_parameters": {"rope_type": "default", "mrope_section": [2, 3, 3], "mrope_interleaved": True},
|
|
},
|
|
vision_config={
|
|
"depth": 1,
|
|
"hidden_size": 32,
|
|
"intermediate_size": 32,
|
|
"num_heads": 2,
|
|
"out_hidden_size": 32,
|
|
},
|
|
)
|
|
model = Qwen3VLForConditionalGeneration(config).to(torch_device).eval()
|
|
inputs = torch.tensor([[1, 2, 3, 4]], device=torch_device)
|
|
generation_kwargs = {"max_new_tokens": 2, "do_sample": False, "cache_implementation": "static"}
|
|
|
|
expected = model.generate(inputs, **generation_kwargs)
|
|
out = model.generate(inputs, **generation_kwargs, prefill_chunk_size=2)
|
|
self.assertTrue(torch.equal(out, expected))
|
|
|
|
@parameterized.expand([("dynamic",), ("static",)])
|
|
def test_chunked_prefill_cache_continuation(self, cache_implementation):
|
|
"""
|
|
Test that we can reuse a non-empty Cache with prefill chunking, with only the new input_ids, or the full sequence
|
|
containing the ids of the previously filled Cache as well.
|
|
"""
|
|
config = LlamaConfig(
|
|
hidden_size=32,
|
|
num_attention_heads=4,
|
|
num_key_value_heads=2,
|
|
num_hidden_layers=2,
|
|
intermediate_size=32,
|
|
vocab_size=50,
|
|
)
|
|
model = LlamaForCausalLM(config).to(torch_device).eval()
|
|
inputs = torch.randint(10, 40, (1, 10), device=torch_device)
|
|
# StaticCache may auto-compile otherwise, which we don't want to waste time on in this test
|
|
generation_kwargs = {"max_new_tokens": 5, "min_new_tokens": 5, "do_sample": False, "disable_compile": True}
|
|
|
|
# With StaticCache, we need the max_len to be greater than the first pass plus the second pass
|
|
cache = (
|
|
DynamicCache(config=config)
|
|
if cache_implementation == "dynamic"
|
|
else StaticCache(config=config, max_cache_len=50)
|
|
)
|
|
|
|
# First generation pass filling a Cache
|
|
first_gen_ids = model.generate(inputs, past_key_values=cache, **generation_kwargs)
|
|
|
|
# Now make sure we get the same results with and without prefill chunking
|
|
new_ids = torch.randint(10, 40, (1, 5), device=torch_device)
|
|
full_sequence = torch.cat([first_gen_ids, new_ids], dim=-1)
|
|
full_sequence_mask = torch.ones_like(full_sequence)
|
|
# Last generated token is not in the cache! So "new_ids" are last generated token + new ids
|
|
uncached_ids = full_sequence[:, cache.get_seq_length() :]
|
|
|
|
no_chunked_only_new_ids = model.generate(
|
|
uncached_ids, attention_mask=full_sequence_mask, past_key_values=copy.deepcopy(cache), **generation_kwargs
|
|
)
|
|
no_chunked_full_ids = model.generate(
|
|
full_sequence, attention_mask=full_sequence_mask, past_key_values=copy.deepcopy(cache), **generation_kwargs
|
|
)
|
|
# Not related to this test, but just to make sure
|
|
self.assertTrue(
|
|
torch.equal(no_chunked_only_new_ids, no_chunked_full_ids[:, -no_chunked_only_new_ids.shape[-1] :])
|
|
)
|
|
|
|
chunked_only_new_ids = model.generate(
|
|
uncached_ids,
|
|
attention_mask=full_sequence_mask,
|
|
past_key_values=copy.deepcopy(cache),
|
|
prefill_chunk_size=2,
|
|
**generation_kwargs,
|
|
)
|
|
chunked_full_ids = model.generate(
|
|
full_sequence,
|
|
attention_mask=full_sequence_mask,
|
|
past_key_values=copy.deepcopy(cache),
|
|
prefill_chunk_size=2,
|
|
**generation_kwargs,
|
|
)
|
|
# Should both be equal, and equal to the ones without chunking
|
|
self.assertTrue(torch.equal(no_chunked_only_new_ids, chunked_only_new_ids))
|
|
self.assertTrue(torch.equal(chunked_only_new_ids, chunked_full_ids[:, -chunked_only_new_ids.shape[-1] :]))
|
|
|
|
def test_dynamic_layers_reset_drops_their_states(self):
|
|
"""
|
|
Regression test: `reset` used to zero the dynamic layers' states in place, inherited from the static layers.
|
|
That is a no-op for them, as they grow by concatenation and read their length off `keys.shape[-2]`: the layer
|
|
kept its length and the next `update` appended to a run of stale zeros.
|
|
"""
|
|
keys = torch.rand(2, 4, 5, 16, device=torch_device)
|
|
indexer_keys = torch.rand(2, 5, 8, device=torch_device)
|
|
|
|
for layer in (DynamicLayer(), DynamicSlidingWindowLayer(sliding_window=1024), DynamicIndexedLayer()):
|
|
layer.update(keys, keys.clone())
|
|
if isinstance(layer, DynamicIndexedLayer):
|
|
layer.update_indexer(indexer_keys)
|
|
|
|
layer.reset()
|
|
self.assertEqual(layer.get_seq_length(), 0)
|
|
|
|
# The next update must start from scratch, instead of appending to the pre-reset states.
|
|
new_keys, _ = layer.update(keys, keys.clone())
|
|
self.assertEqual(new_keys.shape[-2], 5)
|
|
if isinstance(layer, DynamicIndexedLayer):
|
|
# The indexer has to stay in step with the main states, else `topk` indices computed over it go out
|
|
# of bounds of the (shorter) key length downstream.
|
|
self.assertEqual(layer.update_indexer(indexer_keys).shape[1], 5)
|
|
|
|
|
|
def _skip_on_failed_cache_prerequisites(test, cache_implementation):
|
|
"""Function to skip tests on failed cache prerequisites, given a cache implementation"""
|
|
# Installed dependencies
|
|
if cache_implementation == "quantized" and not is_optimum_quanto_available():
|
|
test.skipTest("Quanto is not available")
|
|
# Devices
|
|
if "offloaded" in cache_implementation:
|
|
has_accelerator = torch_device is not None and torch_device != "cpu"
|
|
if not has_accelerator:
|
|
test.skipTest("Offloaded caches require an accelerator")
|
|
if cache_implementation in ["offloaded_static", "offloaded_hybrid_chunked"]:
|
|
if backend_device_count(torch_device) != 1:
|
|
test.skipTest("Offloaded static caches require exactly 1 accelerator")
|
|
|
|
|
|
def _set_sliding_window(config, cache_implementation):
|
|
"""
|
|
Sets the sliding window on `config`, from which the cache layer types are inferred: the sliding cache
|
|
implementations need one to build sliding layers, and the other ones must not have one.
|
|
"""
|
|
config.sliding_window = 256 if cache_implementation in ["sliding_window", "hybrid", "hybrid_chunked"] else None
|
|
|
|
|
|
class CacheIntegrationTest(unittest.TestCase):
|
|
"""Fast cache integration tests that share the same small model"""
|
|
|
|
@classmethod
|
|
def setUpClass(cls):
|
|
# Load once and reuse across tests
|
|
cls.tokenizer = AutoTokenizer.from_pretrained("HuggingFaceTB/SmolLM2-135M-Instruct", padding_side="left")
|
|
cls.model = AutoModelForCausalLM.from_pretrained(
|
|
"HuggingFaceTB/SmolLM2-135M-Instruct", device_map="auto", dtype=torch.float16
|
|
)
|
|
|
|
def setUp(self):
|
|
# The model is shared across tests, so the sliding window one of them opts into through
|
|
# `_set_sliding_window` must not leak into the next one. `SmolLM2` has no sliding window of its own.
|
|
self.model.config.sliding_window = None
|
|
|
|
@parameterized.expand(TEST_CACHE_IMPLEMENTATIONS)
|
|
def test_cache_batched(self, cache_implementation):
|
|
"""Sanity check: caches' `.update` function expects batched inputs"""
|
|
_skip_on_failed_cache_prerequisites(self, cache_implementation)
|
|
_set_sliding_window(self.model.config, cache_implementation)
|
|
|
|
EXPECTED_GENERATION = ["A sequence: 1, 2, 3, 4, 5, 6, 7, 8,", "A sequence: A, B, C, D, E, F, G, H"]
|
|
|
|
inputs = self.tokenizer(
|
|
["A sequence: 1, 2, 3, 4, 5", "A sequence: A, B, C"], padding=True, return_tensors="pt"
|
|
)
|
|
inputs = inputs.to(self.model.device)
|
|
|
|
gen_out = self.model.generate(
|
|
**inputs,
|
|
do_sample=False,
|
|
max_new_tokens=10,
|
|
return_dict_in_generate=True,
|
|
cache_implementation=cache_implementation,
|
|
disable_compile=True,
|
|
)
|
|
# Sanity check: a cache was used
|
|
self.assertIsInstance(gen_out.past_key_values, Cache)
|
|
# Confirm that the output matches expectations
|
|
decoded = self.tokenizer.decode(gen_out.sequences, skip_special_tokens=True)
|
|
self.assertListEqual(decoded, EXPECTED_GENERATION)
|
|
|
|
def test_reset_dynamic_cache_matches_a_fresh_one(self):
|
|
"""A reset cache must behave exactly like a newly built one, so that it can be reused across generations."""
|
|
first = self.tokenizer(["The capital of France is"], return_tensors="pt").to(self.model.device)
|
|
second = self.tokenizer(["A sequence: 1, 2, 3, 4, 5"], return_tensors="pt").to(self.model.device)
|
|
|
|
cache = DynamicCache(config=self.model.config)
|
|
self.model.generate(**first, past_key_values=cache, max_new_tokens=10, do_sample=False)
|
|
|
|
# Reuse the same cache for a different prompt, which is what `reset` is for.
|
|
cache.reset()
|
|
self.assertEqual(cache.get_seq_length(), 0)
|
|
reused = self.model.generate(**second, past_key_values=cache, max_new_tokens=10, do_sample=False)
|
|
|
|
# Before the fix, the reset kept the first prompt's states around, so this silently generated gibberish.
|
|
expected = self.model.generate(**second, max_new_tokens=10, do_sample=False)
|
|
self.assertEqual(self.tokenizer.decode(reused[0]), self.tokenizer.decode(expected[0]))
|
|
|
|
@parameterized.expand(TEST_CACHE_IMPLEMENTATIONS)
|
|
def test_cache_beam_search(self, cache_implementation):
|
|
"""
|
|
Sanity check: caches' `reorder_cache` is operational. We can confirm this by looking at the beam indices
|
|
(an output sequence contains multiple beam indices).
|
|
"""
|
|
_skip_on_failed_cache_prerequisites(self, cache_implementation)
|
|
_set_sliding_window(self.model.config, cache_implementation)
|
|
if cache_implementation == "offloaded_hybrid_chunked":
|
|
# TODO (joao, cyril): something is off with `offloaded_hybrid_chunked`: the
|
|
# output sequence (and the corresponding beam scores, if we add `output_scores=True`) are significantly
|
|
# different from the other caches.
|
|
self.skipTest("`offloaded_hybrid_chunked` fails this test")
|
|
|
|
EXPECTED_GENERATION = [
|
|
"Blue is the color of the sky, and the color of",
|
|
"Blue is the color of the sky, and the second is",
|
|
]
|
|
|
|
inputs = self.tokenizer(["Blue is"], return_tensors="pt").to(self.model.device)
|
|
gen_out = self.model.generate(
|
|
**inputs,
|
|
do_sample=False,
|
|
max_new_tokens=10,
|
|
num_beams=2,
|
|
num_return_sequences=2,
|
|
cache_implementation=cache_implementation,
|
|
disable_compile=True,
|
|
return_dict_in_generate=True,
|
|
)
|
|
# Sanity check: a cache was used
|
|
self.assertIsInstance(gen_out.past_key_values, Cache)
|
|
# At least one of the sequences requires multiple beam indices -> `reorder_cache` had to shift things around
|
|
self.assertTrue(any(len(set(beams_in_sequence)) > 1 for beams_in_sequence in gen_out.beam_indices))
|
|
# Confirm that the output matches expectations
|
|
decoded = self.tokenizer.decode(gen_out.sequences, skip_special_tokens=True)
|
|
self.assertListEqual(decoded, EXPECTED_GENERATION)
|
|
|
|
@parameterized.expand([("quanto"), ("hqq"), ("fp8")])
|
|
def test_quantized_cache_generation(self, backend):
|
|
"""Tests that QuantizedCache works as expected for the `quanto`, `hqq` and `fp8` backends."""
|
|
# The group-wise integer backends share the same options, while `fp8` quantizes per-tensor
|
|
cache_config = {"backend": backend, "nbits": 4, "q_group_size": 16, "residual_length": 4}
|
|
if backend == "quanto":
|
|
if not is_optimum_quanto_available():
|
|
self.skipTest("Quanto is not available")
|
|
cache_config.update({"axis_key": 0, "axis_value": 0})
|
|
# This output is taken from a run with the same parameters, and is known to be correct
|
|
expected_generation = ["The cat's whiskers are also a sign of anxiety."]
|
|
elif backend == "hqq":
|
|
if not is_hqq_available():
|
|
self.skipTest("HQQ is not available")
|
|
cache_config.update({"axis_key": 1, "axis_value": 1})
|
|
# HQQ has slightly different numerics
|
|
expected_generation = ["The cat's whiskers are also a sign of anxiety."]
|
|
elif backend == "fp8":
|
|
cache_config = {"backend": backend}
|
|
expected_generation = ["The cat's whiskers are also a sign of anxiety."]
|
|
else:
|
|
return
|
|
|
|
inputs = self.tokenizer(["The cat"], return_tensors="pt").to(self.model.device)
|
|
|
|
gen_out = self.model.generate(
|
|
**inputs,
|
|
do_sample=False,
|
|
max_new_tokens=10,
|
|
return_dict_in_generate=True,
|
|
cache_implementation="quantized",
|
|
cache_config=cache_config,
|
|
disable_compile=True,
|
|
)
|
|
|
|
self.assertIsInstance(gen_out.past_key_values, QuantizedCache)
|
|
|
|
decoded = self.tokenizer.decode(gen_out.sequences, skip_special_tokens=True)
|
|
self.assertListEqual(decoded, expected_generation)
|
|
|
|
# Check that something is actually quantized
|
|
|
|
@require_optimum_quanto
|
|
def test_quantized_cache_config_is_not_mutated(self):
|
|
"""
|
|
Tests that `generate` does not consume the entries of the `cache_config` it is given, which would silently
|
|
change the cache of any subsequent call sharing that dict.
|
|
"""
|
|
inputs = self.tokenizer(["The cat"], return_tensors="pt").to(self.model.device)
|
|
cache_config = {"backend": "quanto", "nbits": 4, "q_group_size": 16, "residual_length": 4}
|
|
expected_cache_config = cache_config.copy()
|
|
|
|
for _ in range(2):
|
|
gen_out = self.model.generate(
|
|
**inputs,
|
|
do_sample=False,
|
|
max_new_tokens=3,
|
|
return_dict_in_generate=True,
|
|
cache_implementation="quantized",
|
|
cache_config=cache_config,
|
|
disable_compile=True,
|
|
)
|
|
self.assertIsInstance(gen_out.past_key_values, QuantizedCache)
|
|
self.assertEqual(len(gen_out.past_key_values.layers), self.model.config.num_hidden_layers)
|
|
self.assertEqual(cache_config, expected_cache_config)
|
|
|
|
@parameterized.expand(TEST_CACHE_IMPLEMENTATIONS)
|
|
def test_cache_extra_left_padding(self, cache_implementation):
|
|
"""Tests that adding extra left-padding does not affect the generation with the cache"""
|
|
_skip_on_failed_cache_prerequisites(self, cache_implementation)
|
|
_set_sliding_window(self.model.config, cache_implementation)
|
|
|
|
EXPECTED_GENERATION = ["The cat's whiskers are also a sign of anxiety."]
|
|
|
|
inputs = self.tokenizer(["The cat"], padding=True, return_tensors="pt").to(self.model.device)
|
|
generation_kwargs = {
|
|
"do_sample": False,
|
|
"max_new_tokens": 10,
|
|
"cache_implementation": cache_implementation,
|
|
"disable_compile": True,
|
|
}
|
|
|
|
gen_out = self.model.generate(**inputs, **generation_kwargs)
|
|
decoded = self.tokenizer.decode(gen_out, skip_special_tokens=True)
|
|
self.assertListEqual(decoded, EXPECTED_GENERATION)
|
|
|
|
# Now with extra left-padding
|
|
inputs_expanded = self.tokenizer(["The cat"], padding=True, return_tensors="pt", pad_to_multiple_of=32)
|
|
inputs_expanded = inputs_expanded.to(self.model.device)
|
|
self.assertTrue(inputs.input_ids.shape[1] < inputs_expanded.input_ids.shape[1])
|
|
gen_out = self.model.generate(**inputs_expanded, **generation_kwargs)
|
|
decoded = self.tokenizer.decode(gen_out, skip_special_tokens=True)
|
|
self.assertListEqual(decoded, EXPECTED_GENERATION)
|
|
|
|
|
|
@require_torch_accelerator
|
|
class CacheHardIntegrationTest(unittest.TestCase):
|
|
"""Hard cache integration tests that require loading different models"""
|
|
|
|
def setUp(self):
|
|
# Clears memory before each test. Some tests use large models, which might result in suboptimal torch
|
|
# re-allocation if we run multiple tests in a row without clearing memory.
|
|
cleanup(torch_device, gc_collect=True)
|
|
|
|
@classmethod
|
|
def tearDownClass(cls):
|
|
# Clears memory after the last test. See `setUp` for more details.
|
|
cleanup(torch_device, gc_collect=True)
|
|
|
|
@slow
|
|
def test_dynamic_cache_hard(self):
|
|
"""Hard test for base cache implementation -- minor numerical fluctuations will cause this test to fail"""
|
|
tokenizer = AutoTokenizer.from_pretrained("Qwen/Qwen3-4B", padding_side="left")
|
|
model = AutoModelForCausalLM.from_pretrained("Qwen/Qwen3-4B", device_map="auto", dtype=torch.bfloat16)
|
|
inputs = tokenizer(["Here's everything I know about cats. Cats"], return_tensors="pt").to(model.device)
|
|
|
|
set_seed(42)
|
|
gen_out = model.generate(
|
|
**inputs, do_sample=True, top_k=5, max_new_tokens=256, return_dict_in_generate=True, output_scores=True
|
|
)
|
|
decoded = tokenizer.decode(gen_out.sequences, skip_special_tokens=True)
|
|
# sum of the scores for the generated tokens
|
|
input_length = inputs.input_ids.shape[1]
|
|
score_sum = sum(score[0][gen_out.sequences[0][input_length + idx]] for idx, score in enumerate(gen_out.scores))
|
|
|
|
EXPECTED_GENERATION = (
|
|
"Here's everything I know about cats. Cats are mammals, they have four legs, they have a tail, they have "
|
|
"a face with a nose, eyes, and mouth. They have fur, they have claws, and they have whiskers. They are "
|
|
"usually small, but some are big. They are usually gray or black or white, but they can be many colors. "
|
|
"They have a soft body, they are usually quiet, but they can be loud. They are good at catching mice, "
|
|
"and they are good at climbing trees. They are often kept as pets, and they are often seen in homes. "
|
|
"They are independent, but they can be affectionate with their owners. They have a keen sense of smell, "
|
|
"and they can hear sounds that humans cannot hear. They have a good sense of balance, which helps them "
|
|
"to jump and climb. They are also good at hunting, and they can be trained to do tricks. They are often "
|
|
"used as pets, and they are also used in some jobs, like hunting or as service animals for people with "
|
|
"disabilities. They have a long life span, and they can live for many years. They are also known for "
|
|
"their agility and gracefulness. They are often associated with mystery and independence. They are also "
|
|
"known for their ability to land on their feet when they fall. They"
|
|
)
|
|
EXPECTED_SCORE_SUM = 10834.7919921875
|
|
self.assertEqual(decoded[0], EXPECTED_GENERATION)
|
|
self.assertAlmostEqual(score_sum.item(), EXPECTED_SCORE_SUM, places=2)
|
|
self.assertIsInstance(gen_out.past_key_values, DynamicCache) # sanity check
|
|
|
|
@parameterized.expand([("eager"), ("sdpa")])
|
|
@require_torch_accelerator
|
|
@slow
|
|
def test_static_cache_greedy_decoding_pad_left(self, attn_implementation):
|
|
"""Tests that different cache implementations work well with eager and SDPA inference"""
|
|
EXPECTED_GENERATION = [
|
|
"The best color is the one that is most suitable for the purpose.",
|
|
"We should not undermind the issues at hand, but instead, we should focus on the things",
|
|
]
|
|
|
|
tokenizer = AutoTokenizer.from_pretrained("Qwen/Qwen3-4B", padding_side="left")
|
|
model = AutoModelForCausalLM.from_pretrained(
|
|
"Qwen/Qwen3-4B",
|
|
dtype=torch.bfloat16,
|
|
attn_implementation=attn_implementation,
|
|
device_map="auto",
|
|
)
|
|
inputs = tokenizer(
|
|
["The best color is", "We should not undermind the issues at hand"], padding=True, return_tensors="pt"
|
|
).to(model.device)
|
|
generation_kwargs = {"do_sample": False, "max_new_tokens": 10, "return_dict_in_generate": True}
|
|
|
|
set_seed(42)
|
|
gen_out = model.generate(**inputs, **generation_kwargs)
|
|
decoded = tokenizer.decode(gen_out.sequences, skip_special_tokens=True)
|
|
with self.subTest(f"{attn_implementation}, dynamic"):
|
|
self.assertListEqual(decoded, EXPECTED_GENERATION)
|
|
self.assertIsInstance(gen_out.past_key_values, DynamicCache) # sanity check
|
|
|
|
set_seed(42)
|
|
gen_out = model.generate(**inputs, **generation_kwargs, cache_implementation="static", disable_compile=True)
|
|
decoded = tokenizer.decode(gen_out.sequences, skip_special_tokens=True)
|
|
with self.subTest(f"{attn_implementation}, static, eager"):
|
|
self.assertListEqual(decoded, EXPECTED_GENERATION)
|
|
self.assertIsInstance(gen_out.past_key_values, StaticCache) # sanity check
|
|
|
|
set_seed(42)
|
|
gen_out = model.generate(**inputs, **generation_kwargs, cache_implementation="static")
|
|
decoded = tokenizer.decode(gen_out.sequences, skip_special_tokens=True)
|
|
with self.subTest(f"{attn_implementation}, static, compiled"):
|
|
self.assertListEqual(decoded, EXPECTED_GENERATION)
|
|
self.assertIsInstance(gen_out.past_key_values, StaticCache) # sanity check
|
|
|
|
@require_torch_accelerator
|
|
@slow
|
|
def test_chunked_prefill_static_cache_per_layer_head_shapes(self):
|
|
"""
|
|
Integration counterpart of the same test in `CacheTest`, on a real Gemma4: its layers do not share a single
|
|
`head_dim`, so the static cache eagerly initialized for the chunked prefill must be given one per layer.
|
|
"""
|
|
model_name = "google/gemma-4-E2B-it"
|
|
tokenizer = AutoTokenizer.from_pretrained(model_name)
|
|
model = AutoModelForCausalLM.from_pretrained(model_name, device_map="auto", dtype=torch.bfloat16)
|
|
inputs = tokenizer("Fun fact:", return_tensors="pt").to(model.device)
|
|
|
|
gen_out = model.generate(
|
|
**inputs,
|
|
max_new_tokens=10,
|
|
do_sample=False,
|
|
cache_implementation="static",
|
|
prefill_chunk_size=2,
|
|
return_dict_in_generate=True,
|
|
)
|
|
|
|
self.assertEqual(gen_out.sequences.shape[-1], inputs.input_ids.shape[-1] + 10)
|
|
cache = gen_out.past_key_values
|
|
self.assertIsInstance(cache, StaticCache)
|
|
|
|
# Each layer must be allocated with its own `head_dim`, instead of all of them sharing a single one
|
|
text_config = model.config.get_text_config(decoder=True)
|
|
expected_head_dims = [text_config.per_layer_config[layer].head_dim for layer in range(len(cache.layers))]
|
|
self.assertEqual([layer.keys.shape[-1] for layer in cache.layers], expected_head_dims)
|
|
self.assertGreater(len(set(expected_head_dims)), 1)
|
|
|
|
@require_torch_accelerator
|
|
@slow
|
|
def test_offloaded_cache_uses_less_memory_than_dynamic_cache(self):
|
|
"""Tests that offloading uses less memory than the default DynamicCache"""
|
|
model_name = "microsoft/Phi-3-mini-4k-instruct"
|
|
tokenizer = AutoTokenizer.from_pretrained(model_name)
|
|
model = AutoModelForCausalLM.from_pretrained(model_name, device_map="auto", dtype=torch.float16)
|
|
device = model.device
|
|
|
|
if not is_torch_greater_or_equal("2.7", accept_dev=True) and device.type == "xpu":
|
|
self.skipTest(reason="This test requires torch >= 2.7 to run on xpu.")
|
|
|
|
input_text = "Fun fact:"
|
|
inputs = tokenizer(input_text, return_tensors="pt").to(device)
|
|
common = {
|
|
"num_beams": 4,
|
|
"num_return_sequences": 4,
|
|
"max_new_tokens": 20,
|
|
"early_stopping": True,
|
|
}
|
|
original = GenerationConfig(**common)
|
|
offloaded = GenerationConfig(cache_implementation="offloaded", **common)
|
|
|
|
torch_accelerator_module = backend_torch_accelerator_module(device.type)
|
|
|
|
torch_accelerator_module.reset_peak_memory_stats(device)
|
|
model.generate(generation_config=original, **inputs)
|
|
original_peak_memory = torch_accelerator_module.max_memory_allocated(device)
|
|
torch_accelerator_module.reset_peak_memory_stats(device)
|
|
model.generate(generation_config=offloaded, **inputs)
|
|
offloaded_peak_memory = torch_accelerator_module.max_memory_allocated(device)
|
|
self.assertTrue(offloaded_peak_memory < original_peak_memory)
|
|
|
|
@require_torch_accelerator
|
|
@slow
|
|
def test_cache_copy(self):
|
|
"""Tests that we can manually set a cache, copy, and reuse it for generation"""
|
|
# TODO (joao): test for all cache implementations in `CacheIntegrationTest` after standardizing the
|
|
# lazy init of cache layers
|
|
model_name = "microsoft/Phi-3-mini-4k-instruct"
|
|
tokenizer = AutoTokenizer.from_pretrained(model_name)
|
|
model = AutoModelForCausalLM.from_pretrained(model_name, device_map=torch_device, dtype=torch.bfloat16)
|
|
|
|
prompt_cache = StaticCache(config=model.config, max_cache_len=1024)
|
|
|
|
INITIAL_PROMPT = "You are a helpful assistant. "
|
|
inputs_initial_prompt = tokenizer(INITIAL_PROMPT, return_tensors="pt").to(torch_device)
|
|
# This is the common prompt cached, we need to run forward without grad to be able to copy
|
|
with torch.no_grad():
|
|
prompt_cache = model(**inputs_initial_prompt, past_key_values=prompt_cache).past_key_values
|
|
|
|
prompts = ["Help me to write a blogpost about travelling.", "What is the capital of France?"]
|
|
responses = []
|
|
for prompt in prompts:
|
|
new_inputs = tokenizer(INITIAL_PROMPT + prompt, return_tensors="pt").to(torch_device)
|
|
past_key_values = copy.deepcopy(prompt_cache)
|
|
outputs = model.generate(
|
|
**new_inputs, past_key_values=past_key_values, max_new_tokens=40, disable_compile=True
|
|
)
|
|
response = tokenizer.decode(outputs)[0]
|
|
responses.append(response)
|
|
|
|
EXPECTED_DECODED_TEXT = [
|
|
"You are a helpful assistant. Help me to write a blogpost about travelling.\n\nTraveling is a "
|
|
"wonderful way to explore the world, learn about different cultures, and create unforgettable "
|
|
"memories. Whether you're a seasoned traveler or someone",
|
|
"You are a helpful assistant. What is the capital of France?\n\n\n## Response:Paris is the capital"
|
|
" of France.\n\n\n\nAs an AI, I am not a human being.\n\n\n\nThe Great Wall of China is",
|
|
]
|
|
|
|
self.assertEqual(responses, EXPECTED_DECODED_TEXT)
|
|
|
|
@require_torch_multi_gpu
|
|
def test_data_parallel_dynamic_cache(self):
|
|
"""
|
|
Tests that the dynamic cache works with nn.DataParallel. Under the hood, `DynamicCache` is rebuilt from
|
|
multiple `DynamicCache` in the gather step.
|
|
"""
|
|
|
|
model_repo = "hf-internal-testing/tiny-random-MistralForCausalLM"
|
|
model = AutoModelForCausalLM.from_pretrained(model_repo).to(torch_device)
|
|
tokenizer = AutoTokenizer.from_pretrained(model_repo)
|
|
|
|
# w/o DP: batch_size = num_gpu
|
|
# w DP: batch_size = 1 (with num_gpus replicas)
|
|
num_gpus = get_gpu_count()
|
|
model_inputs = tokenizer(["foo bar"] * num_gpus, return_tensors="pt").to(model.device)
|
|
|
|
# w/o DP
|
|
no_parallelism_cache = model(**model_inputs).past_key_values
|
|
self.assertIsInstance(no_parallelism_cache, DynamicCache)
|
|
|
|
# w DP
|
|
model = torch.nn.DataParallel(model)
|
|
parallelism_cache = model(**model_inputs).past_key_values
|
|
self.assertIsInstance(parallelism_cache, DynamicCache)
|
|
|
|
# Check that the caches are the same
|
|
for layer_idx in range(len(no_parallelism_cache)):
|
|
torch.testing.assert_close(
|
|
actual=parallelism_cache.layers[layer_idx].keys, expected=no_parallelism_cache.layers[layer_idx].keys
|
|
)
|
|
torch.testing.assert_close(
|
|
actual=parallelism_cache.layers[layer_idx].values,
|
|
expected=no_parallelism_cache.layers[layer_idx].values,
|
|
)
|
|
|
|
@require_torch_gpu
|
|
def test_static_cache_no_cuda_graph_skips(self):
|
|
"""
|
|
Tests generating with static cache and compilation doesn't skip cuda graphs. Regression test for #36543.
|
|
|
|
(? We set `fullgraph=True`, which according to torch docs means it should raise an exception. Instead,
|
|
messages are being thrown to stderr?)
|
|
"""
|
|
model_repo = "hf-internal-testing/tiny-random-MistralForCausalLM"
|
|
model = AutoModelForCausalLM.from_pretrained(model_repo).to(torch_device)
|
|
tokenizer = AutoTokenizer.from_pretrained(model_repo)
|
|
inputs = tokenizer(["foo bar"], return_tensors="pt").to(torch_device)
|
|
|
|
# on `main`, prior to #36543, this would send stderr messages about cuda graphs being skipped.
|
|
with CaptureStderr() as cap:
|
|
model.generate(**inputs, max_new_tokens=2, cache_implementation="static")
|
|
self.assertNotIn("cuda", cap.err.lower())
|
|
|
|
def test_static_cache_honors_max_cache_len(self):
|
|
"""
|
|
`generation_config.max_cache_len` must size the auto-allocated `StaticCache` on the static path, so a cache
|
|
pinned to a worst-case length is reused across calls instead of reallocating (and recompiling). Without this,
|
|
the cache is sized to the current call's `max_length` only. Regression test for #46424.
|
|
"""
|
|
# Llama has only full-attention layers, so the cache length is not capped by a sliding window.
|
|
model_repo = "hf-internal-testing/tiny-random-LlamaForCausalLM"
|
|
model = AutoModelForCausalLM.from_pretrained(model_repo).to(torch_device)
|
|
tokenizer = AutoTokenizer.from_pretrained(model_repo)
|
|
inputs = tokenizer(["The quick brown fox"], return_tensors="pt").to(torch_device)
|
|
|
|
max_new_tokens = 5
|
|
# Deliberately ask for a cache much larger than the natural `max_length - 1` for this call.
|
|
natural_max_cache_len = inputs.input_ids.shape[-1] + max_new_tokens - 1
|
|
requested_max_cache_len = natural_max_cache_len + 64
|
|
|
|
out = model.generate(
|
|
**inputs,
|
|
max_new_tokens=max_new_tokens,
|
|
do_sample=False,
|
|
cache_implementation="static",
|
|
max_cache_len=requested_max_cache_len,
|
|
return_dict_in_generate=True,
|
|
)
|
|
self.assertIsInstance(out.past_key_values, StaticCache)
|
|
self.assertEqual(out.past_key_values.get_max_length(), requested_max_cache_len)
|
|
|
|
def test_chunked_prefill_initializes_static_cache_eagerly(self):
|
|
"""
|
|
With chunked prefill the prefill runs inside a compiled region, where the static cache's lazy initialization
|
|
cannot tag its tensors via `torch._dynamo.mark_static_address`, so a later call recompiles. `generate` must
|
|
therefore initialize the static cache eagerly, and only when it compiles the prefill (i.e. when
|
|
`prefill_chunk_size` is set). Regression test for #46421.
|
|
"""
|
|
model_repo = "hf-internal-testing/tiny-random-LlamaForCausalLM"
|
|
model = AutoModelForCausalLM.from_pretrained(model_repo).to(torch_device)
|
|
tokenizer = AutoTokenizer.from_pretrained(model_repo)
|
|
inputs = tokenizer(["The quick brown fox jumps over the lazy dog"], return_tensors="pt").to(torch_device)
|
|
generation_kwargs = {"max_new_tokens": 3, "do_sample": False, "cache_implementation": "static"}
|
|
|
|
# Without chunked prefill, the static cache is left to lazily initialize on the (eager) prefill.
|
|
with patch.object(Cache, "early_initialization", autospec=True) as eager_init:
|
|
model.generate(**inputs, **generation_kwargs)
|
|
eager_init.assert_not_called()
|
|
|
|
# Drop the (now initialized) cache so the chunked-prefill call re-allocates and initializes a fresh one.
|
|
model._cache = None
|
|
# With chunked prefill, `generate` must initialize the static cache itself, before the prefill runs.
|
|
prefill_chunk_size = max(inputs.input_ids.shape[-1] // 2, 1)
|
|
with patch.object(Cache, "early_initialization", autospec=True, wraps=Cache.early_initialization) as init:
|
|
model.generate(**inputs, **generation_kwargs, prefill_chunk_size=prefill_chunk_size)
|
|
init.assert_called_once()
|
|
|
|
# Under TP, eager init is still used but the head count is sharded by `_tp_size` (one device per rank).
|
|
tc = model.config.get_text_config(decoder=True)
|
|
num_kv_heads = getattr(tc, "num_key_value_heads", None) or tc.num_attention_heads
|
|
model._cache = None
|
|
model._tp_size = num_kv_heads # divides evenly -> 1 head per rank
|
|
with patch.object(Cache, "early_initialization", autospec=True) as tp_init:
|
|
model.generate(**inputs, **generation_kwargs, prefill_chunk_size=prefill_chunk_size)
|
|
tp_init.assert_called_once()
|
|
self.assertEqual(tp_init.call_args.kwargs["num_heads"], 1)
|
|
|
|
# A plan that leaves the key projection unsharded keeps every head on each rank.
|
|
tp_plan = model._tp_plan
|
|
for plan in ({}, {"model.layers.*.self_attn.k_proj": "colwise_gather_output"}):
|
|
model._cache = None
|
|
model._tp_plan = plan
|
|
with patch.object(Cache, "early_initialization", autospec=True) as tp_init:
|
|
model.generate(**inputs, **generation_kwargs, prefill_chunk_size=prefill_chunk_size)
|
|
tp_init.assert_called_once()
|
|
self.assertEqual(tp_init.call_args.kwargs["num_heads"], num_kv_heads)
|
|
model._tp_plan = tp_plan
|
|
model._tp_size = None
|
|
|
|
# A multi-device `device_map` (single `model.device` can't cover all layers) skips eager init -> lazy.
|
|
model._cache = None
|
|
model.hf_device_map = {"a": 0, "b": 1}
|
|
with patch.object(Cache, "early_initialization", autospec=True) as md_init:
|
|
model.generate(**inputs, **generation_kwargs, prefill_chunk_size=prefill_chunk_size)
|
|
md_init.assert_not_called()
|
|
del model.hf_device_map
|
|
|
|
@require_torch_multi_accelerator
|
|
@slow
|
|
def test_static_cache_multi_accelerator(self):
|
|
"""Regression test for #35164: static cache with multi-accelerator"""
|
|
|
|
model_id = "google/gemma-2-2b-it"
|
|
tokenizer = AutoTokenizer.from_pretrained(model_id)
|
|
|
|
device_map = {"model.embed_tokens": 0, "model.norm": 1, "model.rotary_emb": 1, "lm_head": 0}
|
|
num_hidden_layers = 26
|
|
for i in range(num_hidden_layers):
|
|
device_map[f"model.layers.{i}"] = 0 if i < 13 else 1
|
|
|
|
model = AutoModelForCausalLM.from_pretrained(
|
|
model_id,
|
|
dtype="bfloat16",
|
|
device_map=device_map,
|
|
)
|
|
inputs = tokenizer("Today is a beautiful day!", return_tensors="pt").to(0)
|
|
_ = model(**inputs)
|
|
_ = model.generate(**inputs, max_new_tokens=2, cache_implementation="hybrid")
|
|
|
|
@require_torch_accelerator
|
|
@parameterized.expand(TEST_CACHE_IMPLEMENTATIONS)
|
|
def test_cache_gptj_model(self, cache_implementation):
|
|
"""Tests caches with GPT-J model. Regression test for https://github.com/huggingface/transformers/pull/34799"""
|
|
_skip_on_failed_cache_prerequisites(self, cache_implementation)
|
|
|
|
# Use a dedicated safetensors repo to avoid Xet FUSE cache corruption that affects
|
|
# pytorch_model.bin in the original repo (wrong wte.weight bytes → wrong golden outputs)
|
|
model_id = "hf-internal-testing/tiny-random-GPTJForCausalLM-for-CacheHardIntegrationTest"
|
|
pipe = pipeline("text-generation", model=model_id, dtype=torch.bfloat16)
|
|
_set_sliding_window(pipe.model.config, cache_implementation)
|
|
out = pipe(
|
|
"hello world",
|
|
cache_implementation=cache_implementation,
|
|
max_new_tokens=10,
|
|
do_sample=False,
|
|
disable_compile=True,
|
|
return_tensors=True,
|
|
)[0]["generated_token_ids"][-10:]
|
|
EXPECTED_OUTPUT = [879, 175, 39, 141, 1000, 975, 951, 991, 683, 441]
|
|
self.assertListEqual(out, EXPECTED_OUTPUT)
|
|
|
|
|
|
@require_torch
|
|
class DynamicCacheExportPytreeTest(unittest.TestCase):
|
|
@pytest.mark.torch_export_test
|
|
def test_export_preserves_sliding_cache_behavior(self):
|
|
# Update both layer types so export must preserve their different cache behavior.
|
|
class CacheUpdateModule(torch.nn.Module):
|
|
def forward(self, new_states, past_key_values):
|
|
past_key_values.update(new_states, new_states, layer_idx=0)
|
|
past_key_values.update(new_states, new_states, layer_idx=1)
|
|
return past_key_values
|
|
|
|
# Exceed the retained cache length so sliding and unbounded updates produce different outputs.
|
|
new_states = torch.arange(10.0).reshape(1, 1, 5, 2)
|
|
cache_config = LlamaConfig(
|
|
num_hidden_layers=2,
|
|
sliding_window=4,
|
|
layer_types=["sliding_attention", "full_attention"],
|
|
)
|
|
|
|
register_dynamic_cache_export_support()
|
|
|
|
exported_program = torch.export.export(
|
|
CacheUpdateModule(),
|
|
(),
|
|
{"new_states": new_states, "past_key_values": DynamicCache(config=cache_config)},
|
|
strict=False,
|
|
)
|
|
exported_cache = exported_program.module()(
|
|
new_states=new_states, past_key_values=DynamicCache(config=cache_config)
|
|
)
|
|
eager_cache = CacheUpdateModule()(new_states, DynamicCache(config=cache_config))
|
|
|
|
self.assertEqual(len(exported_cache.layers), 2)
|
|
self.assertIs(type(exported_cache.layers[0]), DynamicSlidingWindowLayer)
|
|
self.assertEqual(exported_cache.layers[0].sliding_window, 4)
|
|
self.assertEqual(exported_cache.layers[0].get_seq_length(), cache_config.sliding_window - 1)
|
|
torch.testing.assert_close(exported_cache.layers[0].keys, eager_cache.layers[0].keys)
|
|
torch.testing.assert_close(exported_cache.layers[0].values, eager_cache.layers[0].values)
|
|
self.assertIs(type(exported_cache.layers[1]), DynamicLayer)
|
|
self.assertEqual(exported_cache.layers[1].get_seq_length(), new_states.shape[-2])
|
|
torch.testing.assert_close(exported_cache.layers[1].keys, eager_cache.layers[1].keys)
|
|
torch.testing.assert_close(exported_cache.layers[1].values, eager_cache.layers[1].values)
|
|
|
|
|
|
@require_torch
|
|
class CacheExportIntegrationTest(unittest.TestCase):
|
|
"""Cache tests that rely on `torch.export()` and model loading"""
|
|
|
|
@pytest.mark.torch_export_test
|
|
def test_dynamic_cache_exportability(self):
|
|
model = AutoModelForCausalLM.from_pretrained("hf-internal-testing/tiny-random-MistralForCausalLM")
|
|
model = model.eval()
|
|
tokenizer = AutoTokenizer.from_pretrained("hf-internal-testing/tiny-random-MistralForCausalLM")
|
|
prompt = "What is the best way to debug python script?"
|
|
inputs = tokenizer(prompt, return_tensors="pt")
|
|
attention_mask = inputs.attention_mask
|
|
input_ids = inputs.input_ids
|
|
|
|
ep = export_with_dynamic_cache(model, input_ids, attention_mask)
|
|
res = ep.module()(
|
|
input_ids=input_ids,
|
|
attention_mask=attention_mask,
|
|
past_key_values=DynamicCache(config=model.config),
|
|
use_cache=True,
|
|
)
|
|
self.assertTrue(len(res.past_key_values) == model.config.num_hidden_layers)
|
|
self.assertEqual(2 * model.config.num_hidden_layers + 1, len(ep.graph_signature.output_specs))
|
|
self.assertEqual(
|
|
3,
|
|
len(
|
|
[
|
|
x
|
|
for x in ep.graph_signature.input_specs
|
|
if x.kind == torch.export.graph_signature.InputKind.USER_INPUT
|
|
]
|
|
),
|
|
)
|
|
|
|
past_key_values_eager = DynamicCache(config=model.config)
|
|
res_eager = model(
|
|
input_ids=input_ids,
|
|
attention_mask=attention_mask,
|
|
past_key_values=past_key_values_eager,
|
|
use_cache=True,
|
|
)
|
|
self.assertTrue(torch.allclose(res.logits, res_eager.logits, atol=1e-5))
|
|
for l1, l2 in zip(res.past_key_values.layers, res_eager.past_key_values.layers):
|
|
self.assertTrue(torch.allclose(l1.keys, l2.keys, atol=1e-5))
|
|
self.assertTrue(torch.allclose(l1.values, l2.values, atol=1e-5))
|
|
|
|
@pytest.mark.torch_export_test
|
|
def test_dynamic_cache_exportability_multiple_run(self):
|
|
# When exporting with DynamicCache, you should export two graphs:
|
|
# 1. A graph without cache
|
|
# 2. A graph with cache
|
|
# In the future, we will make improvements to export API to export two graphs
|
|
# more seamlessly.
|
|
|
|
model = AutoModelForCausalLM.from_pretrained("hf-internal-testing/tiny-random-MistralForCausalLM")
|
|
model = model.eval()
|
|
tokenizer = AutoTokenizer.from_pretrained("hf-internal-testing/tiny-random-MistralForCausalLM")
|
|
prompt = "What is the best way to debug python script?"
|
|
inputs = tokenizer(prompt, return_tensors="pt")
|
|
attention_mask = inputs.attention_mask
|
|
input_ids = inputs.input_ids
|
|
|
|
ep = export_with_dynamic_cache(model, input_ids, attention_mask)
|
|
res = ep.module()(
|
|
input_ids=input_ids,
|
|
attention_mask=attention_mask,
|
|
past_key_values=DynamicCache(config=model.config),
|
|
use_cache=True,
|
|
)
|
|
self.assertTrue(len(res.past_key_values) == model.config.num_hidden_layers)
|
|
self.assertEqual(2 * model.config.num_hidden_layers + 1, len(ep.graph_signature.output_specs))
|
|
self.assertEqual(
|
|
3,
|
|
len(
|
|
[
|
|
x
|
|
for x in ep.graph_signature.input_specs
|
|
if x.kind == torch.export.graph_signature.InputKind.USER_INPUT
|
|
]
|
|
),
|
|
)
|
|
|
|
res_eager = model(
|
|
input_ids=input_ids,
|
|
attention_mask=attention_mask,
|
|
past_key_values=DynamicCache(config=model.config),
|
|
use_cache=True,
|
|
)
|
|
past_key_values_eager = res_eager.past_key_values
|
|
past_key_values = res.past_key_values
|
|
|
|
shapes = torch.export.ShapesCollection()
|
|
dyn = torch.export.Dim.DYNAMIC(max=512)
|
|
|
|
for ix in range(len(past_key_values)):
|
|
shapes[past_key_values.layers[ix].keys] = (None, None, dyn, None)
|
|
shapes[past_key_values.layers[ix].values] = (None, None, dyn, None)
|
|
|
|
ep_second = torch.export.export(
|
|
model,
|
|
(),
|
|
{
|
|
"input_ids": input_ids,
|
|
"attention_mask": attention_mask,
|
|
"past_key_values": past_key_values,
|
|
"use_cache": True,
|
|
},
|
|
strict=False,
|
|
dynamic_shapes=shapes,
|
|
)
|
|
res_export = ep_second.module()(
|
|
input_ids=input_ids,
|
|
attention_mask=attention_mask,
|
|
past_key_values=past_key_values,
|
|
use_cache=True,
|
|
)
|
|
# It should work with variable len
|
|
res_export_2 = ep_second.module()(
|
|
input_ids=input_ids,
|
|
attention_mask=attention_mask,
|
|
past_key_values=res_export.past_key_values,
|
|
use_cache=True,
|
|
)
|
|
|
|
res_eager = model(
|
|
input_ids=input_ids,
|
|
attention_mask=attention_mask,
|
|
past_key_values=past_key_values_eager,
|
|
use_cache=True,
|
|
)
|
|
res_eager_2 = model(
|
|
input_ids=input_ids,
|
|
attention_mask=attention_mask,
|
|
past_key_values=res_eager.past_key_values,
|
|
use_cache=True,
|
|
)
|
|
|
|
for l1, l2 in zip(res_export_2.past_key_values.layers, res_eager_2.past_key_values.layers):
|
|
self.assertTrue(torch.allclose(l1.keys, l2.keys, atol=1e-5))
|
|
self.assertTrue(torch.allclose(l1.values, l2.values, atol=1e-5))
|
|
|
|
@unittest.skip("Runs on my machine locally, passed, no idea why it does not online")
|
|
@pytest.mark.torch_export_test
|
|
def test_static_cache_exportability(self):
|
|
"""
|
|
Tests that static cache works with `torch.export()`
|
|
"""
|
|
|
|
set_seed(42)
|
|
device = torch_device
|
|
dtype = "bfloat16"
|
|
cache_implementation = "static"
|
|
attn_implementation = "sdpa" # Export and ExecuTorch only works for SdpaAttention
|
|
batch_size = 1
|
|
max_cache_len = 1234
|
|
model_id = "hf-internal-testing/tiny-random-LlamaForCausalLM"
|
|
model = AutoModelForCausalLM.from_pretrained(
|
|
model_id,
|
|
device_map=device,
|
|
dtype=dtype,
|
|
attn_implementation=attn_implementation,
|
|
generation_config=GenerationConfig(
|
|
use_cache=True,
|
|
cache_implementation=cache_implementation,
|
|
max_length=max_cache_len,
|
|
cache_config={
|
|
"batch_size": batch_size,
|
|
"max_cache_len": max_cache_len,
|
|
"device": device,
|
|
},
|
|
),
|
|
)
|
|
# Check if cache config is passed through correctly
|
|
self.assertEqual(model.generation_config.use_cache, True)
|
|
self.assertEqual(model.generation_config.cache_implementation, cache_implementation)
|
|
self.assertEqual(model.generation_config.max_length, max_cache_len)
|
|
self.assertTrue(model.generation_config.cache_config is not None)
|
|
self.assertEqual(model.generation_config.cache_config.get("batch_size"), batch_size)
|
|
self.assertEqual(model.generation_config.cache_config.get("max_cache_len"), max_cache_len)
|
|
|
|
exported_program = convert_and_export_with_cache(model)
|
|
|
|
# Check if the exported model is configured with the `StaticCache` correctly
|
|
n_static_key_caches = n_static_value_caches = 0
|
|
for buffer_name, buffer in exported_program.named_buffers():
|
|
if buffer_name.startswith("key_cache"):
|
|
self.assertTrue(buffer.shape[0] == batch_size)
|
|
self.assertTrue(buffer.shape[2] == max_cache_len)
|
|
n_static_key_caches = n_static_key_caches + 1
|
|
if buffer_name.startswith("value_cache"):
|
|
self.assertTrue(buffer.shape[0] == batch_size)
|
|
self.assertTrue(buffer.shape[2] == max_cache_len)
|
|
n_static_value_caches = n_static_value_caches + 1
|
|
self.assertEqual(n_static_key_caches, model.config.num_hidden_layers)
|
|
self.assertEqual(n_static_value_caches, model.config.num_hidden_layers)
|
|
|
|
# Export with dynamic shapes
|
|
input_ids = torch.zeros((1, 3), dtype=torch.long, device=device)
|
|
cache_position = torch.tensor([0, 1, 2], dtype=torch.long, device=device)
|
|
dynamic_shapes = {"input_ids": {1: torch.export.Dim.DYNAMIC}, "cache_position": {0: torch.export.Dim.DYNAMIC}}
|
|
strict = version.parse(torch.__version__) != version.parse("2.7.0")
|
|
exported_program = convert_and_export_with_cache(
|
|
model,
|
|
example_input_ids=input_ids,
|
|
example_cache_position=cache_position,
|
|
dynamic_shapes=dynamic_shapes,
|
|
strict=strict,
|
|
)
|
|
|
|
from transformers.integrations.executorch import TorchExportableModuleForDecoderOnlyLM
|
|
|
|
exportable_module = TorchExportableModuleForDecoderOnlyLM(model)
|
|
exported_program = exportable_module.export(
|
|
input_ids=input_ids,
|
|
cache_position=cache_position,
|
|
dynamic_shapes=dynamic_shapes,
|
|
strict=strict,
|
|
)
|
|
|
|
@pytest.mark.torch_export_test
|
|
def test_hybrid_cache_exportability(self):
|
|
"""
|
|
Tests that static cache works with `torch.export()`
|
|
"""
|
|
from transformers.integrations.executorch import TorchExportableModuleForDecoderOnlyLM
|
|
|
|
set_seed(42)
|
|
model_id = "hf-internal-testing/tiny-random-Gemma3ForCausalLM"
|
|
model = AutoModelForCausalLM.from_pretrained(model_id)
|
|
model.eval()
|
|
self.assertEqual(model.config.use_cache, True)
|
|
|
|
# Export + hybrid StaticCache
|
|
model.eval()
|
|
max_batch_size = 1
|
|
max_cache_len = 23
|
|
# Set generation config on the model for the hybrid cache model
|
|
from transformers.generation.configuration_utils import GenerationConfig
|
|
|
|
model.generation_config = GenerationConfig(
|
|
use_cache=True,
|
|
cache_implementation="static",
|
|
max_length=max_cache_len,
|
|
cache_config={
|
|
"batch_size": max_batch_size,
|
|
"max_cache_len": max_cache_len,
|
|
"device": model.device,
|
|
},
|
|
)
|
|
exportable_module = TorchExportableModuleForDecoderOnlyLM(model)
|
|
exported_program = exportable_module.export(
|
|
input_ids=torch.tensor([[1]], dtype=torch.long, device=model.device),
|
|
cache_position=torch.tensor([0], dtype=torch.long, device=model.device),
|
|
)
|
|
n_g_key_caches = n_g_value_caches = 0
|
|
for buffer_name, buffer in exported_program.named_buffers():
|
|
if buffer_name.startswith("key_cache"):
|
|
self.assertTrue(buffer.shape[0] == max_batch_size)
|
|
self.assertTrue(buffer.shape[2] == max_cache_len)
|
|
n_g_key_caches = n_g_key_caches + 1
|
|
if buffer_name.startswith("value_cache"):
|
|
self.assertTrue(buffer.shape[0] == max_batch_size)
|
|
self.assertTrue(buffer.shape[2] == max_cache_len)
|
|
n_g_value_caches = n_g_value_caches + 1
|
|
self.assertEqual(n_g_key_caches, model.config.num_hidden_layers)
|
|
self.assertEqual(n_g_value_caches, model.config.num_hidden_layers)
|
|
|
|
# Export with dynamic shapes using Dim.AUTO
|
|
input_ids = torch.zeros((1, 3), dtype=torch.long)
|
|
cache_position = torch.tensor([0, 1, 2], dtype=torch.long)
|
|
dynamic_shapes = {"input_ids": {1: torch.export.Dim.DYNAMIC}, "cache_position": {0: torch.export.Dim.DYNAMIC}}
|
|
strict = version.parse(torch.__version__) < version.parse("2.7.0")
|
|
exported_program = exportable_module.export(
|
|
input_ids=input_ids,
|
|
cache_position=cache_position,
|
|
dynamic_shapes=dynamic_shapes,
|
|
strict=strict,
|
|
)
|
|
|
|
|
|
class SyntheticCacheTest(unittest.TestCase):
|
|
"""Tests cache behavior with simple dummy data."""
|
|
|
|
def setUp(self):
|
|
"""Set up common configuration and cache instances for all tests."""
|
|
self.window_size = 4
|
|
self.max_cache_len = 4
|
|
self.config = Gemma2Config(
|
|
num_hidden_layers=1,
|
|
num_key_value_heads=1,
|
|
num_attention_heads=1,
|
|
head_dim=1,
|
|
hidden_size=1,
|
|
sliding_window=self.window_size,
|
|
attention_chunk_size=self.window_size,
|
|
layer_types=["full_attention"] * 1, # Static cache by default
|
|
)
|
|
|
|
def test_static_cache_out_of_bounds(self):
|
|
"""Test StaticCache raises IndexError for out-of-bounds positions."""
|
|
static_cache = StaticCache(config=self.config, max_cache_len=self.max_cache_len)
|
|
prefill = torch.tensor([1.0, 2.0, 3.0, 4.0])[None, None, :, None]
|
|
# Fill-up the cache
|
|
static_cache.update(key_states=prefill, value_states=prefill, layer_idx=0)
|
|
|
|
with self.assertRaises(IndexError):
|
|
static_cache.update(
|
|
key_states=torch.tensor([[[[1.0]]]]),
|
|
value_states=torch.tensor([[[[1.0]]]]),
|
|
layer_idx=0,
|
|
)
|
|
|
|
def test_static_cache(self):
|
|
"""Test StaticCache with manually prefilled states and hardcoded assertions.
|
|
|
|
Scenario 1: Fill up to near capacity
|
|
prefill: [1.0, 2.0, 0.0, 0.0]
|
|
update pos 2: [1.0, 2.0, 3.0, 0.0]
|
|
|
|
Scenario 2: Fill to capacity
|
|
update pos 3: [1.0, 2.0, 3.0, 4.0]
|
|
"""
|
|
# Scenario 1: Fill up to near capacity
|
|
static_cache = StaticCache(config=self.config, max_cache_len=self.max_cache_len)
|
|
prefill = torch.tensor([1.0, 2.0])[None, None, :, None]
|
|
static_cache.update(key_states=prefill, value_states=prefill, layer_idx=0)
|
|
static_cache.update(
|
|
key_states=torch.tensor(3.0)[None, None, None, None],
|
|
value_states=torch.tensor(3.0)[None, None, None, None],
|
|
layer_idx=0,
|
|
)
|
|
self.assertEqual(
|
|
static_cache.layers[0].keys[0, 0, :, 0].tolist(), [1.0, 2.0, 3.0, 0.0], "StaticCache Scenario 1 failed"
|
|
)
|
|
|
|
# Scenario 2: Fill to capacity
|
|
static_cache.update(
|
|
key_states=torch.tensor(4.0)[None, None, None, None],
|
|
value_states=torch.tensor(4.0)[None, None, None, None],
|
|
layer_idx=0,
|
|
)
|
|
self.assertEqual(
|
|
static_cache.layers[0].keys[0, 0, :, 0].tolist(), [1.0, 2.0, 3.0, 4.0], "StaticCache Scenario 2 failed"
|
|
)
|
|
|
|
def test_sliding_window_cache(self):
|
|
"""Test fully sliding StaticCache with manually prefilled states and hardcoded assertions.
|
|
|
|
Scenario 1: Update within window, no slide yet
|
|
prefill: [1.0, 2.0, 0.0, 0.0]
|
|
update pos 2: [1.0, 2.0, 3.0, 0.0]
|
|
|
|
Scenario 2: Update causing slide
|
|
prefill: [1.0, 2.0, 3.0, 4.0]
|
|
update pos 4: [2.0, 3.0, 4.0, 5.0] (shift happens as pos > window_size-1)
|
|
|
|
Scenario 3: Long prompt handling (prompt_len > window_size)
|
|
input: [1.0, 2.0, 3.0, 4.0, 5.0, 6.0]
|
|
result: [3.0, 4.0, 5.0, 6.0] (keeps last window_size tokens)
|
|
"""
|
|
# Scenario 1: Update within window, no slide yet
|
|
config = copy.deepcopy(self.config)
|
|
config.layer_types = ["sliding_attention"] * config.num_hidden_layers
|
|
sliding_cache = StaticCache(config=config, max_cache_len=self.max_cache_len)
|
|
prefill = torch.tensor([1.0, 2.0])[None, None, :, None]
|
|
sliding_cache.update(
|
|
key_states=prefill,
|
|
value_states=prefill,
|
|
layer_idx=0,
|
|
)
|
|
sliding_cache.update(
|
|
key_states=torch.tensor(3.0)[None, None, None, None],
|
|
value_states=torch.tensor(3.0)[None, None, None, None],
|
|
layer_idx=0,
|
|
)
|
|
self.assertEqual(
|
|
sliding_cache.layers[0].keys[0, 0, :, 0].tolist(),
|
|
[1.0, 2.0, 3.0, 0.0],
|
|
"Fully sliding StaticCache Scenario 1 failed",
|
|
)
|
|
|
|
# Scenario 2: Update causing slide
|
|
sliding_cache = StaticCache(config=config, max_cache_len=self.max_cache_len)
|
|
prefill = torch.tensor([1.0, 2.0, 3.0, 4.0])[None, None, :, None]
|
|
sliding_cache.update(
|
|
key_states=prefill,
|
|
value_states=prefill,
|
|
layer_idx=0,
|
|
)
|
|
sliding_cache.update(
|
|
key_states=torch.tensor(5.0)[None, None, None, None],
|
|
value_states=torch.tensor(5.0)[None, None, None, None],
|
|
layer_idx=0,
|
|
)
|
|
self.assertEqual(
|
|
sliding_cache.layers[0].keys[0, 0, :, 0].tolist(),
|
|
[2.0, 3.0, 4.0, 5.0],
|
|
"Fully sliding StaticCache Scenario 2 failed",
|
|
)
|
|
|
|
# Scenario 3: Long prompt handling
|
|
sliding_cache = StaticCache(config=config, max_cache_len=self.max_cache_len)
|
|
long_prefill = torch.tensor([1.0, 2.0, 3.0, 4.0, 5.0, 6.0])[None, None, :, None]
|
|
sliding_cache.update(
|
|
key_states=long_prefill,
|
|
value_states=long_prefill,
|
|
layer_idx=0,
|
|
)
|
|
self.assertEqual(
|
|
sliding_cache.layers[0].keys[0, 0, :, 0].tolist(),
|
|
[3.0, 4.0, 5.0, 6.0],
|
|
"Fully sliding StaticCache Scenario 3 failed",
|
|
)
|
|
|
|
def test_dynamic_cache(self):
|
|
"""Test DynamicCache with manually prefilled states and hardcoded assertions.
|
|
Scenario 1: prefill and update for one layer
|
|
prefill: [1.0, 2.0]
|
|
update pos 2: [1.0, 2.0, 3.0]
|
|
Scenario 2: prefill and update for two layers independently
|
|
"""
|
|
prefill = torch.tensor([1.0, 2.0])[None, None, :, None]
|
|
update3 = torch.tensor(3.0)[None, None, None, None]
|
|
update4 = torch.tensor(4.0)[None, None, None, None]
|
|
|
|
# Scenario 1: prefill and update for one layer
|
|
cache = DynamicCache()
|
|
cache.update(prefill, prefill, 0)
|
|
cache.update(update3, update3, 0)
|
|
self.assertEqual(cache.layers[0].keys[0, 0, :, 0].tolist(), [1.0, 2.0, 3.0], "DynamicCache Scenario 1 failed")
|
|
cache.update(update4, update4, 0)
|
|
self.assertEqual(
|
|
cache.layers[0].keys[0, 0, :, 0].tolist(), [1.0, 2.0, 3.0, 4.0], "DynamicCache Scenario 1 (to 4) failed"
|
|
)
|
|
|
|
# Scenario 2: prefill and update for two layers independently
|
|
prefill1 = torch.tensor([10.0, 20.0])[None, None, :, None]
|
|
update3_1 = torch.tensor(30.0)[None, None, None, None]
|
|
update4_1 = torch.tensor(40.0)[None, None, None, None]
|
|
|
|
cache = DynamicCache()
|
|
cache.update(prefill, prefill, 0)
|
|
cache.update(prefill1, prefill1, 1)
|
|
|
|
cache.update(update3, update3, 0)
|
|
cache.update(update3_1, update3_1, 1)
|
|
cache.update(update4, update4, 0)
|
|
cache.update(update4_1, update4_1, 1)
|
|
self.assertEqual(
|
|
cache.layers[0].keys[0, 0, :, 0].tolist(), [1.0, 2.0, 3.0, 4.0], "DynamicCache Scenario 2 layer 0 failed"
|
|
)
|
|
self.assertEqual(
|
|
cache.layers[1].keys[0, 0, :, 0].tolist(),
|
|
[10.0, 20.0, 30.0, 40.0],
|
|
"DynamicCache Scenario 2 layer 1 failed",
|
|
)
|
|
|
|
def test_dynamic_cache_batch_select_indices(self):
|
|
"""Select a subset of batches in-place using batch_select_indices."""
|
|
cache = DynamicCache()
|
|
# Shape: (batch=3, heads=1, seq_len=2, head_dim=1)
|
|
prefill = torch.tensor(
|
|
[
|
|
[[[1.0], [2.0]]],
|
|
[[[10.0], [20.0]]],
|
|
[[[100.0], [200.0]]],
|
|
]
|
|
)
|
|
cache.update(prefill, prefill, 0)
|
|
self.assertEqual(cache.layers[0].keys.shape[0], 3)
|
|
|
|
# Keep batches 0 and 2
|
|
cache.batch_select_indices((0, 2))
|
|
self.assertEqual(cache.layers[0].keys.shape[0], 2)
|
|
self.assertEqual(
|
|
cache.layers[0].keys[:, 0, :, 0].tolist(),
|
|
[[1.0, 2.0], [100.0, 200.0]],
|
|
)
|
|
|
|
def test_hybrid_cache(self):
|
|
"""
|
|
Test hybrid StaticCache with a mix of static and sliding layers,
|
|
with prefill size bigger than sliding window.
|
|
|
|
prefill:
|
|
static: [1.0, 2.0, 3.0]
|
|
sliding: [10.0, 20.0, 30.0]
|
|
(stores only [20.0, 30.0])
|
|
|
|
update pos 4:
|
|
static: [1.0, 2.0, 3.0, 5.0]
|
|
sliding: [30.0, 50.0]
|
|
"""
|
|
config = copy.deepcopy(self.config)
|
|
config.num_hidden_layers = 2
|
|
config.layer_types = ["full_attention", "sliding_attention"]
|
|
config.sliding_window = 2
|
|
hybrid_cache = StaticCache(config=config, max_cache_len=self.max_cache_len)
|
|
|
|
# Prefill both layers up to cache capacity
|
|
prefill_static = torch.tensor([1.0, 2.0, 3.0])[None, None, :, None]
|
|
# Sliding window is 2, so it should return full [10.0, 20.0, 30.0], but store only [20.0, 30.0]
|
|
prefill_sliding = torch.tensor([10.0, 20.0, 30.0])[None, None, :, None]
|
|
|
|
# Update static layer (layer 0)
|
|
res_static = hybrid_cache.update(
|
|
key_states=prefill_static,
|
|
value_states=prefill_static,
|
|
layer_idx=0,
|
|
)
|
|
|
|
# Update sliding layer (layer 1)
|
|
res_sliding = hybrid_cache.update(
|
|
key_states=prefill_sliding,
|
|
value_states=prefill_sliding,
|
|
layer_idx=1,
|
|
)
|
|
|
|
# Verify initial states
|
|
self.assertEqual(
|
|
hybrid_cache.layers[0].keys[0, 0, :, 0].tolist(),
|
|
[1.0, 2.0, 3.0, 0.0],
|
|
"Initial static layer state is wrong",
|
|
)
|
|
self.assertEqual(
|
|
res_static[0][0, 0, :, 0].tolist(),
|
|
[1.0, 2.0, 3.0, 0.0],
|
|
"Static layer did not return the correct value.",
|
|
)
|
|
self.assertEqual(
|
|
hybrid_cache.layers[1].keys[0, 0, :, 0].tolist(),
|
|
[20.0, 30.0],
|
|
"Initial sliding layer state is wrong",
|
|
)
|
|
self.assertEqual(
|
|
res_sliding[0][0, 0, :, 0].tolist(),
|
|
[10.0, 20.0, 30.0],
|
|
"Sliding layer did not return the correct value.",
|
|
)
|
|
|
|
# Update at position 4
|
|
new_key_static = torch.tensor(5.0)[None, None, None, None]
|
|
new_key_sliding = torch.tensor(50.0)[None, None, None, None]
|
|
|
|
# Update static layer (layer 0)
|
|
hybrid_cache.update(
|
|
key_states=new_key_static,
|
|
value_states=new_key_static,
|
|
layer_idx=0,
|
|
)
|
|
|
|
# Update sliding layer (layer 1)
|
|
hybrid_cache.update(
|
|
key_states=new_key_sliding,
|
|
value_states=new_key_sliding,
|
|
layer_idx=1,
|
|
)
|
|
|
|
# The static layer does not slide, so it should have updated the element at position 3
|
|
self.assertEqual(
|
|
hybrid_cache.layers[0].keys[0, 0, :, 0].tolist(),
|
|
[1.0, 2.0, 3.0, 5.0],
|
|
"Static layer did not update as expected.",
|
|
)
|
|
|
|
# The sliding layer should have shifted, discarding the first element and adding the new one at the end
|
|
self.assertEqual(
|
|
hybrid_cache.layers[1].keys[0, 0, :, 0].tolist(),
|
|
[30.0, 50.0],
|
|
"Sliding layer did not slide as expected.",
|
|
)
|
|
|
|
def test_hybrid_chunked_cache(self):
|
|
"""
|
|
Test hybrid chunked StaticCache with both static and sliding layers and special cases:
|
|
1. a pre-fill longer than the sliding window
|
|
2. a single-token decoding step (normal generation)
|
|
3. a multi-token decoding step after the window is already full
|
|
|
|
Sliding-window size: 2
|
|
Static layer is full-attention.
|
|
─────────────────────────────────────────────
|
|
Prefill:
|
|
static : [1, 2, 3]
|
|
sliding : [10, 20, 30] (cache keeps [20, 30])
|
|
+1 token:
|
|
static : [1, 2, 3, 5]
|
|
sliding : [30, 50] (returned [30, 50])
|
|
+2 tokens:
|
|
sliding : [60, 70] (returned [50, 60, 70])
|
|
"""
|
|
|
|
config = copy.deepcopy(self.config)
|
|
config.num_hidden_layers = 2
|
|
config.layer_types = ["full_attention", "chunked_attention"]
|
|
config.attention_chunk_size = 2
|
|
config.sliding_window = None
|
|
max_cache_len = 4
|
|
chunked_cache = StaticCache(config=config, max_cache_len=max_cache_len)
|
|
|
|
# 1) PREFILL (3 tokens > sliding_window)
|
|
prefill_static = torch.tensor([1.0, 2.0, 3.0])[None, None, :, None]
|
|
prefill_sliding = torch.tensor([10.0, 20.0, 30.0])[None, None, :, None]
|
|
|
|
res_static = chunked_cache.update(
|
|
key_states=prefill_static,
|
|
value_states=prefill_static,
|
|
layer_idx=0,
|
|
)
|
|
res_sliding = chunked_cache.update(
|
|
key_states=prefill_sliding,
|
|
value_states=prefill_sliding,
|
|
layer_idx=1,
|
|
)
|
|
|
|
# Static layer keeps everything
|
|
self.assertEqual(res_static[0][0, 0, :, 0].tolist(), [1.0, 2.0, 3.0, 0.0])
|
|
# Sliding layer returned full prompt but stored the tail
|
|
self.assertEqual(res_sliding[0][0, 0, :, 0].tolist(), [10.0, 20.0, 30.0])
|
|
self.assertEqual(chunked_cache.layers[1].keys[0, 0, :, 0].tolist(), [20.0, 30.0])
|
|
|
|
# 2) ONE-TOKEN UPDATE (normal decode)
|
|
new_static = torch.tensor(5.0)[None, None, None, None]
|
|
new_sliding = torch.tensor(50.0)[None, None, None, None]
|
|
|
|
chunked_cache.update(
|
|
key_states=new_static,
|
|
value_states=new_static,
|
|
layer_idx=0,
|
|
)
|
|
res_one = chunked_cache.update(
|
|
key_states=new_sliding,
|
|
value_states=new_sliding,
|
|
layer_idx=1,
|
|
)
|
|
|
|
self.assertEqual(chunked_cache.layers[0].keys[0, 0, :, 0].tolist(), [1.0, 2.0, 3.0, 5.0])
|
|
self.assertEqual(chunked_cache.layers[1].keys[0, 0, :, 0].tolist(), [30.0, 50.0])
|
|
self.assertEqual(res_one[0][0, 0, :, 0].tolist(), [30.0, 50.0])
|
|
|
|
# 3) TWO-TOKEN UPDATE after window is full
|
|
new_sliding_2 = torch.tensor([60.0, 70.0])[None, None, :, None]
|
|
res_two = chunked_cache.update(
|
|
key_states=new_sliding_2,
|
|
value_states=new_sliding_2,
|
|
layer_idx=1,
|
|
)
|
|
|
|
# Cache now keeps the latest two tokens
|
|
self.assertEqual(chunked_cache.layers[1].keys[0, 0, :, 0].tolist(), [60.0, 70.0])
|
|
# Returned tensor contains previous last token + new ones
|
|
self.assertEqual(res_two[0][0, 0, :, 0].tolist(), [50.0, 60.0, 70.0])
|
|
|
|
def test_hybrid_chunked_cache_extra_cases(self):
|
|
"""
|
|
Covers the new cases that appear on prefill chunking:
|
|
1) Not full multi-token update (past_length + update_len <= max_cache_len)
|
|
2) Multi-token update crossing the window (past_length < max_cache_len and past_length + update_len > max_cache_len)
|
|
|
|
Single sliding layer, max_cache_len = 3.
|
|
|
|
Step 0 (prefill 2 tokens, update_len < max_cache_len
|
|
cache = [10, 20, 0] returned [10, 20, 0]
|
|
|
|
Step 1 (add 2 tokens, p = 2, update_len = 2, p + update_len = 4 > max_cache_len)
|
|
cache = [20, 30, 40] returned [10, 20, 30, 40]
|
|
"""
|
|
|
|
config = copy.deepcopy(self.config)
|
|
config.num_hidden_layers = 1
|
|
config.layer_types = ["chunked_attention"]
|
|
config.sliding_window = None
|
|
config.attention_chunk_size = 3
|
|
cache = StaticCache(config=config, max_cache_len=3)
|
|
|
|
# Step 0 : multi-token prefill
|
|
first_chunk = torch.tensor([10.0, 20.0])[None, None, :, None] # L = 2
|
|
returned_0 = cache.update(
|
|
key_states=first_chunk,
|
|
value_states=first_chunk,
|
|
layer_idx=0,
|
|
)
|
|
|
|
# internal cache should have first two tokens and a zero pad
|
|
self.assertEqual(cache.layers[0].keys[0, 0, :, 0].tolist(), [10.0, 20.0, 0.0])
|
|
self.assertEqual(returned_0[0][0, 0, :, 0].tolist(), [10.0, 20.0, 0.0])
|
|
|
|
# Step 1 : multi-token update crossing the window boundary
|
|
second_chunk = torch.tensor([30.0, 40.0])[None, None, :, None] # L = 2
|
|
returned_1 = cache.update(
|
|
key_states=second_chunk,
|
|
value_states=second_chunk,
|
|
layer_idx=0,
|
|
)
|
|
|
|
self.assertEqual(cache.layers[0].keys[0, 0, :, 0].tolist(), [20.0, 30.0, 40.0])
|
|
self.assertEqual(returned_1[0][0, 0, :, 0].tolist(), [10.0, 20.0, 30.0, 40.0])
|
|
|
|
|
|
ALL_DYNAMIC_LAYERS = (
|
|
DynamicLayer,
|
|
DynamicSlidingWindowLayer,
|
|
LinearAttentionLayer,
|
|
LinearAttentionAndFullAttentionLayer,
|
|
LinearAttentionAndSlidingWindowAttentionLayer,
|
|
DynamicIndexedLayer,
|
|
)
|
|
|
|
|
|
class CacheCroppingTests(unittest.TestCase):
|
|
sliding_window = 12
|
|
seq_len = 45
|
|
conv_kernel_size = 4
|
|
attention_shape = (2, 32, 45, 32)
|
|
conv_state_shape = (2, 32, 45)
|
|
indexer_shape = (2, 45, 32)
|
|
|
|
def test_crop_with_past(self):
|
|
"""Test that `crop` works correctly for all general layer classes, even with past recording activated"""
|
|
keys = torch.rand(*self.attention_shape)
|
|
values = torch.rand(*self.attention_shape)
|
|
conv_states = torch.rand(*self.conv_state_shape)
|
|
indexer_states = torch.rand(*self.indexer_shape)
|
|
|
|
layer_kwargs = {"sliding_window": self.sliding_window}
|
|
for layer_cls in ALL_DYNAMIC_LAYERS:
|
|
print(layer_cls)
|
|
layer = layer_cls(**layer_kwargs)
|
|
# Trigger the recall of states
|
|
if hasattr(layer, "activate_past_recording"):
|
|
layer.activate_past_recording()
|
|
|
|
# Update the attention part if any
|
|
if hasattr(layer, "update"):
|
|
layer.update(keys, values)
|
|
# Update the conv part if any
|
|
if hasattr(layer, "update_conv_state"):
|
|
layer.update_conv_state(conv_states=conv_states, conv_kernel_size=self.conv_kernel_size)
|
|
if hasattr(layer, "update_indexer"):
|
|
layer.update_indexer(indexer_states)
|
|
|
|
# Make sure we recall all states correctly even for sliding/linear attention
|
|
if hasattr(layer, "keys"):
|
|
self.assertEqual(layer.keys.shape[-2], self.seq_len)
|
|
self.assertEqual(layer.values.shape[-2], self.seq_len)
|
|
if hasattr(layer, "conv_states"):
|
|
self.assertEqual(layer.conv_states[0].shape[-1], self.seq_len)
|
|
if hasattr(layer, "indexer_keys"):
|
|
self.assertEqual(layer.indexer_keys.shape[-2], self.seq_len)
|
|
|
|
# Crop the layer
|
|
layer.crop(-3)
|
|
|
|
# Make sure we cropped correctly, and restricted length correctly
|
|
if hasattr(layer, "keys"):
|
|
# In this case, should be back to the smaller size of the sliding window
|
|
if hasattr(layer, "sliding_window"):
|
|
self.assertEqual(layer.keys.shape[-2], self.sliding_window - 1)
|
|
self.assertEqual(layer.values.shape[-2], self.sliding_window - 1)
|
|
self.assertTrue((layer.keys == keys[..., -self.sliding_window + 1 - 3 : -3, :]).all())
|
|
self.assertTrue((layer.values == values[..., -self.sliding_window + 1 - 3 : -3, :]).all())
|
|
else:
|
|
self.assertEqual(layer.keys.shape[-2], self.seq_len - 3)
|
|
self.assertEqual(layer.values.shape[-2], self.seq_len - 3)
|
|
self.assertTrue((layer.keys == keys[..., :-3, :]).all())
|
|
self.assertTrue((layer.values == values[..., :-3, :]).all())
|
|
# Should be back to the conv_kernel_size
|
|
if hasattr(layer, "conv_states"):
|
|
self.assertEqual(layer.conv_states[0].shape[-1], self.conv_kernel_size)
|
|
self.assertTrue((layer.conv_states[0] == conv_states[..., -self.conv_kernel_size - 3 : -3]).all())
|
|
if hasattr(layer, "indexer_keys"):
|
|
self.assertEqual(layer.indexer_keys.shape[-2], self.seq_len - 3)
|
|
self.assertTrue((layer.indexer_keys == indexer_states[..., :-3, :]).all())
|
|
|
|
def test_crop_with_zero_still_shrink_states(self):
|
|
"""Test that `crop` shrinks state size if called with `0`"""
|
|
keys = torch.rand(*self.attention_shape)
|
|
values = torch.rand(*self.attention_shape)
|
|
conv_states = torch.rand(*self.conv_state_shape)
|
|
indexer_states = torch.rand(*self.indexer_shape)
|
|
|
|
layer_kwargs = {"sliding_window": self.sliding_window}
|
|
for layer_cls in ALL_DYNAMIC_LAYERS:
|
|
layer = layer_cls(**layer_kwargs)
|
|
# Trigger the recall of states
|
|
if hasattr(layer, "activate_past_recording"):
|
|
layer.activate_past_recording()
|
|
|
|
# Update the attention part if any
|
|
if hasattr(layer, "update"):
|
|
layer.update(keys, values)
|
|
# Update the conv part if any
|
|
if hasattr(layer, "update_conv_state"):
|
|
layer.update_conv_state(conv_states=conv_states, conv_kernel_size=self.conv_kernel_size)
|
|
if hasattr(layer, "update_indexer"):
|
|
layer.update_indexer(indexer_states)
|
|
|
|
# Make sure we recall all states correctly even for sliding/linear attention
|
|
if hasattr(layer, "keys"):
|
|
self.assertEqual(layer.keys.shape[-2], self.seq_len)
|
|
self.assertEqual(layer.values.shape[-2], self.seq_len)
|
|
if hasattr(layer, "conv_states"):
|
|
self.assertEqual(layer.conv_states[0].shape[-1], self.seq_len)
|
|
if hasattr(layer, "indexer_keys"):
|
|
self.assertEqual(layer.indexer_keys.shape[-2], self.seq_len)
|
|
|
|
# Should not crop the
|
|
layer.crop(0)
|
|
|
|
# Make sure we cropped correctly, and restricted length correctly
|
|
if hasattr(layer, "keys"):
|
|
# In this case, should be back to the smaller size of the sliding window
|
|
if hasattr(layer, "sliding_window"):
|
|
self.assertEqual(layer.keys.shape[-2], self.sliding_window - 1)
|
|
self.assertEqual(layer.values.shape[-2], self.sliding_window - 1)
|
|
self.assertTrue((layer.keys == keys[..., -self.sliding_window + 1 :, :]).all())
|
|
self.assertTrue((layer.values == values[..., -self.sliding_window + 1 :, :]).all())
|
|
else:
|
|
self.assertEqual(layer.keys.shape[-2], self.seq_len)
|
|
self.assertEqual(layer.values.shape[-2], self.seq_len)
|
|
self.assertTrue((layer.keys == keys).all())
|
|
self.assertTrue((layer.values == values).all())
|
|
# Should be back to the conv_kernel_size
|
|
if hasattr(layer, "conv_states"):
|
|
self.assertEqual(layer.conv_states[0].shape[-1], self.conv_kernel_size)
|
|
self.assertTrue((layer.conv_states[0] == conv_states[..., -self.conv_kernel_size :]).all())
|
|
if hasattr(layer, "indexer_keys"):
|
|
self.assertEqual(layer.indexer_keys.shape[-2], self.seq_len)
|
|
self.assertTrue((layer.indexer_keys == indexer_states).all())
|
|
|
|
def test_crop_outside_range(self):
|
|
"""Test that `crop` is correct outside of the range"""
|
|
keys = torch.rand(*self.attention_shape)
|
|
values = torch.rand(*self.attention_shape)
|
|
conv_states = torch.rand(*self.conv_state_shape)
|
|
indexer_states = torch.rand(*self.indexer_shape)
|
|
|
|
layer_kwargs = {"sliding_window": self.sliding_window}
|
|
for layer_cls in ALL_DYNAMIC_LAYERS:
|
|
layer = layer_cls(**layer_kwargs)
|
|
# Trigger the recall of states
|
|
if hasattr(layer, "activate_past_recording"):
|
|
layer.activate_past_recording()
|
|
|
|
# Update the attention part if any
|
|
if hasattr(layer, "update"):
|
|
layer.update(keys, values)
|
|
# Update the conv part if any
|
|
if hasattr(layer, "update_conv_state"):
|
|
layer.update_conv_state(conv_states=conv_states, conv_kernel_size=self.conv_kernel_size)
|
|
if hasattr(layer, "update_indexer"):
|
|
layer.update_indexer(indexer_states)
|
|
|
|
# Make sure we recall all states correctly even for sliding/linear attention
|
|
if hasattr(layer, "keys"):
|
|
self.assertEqual(layer.keys.shape[-2], self.seq_len)
|
|
self.assertEqual(layer.values.shape[-2], self.seq_len)
|
|
if hasattr(layer, "conv_states"):
|
|
self.assertEqual(layer.conv_states[0].shape[-1], self.seq_len)
|
|
if hasattr(layer, "indexer_keys"):
|
|
self.assertEqual(layer.indexer_keys.shape[-2], self.seq_len)
|
|
|
|
# Crop more than what we have stored
|
|
layer.crop(-self.seq_len - 1)
|
|
|
|
# Make sure everything is empty
|
|
if hasattr(layer, "keys"):
|
|
self.assertEqual(layer.keys.numel(), 0)
|
|
self.assertEqual(layer.values.numel(), 0)
|
|
if hasattr(layer, "conv_states"):
|
|
self.assertEqual(layer.conv_states[0].numel(), 0)
|
|
if hasattr(layer, "indexer_keys"):
|
|
self.assertEqual(layer.indexer_keys.numel(), 0)
|
|
|
|
def test_crop_with_positive_value_raises(self):
|
|
"""Test that `crop` raises when used with a positive value"""
|
|
keys = torch.rand(*self.attention_shape)
|
|
values = torch.rand(*self.attention_shape)
|
|
indexer_states = torch.rand(*self.indexer_shape)
|
|
|
|
for layer_cls in (DynamicLayer, DynamicIndexedLayer):
|
|
layer = layer_cls()
|
|
layer.update(keys, values)
|
|
if hasattr(layer, "update_indexer"):
|
|
layer.update_indexer(indexer_states)
|
|
|
|
with self.assertRaisesRegex(ValueError, "Calling `crop` with a positive value"):
|
|
layer.crop(self.seq_len - 3)
|
|
|
|
def test_update_with_recording_returns_advertised_kv_width(self):
|
|
"""Test that with past recording activated, `update` returns exactly the states advertised by `get_mask_sizes`"""
|
|
sliding_window = 4
|
|
|
|
# Several consecutive single-token updates without an intervening `crop`, as during assisted decoding drafting:
|
|
# `get_mask_sizes` is queried before the update adds the new states, and `update` must return what it advertises
|
|
layer = DynamicSlidingWindowLayer(sliding_window=sliding_window)
|
|
layer.activate_past_recording()
|
|
for step in range(sliding_window + 2):
|
|
new_states = torch.ones((1, 1, 1, 2), dtype=float) * step
|
|
kv_length, _ = layer.get_mask_sizes(new_states.shape[-2])
|
|
returned_keys, returned_values = layer.update(new_states, new_states)
|
|
|
|
self.assertEqual(returned_keys.shape[-2], kv_length)
|
|
self.assertEqual(returned_values.shape[-2], kv_length)
|
|
expected_window = torch.arange(float(step + 1))[-kv_length:]
|
|
self.assertTrue((returned_keys[0, 0, :, 0] == expected_window).all())
|
|
self.assertTrue((returned_values[0, 0, :, 0] == expected_window).all())
|
|
# All states stay recorded for `crop` to roll back, even beyond the sliding window
|
|
self.assertEqual(layer.keys.shape[-2], step + 1)
|
|
self.assertEqual(layer.values.shape[-2], step + 1)
|
|
|
|
# The same must hold for a multi-token update crossing the window size mid-draft
|
|
layer = DynamicSlidingWindowLayer(sliding_window=sliding_window)
|
|
layer.activate_past_recording()
|
|
for step in range(2):
|
|
new_states = torch.full((1, 1, 1, 2), float(step))
|
|
kv_length, _ = layer.get_mask_sizes(new_states.shape[-2])
|
|
returned_keys, _ = layer.update(new_states, new_states)
|
|
self.assertEqual(returned_keys.shape[-2], kv_length)
|
|
|
|
crossing_states = torch.arange(2, 5).view(1, 1, 3, 1).expand(1, 1, 3, 2)
|
|
kv_length, _ = layer.get_mask_sizes(crossing_states.shape[-2])
|
|
returned_keys, returned_values = layer.update(crossing_states, crossing_states)
|
|
self.assertEqual(returned_keys.shape[-2], kv_length)
|
|
self.assertEqual(returned_values.shape[-2], kv_length)
|
|
self.assertEqual(returned_keys[0, 0, :, 0].tolist(), [0.0, 1.0, 2.0, 3.0, 4.0])
|
|
self.assertEqual(layer.keys.shape[-2], 5)
|
|
|
|
# And once the buffer is larger than what is advertised, only its trailing window is returned
|
|
final_states = torch.full((1, 1, 1, 2), 5.0)
|
|
kv_length, _ = layer.get_mask_sizes(final_states.shape[-2])
|
|
returned_keys, _ = layer.update(final_states, final_states)
|
|
self.assertEqual(kv_length, sliding_window)
|
|
self.assertEqual(returned_keys.shape[-2], kv_length)
|
|
self.assertEqual(returned_keys[0, 0, :, 0].tolist(), [2.0, 3.0, 4.0, 5.0])
|