arXiv — cs.AI preprintsInternational15 October 2026
Learnable Low-Rank Polynomial Sketch for Effective Linear Attention
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.14219v1 Announce Type: cross Abstract: Softmax attention in Transformers suffers from quadratic complexity in sequence length, making it impractical for long-context applications. Linear attention alleviates this issue by replacing the exponential kernel with alternative functions that enable linear-time computation. Among existing linear attention approaches, recent studies have shown that polynomial kernels are particularly effective, as they exhibit sparse and spiky behavior similar to softmax attention, which emphasizes large dot products while suppressing irrelevant interaction
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Artificiality's First Exam: An LLM-Referenced C-test for Supraintelligence15 October 2026
- The Silent Failures in Agentic Data Science15 October 2026
- ClawLoop: Self-Improving Agents via Harness-Native Training Loop15 October 2026
- Correction Training for Diffusion Models15 October 2026
- Long-Horizon-Terminal-Bench 2.0: Automating Diverse Task Construction and Measuring Sustained Agent Progress15 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.