arXiv (All)
open access
Learnable Low-Rank Polynomial Sketch for Effective Linear Attention
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 linea
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- EFQ-Softmax: Exp-Free Quantization for Softmax#996547
- On-Policy Attention Linearization#1115903
- Copy the Same, Distill the Difference: Initializing Linear Vision Transformers#1130392
- Copy the Same, Distill the Difference: Initializing Linear Vision Transformers#1108747
- The Approximation Rank of Softmax Attention: Sharp Geometric Laws and Robust Interaction Dimension#784904
Record · ID 1324820
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive