菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-03-04
📄 Abstract - Data-Aware Random Feature Kernel for Transformers

Transformers excel across domains, yet their quadratic attention complexity poses a barrier to scaling. Random-feature attention, as in Performers, can reduce this cost to linear in the sequence length by approximating the softmax kernel with positive random features drawn from an isotropic distribution. In pretrained models, however, queries and keys are typically anisotropic. This induces high Monte Carlo variance in isotropic sampling schemes unless one retrains the model or uses a large feature budget. Importance sampling can address this by adapting the sampling distribution to the input geometry, but complex data-dependent proposal distributions are often intractable. We show that by data aligning the softmax kernel, we obtain an attention mechanism which can both admit a tractable minimal-variance proposal distribution for importance sampling, and exhibits better training stability. Motivated by this finding, we introduce DARKFormer, a Data-Aware Random-feature Kernel transformer that features a data-aligned kernel geometry. DARKFormer learns the random-projection covariance, efficiently realizing an importance-sampled positive random-feature estimator for its data-aligned kernel. Empirically, DARKFormer narrows the performance gap with exact softmax attention, particularly in finetuning regimes where pretrained representations are anisotropic. By combining random-feature efficiency with data-aware kernels, DARKFormer advances kernel-based attention in resource-constrained settings.

顶级标签: natural language processing model training theory
详细标签: transformers attention mechanism kernel methods importance sampling efficient training 或 搜索:

用于Transformer的数据感知随机特征核 / Data-Aware Random Feature Kernel for Transformers


1️⃣ 一句话总结

这篇论文提出了一种名为DARKFormer的新型Transformer模型,它通过一种数据感知的随机特征核来高效近似注意力计算,在保持线性计算复杂度的同时,显著提升了模型在预训练后微调场景下的性能表现。

源自 arXiv: 2603.04127