AI RESEARCH
LaplacianFormer:Rethinking Linear Attention with Laplacian Kernel
arXiv CS.CV
•
ArXi:2604.20368v1 Announce Type: new The quadratic complexity of softmax attention presents a major obstacle for scaling Transformers to high-resolution vision tasks. Existing linear attention variants often replace the softmax with Gaussian kernels to reduce complexity, but such approximations lack theoretical grounding and tend to oversuppress mid-range token interactions. We propose LaplacianFormer, a Transformer variant that employs a Laplacian kernel as a principled alternative to softmax, motivated by empirical observations and theoretical analysis.