| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523 |
- # Copyright 2025 The HuggingFace Team. All rights reserved.
- #
- # 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.
- from collections.abc import Callable
- from functools import wraps
- from ..utils import logging
- from ..utils.generic import GeneralInterface
- from ..utils.import_utils import is_torch_available, is_torch_less_or_equal, is_torchdynamo_compiling
- if is_torch_available():
- import torch
- logger = logging.get_logger(__name__)
- # Examples of experts class with its eager mm implementation
- # class Experts(torch.nn.Module):
- # """Collection of expert weights stored as 3D tensors."""
- # def __init__(self, config):
- # super().__init__()
- # self.num_experts = config.n_routed_experts
- # self.hidden_dim = config.hidden_size
- # self.intermediate_dim = config.moe_intermediate_size
- # self.gate_up_proj = torch.nn.Parameter(torch.empty(self.num_experts, 2 * self.intermediate_dim, self.hidden_dim))
- # self.down_proj = torch.nn.Parameter(torch.empty(self.num_experts, self.hidden_dim, self.intermediate_dim))
- # self.act_fn = ACT2FN[config.hidden_act]
- # def forward(
- # self,
- # hidden_states: torch.Tensor,
- # top_k_index: torch.Tensor,
- # top_k_weights: torch.Tensor,
- # ) -> torch.Tensor:
- # final_hidden_states = torch.zeros_like(hidden_states)
- # with torch.no_grad():
- # expert_mask = torch.nn.functional.one_hot(top_k_index, num_classes=self.num_experts)
- # expert_mask = expert_mask.permute(2, 1, 0)
- # expert_hit = torch.greater(expert_mask.sum(dim=(-1, -2)), 0).nonzero()
- # for expert_idx in expert_hit:
- # expert_idx = expert_idx[0]
- # if expert_idx == self.num_experts:
- # continue
- # top_k_pos, token_idx = torch.where(expert_mask[expert_idx])
- # current_state = hidden_states[token_idx]
- # gate, up = torch.nn.functional.linear(current_state, self.gate_up_proj[expert_idx]).chunk(2, dim=-1)
- # current_hidden_states = self.act_fn(gate) * up
- # current_hidden_states = torch.nn.functional.linear(current_hidden_states, self.down_proj[expert_idx])
- # current_hidden_states = current_hidden_states * top_k_weights[token_idx, top_k_pos, None]
- # final_hidden_states.index_add_(0, token_idx, current_hidden_states.to(final_hidden_states.dtype))
- # return final_hidden_states
- def _batched_linear(
- input: torch.Tensor,
- weight: torch.Tensor,
- bias: torch.Tensor | None = None,
- is_transposed: bool = False,
- ) -> torch.Tensor:
- """Batched linear layer supporting optional bias and transposed weights.
- Args:
- input (`torch.Tensor`):
- Input tensor of shape (batch_size, input_dim).
- weight (`torch.Tensor`):
- Weight tensor of shape (batch_size, output_dim, input_dim) if transposed is `False`,
- else of shape (batch_size, input_dim, output_dim).
- bias (`torch.Tensor`, *optional*):
- Bias tensor of shape (batch_size, output_dim). Default is `None`.
- is_transposed (`bool`, *optional*, defaults to `False`):
- Whether the weight tensor is transposed.
- Returns:
- `torch.Tensor`: Output tensor of shape (batch_size, output_dim).
- """
- if is_transposed:
- # (batch_size, 1, input_dim) @ (batch_size, input_dim, output_dim) -> (batch_size, 1, output_dim) -> (batch_size, output_dim)
- out = torch.bmm(input.unsqueeze(1), weight).squeeze(1)
- else:
- # (batch_size, output_dim, input_dim) @ (batch_size, input_dim, 1) -> (batch_size, output_dim, 1) -> (batch_size, output_dim)
- out = torch.bmm(weight, input.unsqueeze(-1)).squeeze(-1)
- if bias is not None:
- out = out + bias
- return out
- def batched_mm_experts_forward(
- self: torch.nn.Module,
- hidden_states: torch.Tensor,
- top_k_index: torch.Tensor,
- top_k_weights: torch.Tensor,
- ) -> torch.Tensor:
- device = hidden_states.device
- num_top_k = top_k_index.size(-1)
- num_tokens = hidden_states.size(0)
- hidden_dim = hidden_states.size(-1)
- # Reshape for easier indexing
- # S is the number of selected tokens-experts pairs (S = num_tokens * num_top_k)
- token_idx = torch.arange(num_tokens, device=device).unsqueeze(1).expand(-1, num_top_k).reshape(-1) # (S,)
- sample_weights = top_k_weights.reshape(-1) # (S,)
- expert_ids = top_k_index.reshape(-1) # (S,)
- # Handle invalid expert IDs from Expert Parallelism (EP)
- # When EP is enabled, tokens assigned to experts on other devices are marked with sentinel value >= num_experts
- invalid_mask = expert_ids >= self.num_experts
- expert_ids = expert_ids.clamp(0, self.num_experts - 1)
- # Get current hidden states for selected samples
- selected_hidden_states = hidden_states[token_idx]
- # Select gate_up or just up projection weights and biases
- if self.has_gate:
- selected_weights = self.gate_up_proj[expert_ids]
- selected_biases = self.gate_up_proj_bias[expert_ids] if self.has_bias else None
- else:
- selected_weights = self.up_proj[expert_ids]
- selected_biases = self.up_proj_bias[expert_ids] if self.has_bias else None
- # --- Up projection per expert (batched) ---
- proj_out = _batched_linear(
- selected_hidden_states, selected_weights, bias=selected_biases, is_transposed=self.is_transposed
- ) # (S, 2 * intermediate_dim) or (S, intermediate_dim) depending on whether we have gating
- # Apply gating or activation
- if self.has_gate:
- # for gated experts we apply the custom/default gating mechanism
- proj_out = self._apply_gate(proj_out) # (S, intermediate_dim)
- else:
- # for non-gated experts we just apply the activation function
- proj_out = self.act_fn(proj_out) # (S, intermediate_dim)
- # Select down projection weights and biases for selected samples
- selected_weights = self.down_proj[expert_ids]
- selected_biases = self.down_proj_bias[expert_ids] if self.has_bias else None
- # --- Down projection per expert (batched) ---
- proj_out = _batched_linear(
- proj_out, selected_weights, bias=selected_biases, is_transposed=self.is_transposed
- ) # (S, hidden_dim)
- # Apply routing weights and zero out invalid expert contributions
- weighted_out = proj_out * sample_weights.unsqueeze(-1) # (S, hidden_dim)
- weighted_out.masked_fill_(invalid_mask.unsqueeze(-1), 0.0) # Zero out invalid expert contributions
- # Accumulate results using deterministic reshape+sum instead of index_add_
- # index_add_ with duplicate indices is non-deterministic on CUDA due to atomicAdd
- # index_add_ accumulates in-place using the dtype of the output tensor (fp16/bf16)
- # reshape+sum accumulates in fp32 which is more stable for low precision training/inference.
- final_hidden_states = weighted_out.view(num_tokens, num_top_k, hidden_dim).sum(dim=1)
- return final_hidden_states.to(hidden_states.dtype)
- # torch.compiler.disable does not work with fullgraph=True, so we implement a custom operator to opaque this function.
- # This is not "free compilation compatibility" because now inductor won't be able to optimize matmuls inside the loop,
- # but since the matmuls here have dynamic shapes, inductor wouldn't have been able to optimize them anyway.
- def _grouped_mm_fallback(input: torch.Tensor, weight: torch.Tensor, offs: torch.Tensor) -> torch.Tensor:
- """
- Fallback grouped matrix multiplication used when `torch.nn.functional.grouped_mm` and `torch._grouped_mm`
- are unavailable or incompatible with `torch.compile` (e.g. non-bfloat16 weights).
- Args:
- input (`torch.Tensor`): Input of shape (S, input_dim), sorted by expert id.
- weight (`torch.Tensor`): Expert weights of shape (num_experts, input_dim, output_dim).
- offs (`torch.Tensor`): Cumulative token counts per expert of shape (num_experts,).
- Returns:
- `torch.Tensor`: Output of shape (S, output_dim).
- """
- output = torch.zeros(input.size(0), weight.size(2), device=input.device, dtype=input.dtype) # (S, output_dim)
- start = 0
- # single cpu<->gpu sync point here,
- # avoids multiple syncs inside the loop
- for i, end in enumerate(offs.tolist()):
- if start == end:
- continue
- torch.mm(input[start:end], weight[i], out=output[start:end])
- start = end
- return output
- def _grouped_mm_fallback_fake(input: torch.Tensor, weight: torch.Tensor, offs: torch.Tensor) -> torch.Tensor:
- """Shape/dtype inference stub for `_grouped_mm_fallback` required by `torch.compile`."""
- assert input.dim() == 2, f"input must be 2D (S, input_dim), got shape {tuple(input.shape)}"
- assert weight.dim() == 3, (
- f"weight must be 3D (num_experts, input_dim, output_dim), got shape {tuple(weight.shape)}"
- )
- assert offs.dim() == 1, f"offs must be 1D (num_experts,), got shape {tuple(offs.shape)}"
- assert offs.size(0) == weight.size(0), f"offs length {offs.size(0)} must match number of experts {weight.size(0)}"
- assert input.size(1) == weight.size(1), (
- f"input_dim mismatch: input has {input.size(1)}, weight has {weight.size(1)}"
- )
- assert offs.dtype in (torch.int32, torch.int64), f"offs must be an integer tensor, got {offs.dtype}"
- return torch.empty(input.size(0), weight.size(2), device=input.device, dtype=input.dtype)
- def _grouped_mm_fallback_setup_context(ctx, inputs, output):
- """Saves input and weight for backward; offs is stored directly as it is a non-differentiable integer tensor."""
- ctx.save_for_backward(inputs[0], inputs[1])
- ctx.offs = inputs[2]
- def _grouped_mm_fallback_backward(ctx, grad_output):
- """Backward pass for `_grouped_mm_fallback`. Computes grad_input and grad_weight per expert group; offs has no gradient."""
- input, weight = ctx.saved_tensors
- grad_input = torch.zeros_like(input)
- grad_weight = torch.zeros_like(weight)
- start = 0
- # single cpu<->gpu sync point here,
- # avoids multiple syncs inside the loop
- for i, end in enumerate(ctx.offs.tolist()):
- if start == end:
- continue
- torch.mm(grad_output[start:end], weight[i].T, out=grad_input[start:end])
- torch.mm(input[start:end].T, grad_output[start:end], out=grad_weight[i])
- start = end
- return grad_input, grad_weight, None
- if is_torch_available():
- torch.library.custom_op("transformers::grouped_mm_fallback", _grouped_mm_fallback, mutates_args=())
- torch.library.register_fake("transformers::grouped_mm_fallback", _grouped_mm_fallback_fake)
- torch.library.register_autograd(
- "transformers::grouped_mm_fallback",
- _grouped_mm_fallback_backward,
- setup_context=_grouped_mm_fallback_setup_context,
- )
- def _can_use_grouped_mm(input: torch.Tensor, weight: torch.Tensor, offs: torch.Tensor) -> bool:
- """
- Check if torch.nn.functional.grouped_mm or torch._grouped_mm can be used based on availability and compatibility with torch.compile.
- Args:
- input (`torch.Tensor`):
- Input tensor of shape (S, input_dim).
- weight (`torch.Tensor`):
- Weight tensor of shape (num_experts, input_dim, output_dim).
- offs (`torch.Tensor`):
- Offsets tensor indicating the boundaries of each group in the input tensor.
- Returns:
- `bool`: True if grouped_mm can be used, False otherwise.
- """
- if (is_torchdynamo_compiling() and weight.dtype != torch.bfloat16) or (
- weight.device.type == "cpu"
- # accept_dev=True is necessary for "+cpu"/"+xpu" etc.
- and is_torch_less_or_equal("2.10.0", accept_dev=True)
- and (weight.data_ptr() % 16 != 0 or input.data_ptr() % 16 != 0)
- ):
- # Under the following conditions we cannot use torch.grouped_mm and have to fall back:
- # 1. torch.grouped_mm is not supported in torch.compile / inductor with dtypes other than bf16
- # 2. Before PyTorch 2.11, torch.grouped_mm on CPU required 16 bytes alignment which is not
- # guaranteed for tensors loaded using memmap (e.g. using safetensors lazy tensor loading)
- # and not really necessary because the cpu path uses a fallback for-loop implementation.
- # issue: https://github.com/pytorch/pytorch/issues/172440
- return False
- return hasattr(torch.nn.functional, "grouped_mm") or hasattr(torch, "_grouped_mm")
- def _grouped_mm(
- input: torch.Tensor,
- weight: torch.Tensor,
- offs: torch.Tensor,
- ) -> torch.Tensor:
- """Grouped matrix multiplication dispatcher that uses torch.nn.functional.grouped_mm if available, else falls back to torch._grouped_mm.
- Args:
- input (`torch.Tensor`):
- Input tensor of shape (S, input_dim).
- weight (`torch.Tensor`):
- Weight tensor of shape (num_experts, input_dim, output_dim).
- offs (`torch.Tensor`):
- Offsets tensor indicating the boundaries of each group in the input tensor.
- Returns:
- `torch.Tensor`: Output tensor of shape (S, output_dim).
- """
- if _can_use_grouped_mm(input, weight, offs):
- # torch.nn.functional.grouped_mm and torch._grouped_mm are not autocast-enabled,
- # when autocast is enabled we can end up with intermediate tensors in fp32 (e.g. LayerNorm output) and weight tensors in bf16
- # In that case we need to cast the input to the weight dtype to avoid dtype mismatch errors.
- # See: https://github.com/pytorch/pytorch/issues/174763
- if hasattr(torch.nn.functional, "grouped_mm"):
- return torch.nn.functional.grouped_mm(input.to(weight.dtype), weight, offs=offs)
- elif hasattr(torch, "_grouped_mm"):
- return torch._grouped_mm(input.to(weight.dtype), weight, offs=offs)
- return torch.ops.transformers.grouped_mm_fallback(input, weight, offs=offs)
- def _grouped_linear(
- input: torch.Tensor,
- weight: torch.Tensor,
- offs: torch.Tensor,
- bias: torch.Tensor | None = None,
- is_transposed: bool = False,
- ) -> torch.Tensor:
- """Grouped linear layer supporting optional bias and transposed weights.
- Args:
- input (`torch.Tensor`):
- Input tensor of shape (S, input_dim).
- weight (`torch.Tensor`):
- Weight tensor of shape (num_experts, input_dim, output_dim) if `is_transposed`,
- else of shape (num_experts, output_dim, input_dim).
- offs (`torch.Tensor`):
- Offsets tensor indicating the boundaries of each group in the input tensor.
- bias (`torch.Tensor`, *optional*):
- Bias tensor of shape (num_experts, output_dim). Default is `None`.
- is_transposed (`bool`, *optional*, defaults to `False`):
- Whether the weight tensor is transposed.
- Returns:
- `torch.Tensor`: Output tensor of shape (S, output_dim).
- """
- if is_transposed:
- # (S, input_dim) @ grouped (num_experts, input_dim, output_dim) -> (S, output_dim)
- out = _grouped_mm(input, weight, offs=offs)
- else:
- # (S, input_dim) @ grouped (num_experts, output_dim, input_dim).T -> (S, output_dim)
- out = _grouped_mm(input, weight.transpose(-2, -1), offs=offs)
- if bias is not None:
- # We should be able to pass bias to the grouped_mm call, but it's not yet supported.
- out = out + bias
- return out
- def grouped_mm_experts_forward(
- self: torch.nn.Module,
- hidden_states: torch.Tensor,
- top_k_index: torch.Tensor,
- top_k_weights: torch.Tensor,
- ) -> torch.Tensor:
- device = hidden_states.device
- num_top_k = top_k_index.size(-1)
- num_tokens = hidden_states.size(0)
- hidden_dim = hidden_states.size(-1)
- # Reshape for easier indexing
- # S is the number of selected tokens-experts pairs (S = num_tokens * num_top_k)
- token_idx = torch.arange(num_tokens, device=device).unsqueeze(1).expand(-1, num_top_k).reshape(-1) # (S,)
- sample_weights = top_k_weights.reshape(-1) # (S,)
- expert_ids = top_k_index.reshape(-1) # (S,)
- # Sort by expert for grouped processing
- perm = torch.argsort(expert_ids)
- inv_perm = torch.empty_like(perm)
- inv_perm[perm] = torch.arange(perm.size(0), device=device)
- expert_ids_g = expert_ids[perm]
- sample_weights_g = sample_weights[perm]
- selected_hidden_states_g = hidden_states[token_idx[perm]]
- # Compute offsets for grouped_mm
- # using histc instead of bincount to avoid cuda graph issues
- # With deterministic algorithms, CPU only supports float input, CUDA only supports int input.
- histc_input = expert_ids_g.float() if device.type == "cpu" else expert_ids_g.int()
- tokens_per_expert = torch.histc(histc_input, bins=self.num_experts, min=0, max=self.num_experts - 1)
- offsets = torch.cumsum(tokens_per_expert, dim=0, dtype=torch.int32)
- # Select expert weights and biases
- # NOTE: We keep all experts here and rely on offsets to target the active ones.
- # I have already implemented a version that only passes the active experts, but
- # to do so I had to use torch.unique which breaks the graph capture (data-dependent).
- # Also there were no speedup gains from it in my experiments, even in eager mode.
- if self.has_gate:
- selected_weights = self.gate_up_proj
- selected_biases = self.gate_up_proj_bias[expert_ids_g] if self.has_bias else None
- else:
- selected_weights = self.up_proj
- selected_biases = self.up_proj_bias[expert_ids_g] if self.has_bias else None
- # --- Up projection per expert (grouped) ---
- proj_out = _grouped_linear(
- selected_hidden_states_g, selected_weights, offsets, bias=selected_biases, is_transposed=self.is_transposed
- ) # (S, 2 * intermediate_dim) or (S, intermediate_dim) depending on whether we have gating
- # Apply gating or activation
- if self.has_gate:
- # for gated experts we apply the custom/default gating mechanism
- proj_out = self._apply_gate(proj_out) # (S, intermediate_dim)
- else:
- # for non-gated experts we just apply the activation function
- proj_out = self.act_fn(proj_out) # (S, intermediate_dim)
- # Select down projection weights and biases
- selected_weights = self.down_proj
- selected_biases = self.down_proj_bias[expert_ids_g] if self.has_bias else None
- # --- Down projection per expert (grouped) ---
- proj_out = _grouped_linear(
- proj_out, selected_weights, offsets, bias=selected_biases, is_transposed=self.is_transposed
- ) # (S, hidden_dim)
- # Apply routing weights
- weighted_out = proj_out * sample_weights_g.unsqueeze(-1) # (S, hidden_dim)
- # Restore original order
- weighted_out = weighted_out[inv_perm] # (S, hidden_dim)
- # Accumulate results using deterministic reshape+sum instead of index_add_
- # index_add_ with duplicate indices is non-deterministic on CUDA due to atomicAdd
- # index_add_ accumulates in-place using the dtype of the output tensor (fp16/bf16)
- # reshape+sum accumulates in fp32 which is more stable for low precision training/inference.
- final_hidden_states = weighted_out.view(num_tokens, num_top_k, hidden_dim).sum(dim=1)
- return final_hidden_states.to(hidden_states.dtype)
- class ExpertsInterface(GeneralInterface):
- """Interface for registering custom experts forward functions."""
- _global_mapping = {
- "batched_mm": batched_mm_experts_forward,
- "grouped_mm": grouped_mm_experts_forward,
- }
- def get_interface(self, experts_implementation: str, default: Callable) -> Callable:
- """Return the requested `experts_implementation`. Also strictly check its validity, and raise if invalid."""
- if experts_implementation is None:
- logger.warning_once(
- "You tried to access the `ExpertsInterface` with a `config._experts_implementation` set to `None`. This "
- "is expected if you use an Expert Module as a standalone Module. If this is not the case, something went "
- "wrong with the dispatch of `config._experts_implementation`"
- )
- elif experts_implementation != "eager" and experts_implementation not in self:
- raise KeyError(
- f"`{experts_implementation}` is not a valid experts implementation registered in the `ExpertsInterface`"
- )
- return super().get(experts_implementation, default)
- ALL_EXPERTS_FUNCTIONS = ExpertsInterface()
- def _default_apply_gate(self, gate_up_out: torch.Tensor) -> torch.Tensor:
- """
- Default gating mechanism: splits the gate_up_out into gate and up parts,
- applies the activation function to the gate part, and multiplies it with the up part.
- Args:
- gate_up_out (`torch.Tensor`):
- The output tensor from the gate and up projection of shape (S, 2 * intermediate_dim).
- Returns:
- `torch.Tensor`: The gated output tensor of shape (S, intermediate_dim).
- """
- gate, up = gate_up_out.chunk(2, dim=-1) # (S, intermediate_dim)
- return self.act_fn(gate) * up # (S, intermediate_dim)
- def use_experts_implementation(
- experts_class: type[torch.nn.Module] | None = None,
- *,
- experts_interface: ExpertsInterface = ALL_EXPERTS_FUNCTIONS,
- is_transposed: bool = False,
- has_bias: bool = False,
- has_gate: bool = True,
- ) -> type[torch.nn.Module]:
- """Decorator to modify experts class to support different experts implementations.
- Args:
- experts_class (`type[torch.nn.Module]`, *optional*):
- The experts class to modify. If not provided, returns a decorator that can be applied to the class.
- experts_interface (`ExpertsInterface`, *optional*, defaults to `ALL_EXPERTS_FUNCTIONS`):
- The experts interface to use for dispatching the forward method.
- is_transposed (`bool`, *optional*, defaults to `False`):
- Whether the expert weights are stored in transposed format.
- has_bias (`bool`, *optional*, defaults to `False`):
- Whether the expert layers include bias terms.
- Returns:
- `type[torch.nn.Module]`: The modified experts class.
- """
- def wrapper(experts_class: type[torch.nn.Module]) -> type[torch.nn.Module]:
- original_init = experts_class.__init__
- original_forward = experts_class.forward
- @wraps(original_init)
- def __init__(self, config, *args, **kwargs):
- original_init(self, config, *args, **kwargs)
- self.config = config
- self.has_gate = has_gate
- self.has_bias = has_bias
- self.is_transposed = is_transposed
- @wraps(original_forward)
- def forward(self, *args, **kwargs):
- experts_forward = experts_interface.get_interface(self.config._experts_implementation, original_forward)
- return experts_forward(self, *args, **kwargs)
- if not hasattr(experts_class, "_apply_gate"):
- experts_class._apply_gate = _default_apply_gate
- experts_class.__init__ = __init__
- experts_class.forward = forward
- return experts_class
- if experts_class is not None:
- return wrapper(experts_class)
- return wrapper
|