Instructions to use inference-optimization/Kimi-K3-0.40B with libraries, inference providers, notebooks, and local apps. Follow these links to get started.
- Libraries
- Transformers
How to use inference-optimization/Kimi-K3-0.40B with Transformers:
# Use a pipeline as a high-level helper from transformers import pipeline pipe = pipeline("feature-extraction", model="inference-optimization/Kimi-K3-0.40B", trust_remote_code=True)# Load model directly from transformers import AutoModel model = AutoModel.from_pretrained("inference-optimization/Kimi-K3-0.40B", trust_remote_code=True, device_map="auto") - Notebooks
- Google Colab
- Kaggle
| # coding=utf-8 | |
| # Copyright 2025-2026 The Moonshot AI Team, DeepSeek-AI, and HuggingFace Inc. team. All rights reserved. | |
| # | |
| # The multi-head latent attention, MoE gating and sparse MoE block in this file are | |
| # adapted from DeepSeek-V3 (DeepSeek-V3/modeling_deepseek.py). They have been | |
| # extensively modified and extended for the Kimi-Linear architecture. | |
| # | |
| # Licensing Information: | |
| # - Code adapted from DeepSeek-V3 (DeepSeek-V3/modeling_deepseek.py) is licensed under the Apache License, Version 2.0. | |
| # - Other parts of the code are licensed under the Kimi K3 License (see the LICENSE file in this repository). | |
| # | |
| # Apache License, Version 2.0: | |
| # 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 math | |
| from collections.abc import Callable | |
| from typing import Any | |
| import torch | |
| import torch.nn.functional as F | |
| import transformers | |
| from einops import rearrange | |
| from packaging import version | |
| from torch import nn | |
| from transformers.activations import ACT2FN | |
| from transformers.cache_utils import Cache | |
| from transformers.generation import GenerationMixin | |
| from transformers.masking_utils import create_causal_mask | |
| from transformers.modeling_flash_attention_utils import FlashAttentionKwargs | |
| from transformers.modeling_outputs import ( | |
| BaseModelOutputWithPast, | |
| CausalLMOutputWithPast, | |
| ) | |
| from transformers.modeling_utils import ALL_ATTENTION_FUNCTIONS, PreTrainedModel | |
| from transformers.processing_utils import Unpack | |
| from transformers.pytorch_utils import ALL_LAYERNORM_LAYERS | |
| from transformers.utils import ( | |
| TransformersKwargs, | |
| can_return_tuple, | |
| logging, | |
| ) | |
| from transformers.utils.generic import check_model_inputs | |
| from transformers.utils.output_capturing import OutputRecorder | |
| try: | |
| from fla.modules import FusedRMSNormGated, ShortConvolution | |
| from fla.ops.kda import chunk_kda, fused_recurrent_kda | |
| # from fla.ops.kda.gate import fused_kda_gate # deprecated, gate is now computed inside chunk_kda/fused_recurrent_kda | |
| from fla.ops.utils.index import prepare_cu_seqlens_from_mask, prepare_lens_from_mask | |
| from fla.utils import tensor_cache | |
| except ImportError: | |
| raise ImportError("Plese run `pip install -U fla-core`") | |
| def get_calibrate_all_experts_flag() -> bool: | |
| return False | |
| from .configuration_kimi_k3 import KimiLinearConfig | |
| assert version.parse(transformers.__version__) >= version.parse( | |
| "4.56.0" | |
| ), "Please upgrade transformers to >= 4.56.0" | |
| logger = logging.get_logger(__name__) | |
| # Register Moonshot-specific activation functions | |
| class SituAndMul(nn.Module): | |
| """ | |
| SituAndMul activation: beta * tanh(gate / beta) * sigmoid(gate) * up | |
| When linear_beta is set, up is also transformed by linear_beta * tanh(up / linear_beta). | |
| """ | |
| def __init__(self, beta: float = 1.0, linear_beta: float | None = None): | |
| super().__init__() | |
| self.beta = beta | |
| self.linear_beta = linear_beta | |
| def forward(self, x: torch.Tensor) -> torch.Tensor: | |
| d = x.shape[-1] // 2 | |
| gate = x[..., :d].to(torch.float32) | |
| up = x[..., d:].to(torch.float32) | |
| situ_a = self.beta * torch.tanh(gate / self.beta) * torch.sigmoid(gate) | |
| if self.linear_beta is not None: | |
| up = self.linear_beta * torch.tanh(up / self.linear_beta) | |
| return (situ_a * up).to(x.dtype) | |
| ACT2FN["situ"] = SituAndMul | |
| def _get_situ_activation_params(config: KimiLinearConfig): | |
| beta = getattr(config, "activation_situ_beta", None) | |
| linear_beta = getattr(config, "activation_situ_linear_beta", None) | |
| return beta or 1.0, linear_beta | |
| def index_first_axis(x, indices): | |
| return x[indices] | |
| def get_unpad_data( | |
| attention_mask: torch.Tensor, | |
| ) -> tuple[torch.Tensor, torch.Tensor, int]: | |
| lens = prepare_lens_from_mask(attention_mask) | |
| indices = torch.nonzero(attention_mask.flatten(), as_tuple=False).flatten() | |
| max_seqlen_in_batch = lens.max().item() | |
| cu_seqlens = prepare_cu_seqlens_from_mask(attention_mask) | |
| return indices, cu_seqlens, max_seqlen_in_batch | |
| def pad_input( | |
| hidden_states: torch.Tensor, | |
| indices: torch.LongTensor, | |
| batch_size: int, | |
| seq_len: int, | |
| ) -> torch.Tensor: | |
| out = hidden_states.new_zeros((batch_size * seq_len, *hidden_states.shape[1:])) | |
| out[indices] = hidden_states | |
| return out.view(batch_size, seq_len, *hidden_states.shape[1:]) | |
| class KimiDynamicCache: | |
| """ | |
| Dynamic cache for Kimi model. | |
| Inspired by Qwen3-Next | |
| """ | |
| is_compileable = False | |
| def __init__(self, config: KimiLinearConfig): | |
| super().__init__() | |
| self.config = config | |
| if config.linear_attn_config is not None: | |
| self.layer_types = [] | |
| for i in range(config.num_hidden_layers): | |
| if config.is_kda_layer(i): | |
| self.layer_types.append("linear_attention") | |
| else: | |
| self.layer_types.append("full_attention") | |
| else: | |
| self.layer_types = ["full_attention"] * config.num_hidden_layers | |
| self.transformer_layers = [ | |
| i | |
| for i in range(config.num_hidden_layers) | |
| if self.layer_types[i] == "full_attention" | |
| ] | |
| linear_layers = [ | |
| i | |
| for i in range(config.num_hidden_layers) | |
| if self.layer_types[i] == "linear_attention" | |
| ] | |
| self.last_linear_layer = linear_layers[-1] if linear_layers else -1 | |
| self.conv_states = [None for _ in range(config.num_hidden_layers)] | |
| self.recurrent_states = [None for _ in range(config.num_hidden_layers)] | |
| self.key_cache = [None for _ in range(config.num_hidden_layers)] | |
| self.value_cache = [None for _ in range(config.num_hidden_layers)] | |
| def __len__(self): | |
| return len(self.layer_types) | |
| def update( | |
| self, | |
| key_states: torch.Tensor, | |
| value_states: torch.Tensor, | |
| layer_idx: int, | |
| cache_kwargs: dict[str, Any] | None = None, | |
| ) -> tuple[torch.Tensor, torch.Tensor]: | |
| if self.key_cache[layer_idx] is None: | |
| self.key_cache[layer_idx] = key_states | |
| self.value_cache[layer_idx] = value_states | |
| else: | |
| self.key_cache[layer_idx] = torch.cat( | |
| [self.key_cache[layer_idx], key_states], dim=2 | |
| ) | |
| self.value_cache[layer_idx] = torch.cat( | |
| [self.value_cache[layer_idx], value_states], dim=2 | |
| ) | |
| return self.key_cache[layer_idx], self.value_cache[layer_idx] | |
| def reorder_cache(self, beam_idx: torch.LongTensor): | |
| """Reorders the cache for beam search, given the selected beam indices.""" | |
| for layer_idx in range(len(self.key_cache)): | |
| if self.key_cache[layer_idx] is not None: | |
| device = self.key_cache[layer_idx].device | |
| beam_idx = beam_idx.to(device) | |
| self.key_cache[layer_idx] = self.key_cache[layer_idx].index_select( | |
| 0, beam_idx | |
| ) | |
| self.value_cache[layer_idx] = self.value_cache[layer_idx].index_select( | |
| 0, beam_idx | |
| ) | |
| if self.conv_states[layer_idx] is not None: | |
| device = self.conv_states[layer_idx][0].device | |
| beam_idx = beam_idx.to(device) | |
| q_conv, k_conv, v_conv = self.conv_states[layer_idx] | |
| self.conv_states[layer_idx] = ( | |
| q_conv.index_select(0, beam_idx), | |
| k_conv.index_select(0, beam_idx), | |
| v_conv.index_select(0, beam_idx), | |
| ) | |
| self.recurrent_states[layer_idx] = self.recurrent_states[ | |
| layer_idx | |
| ].index_select(0, beam_idx) | |
| def get_seq_length(self, layer_idx: int | None = 0) -> int: | |
| """Returns the sequence length of the cached states. A layer index can be optionally passed.""" | |
| # take any layer that contains cache and not empty tensor | |
| layer_idx = ( | |
| self.transformer_layers[0] | |
| if layer_idx not in self.transformer_layers | |
| else layer_idx | |
| ) | |
| if len(self.key_cache) <= layer_idx or self.key_cache[layer_idx] is None: | |
| return 0 | |
| return self.key_cache[layer_idx].shape[-2] | |
| def get_query_offset(self, layer_idx: int = 0) -> int: | |
| return self.get_seq_length(layer_idx=layer_idx) | |
| def get_mask_sizes(self, cache_position, layer_idx: int) -> tuple[int, int]: | |
| """ | |
| Return a tuple (kv_length, kv_offset) corresponding to the length and offset that will be returned for | |
| the given layer at `layer_idx`. | |
| The masks are then prepared according to the given lengths (kv_length, kv_offset) and patterns for each layer. | |
| """ | |
| kv_offset = 0 | |
| # cache_position may be an int (new API) or a 1-D tensor (old API) | |
| query_length = ( | |
| cache_position | |
| if isinstance(cache_position, int) | |
| else cache_position.shape[0] | |
| ) | |
| past_seen_tokens = self.get_seq_length(layer_idx) | |
| kv_length = query_length + past_seen_tokens | |
| return kv_length, kv_offset | |
| def has_previous_state(self): | |
| """We have a previous state if the last linear (conv) layer was already updated.""" | |
| if self.last_linear_layer == -1: | |
| return False | |
| return self.conv_states[self.last_linear_layer] is not None | |
| class KimiRMSNorm(nn.Module): | |
| def __init__(self, hidden_size, eps=1e-6): | |
| super().__init__() | |
| self.weight = nn.Parameter(torch.ones(hidden_size)) | |
| self.variance_epsilon = eps | |
| def forward(self, hidden_states): | |
| dtype = hidden_states.dtype | |
| x = hidden_states.float() | |
| x = x * torch.rsqrt(x.pow(2).mean(-1, keepdim=True) + self.variance_epsilon) | |
| return self.weight * x.to(dtype) | |
| ALL_LAYERNORM_LAYERS.append(KimiRMSNorm) | |
| class KimiBlockSparseMLP(nn.Module): | |
| def __init__( | |
| self, config: KimiLinearConfig, hidden_size=None, intermediate_size=None | |
| ): | |
| super().__init__() | |
| self.config = config | |
| self.ffn_dim = ( | |
| config.intermediate_size if intermediate_size is None else intermediate_size | |
| ) | |
| self.hidden_dim = config.hidden_size if hidden_size is None else hidden_size | |
| self.w1 = nn.Linear(self.hidden_dim, self.ffn_dim, bias=False) # gate | |
| self.w2 = nn.Linear(self.ffn_dim, self.hidden_dim, bias=False) # down | |
| self.w3 = nn.Linear(self.hidden_dim, self.ffn_dim, bias=False) # up | |
| if config.hidden_act == "situ": | |
| beta, linear_beta = _get_situ_activation_params(config) | |
| self.act_fn = SituAndMul( | |
| beta=beta, | |
| linear_beta=linear_beta, | |
| ) | |
| else: | |
| self.act_fn = ACT2FN[config.hidden_act] | |
| def forward(self, hidden_states): | |
| if self.config.hidden_act == "situ": | |
| gate_up = torch.cat( | |
| [self.w1(hidden_states), self.w3(hidden_states)], dim=-1 | |
| ) | |
| current_hidden_states = self.act_fn(gate_up) | |
| else: | |
| current_hidden_states = self.act_fn(self.w1(hidden_states)) * self.w3( | |
| hidden_states | |
| ) | |
| current_hidden_states = self.w2(current_hidden_states) | |
| return current_hidden_states | |
| class KimiMLP(nn.Module): | |
| def __init__( | |
| self, config: KimiLinearConfig, hidden_size=None, intermediate_size=None | |
| ): | |
| super().__init__() | |
| self.config = config | |
| self.hidden_size = config.hidden_size if hidden_size is None else hidden_size | |
| self.intermediate_size = ( | |
| config.intermediate_size if intermediate_size is None else intermediate_size | |
| ) | |
| self.gate_proj = nn.Linear(self.hidden_size, self.intermediate_size, bias=False) | |
| self.up_proj = nn.Linear(self.hidden_size, self.intermediate_size, bias=False) | |
| self.down_proj = nn.Linear(self.intermediate_size, self.hidden_size, bias=False) | |
| if config.hidden_act == "situ": | |
| beta, linear_beta = _get_situ_activation_params(config) | |
| self.act_fn = SituAndMul( | |
| beta=beta, | |
| linear_beta=linear_beta, | |
| ) | |
| else: | |
| self.act_fn = ACT2FN[config.hidden_act] | |
| def forward(self, x): | |
| if self.config.hidden_act == "situ": | |
| gate_up = torch.cat([self.gate_proj(x), self.up_proj(x)], dim=-1) | |
| down_proj = self.down_proj(self.act_fn(gate_up)) | |
| else: | |
| down_proj = self.down_proj(self.act_fn(self.gate_proj(x)) * self.up_proj(x)) | |
| return down_proj | |
| def repeat_kv(hidden_states: torch.Tensor, n_rep: int) -> torch.Tensor: | |
| """Expand the key/value heads from `num_key_value_heads` to `num_attention_heads`.""" | |
| if n_rep == 1: | |
| return hidden_states | |
| return torch.repeat_interleave(hidden_states, dim=1, repeats=n_rep) | |
| def eager_attention_forward( | |
| module: nn.Module, | |
| query: torch.Tensor, | |
| key: torch.Tensor, | |
| value: torch.Tensor, | |
| attention_mask: torch.Tensor | None, | |
| scaling: float, | |
| dropout: float = 0.0, | |
| **kwargs: Unpack[TransformersKwargs], | |
| ): | |
| key = repeat_kv(key, module.num_key_value_groups) | |
| value = repeat_kv(value, module.num_key_value_groups) | |
| scores = torch.einsum("bhqd,bhkd->bhqk", query, key) * scaling | |
| if attention_mask is not None: | |
| scores = scores + attention_mask[:, :, :, : key.shape[-2]] | |
| probs = F.softmax(scores, dim=-1, dtype=torch.float32).to(query.dtype) | |
| probs = F.dropout(probs, p=dropout, training=module.training) | |
| out = torch.einsum("bhqk,bhkd->bhqd", probs, value).transpose(1, 2).contiguous() | |
| return out, probs | |
| class KimiMLAAttention(nn.Module): | |
| """ | |
| Multi-Latent Attention adapted from deepseek-v3 | |
| """ | |
| def __init__(self, config: KimiLinearConfig, layer_idx: int): | |
| nn.Module.__init__(self) | |
| self.config = config | |
| self.layer_idx = layer_idx | |
| self.hidden_size = config.hidden_size | |
| self.num_heads = config.num_attention_heads | |
| self.num_key_value_heads = config.num_key_value_heads | |
| self.num_key_value_groups = self.num_heads // self.num_key_value_heads | |
| self.attention_dropout = getattr(config, "attention_dropout", 0.0) | |
| try: | |
| self.q_lora_rank = config.q_lora_rank | |
| self.qk_rope_head_dim = config.qk_rope_head_dim | |
| self.kv_lora_rank = config.kv_lora_rank | |
| self.v_head_dim = config.v_head_dim | |
| self.qk_nope_head_dim = config.qk_nope_head_dim | |
| self.q_head_dim = self.qk_nope_head_dim + self.qk_rope_head_dim | |
| self.use_nope = config.mla_use_nope | |
| self.scaling = self.q_head_dim ** (-0.5) | |
| except Exception as e: | |
| raise ValueError( | |
| f"Kimi MLA config is not found or not properly formatted: {e}" | |
| ) | |
| if self.q_lora_rank is not None: | |
| self.q_a_proj = nn.Linear( | |
| self.hidden_size, | |
| self.q_lora_rank, | |
| bias=False, | |
| ) | |
| self.q_a_layernorm = KimiRMSNorm(self.q_lora_rank) | |
| self.q_b_proj = nn.Linear( | |
| self.q_lora_rank, | |
| self.num_heads * self.q_head_dim, | |
| bias=False, | |
| ) | |
| else: | |
| self.q_proj = nn.Linear( | |
| self.hidden_size, | |
| self.num_heads * self.q_head_dim, | |
| bias=False, | |
| ) | |
| self.kv_a_proj_with_mqa = nn.Linear( | |
| self.hidden_size, | |
| self.kv_lora_rank + self.qk_rope_head_dim, | |
| bias=False, | |
| ) | |
| self.kv_a_layernorm = KimiRMSNorm(self.kv_lora_rank) | |
| self.kv_b_proj = nn.Linear( | |
| self.kv_lora_rank, | |
| self.num_heads | |
| * (self.q_head_dim - self.qk_rope_head_dim + self.v_head_dim), | |
| bias=False, | |
| ) | |
| self.o_proj = nn.Linear( | |
| self.num_heads * self.v_head_dim, | |
| self.hidden_size, | |
| bias=False, | |
| ) | |
| self.is_causal = True | |
| assert self.use_nope | |
| self.use_output_gate = getattr(config, "mla_use_output_gate", False) | |
| if self.use_output_gate: | |
| projection_size = self.num_heads * self.v_head_dim | |
| self.g_proj = nn.Linear(self.hidden_size, projection_size, bias=False) | |
| self.rotary_emb = None | |
| def forward( | |
| self, | |
| hidden_states: torch.Tensor, | |
| attention_mask: torch.Tensor | None = None, | |
| position_ids: torch.LongTensor | None = None, | |
| past_key_values: Cache | None = None, | |
| **kwargs, | |
| ) -> tuple[torch.Tensor, torch.Tensor | None, tuple[torch.Tensor] | None]: | |
| batch_size, seq_length = hidden_states.shape[:-1] | |
| query_shape = (batch_size, seq_length, -1, self.q_head_dim) | |
| key_shape = ( | |
| batch_size, | |
| seq_length, | |
| -1, | |
| self.qk_nope_head_dim + self.v_head_dim, | |
| ) | |
| if self.q_lora_rank is not None: | |
| q_states = self.q_b_proj(self.q_a_layernorm(self.q_a_proj(hidden_states))) | |
| else: | |
| q_states = self.q_proj(hidden_states) | |
| q_states = q_states.view(query_shape).transpose(1, 2) | |
| q_pass, q_rot = torch.split( | |
| q_states, [self.qk_nope_head_dim, self.qk_rope_head_dim], dim=-1 | |
| ) | |
| compressed_kv = self.kv_a_proj_with_mqa(hidden_states) | |
| k_pass, k_rot = torch.split( | |
| compressed_kv, [self.kv_lora_rank, self.qk_rope_head_dim], dim=-1 | |
| ) | |
| k_pass = ( | |
| self.kv_b_proj(self.kv_a_layernorm(k_pass)).view(key_shape).transpose(1, 2) | |
| ) | |
| k_pass, value_states = torch.split( | |
| k_pass, [self.qk_nope_head_dim, self.v_head_dim], dim=-1 | |
| ) | |
| k_rot = k_rot.view(batch_size, 1, seq_length, self.qk_rope_head_dim) | |
| k_rot = k_rot.expand(*k_pass.shape[:-1], -1) | |
| query_states = torch.cat((q_pass, q_rot), dim=-1) | |
| key_states = torch.cat((k_pass, k_rot), dim=-1) | |
| if past_key_values is not None: | |
| key_states, value_states = past_key_values.update( | |
| key_states, value_states, self.layer_idx | |
| ) | |
| if ( | |
| self.config._attn_implementation == "flash_attention_2" | |
| and self.q_head_dim != self.v_head_dim | |
| ): | |
| value_states = F.pad(value_states, [0, self.q_head_dim - self.v_head_dim]) | |
| attention_interface: Callable = eager_attention_forward | |
| if self.config._attn_implementation != "eager": | |
| attention_interface = ALL_ATTENTION_FUNCTIONS[ | |
| self.config._attn_implementation | |
| ] | |
| attn_output, _ = attention_interface( | |
| self, | |
| query_states, | |
| key_states, | |
| value_states, | |
| attention_mask, | |
| dropout=0.0 if not self.training else self.attention_dropout, | |
| scaling=self.scaling, | |
| **kwargs, | |
| ) | |
| if ( | |
| self.config._attn_implementation == "flash_attention_2" | |
| and self.q_head_dim != self.v_head_dim | |
| ): | |
| attn_output = attn_output[:, :, :, : self.v_head_dim] | |
| attn_output = attn_output.reshape(batch_size, seq_length, -1).contiguous() | |
| if self.use_output_gate: | |
| g = self.g_proj(hidden_states).sigmoid() | |
| attn_output = attn_output * g | |
| attn_output = self.o_proj(attn_output) | |
| return attn_output | |
| class KimiDeltaAttention(nn.Module): | |
| def __init__(self, config: KimiLinearConfig, layer_idx: int): | |
| super().__init__() | |
| self.config = config | |
| self.mode = "chunk" | |
| self.hidden_size = config.hidden_size | |
| self.conv_size = config.linear_attn_config["short_conv_kernel_size"] | |
| self.head_dim = config.linear_attn_config["head_dim"] | |
| self.num_heads = config.linear_attn_config["num_heads"] | |
| self.head_k_dim = self.head_dim | |
| self.num_k_heads = self.num_heads | |
| self.layer_idx = layer_idx | |
| assert self.mode in [ | |
| "chunk", | |
| "fused_recurrent", | |
| ], f"Not supported mode `{self.mode}`." | |
| projection_k_size = self.head_k_dim * self.num_k_heads | |
| projection_size = self.head_dim * self.num_heads | |
| self.q_proj = nn.Linear(self.hidden_size, projection_k_size, bias=False) | |
| self.k_proj = nn.Linear(self.hidden_size, projection_k_size, bias=False) | |
| self.v_proj = nn.Linear(self.hidden_size, projection_size, bias=False) | |
| self.q_conv1d = ShortConvolution( | |
| hidden_size=projection_k_size, | |
| kernel_size=self.conv_size, | |
| activation="silu", | |
| ) | |
| self.k_conv1d = ShortConvolution( | |
| hidden_size=projection_k_size, | |
| kernel_size=self.conv_size, | |
| activation="silu", | |
| ) | |
| self.v_conv1d = ShortConvolution( | |
| hidden_size=projection_size, | |
| kernel_size=self.conv_size, | |
| activation="silu", | |
| ) | |
| self.A_log = torch.nn.Parameter( | |
| torch.log(torch.empty(self.num_heads, dtype=torch.float32).uniform_(1, 16)) | |
| ) | |
| self.f_a_proj = nn.Linear(self.hidden_size, self.head_dim, bias=False) | |
| self.f_b_proj = nn.Linear(self.head_dim, projection_size, bias=False) | |
| self.dt_bias = nn.Parameter(torch.empty(projection_size, dtype=torch.float32)) | |
| self.b_proj = nn.Linear(self.hidden_size, self.num_heads, bias=False) | |
| self.use_full_rank_gate = config.linear_attn_config.get( | |
| "use_full_rank_gate", False | |
| ) | |
| self.gate_lower_bound = config.linear_attn_config.get("gate_lower_bound", None) | |
| if self.use_full_rank_gate: | |
| self.g_proj = nn.Linear(self.hidden_size, projection_size, bias=False) | |
| else: | |
| self.g_a_proj = nn.Linear(self.hidden_size, self.head_dim, bias=False) | |
| self.g_b_proj = nn.Linear(self.head_dim, projection_size, bias=False) | |
| self.o_norm = FusedRMSNormGated( | |
| self.head_dim, eps=config.rms_norm_eps, activation="sigmoid" | |
| ) | |
| self.o_proj = nn.Linear(projection_size, self.hidden_size, bias=False) | |
| def forward( | |
| self, | |
| hidden_states: torch.Tensor, | |
| attention_mask: torch.Tensor | None = None, | |
| cache_params: KimiDynamicCache | None = None, | |
| **kwargs: Unpack[dict], | |
| ) -> tuple[torch.Tensor, torch.Tensor | None, Cache | None]: | |
| if attention_mask is not None: | |
| if attention_mask.dim() != 2: | |
| attention_mask = kwargs.get("padding_mask") | |
| if attention_mask is not None and attention_mask.dim() != 2: | |
| raise ValueError( | |
| "attention_mask must be a 0-1 matrix of shape [batch_size, seq_len] " | |
| "(0 = padding). 3D masks are not supported here.", | |
| ) | |
| use_cache = cache_params is not None | |
| batch_size, q_len, _ = hidden_states.shape | |
| mode = "fused_recurrent" if use_cache and q_len == 1 else self.mode | |
| if self.training: | |
| assert mode == "chunk", "Only chunk mode is supported in training." | |
| cu_seqlens = kwargs.get("cu_seqlens") | |
| indices = None | |
| if attention_mask is not None: | |
| indices, cu_seqlens, _ = get_unpad_data(attention_mask[:, -q_len:]) | |
| hidden_states = index_first_axis( | |
| rearrange(hidden_states, "b s ... -> (b s) ..."), indices | |
| ).unsqueeze(0) | |
| conv_state_q, conv_state_k, conv_state_v = None, None, None | |
| recurrent_state = None | |
| if cache_params is not None: | |
| if cache_params.conv_states[self.layer_idx] is not None: | |
| conv_state_q, conv_state_k, conv_state_v = cache_params.conv_states[ | |
| self.layer_idx | |
| ] | |
| recurrent_state = cache_params.recurrent_states[self.layer_idx] | |
| q_proj_states = self.q_proj(hidden_states) | |
| k_proj_states = self.k_proj(hidden_states) | |
| v_proj_states = self.v_proj(hidden_states) | |
| q, conv_state_q = self.q_conv1d( | |
| x=q_proj_states, | |
| cache=conv_state_q, | |
| output_final_state=use_cache, | |
| cu_seqlens=cu_seqlens, | |
| ) | |
| k, conv_state_k = self.k_conv1d( | |
| x=k_proj_states, | |
| cache=conv_state_k, | |
| output_final_state=use_cache, | |
| cu_seqlens=cu_seqlens, | |
| ) | |
| v, conv_state_v = self.v_conv1d( | |
| x=v_proj_states, | |
| cache=conv_state_v, | |
| output_final_state=use_cache, | |
| cu_seqlens=cu_seqlens, | |
| ) | |
| g = self.f_b_proj(self.f_a_proj(hidden_states)) | |
| g = rearrange(g, "... (h d) -> ... h d", d=self.head_dim) | |
| beta = self.b_proj(hidden_states).float() | |
| q, k = map( | |
| lambda x: rearrange(x, "... (h d) -> ... h d", d=self.head_k_dim), (q, k) | |
| ) | |
| v = rearrange(v, "... (h d) -> ... h d", d=self.head_dim) | |
| if mode == "chunk": | |
| o, recurrent_state = chunk_kda( | |
| q=q, | |
| k=k, | |
| v=v, | |
| g=g, | |
| beta=beta, | |
| A_log=self.A_log, | |
| dt_bias=self.dt_bias, | |
| initial_state=recurrent_state, | |
| output_final_state=True, | |
| use_qk_l2norm_in_kernel=True, | |
| use_gate_in_kernel=True, | |
| use_beta_sigmoid_in_kernel=True, | |
| safe_gate=self.gate_lower_bound is not None, | |
| lower_bound=self.gate_lower_bound, | |
| transpose_state_layout=True, | |
| cu_seqlens=cu_seqlens, | |
| ) | |
| else: | |
| o, recurrent_state = fused_recurrent_kda( | |
| q=q, | |
| k=k, | |
| v=v, | |
| g=g, | |
| beta=beta, | |
| A_log=self.A_log, | |
| dt_bias=self.dt_bias, | |
| initial_state=recurrent_state, | |
| output_final_state=True, | |
| use_qk_l2norm_in_kernel=True, | |
| use_gate_in_kernel=True, | |
| use_beta_sigmoid_in_kernel=True, | |
| lower_bound=self.gate_lower_bound, | |
| transpose_state_layout=True, | |
| cu_seqlens=cu_seqlens, | |
| ) | |
| if cache_params is not None: | |
| cache_params.recurrent_states[self.layer_idx] = recurrent_state | |
| cache_params.conv_states[self.layer_idx] = ( | |
| conv_state_q, | |
| conv_state_k, | |
| conv_state_v, | |
| ) | |
| if self.use_full_rank_gate: | |
| g = self.g_proj(hidden_states) | |
| else: | |
| g = self.g_b_proj(self.g_a_proj(hidden_states)) | |
| g = rearrange(g, "... (h d) -> ... h d", d=self.head_dim) | |
| o = self.o_norm(o, g) | |
| o = rearrange(o, "b t h d -> b t (h d)") | |
| o = self.o_proj(o) | |
| if attention_mask is not None: | |
| o = pad_input(o.squeeze(0), indices, batch_size, q_len) | |
| return o | |
| class KimiMoEGate(nn.Module): | |
| """ | |
| MoEGate adapted from Deepseek-V3. | |
| Parameter correspondences: | |
| num_experts -> n_routed_experts | |
| num_experts_per_token -> num_experts_per_tok | |
| num_expert_group -> n_group | |
| moe_router_activation_func -> scoring_func | |
| """ | |
| def __init__(self, config: KimiLinearConfig): | |
| super().__init__() | |
| self.config = config | |
| self.top_k = config.num_experts_per_token | |
| self.num_experts = config.num_experts | |
| self.routed_scaling_factor = config.routed_scaling_factor | |
| self.moe_router_activation_func = config.moe_router_activation_func | |
| self.num_expert_group = getattr(config, "num_expert_group", 1) | |
| self.topk_group = getattr(config, "topk_group", 1) | |
| # topk selection algorithm | |
| self.moe_renormalize = config.moe_renormalize | |
| self.gating_dim = config.hidden_size | |
| self.weight = nn.Parameter( | |
| torch.empty((self.num_experts, self.gating_dim)), | |
| ) | |
| self.e_score_correction_bias = nn.Parameter( | |
| torch.empty(self.num_experts), | |
| ) | |
| self.reset_parameters() | |
| def reset_parameters(self) -> None: | |
| import torch.nn.init as init | |
| init.kaiming_uniform_(self.weight, a=math.sqrt(5)) | |
| def forward(self, hidden_states): | |
| bsz, seq_len, h = hidden_states.shape | |
| # compute gating score | |
| hidden_states = hidden_states.view(-1, h) | |
| logits = F.linear( | |
| hidden_states.type(torch.float32), | |
| self.weight.type(torch.float32), | |
| None, | |
| ) | |
| if self.moe_router_activation_func == "sigmoid": | |
| scores = logits.sigmoid() | |
| elif self.moe_router_activation_func == "softmax": | |
| scores = logits.softmax(dim=1) | |
| else: | |
| raise NotImplementedError( | |
| f"insupportable scoring function for MoE gating: {self.moe_router_activation_func}", | |
| ) | |
| # select top-k experts | |
| scores = scores.view(bsz * seq_len, -1) | |
| scores_for_choice = scores + self.e_score_correction_bias.unsqueeze(0) | |
| if self.num_expert_group > 1 and self.num_expert_group > self.topk_group: | |
| group_scores = ( | |
| scores_for_choice.view(bsz * seq_len, self.num_expert_group, -1) | |
| .topk(2, dim=-1)[0] | |
| .sum(dim=-1) | |
| ) # [n, num_expert_group] | |
| group_idx = torch.topk( | |
| group_scores, | |
| k=self.topk_group, | |
| dim=-1, | |
| sorted=False, | |
| )[1] # [n, top_k_group] | |
| group_mask = torch.zeros_like(group_scores) # [n, num_expert_group] | |
| group_mask.scatter_(1, group_idx, 1) # [n, num_expert_group] | |
| score_mask = ( | |
| group_mask.unsqueeze(-1) | |
| .expand( | |
| bsz * seq_len, | |
| self.num_expert_group, | |
| self.num_experts // self.num_expert_group, | |
| ) | |
| .reshape(bsz * seq_len, -1) | |
| ) # [n, e] | |
| tmp_scores = scores_for_choice.masked_fill( | |
| ~score_mask.bool(), float("-inf") | |
| ) # [n, e] | |
| else: | |
| tmp_scores = scores_for_choice | |
| _, topk_idx = torch.topk( | |
| tmp_scores, | |
| k=self.top_k, | |
| dim=-1, | |
| sorted=False, | |
| ) | |
| topk_weight = scores.gather(1, topk_idx) | |
| # norm gate to sum 1 | |
| if self.top_k > 1 and self.moe_renormalize: | |
| denominator = topk_weight.sum(dim=-1, keepdim=True) + 1e-20 | |
| topk_weight = topk_weight / denominator | |
| # must multiply the scaling factor | |
| topk_weight = topk_weight * self.routed_scaling_factor | |
| return topk_idx, topk_weight | |
| class KimiSparseMoeBlock(nn.Module): | |
| """ | |
| Adapted from Deepseek-V3's MOE implementation | |
| The namings are consistent with Kimi's version. | |
| """ | |
| def __init__(self, config: KimiLinearConfig): | |
| super().__init__() | |
| self.config = config | |
| self.hidden_dim = config.hidden_size | |
| self.num_experts = config.num_experts | |
| self.top_k = config.num_experts_per_token | |
| self.moe_renormalize = config.moe_renormalize | |
| self.use_latent_moe = ( | |
| getattr(config, "routed_expert_hidden_size", None) is not None | |
| ) | |
| self.moe_hidden_size = ( | |
| config.routed_expert_hidden_size | |
| if self.use_latent_moe | |
| else config.hidden_size | |
| ) | |
| self.latent_moe_use_norm = getattr(config, "latent_moe_use_norm", False) | |
| self.ep_size = 1 | |
| self.experts_per_rank = config.num_experts | |
| self.ep_rank = 0 | |
| self.experts = nn.ModuleList( | |
| [ | |
| KimiBlockSparseMLP( | |
| config, | |
| hidden_size=self.moe_hidden_size, | |
| intermediate_size=config.moe_intermediate_size, | |
| ) | |
| for _ in range(config.num_experts) | |
| ], | |
| ) | |
| self.gate = KimiMoEGate(config) | |
| if config.num_shared_experts is not None: | |
| intermediate_size = config.moe_intermediate_size * config.num_shared_experts | |
| self.shared_experts = KimiMLP( | |
| config=config, | |
| intermediate_size=intermediate_size, | |
| ) | |
| if self.use_latent_moe: | |
| self.routed_expert_down_proj = nn.Linear( | |
| config.hidden_size, | |
| self.moe_hidden_size, | |
| bias=False, | |
| ) | |
| self.routed_expert_up_proj = nn.Linear( | |
| self.moe_hidden_size, | |
| config.hidden_size, | |
| bias=False, | |
| ) | |
| if self.latent_moe_use_norm: | |
| self.routed_expert_norm = KimiRMSNorm( | |
| self.moe_hidden_size, | |
| eps=config.rms_norm_eps, | |
| ) | |
| def forward(self, hidden_states): | |
| identity = hidden_states | |
| orig_shape = hidden_states.shape | |
| topk_idx, topk_weight = self.gate(hidden_states) | |
| hidden_states = hidden_states.view(-1, hidden_states.shape[-1]) | |
| if self.use_latent_moe: | |
| hidden_states = self.routed_expert_down_proj(hidden_states) | |
| if not self.training: | |
| y = self.moe_infer(hidden_states, topk_idx, topk_weight) | |
| else: | |
| y = self.moe_train(hidden_states, topk_idx, topk_weight) | |
| if self.use_latent_moe: | |
| if self.latent_moe_use_norm: | |
| y = self.routed_expert_norm(y) | |
| y = self.routed_expert_up_proj(y) | |
| y = y.view(*orig_shape) | |
| if self.config.num_shared_experts is not None: | |
| y = y + self.shared_experts(identity) | |
| return y | |
| def moe_train(self, x, topk_ids, topk_weight): | |
| """Training-compatible MoE dispatch with gradient flow.""" | |
| y = torch.zeros_like(x) | |
| with torch.no_grad(): | |
| expert_mask = F.one_hot(topk_ids, self.num_experts).permute(2, 1, 0) | |
| for expert_idx, expert in enumerate(self.experts): | |
| top_k_pos, token_indices = torch.where(expert_mask[expert_idx]) | |
| if get_calibrate_all_experts_flag(): | |
| expert_out = expert(x)[token_indices] | |
| else: | |
| expert_out = expert(x[token_indices]) | |
| expert_weights = topk_weight[token_indices, top_k_pos, None] | |
| y.index_add_(0, token_indices, (expert_out * expert_weights).to(y.dtype)) | |
| return y | |
| def moe_infer(self, x, topk_ids, topk_weight): | |
| cnts = topk_ids.new_zeros((topk_ids.shape[0], len(self.experts))) | |
| cnts.scatter_(1, topk_ids, 1) | |
| tokens_per_expert = cnts.sum(dim=0) | |
| idxs = topk_ids.view(-1).argsort() | |
| sorted_tokens = x[idxs // topk_ids.shape[1]] | |
| tokens_per_expert = tokens_per_expert.cpu().numpy() | |
| outputs = [] | |
| start_idx = 0 | |
| for i, num_tokens in enumerate(tokens_per_expert): | |
| end_idx = start_idx + num_tokens | |
| if num_tokens == 0: | |
| continue | |
| expert = self.experts[i + self.ep_rank * self.experts_per_rank] | |
| tokens_for_this_expert = sorted_tokens[start_idx:end_idx] | |
| expert_out = expert(tokens_for_this_expert) | |
| outputs.append(expert_out) | |
| start_idx = end_idx | |
| outs = torch.cat(outputs, dim=0) if len(outputs) else sorted_tokens.new_empty(0) | |
| new_x = torch.empty_like(outs) | |
| new_x[idxs] = outs | |
| final_out = ( | |
| new_x.view(*topk_ids.shape, -1) | |
| .type(topk_weight.dtype) | |
| .mul_(topk_weight.unsqueeze(dim=-1)) | |
| .sum(dim=1) | |
| .type(new_x.dtype) | |
| ) | |
| return final_out | |
| class KimiDecoderLayer(nn.Module): | |
| def __init__(self, config: KimiLinearConfig, layer_idx: int): | |
| super().__init__() | |
| self.hidden_size = config.hidden_size | |
| self.config = config | |
| self.layer_idx = layer_idx | |
| if config.is_kda_layer(layer_idx): | |
| self.is_linear_attn = True | |
| self.self_attn = KimiDeltaAttention(config=config, layer_idx=layer_idx) | |
| elif config.is_mla: | |
| self.is_linear_attn = False | |
| self.self_attn = KimiMLAAttention(config=config, layer_idx=layer_idx) | |
| else: | |
| raise NotImplementedError | |
| if ( | |
| config.num_experts is not None | |
| and layer_idx >= config.first_k_dense_replace | |
| and layer_idx % getattr(config, "moe_layer_freq", 1) == 0 | |
| ): | |
| self.block_sparse_moe = KimiSparseMoeBlock(config) | |
| else: | |
| self.mlp = KimiMLP(config) | |
| self.input_layernorm = KimiRMSNorm(config.hidden_size, eps=config.rms_norm_eps) | |
| self.post_attention_layernorm = KimiRMSNorm( | |
| config.hidden_size, eps=config.rms_norm_eps | |
| ) | |
| # Attention residual | |
| self.use_attn_residuals = ( | |
| getattr(config, "attn_res_block_size", None) is not None | |
| ) | |
| if self.use_attn_residuals: | |
| self.attn_res_block_size = config.attn_res_block_size | |
| self.self_attention_res_norm = KimiRMSNorm( | |
| config.hidden_size, eps=config.rms_norm_eps | |
| ) | |
| self.mlp_res_norm = KimiRMSNorm(config.hidden_size, eps=config.rms_norm_eps) | |
| self.self_attention_res_proj = nn.Linear(config.hidden_size, 1, bias=False) | |
| self.mlp_res_proj = nn.Linear(config.hidden_size, 1, bias=False) | |
| def forward( | |
| self, | |
| hidden_states: torch.Tensor, | |
| attention_mask: torch.Tensor | None = None, | |
| position_ids: torch.LongTensor | None = None, | |
| past_key_values: tuple[torch.Tensor] | None = None, | |
| output_attentions: bool | None = False, | |
| use_cache: bool | None = False, | |
| block_residual: torch.Tensor | None = None, | |
| **kwargs: Unpack[FlashAttentionKwargs], | |
| ): | |
| if self.use_attn_residuals: | |
| return self._forward_attn_residual( | |
| hidden_states, | |
| attention_mask, | |
| position_ids, | |
| past_key_values, | |
| output_attentions, | |
| use_cache, | |
| block_residual, | |
| **kwargs, | |
| ) | |
| residual = hidden_states | |
| hidden_states = self.input_layernorm(hidden_states) | |
| # Self Attention | |
| if self.is_linear_attn is False: | |
| hidden_states = self.self_attn( | |
| hidden_states=hidden_states, | |
| attention_mask=attention_mask, | |
| position_ids=position_ids, | |
| past_key_values=past_key_values, | |
| output_attentions=output_attentions, | |
| use_cache=use_cache, | |
| **kwargs, | |
| ) | |
| else: | |
| hidden_states = self.self_attn( | |
| hidden_states=hidden_states, | |
| attention_mask=attention_mask, | |
| cache_params=past_key_values, | |
| output_attentions=output_attentions, | |
| use_cache=use_cache, | |
| **kwargs, | |
| ) | |
| hidden_states = residual + hidden_states | |
| # Fully Connected | |
| residual = hidden_states | |
| hidden_states = self.post_attention_layernorm(hidden_states) | |
| if hasattr(self, "block_sparse_moe"): | |
| hidden_states = self.block_sparse_moe(hidden_states) | |
| else: | |
| hidden_states = self.mlp(hidden_states) | |
| hidden_states = residual + hidden_states | |
| return hidden_states | |
| def _forward_attn_residual( | |
| self, | |
| hidden_states: torch.Tensor, | |
| attention_mask: torch.Tensor | None = None, | |
| position_ids: torch.LongTensor | None = None, | |
| past_key_values: tuple[torch.Tensor] | None = None, | |
| output_attentions: bool | None = False, | |
| use_cache: bool | None = False, | |
| block_residual: torch.Tensor | None = None, | |
| **kwargs: Unpack[FlashAttentionKwargs], | |
| ): | |
| batch_size, seq_len, hidden_size = hidden_states.shape | |
| prefix_sum = hidden_states | |
| if block_residual is not None and block_residual.shape[1] > 0: | |
| hidden_states = _apply_attn_res( | |
| prefix_sum.view(-1, hidden_size), | |
| block_residual, | |
| self.self_attention_res_proj, | |
| self.self_attention_res_norm, | |
| ).view(batch_size, seq_len, hidden_size) | |
| if self.layer_idx % self.attn_res_block_size == 0: | |
| block_residual = torch.cat( | |
| [block_residual, prefix_sum.view(-1, hidden_size).unsqueeze(1)], dim=1 | |
| ) | |
| prefix_sum = None | |
| hidden_states = self.input_layernorm(hidden_states) | |
| # Self Attention | |
| if self.is_linear_attn is False: | |
| hidden_states = self.self_attn( | |
| hidden_states=hidden_states, | |
| attention_mask=attention_mask, | |
| position_ids=position_ids, | |
| past_key_values=past_key_values, | |
| output_attentions=output_attentions, | |
| use_cache=use_cache, | |
| **kwargs, | |
| ) | |
| else: | |
| hidden_states = self.self_attn( | |
| hidden_states=hidden_states, | |
| attention_mask=attention_mask, | |
| cache_params=past_key_values, | |
| output_attentions=output_attentions, | |
| use_cache=use_cache, | |
| **kwargs, | |
| ) | |
| if prefix_sum is not None: | |
| prefix_sum = prefix_sum + hidden_states | |
| else: | |
| prefix_sum = hidden_states | |
| hidden_states = _apply_attn_res( | |
| prefix_sum.view(-1, hidden_size), | |
| block_residual, | |
| self.mlp_res_proj, | |
| self.mlp_res_norm, | |
| ).view(batch_size, seq_len, hidden_size) | |
| hidden_states = self.post_attention_layernorm(hidden_states) | |
| if hasattr(self, "block_sparse_moe"): | |
| hidden_states = self.block_sparse_moe(hidden_states) | |
| else: | |
| hidden_states = self.mlp(hidden_states) | |
| if prefix_sum is None: | |
| prefix_sum = hidden_states | |
| else: | |
| prefix_sum = prefix_sum + hidden_states | |
| return prefix_sum, block_residual | |
| class KimiPreTrainedModel(PreTrainedModel): | |
| config_class = KimiLinearConfig | |
| base_model_prefix = "model" | |
| supports_gradient_checkpointing = True | |
| _no_split_modules = ["KimiDecoderLayer"] | |
| _skip_keys_device_placement = "past_key_values" | |
| _supports_flash_attn_2 = True | |
| _can_record_outputs = { | |
| "router_logits": OutputRecorder(KimiBlockSparseMLP, index=1), | |
| "hidden_states": KimiDecoderLayer, | |
| "attentions": KimiMLAAttention, | |
| } | |
| _is_stateful = True | |
| def _init_weights(self, module): | |
| # HOTFIX: disk offloading attempts to initialize the meta tensors | |
| # but this is bad programming: we shouldn't be initializing these | |
| # params in the first place | |
| # the init attempt attempts to get `module.weight`, which DNE for qmodels | |
| return | |
| std = self.config.initializer_range | |
| if isinstance(module, nn.Linear): | |
| module.weight.data.normal_(mean=0.0, std=std) | |
| if module.bias is not None: | |
| module.bias.data.zero_() | |
| elif isinstance(module, nn.Embedding): | |
| module.weight.data.normal_(mean=0.0, std=std) | |
| if module.padding_idx is not None: | |
| module.weight.data[module.padding_idx].zero_() | |
| def _apply_attn_res(prefix_sum, block_residual, proj, norm): | |
| """ | |
| prefix_sum: (num_tokens, hidden_size) | |
| block_residual: (num_tokens, num_blocks, hidden_size) | |
| """ | |
| v = torch.cat((block_residual, prefix_sum.unsqueeze(1)), dim=1) | |
| v_float = v.float() | |
| variance = v_float.pow(2).mean(-1, keepdim=True) | |
| k = v_float * torch.rsqrt(variance + norm.variance_epsilon) | |
| score_weight = norm.weight.float() * proj.weight.squeeze(0).float() | |
| scores = (k * score_weight).sum(-1) | |
| probs = scores.softmax(-1).unsqueeze(1) | |
| hidden_states = torch.matmul(probs, v_float).squeeze(1) | |
| return hidden_states.to(v.dtype) | |
| class KimiLinearModel(KimiPreTrainedModel): | |
| def __init__(self, config: KimiLinearConfig): | |
| super().__init__(config) | |
| self.padding_idx = config.pad_token_id | |
| self.vocab_size = config.vocab_size | |
| self.embed_tokens = nn.Embedding( | |
| config.vocab_size, config.hidden_size, self.padding_idx | |
| ) | |
| self.layers = nn.ModuleList( | |
| [ | |
| KimiDecoderLayer(config, layer_idx) | |
| for layer_idx in range(config.num_hidden_layers) | |
| ] | |
| ) | |
| self.norm = KimiRMSNorm(config.hidden_size, eps=config.rms_norm_eps) | |
| self.use_attn_residuals = ( | |
| getattr(config, "attn_res_block_size", None) is not None | |
| ) | |
| if self.use_attn_residuals: | |
| self.output_attn_res_norm = KimiRMSNorm( | |
| config.hidden_size, eps=config.rms_norm_eps | |
| ) | |
| self.output_attn_res_proj = nn.Linear(config.hidden_size, 1, bias=False) | |
| from transformers.utils import is_flash_attn_2_available as _fa2_avail | |
| _requested = getattr(config, "_attn_implementation", None) | |
| if _requested not in (None, "flash_attention_2") or not _fa2_avail(): | |
| # Fall back gracefully when flash-attn2 is unavailable or a different impl is requested | |
| if _requested == "flash_attention_2" and not _fa2_avail(): | |
| logger.warning_once( | |
| "flash_attention_2 requested but not available; falling back to sdpa." | |
| ) | |
| config._attn_implementation = ( | |
| _requested if _requested not in (None, "flash_attention_2") else "eager" | |
| ) | |
| else: | |
| config._attn_implementation = "flash_attention_2" | |
| self._use_flash_attention_2 = config._attn_implementation == "flash_attention_2" | |
| self.gradient_checkpointing = False | |
| # Initialize weights and apply final processing | |
| self.post_init() | |
| def _update_linear_attn_mask(self, attention_mask, cache_position): | |
| """ | |
| NOTE: Left-padding is used for linear attention mask. | |
| No need for zeroing states when | |
| 1. Cached forward | |
| 2. Attending to all inputs | |
| """ | |
| linear_attn_mask = attention_mask | |
| if cache_position[0] > 0 or ( | |
| attention_mask is not None and torch.all(attention_mask == 1) | |
| ): | |
| linear_attn_mask = None | |
| return linear_attn_mask | |
| # @auto_docstring | |
| def forward( | |
| self, | |
| input_ids: torch.LongTensor = None, | |
| attention_mask: torch.Tensor | None = None, | |
| position_ids: torch.LongTensor | None = None, | |
| past_key_values: Cache | None = None, | |
| inputs_embeds: torch.FloatTensor | None = None, | |
| cache_position: torch.LongTensor | None = None, | |
| use_cache: bool | None = None, | |
| **kwargs: Unpack[TransformersKwargs], | |
| ) -> tuple | BaseModelOutputWithPast: | |
| use_cache = use_cache if use_cache is not None else self.config.use_cache | |
| if (input_ids is None) and (inputs_embeds is None): | |
| raise ValueError( | |
| "You must specify exactly one of input_ids or inputs_embeds" | |
| ) | |
| # Get inputs_embeds | |
| if inputs_embeds is None: | |
| inputs_embeds = self.embed_tokens(input_ids) | |
| if use_cache and past_key_values is None: | |
| past_key_values = KimiDynamicCache(config=self.config) | |
| if cache_position is None: | |
| past_seen_tokens = ( | |
| past_key_values.get_seq_length() if past_key_values is not None else 0 | |
| ) | |
| cache_position: torch.Tensor = torch.arange( | |
| past_seen_tokens, | |
| past_seen_tokens + inputs_embeds.shape[1], | |
| device=inputs_embeds.device, | |
| ) | |
| if position_ids is None: | |
| position_ids = cache_position.unsqueeze(0) | |
| causal_mask = create_causal_mask( | |
| config=self.config, | |
| inputs_embeds=inputs_embeds, | |
| attention_mask=attention_mask, | |
| past_key_values=past_key_values, | |
| position_ids=position_ids, | |
| ) | |
| linear_attn_mask = self._update_linear_attn_mask(attention_mask, cache_position) | |
| hidden_states = inputs_embeds | |
| if past_key_values is not None: | |
| assert isinstance(past_key_values, KimiDynamicCache) | |
| block_residual = None | |
| if self.use_attn_residuals: | |
| block_residual = hidden_states.new_zeros( | |
| hidden_states.shape[0] * hidden_states.shape[1], | |
| 0, | |
| hidden_states.shape[2], | |
| ) | |
| for decoder_layer in self.layers: | |
| layer_mask = ( | |
| linear_attn_mask if decoder_layer.is_linear_attn else causal_mask | |
| ) | |
| if self.use_attn_residuals: | |
| hidden_states, block_residual = decoder_layer( | |
| hidden_states, | |
| attention_mask=layer_mask, | |
| past_key_values=past_key_values, | |
| cache_position=cache_position, | |
| block_residual=block_residual, | |
| **kwargs, | |
| ) | |
| else: | |
| hidden_states = decoder_layer( | |
| hidden_states, | |
| attention_mask=layer_mask, | |
| past_key_values=past_key_values, | |
| cache_position=cache_position, | |
| **kwargs, | |
| ) | |
| if self.use_attn_residuals: | |
| hidden_states = self._apply_output_attn_res(hidden_states, block_residual) | |
| hidden_states = self.norm(hidden_states) | |
| return BaseModelOutputWithPast( | |
| last_hidden_state=hidden_states, | |
| past_key_values=past_key_values, | |
| ) | |
| def _apply_output_attn_res(self, hidden_states, block_residual): | |
| batch_size, seq_len, hidden_size = hidden_states.shape | |
| return _apply_attn_res( | |
| hidden_states.view(-1, hidden_size), | |
| block_residual, | |
| self.output_attn_res_proj, | |
| self.output_attn_res_norm, | |
| ).view(batch_size, seq_len, hidden_size) | |
| class KimiLinearForCausalLM(KimiPreTrainedModel, GenerationMixin): | |
| def _supports_default_dynamic_cache(cls) -> bool: | |
| return False | |
| _tied_weights_keys = {"lm_head.weight": "model.embed_tokens.weight"} | |
| def __init__(self, config): | |
| super().__init__(config) | |
| self.model = KimiLinearModel(config) | |
| self.vocab_size = config.vocab_size | |
| self.lm_head = nn.Linear(config.hidden_size, config.vocab_size, bias=False) | |
| # Initialize weights and apply final processing | |
| self.post_init() | |
| # @auto_docstring | |
| def forward( | |
| self, | |
| input_ids: torch.LongTensor = None, | |
| attention_mask: torch.Tensor | None = None, | |
| position_ids: torch.LongTensor | None = None, | |
| past_key_values: list[torch.FloatTensor] | None = None, | |
| inputs_embeds: torch.FloatTensor | None = None, | |
| labels: torch.LongTensor | None = None, | |
| use_cache: bool | None = None, | |
| output_attentions: bool | None = None, | |
| output_hidden_states: bool | None = None, | |
| generation_mode: bool | None = None, | |
| return_dict: bool | None = None, | |
| cache_position: torch.LongTensor | None = None, | |
| **kwargs: Unpack[TransformersKwargs], | |
| ) -> tuple | CausalLMOutputWithPast: | |
| r""" | |
| Args: | |
| labels (`torch.LongTensor` of shape `(batch_size, sequence_length)`, *optional*): | |
| Labels for computing the masked language modeling loss. Indices should either be in `[0, ..., | |
| config.vocab_size]` or -100 (see `input_ids` docstring). Tokens with indices set to `-100` are ignored | |
| (masked), the loss is only computed for the tokens with labels in `[0, ..., config.vocab_size]`. | |
| """ | |
| output_attentions = ( | |
| output_attentions | |
| if output_attentions is not None | |
| else self.config.output_attentions | |
| ) | |
| output_hidden_states = ( | |
| output_hidden_states | |
| if output_hidden_states is not None | |
| else self.config.output_hidden_states | |
| ) | |
| return_dict = ( | |
| return_dict if return_dict is not None else self.config.use_return_dict | |
| ) | |
| outputs = self.model( | |
| input_ids=input_ids, | |
| attention_mask=attention_mask, | |
| position_ids=position_ids, | |
| past_key_values=past_key_values, | |
| inputs_embeds=inputs_embeds, | |
| use_cache=use_cache, | |
| output_attentions=output_attentions, | |
| output_hidden_states=output_hidden_states, | |
| return_dict=return_dict, | |
| cache_position=cache_position, | |
| ) | |
| logits = outputs[0] | |
| if generation_mode: | |
| logits = logits[:, -1:] | |
| logits = self.lm_head(logits) | |
| loss = None | |
| if labels is not None: | |
| loss = self.loss_function(logits, labels, self.vocab_size, **kwargs) | |
| return CausalLMOutputWithPast( | |
| loss=loss, | |
| logits=logits, | |
| past_key_values=outputs.past_key_values, | |
| hidden_states=outputs.hidden_states, | |
| attentions=outputs.attentions, | |
| ) | |