{"total":16,"rows":[{"id":"2505.23666","title":"LoLA: Low-Rank Linear Attention With Sparse Caching","created":"2025-05-29","cited_by_count":12,"area":null},{"id":"2603.26380","title":"Switch Attention: Towards Dynamic and Fine-grained Hybrid Transformers","created":"2026-03-27","cited_by_count":4,"area":null},{"id":"2605.18753","title":"DashAttention: Differentiable and Adaptive Sparse Hierarchical Attention","created":"2026-05-18","cited_by_count":4,"area":null},{"id":"2511.05313","title":"Controllably Efficient Language Models","created":"2025-11-07","cited_by_count":3,"area":null},{"id":"2604.15180","title":"AdaSplash-2: Faster Differentiable Sparse Attention","created":"2026-04-16","cited_by_count":3,"area":null},{"id":"2602.18145","title":"Detecting Contextual Hallucinations in LLMs with Frequency-Aware Attention","created":"2026-02-20","cited_by_count":2,"area":null},{"id":"2604.12798","title":"VFA: Relieving Vector Operations in Flash Attention with Global Maximum Pre-computation","created":"2026-04-14","cited_by_count":2,"area":null},{"id":"2607.11976","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","created":"2026-07-13","cited_by_count":2,"area":null},{"id":"2511.00819","title":"Optimizing Native Sparse Attention with Latent Attention and Local Global Alternating Strategies","created":"2025-11-02","cited_by_count":1,"area":null},{"id":"2606.25342","title":"Lifelong In-Context Learning with Transformers Requires Parametric Forms of Attention","created":"2026-06-24","cited_by_count":1,"area":null},{"id":"2607.24555","title":"LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decoding","created":"2026-07-27","cited_by_count":1,"area":null},{"id":"2609.01925","title":"CRISP: Cliff-awaRe Input-adaptive Sparse Prefilling with Structural-Mass-Motivated Routing","created":"2026-09-01","cited_by_count":0,"area":null},{"id":"2609.19113","title":"Playing log(N)-Questions over Wikipedia Abstracts: How Per-Round Errors Compound Under Information Asymmetry","created":"2026-09-16","cited_by_count":0,"area":null},{"id":"2609.22884","title":"Block-Sparse Attention with Semantic-Geometric Decoupled Routing","created":"2026-09-19","cited_by_count":0,"area":null},{"id":"2609.34292","title":"Pre-registered tests of solid-state-physics-inspired LLM compression: a cluster-level negative result at small-language-model scale","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.04424","title":"On the Trade-off Between Information Loss and Generalization in Sparse Attention","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}