File size: 21,245 Bytes
7180154 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 | # Copyright 2024 DeepMind Technologies Limited.
#
# 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.
"""Transformer with either dense or sparse attention.
The sparse attention implemented here is for nodes to attend only to themselves
and their neighbours on the graph). It assumes that the adjacency matrix has a
banded structure, and is implemented with dense operations computing with only
the diagonal, super diagonal, and subdiagonal blocks of the tri-block-diagonal
attention matrix.
The basic model structure of the transformer and some functions were adapted
from xlm's transformer_simple.py.
"""
import dataclasses
import logging
from typing import Any, Callable, Literal, Optional, Tuple
from . import mlp as mlp_builder
from . import sparse_transformer_utils as utils
import haiku as hk
import jax
from jax.experimental.pallas.ops.tpu import splash_attention
import jax.numpy as jnp
import numpy as np
import scipy as sp
@dataclasses.dataclass
class _ModelConfig:
"""Transformer config."""
# Depth, or num transformer blocks. One 'layer' is attn + ffw.
num_layers: int
# Primary width, the number of channels on the carrier path.
d_model: int
# Number of heads for self-attention.
num_heads: int
# Mask block size.
mask_block_size: int
# Attention type - 'mha' or 'triblockdiag_mha'
attention_type: str = 'triblockdiag_mha'
block_q: Optional[int] = None
block_kv: Optional[int] = None
block_kv_compute: Optional[int] = None
block_q_dkv: Optional[int] = None
block_kv_dkv: Optional[int] = None
block_kv_dkv_compute: Optional[int] = None
# mask type if splash attention being used - 'full' or 'lazy'
mask_type: Optional[str] = 'full'
# Number of channels per-head for self-attn QK computation.
key_size: Optional[int] = None
# Number of channels per-head for self-attn V computation.
value_size: Optional[int] = None
# Activation to use, any in jax.nn.
activation: str = 'gelu'
# Init scale for ffw layers (divided by num_layers)
ffw_winit_mult: float = 2.0
# Init scale for final ffw layer (divided by depth)
ffw_winit_final_mult: float = 2.0
# Init scale for mha proj (divided by depth).
attn_winit_mult: float = 2.0
# Init scale for mha w (divided by depth).
attn_winit_final_mult: float = 2.0
# Number of hidden units in the MLP blocks. Defaults to 4 * d_model.
ffw_hidden: Optional[int] = None
def __post_init__(self):
if self.ffw_hidden is None:
self.ffw_hidden = 4 * self.d_model
# Compute key_size and value_size from d_model // num_heads.
if self.key_size is None:
if self.d_model % self.num_heads != 0:
raise ValueError('num_heads has to divide d_model exactly')
self.key_size = self.d_model // self.num_heads
if self.value_size is None:
if self.d_model % self.num_heads != 0:
raise ValueError('num_heads has to divide d_model exactly')
self.value_size = self.d_model // self.num_heads
def get_mask_block_size(mask: sp.sparse.csr_matrix) -> int:
"""Get blocksize of the adjacency matrix (attn mask) for the permuted mesh."""
# sub-diagonal bandwidth
lbandwidth = (
np.arange(mask.shape[0]) - (mask != 0).argmax(axis=0) + 1).max()
# super-diagonal bandwidth
ubandwidth = (
(mask.shape[0]-1) - np.argmax(mask[::-1,:] != 0, axis=0
) - np.arange(mask.shape[0]) + 1).max()
block_size = np.maximum(lbandwidth, ubandwidth)
return block_size
def ffw(x: jnp.ndarray, cfg: _ModelConfig) -> jnp.ndarray:
"""Feed-forward block."""
ffw_winit = hk.initializers.VarianceScaling(cfg.ffw_winit_mult /
cfg.num_layers)
ffw_winit_final = hk.initializers.VarianceScaling(cfg.ffw_winit_final_mult /
cfg.num_layers)
x = hk.Linear(cfg.ffw_hidden, name='ffw_up', w_init=ffw_winit)(x)
x = getattr(jax.nn, cfg.activation)(x)
return hk.Linear(cfg.d_model, name='ffw_down', w_init=ffw_winit_final)(x)
def triblockdiag_softmax(logits: Tuple[jnp.ndarray, jnp.ndarray, jnp.ndarray]
) -> Tuple[jnp.ndarray, jnp.ndarray, jnp.ndarray]:
"""Softmax given the diag, upper diag, and lower diag logit blocks."""
logits_d, logits_u, logits_l = logits
m = jnp.max(jnp.stack([
jax.lax.stop_gradient(logits_d.max(-1, keepdims=True)),
jax.lax.stop_gradient(logits_u.max(-1, keepdims=True)),
jax.lax.stop_gradient(logits_l.max(-1, keepdims=True))]), axis=0)
unnormalized_d = jnp.exp(logits_d - m)
unnormalized_u = jnp.exp(logits_u - m)
unnormalized_l = jnp.exp(logits_l - m)
denom = (
unnormalized_d.sum(-1, keepdims=True)
+ unnormalized_u.sum(-1, keepdims=True)
+ unnormalized_l.sum(-1, keepdims=True)
)
logits_d = unnormalized_d / denom
logits_u = unnormalized_u / denom
logits_l = unnormalized_l / denom
return (logits_d, logits_u, logits_l)
def triblockdiag_mha(q_input: jnp.ndarray, kv_input: jnp.ndarray,
mask: jnp.ndarray, cfg: _ModelConfig,
) -> jnp.ndarray:
"""Triblockdiag multihead attention."""
# q_inputs, kv_input: (batch, num_blocks, block_size, num_heads, d_model)
q = multihead_linear(q_input, 'q', cfg)
k = multihead_linear(kv_input, 'k', cfg)
v = multihead_linear(kv_input, 'v', cfg)
k = jnp.pad(k, ((0, 0), (1, 1), (0, 0), (0, 0), (0, 0)))
v = jnp.pad(v, ((0, 0), (1, 1), (0, 0), (0, 0), (0, 0)))
def qk_prod(queries, keys):
return jnp.einsum('bnqhd,bnkhd->bnhqk', queries, keys)
# q shape is (batch, num_blocks, block_size, num_heads, qk_dim)
# k shape is (batch, num_blocks + 2, block_size, num_heads, qk_dim)
logits_d = qk_prod(q, k[:, 1:-1, ...]) * cfg.key_size**-0.5
logits_u = qk_prod(q, k[:, 2:, ...]) * cfg.key_size**-0.5
logits_l = qk_prod(q, k[:, :-2, ...]) * cfg.key_size**-0.5
# apply mask
logits_d = jnp.where(mask[:, 0, ...], logits_d, -1e30)
logits_u = jnp.where(mask[:, 1, ...], logits_u, -1e30)
logits_l = jnp.where(mask[:, 2, ...], logits_l, -1e30)
logits_d, logits_u, logits_l = utils.wrap_fn_for_upcast_downcast(
(logits_d, logits_u, logits_l),
triblockdiag_softmax
)
def av_prod(attn_weights, values):
return jnp.einsum('bnhqk,bnkhd->bnqhd', attn_weights, values)
out_d = av_prod(logits_d, v[:, 1:-1, ...])
out_u = av_prod(logits_u, v[:, 2:, ...])
out_l = av_prod(logits_l, v[:, :-2, ...])
# x shape is (batch, num_blocks, block_size, num_heads, d_model)
x = out_d + out_u + out_l
x = jnp.reshape(x, x.shape[:-2] + (cfg.num_heads * cfg.value_size,))
attn_winit_final = hk.initializers.VarianceScaling(
cfg.attn_winit_final_mult / cfg.num_layers)
x = hk.Linear(cfg.d_model, name='mha_final', w_init=attn_winit_final)(x)
return x
def multihead_linear(
x: jnp.ndarray, qkv: str, cfg: _ModelConfig
) -> jnp.ndarray:
"""Linearly project `x` to have `head_size` dimensions per head."""
head_size = cfg.value_size if qkv == 'v' else cfg.key_size
attn_winit = hk.initializers.VarianceScaling(cfg.attn_winit_mult /
cfg.num_layers)
out = hk.Linear(
cfg.num_heads * head_size,
w_init=attn_winit,
name='mha_proj_' + qkv,
with_bias=False,
)(x)
shape = out.shape[:-1] + (cfg.num_heads, head_size)
return jnp.reshape(out, shape)
def mha(q_input: jnp.ndarray, kv_input: jnp.ndarray,
mask: jnp.ndarray, cfg: _ModelConfig,
normalize_logits: bool = True,
) -> jnp.ndarray:
"""Multi head attention."""
q = multihead_linear(q_input, 'q', cfg)
k = multihead_linear(kv_input, 'k', cfg)
v = multihead_linear(kv_input, 'v', cfg)
logits = jnp.einsum('bthd, bThd->bhtT', q, k)
if normalize_logits:
logits *= cfg.key_size**-0.5
if mask is not None:
def apply_mask(m, l):
return jnp.where(m, l, -1e30)
logits = jax.vmap(jax.vmap(
apply_mask, in_axes=[None, 0]), in_axes=[None, 0])(mask, logits)
# Wrap softmax weights for upcasting & downcasting in case of BF16 activations
weights = utils.wrap_fn_for_upcast_downcast(logits, jax.nn.softmax)
# Note: our mask never has all 0 rows, since nodes always have self edges,
# so no need to account for that possibility explicitly.
x = jnp.einsum('bhtT,bThd->bthd', weights, v)
x = jnp.reshape(x, x.shape[:-2] + (cfg.num_heads * cfg.value_size,))
attn_winit_final = hk.initializers.VarianceScaling(
cfg.attn_winit_final_mult / cfg.num_layers)
x = hk.Linear(cfg.d_model, name='mha_final', w_init=attn_winit_final)(x)
return x
def _make_splash_mha(
mask,
mask_type: str,
num_heads: int,
block_q: Optional[int] = None,
block_kv: Optional[int] = None,
block_kv_compute: Optional[int] = None,
block_q_dkv: Optional[int] = None,
block_kv_dkv: Optional[int] = None,
block_kv_dkv_compute: Optional[int] = None,
tanh_soft_cap: Optional[float] = None,
) -> Callable[..., jnp.ndarray]:
"""Construct attention kernel."""
if mask_type == 'full':
mask = np.broadcast_to(mask[None],
(num_heads, *mask.shape)).astype(np.bool_)
block_sizes = splash_attention.BlockSizes(
block_q=block_q,
block_kv=block_kv,
block_kv_compute=block_kv_compute,
block_q_dkv=block_q_dkv,
block_kv_dkv=block_kv_dkv,
block_kv_dkv_compute=block_kv_dkv_compute,
use_fused_bwd_kernel=True,
)
attn = splash_attention.make_splash_mha(mask, block_sizes=block_sizes,
head_shards=1,
q_seq_shards=1,
attn_logits_soft_cap=tanh_soft_cap,
)
return attn
def splash_mha(q_input: jnp.ndarray, kv_input: jnp.ndarray,
mask: jnp.ndarray | splash_attention.splash_attention_mask.Mask,
cfg: _ModelConfig,
tanh_soft_cap: Optional[float] = None,
normalize_q: bool = True) -> jnp.ndarray:
"""Splash attention."""
q = multihead_linear(q_input, 'q', cfg)
k = multihead_linear(kv_input, 'k', cfg)
v = multihead_linear(kv_input, 'v', cfg)
_, _, num_heads, head_dim = q.shape
assert head_dim % 128 == 0 # splash attention kernel requires this
attn = _make_splash_mha(
mask=mask,
mask_type=cfg.mask_type,
num_heads=num_heads,
block_q=cfg.block_q,
block_kv=cfg.block_kv,
block_kv_compute=cfg.block_kv_compute,
block_q_dkv=cfg.block_q_dkv,
block_kv_dkv=cfg.block_kv_dkv,
block_kv_dkv_compute=cfg.block_kv_dkv_compute,
tanh_soft_cap=tanh_soft_cap,
)
attn = jax.vmap(attn) # Add batch axis.
if normalize_q:
q *= cfg.key_size**-0.5
# (batch, nodes, num_heads, head_dim) -> (batch, num_heads, nodes, head_dim)
reformat = lambda y: y.transpose(0, 2, 1, 3)
x = attn(q=reformat(q), k=reformat(k), v=reformat(v))
x = x.transpose(0, 2, 1, 3)
x = jnp.reshape(x, x.shape[:-2] + (cfg.num_heads * cfg.value_size,))
attn_winit_final = hk.initializers.VarianceScaling(
cfg.attn_winit_final_mult / cfg.num_layers)
x = hk.Linear(cfg.d_model, name='mha_final', w_init=attn_winit_final)(x)
return x
def layernorm(
x: jnp.ndarray, create_scale: bool, create_offset: bool
) -> jnp.ndarray:
return hk.LayerNorm(
axis=-1, create_scale=create_scale, create_offset=create_offset,
name='norm')(x)
def mask_block_diags(mask: sp.sparse.csr_matrix,
num_padding_nodes: int,
block_size: int) -> jnp.ndarray:
"""Pad and reshape mask diag, super-siag and sub-diag blocks."""
# add zero padding to mask
mask_padding_rows = sp.sparse.csr_matrix(
(num_padding_nodes, mask.shape[1]), dtype=jnp.int32)
mask = sp.sparse.vstack([mask, mask_padding_rows])
mask_padding_cols = sp.sparse.csr_matrix(
(mask.shape[0], num_padding_nodes), dtype=jnp.int32)
mask = sp.sparse.hstack([mask, mask_padding_cols])
assert (mask.shape[-1] % block_size) == 0
mask_daig_blocks = jnp.stack(
[jnp.array(mask[i * block_size : (i + 1) * block_size,
i * block_size : (i + 1) * block_size,
].toarray())
for i in range(mask.shape[0] // block_size)])
mask_upper_diag_blocks = jnp.stack(
[jnp.array(mask[i * block_size : (i + 1) * block_size,
(i + 1) * block_size : (i + 2) * block_size,
].toarray())
for i in range(mask.shape[0] // block_size - 1)]
+ [jnp.zeros((block_size, block_size), dtype=mask.dtype)])
mask_lower_diag_blocks = jnp.stack(
[jnp.zeros((block_size, block_size), dtype=mask.dtype)]
+ [jnp.array(mask[(i + 1) * block_size : (i + 2) * block_size,
i * block_size : (i + 1) * block_size,
].toarray())
for i in range(mask.shape[0] // block_size - 1)])
mask = jnp.stack(
[mask_daig_blocks, mask_upper_diag_blocks, mask_lower_diag_blocks]
)
mask = jnp.expand_dims(mask, (0, 3))
return mask
def _pad_mask(mask, num_padding_nodes: Tuple[int, int]) -> jnp.ndarray:
q_padding, kv_padding = num_padding_nodes
mask_padding_rows = sp.sparse.csr_matrix(
(q_padding, mask.shape[1]), dtype=np.bool_)
mask = sp.sparse.vstack([mask, mask_padding_rows])
mask_padding_cols = sp.sparse.csr_matrix(
(mask.shape[0], kv_padding), dtype=np.bool_)
mask = sp.sparse.hstack([mask, mask_padding_cols])
return mask
class WeatherMeshMask(splash_attention.splash_attention_mask.Mask):
"""Lazy local mask, prevent attention to embeddings outside window.
Attributes:
mask:
"""
_shape: Tuple[int, int]
mask: sp.sparse.spmatrix
def __init__(
self,
mask: Any
):
self._shape = mask.shape
self.mask = mask
@property
def shape(self) -> Tuple[int, int]:
return self._shape
def __getitem__(self, idx) -> np.ndarray:
if len(idx) != 2:
raise NotImplementedError(f'Unsupported slice: {idx}')
q_slice, kv_slice = idx
if not isinstance(q_slice, slice) or not isinstance(kv_slice, slice):
raise NotImplementedError(f'Unsupported slice: {idx}')
return self.mask[q_slice, kv_slice].toarray()
class Block(hk.Module):
"""Transformer block (mha and ffw)."""
def __init__(self, cfg, mask, num_nodes, num_padding_nodes, name=None):
super().__init__(name=name)
self._cfg = cfg
self.mask = mask
self.num_nodes = num_nodes
self.num_padding_nodes = num_padding_nodes
def __call__(self, x, global_norm_conditioning=jax.Array):
# x shape is (batch, num_nodes, feature_dim)
def attn(x):
if self._cfg.attention_type == 'triblockdiag_mha':
# We pad -> reshape -> compute attn -> reshape -> select at each block
# so as to avoid complications involved in making the norm layers and
# ffw blocks account for the padding. However, this might be decreasing
# efficiency.
# Add padding so that number of nodes is divisible into blocks
x = jnp.pad(x, ((0, 0), (0, self.num_padding_nodes), (0, 0)))
x = x.reshape(x.shape[0],
x.shape[1]//self._cfg.mask_block_size,
self._cfg.mask_block_size,
x.shape[-1])
x = triblockdiag_mha(x, x, mask=self.mask, cfg=self._cfg)
x = x.reshape(x.shape[0],
self.num_nodes + self.num_padding_nodes,
x.shape[-1])
return x[:,:self.num_nodes, :]
elif self._cfg.attention_type == 'mha':
return mha(x, x, mask=self.mask, cfg=self._cfg)
elif self._cfg.attention_type == 'splash_mha':
# We pad -> reshape -> compute attn -> reshape -> select at each block
# so as to avoid complications involved in making the norm layers and
# ffw blocks account for the padding. However, this might be decreasing
# efficiency.
# Add padding so that number of nodes is divisible by block sizes.
x = jnp.pad(x, ((0, 0), (0, self.num_padding_nodes[0]), (0, 0)))
x = splash_mha(x, x, mask=self.mask, cfg=self._cfg)
return x[:,:self.num_nodes, :]
else:
raise NotImplementedError()
def norm_conditioning_layer(x):
return mlp_builder.LinearNormConditioning(
name=self.name+'_norm_conditioning')(
x,
norm_conditioning=jnp.expand_dims(global_norm_conditioning, 1)
)
x = x + attn(
norm_conditioning_layer(
layernorm(x, create_scale=False, create_offset=False)
)
)
x = x + ffw(
norm_conditioning_layer(
layernorm(x, create_scale=False, create_offset=False)
),
self._cfg,
)
return x
class Transformer(hk.Module):
"""Main transformer module that processes embeddings.
All but the very first and very last layer of a 'classic' Transformer:
Receives already embedded inputs instead of discrete tokens.
Outputs an embedding for each 'node'/'position' rather than logits.
"""
def __init__(self,
adj_mat: sp.sparse.csr_matrix,
attention_k_hop: int,
attention_type: Literal['splash_mha', 'triblockdiag_mha', 'mha'],
mask_type: Literal['full', 'lazy'],
num_heads=1,
name=None,
block_q: Optional[int] = None,
block_kv: Optional[int] = None,
block_kv_compute: Optional[int] = None,
block_q_dkv: Optional[int] = None,
block_kv_dkv: Optional[int] = None,
block_kv_dkv_compute: Optional[int] = None,
**kwargs):
super().__init__(name=name)
# Construct mask and deduce block size.
mask = adj_mat ** attention_k_hop
mask_block_size = get_mask_block_size(mask)
logging.info('mask_block_size: %s.', mask_block_size)
if attention_type == 'triblockdiag_mha':
# we will stack the nodes in blocks of 'block_size' nodes, so we need to
# pad the input such that (num_nodes + num_padding_nodes) % block_size = 0
self.num_padding_nodes = int(np.ceil(
mask.shape[0]/mask_block_size)*mask_block_size
- mask.shape[0])
self.mask = mask_block_diags(
mask, self.num_padding_nodes, mask_block_size)
elif attention_type == 'splash_mha':
max_q_block_size = np.maximum(block_q, block_q_dkv)
max_kv_block_size = np.maximum(block_kv, block_kv_dkv)
q_padding = int(np.ceil(
mask.shape[0]/max_q_block_size)*max_q_block_size - mask.shape[0])
kv_padding = int(np.ceil(
mask.shape[1]/max_kv_block_size)*max_kv_block_size - mask.shape[1])
self.num_padding_nodes = (q_padding, kv_padding)
mask = _pad_mask(mask, self.num_padding_nodes)
if mask_type == 'lazy':
splash_mask = [
WeatherMeshMask(mask)
for _ in range(num_heads)
]
self.mask = splash_attention.splash_attention_mask.MultiHeadMask(
splash_mask)
elif mask_type == 'full':
self.mask = mask.toarray() # pytype: disable=attribute-error
elif attention_type == 'mha':
self.mask = jnp.array(mask.toarray())
self.num_padding_nodes = 0
else:
raise ValueError(
'Unsupported attention type: %s' % attention_type
)
# Construct config for use within class.
self._cfg = _ModelConfig(
mask_block_size=mask_block_size,
attention_type=attention_type,
mask_type=mask_type,
num_heads=num_heads,
block_q=block_q,
block_kv=block_kv,
block_kv_compute=block_kv_compute,
block_q_dkv=block_q_dkv,
block_kv_dkv=block_kv_dkv,
block_kv_dkv_compute=block_kv_dkv_compute,
**kwargs)
def __call__(self, node_features, global_norm_conditioning: jax.Array):
# node_features expected to have shape (batch, num_nodes, d)
x = node_features
for i_layer in range(self._cfg.num_layers):
x = Block(cfg=self._cfg, mask=self.mask,
num_nodes=node_features.shape[1],
num_padding_nodes=self.num_padding_nodes,
name='block_%02d' % i_layer
)(x, global_norm_conditioning=global_norm_conditioning)
def norm_conditioning_layer(x):
return mlp_builder.LinearNormConditioning(
name=self.name+'_final_norm_conditioning')(
x,
norm_conditioning=jnp.expand_dims(global_norm_conditioning, 1)
)
x = norm_conditioning_layer(
layernorm(x, create_scale=False, create_offset=False)
)
return x
|