Hyperbolic Relative Bias (HyPE) in Transformers

• Hyperbolic Relative Bias (HyPE) is a relative positional encoding method that uses hyperbolic functions to dynamically inject biases into Transformer attention mechanisms.
• It integrates auxiliary hyperbolic embeddings into queries and keys, ensuring memory efficiency and compatibility with advanced kernels like FlashAttention-2.
• Its analytic formulation allows seamless long-context extrapolation, approximating linear biases such as ALiBi and generalizing beyond pretraining lengths.

Hyperbolic Relative Bias (HyPE) is a relative positional encoding scheme for Transformer-based architectures that leverages hyperbolic functions to encode token relationships, enabling efficient context-length extrapolation and seamless integration with advanced attention mechanisms. Unlike traditional methods for sequential order imposition—such as absolute positional embeddings or dense relative-bias masks—HyPE introduces a fully differentiable, memory-efficient formulation where the positional bias is indirectly injected into the attention computation using hyperbolic embeddings. HyPE is compatible with state-of-the-art fused attention kernels, supports gradient propagation for all learnable parameters, and analytically approximates linear biases such as the ALiBi method, facilitating extrapolation well beyond pretraining context lengths (Angelotti, 2023).

1. Mathematical Formulation of Hyperbolic Bias

HyPE constructs a relative-position bias matrix $B$ parameterized by the sequence length $L$ and the hidden dimension $d$ of each attention head. The matrix is defined by

$$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$

with $\mu \in \mathbb{R}$ as the slope and $\tau > 0$ as the amplitude. The hyperbolic identity

$2\sinh(x) = e^{x} - e^{-x}$

implies

$$B_{i,j} = -\frac{\tau}{2}(e^{\mu(j-i)} - e^{-\mu(j-i)}).$$

This bias function translates relative token distances $\Delta = j-i$ into soft positional biases, which can be tuned by the $\mu$ and $L$0 hyperparameters.

2. Integration into Transformer Attention

HyPE modifies the attention computation pipeline by introducing two hyperbolic embedding matrices per head,

$L$1

with entries

$L$2

for $L$3. These embeddings are concatenated as additional channels to the usual query and key matrices,

$L$4

The attention logits are then

$L$5

where the bias $L$6 arises via hyperbolic identity. The final output is computed as

$L$7

and the explicit bias matrix $L$8 is never materialized, ensuring efficient computation.

3. Computational Complexity and Memory Footprint

Standard relative-position bias approaches incur $L$9 memory cost for storing a dense bias mask. HyPE requires only two $d$0 side-channel matrices per attention head ($d$1 scalars), or $d$2 overall for $d$3 heads. The runtime involves a single $d$4 matrix multiplication per head and the usual $d$5 cost, with no additional $d$6 operations. The overall time complexity remains $d$7 per head, and memory footprint for embeddings is $d$8, matching standard Transformer attention efficiency.

4. Compatibility with FlashAttention-2 and Backpropagation

HyPE's bias injection via concatenation of auxiliary channels into $d$9 and $$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$0 renders it fully compatible with FlashAttention-2's fused, IO-aware attention kernels. The two added channels are managed as ordinary feature dimensions and all gradients propagate through $$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$1 and $$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$2 under standard automatic differentiation. Any learnable parameters, such as per-head $$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$3 or amplitude $$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$4, are updated by the established backward pass without need for special handling or code modifications at the kernel level.

5. Hyperparameter Selection and ALiBi Approximation

The ALiBi method employs a linear bias $$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$5. For HyPE, the Taylor expansion

$$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$6

implies

$$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$7

Setting $$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$8 and $$B = [B_{i,j}]_{0 \leq i,j < L} \quad \text{where} \quad B_{i,j} = -\tau\,\sinh(\mu\,(j-i))$$9 yields

$\mu \in \mathbb{R}$0

so the cubic remainder is negligible for $\mu \in \mathbb{R}$1 if $\mu \in \mathbb{R}$2, where $\mu \in \mathbb{R}$3 is the context length for extrapolation. Promoting $\mu \in \mathbb{R}$4, or using per-head $\mu \in \mathbb{R}$5, enables fine control over overall bias magnitude during training.

6. Generalization Beyond Pretraining Lengths

HyPE supports input-length extrapolation due to its analytic design. With $\mu \in \mathbb{R}$6, the hyperbolic bias grows almost linearly up to $\mu \in \mathbb{R}$7 before saturating, preventing divergence. As HyPE relies on no fixed-size sinusoidal tables or learned absolute embeddings, it generalizes without modification to arbitrary sequence lengths at inference. The bound on approximation error to linear bias, derived from Taylor expansion, further supports its theoretical robustness. While large-scale empirical results are deferred, HyPE offers a compact, differentiable framework for positional bias injection, achieving extrapolation benefits analogous to ALiBi, trainability, and compatibility with advanced attention mechanisms at minimal memory and computational cost (Angelotti, 2023).