{"total":97,"rows":[{"id":"2508.21058","title":"Mixture of Contexts for Long Video Generation","created":"2025-08-28","cited_by_count":95,"area":null},{"id":"2506.07900","title":"MiniCPM4: Ultra-Efficient LLMs on End Devices","created":"2025-06-09","cited_by_count":52,"area":null},{"id":"2505.19488","title":"Understanding Transformer from the Perspective of Associative Memory","created":"2025-05-26","cited_by_count":34,"area":null},{"id":"2509.24663","title":"InfLLM-V2: Dense-Sparse Switchable Attention for Seamless Short-to-Long Adaptation","created":"2025-09-29","cited_by_count":32,"area":null},{"id":"2509.07120","title":"Block-Sparse Global Attention for Efficient Multi-View Geometry Transformers","created":"2025-09-08","cited_by_count":23,"area":null},{"id":"2507.19595","title":"Efficient Attention Mechanisms for Large Language Models: A Survey","created":"2025-07-25","cited_by_count":22,"area":null},{"id":"2506.02475","title":"Comba: Improving Bilinear RNNs with Closed-loop Control","created":"2025-06-03","cited_by_count":15,"area":null},{"id":"2602.24281","title":"Memory Caching: RNNs with Growing Memory","created":"2026-02-27","cited_by_count":15,"area":null},{"id":"2603.28458","title":"HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attention","created":"2026-03-30","cited_by_count":12,"area":null},{"id":"2607.02980","title":"Hierarchical Sparse Attention Done Right: Toward Infinite Context Modeling","created":"2026-07-03","cited_by_count":12,"area":null},{"id":"2603.08055","title":"Speed3R: Sparse Feed-forward 3D Reconstruction Models","created":"2026-03-09","cited_by_count":10,"area":null},{"id":"2605.12496","title":"CausalCine: Real-Time Autoregressive Generation for Multi-Shot Video Narratives","created":"2026-05-12","cited_by_count":10,"area":null},{"id":"2504.16795","title":"Hardware-aligned Hierarchical Sparse Attention for Efficient Long-term Memory Access","created":"2025-04-23","cited_by_count":9,"area":null},{"id":"2509.04903","title":"ACE-RL: Adaptive Constraint-Enhanced Reward for Long-form Generation Reinforcement Learning","created":"2025-09-05","cited_by_count":9,"area":null},{"id":"2509.24745","title":"ProxyAttn: Guided Sparse Attention via Representative Heads","created":"2025-09-29","cited_by_count":9,"area":null},{"id":"2603.06199","title":"FlashPrefill: Instantaneous Pattern Discovery and Thresholding for Ultra-Fast Long-Context Prefilling","created":"2026-03-06","cited_by_count":9,"area":null},{"id":"2508.18224","title":"FSA: An Alternative Efficient Implementation of Native Sparse Attention Kernel","created":"2025-08-25","cited_by_count":7,"area":null},{"id":"2605.07363","title":"MISA: Mixture of Indexer Sparse Attention for Long-Context LLM Inference","created":"2026-05-08","cited_by_count":7,"area":null},{"id":"2511.20102","title":"SSA: Sparse Sparse Attention by Aligning Full and Sparse Attention Outputs in Feature Space","created":"2025-11-25","cited_by_count":6,"area":null},{"id":"2504.06949","title":"Adaptive Computation Pruning for the Forgetting Transformer","created":"2025-04-09","cited_by_count":5,"area":null},{"id":"2506.11111","title":"Evaluating and Improving Robustness in Large Language Models: A Survey and Future Directions","created":"2025-06-08","cited_by_count":5,"area":null},{"id":"2507.03285","title":"Memory Mosaics at scale","created":"2025-07-04","cited_by_count":5,"area":null},{"id":"2510.05862","title":"Revisiting Long-context Modeling from Context Denoising Perspective","created":"2025-10-07","cited_by_count":5,"area":null},{"id":"2510.21270","title":"Sparser Block-Sparse Attention via Token Permutation","created":"2025-10-24","cited_by_count":5,"area":null},{"id":"2601.17367","title":"Elastic Attention: Test-time Adaptive Sparsity Ratios for Efficient Transformers","created":"2026-01-24","cited_by_count":5,"area":null},{"id":"2606.04511","title":"SparDA: Sparse Decoupled Attention for Efficient Long-Context LLM Inference","created":"2026-06-03","cited_by_count":5,"area":null},{"id":"2507.03153","title":"HGCA: Hybrid GPU-CPU Attention for Long Context LLM Inference","created":"2025-07-03","cited_by_count":4,"area":null},{"id":"2508.16703","title":"ShadowNPU: System and Algorithm Co-design for NPU-Centric On-Device LLM Inference","created":"2025-08-22","cited_by_count":4,"area":null},{"id":"2510.01450","title":"Local Linear Attention: An Optimal Interpolation of Linear and Softmax Attention For Test-Time Regression","created":"2025-10-01","cited_by_count":4,"area":null},{"id":"2510.18413","title":"Adamas: Hadamard Sparse Attention for Efficient Long-Context Inference","created":"2025-10-21","cited_by_count":4,"area":null},{"id":"2512.07647","title":"A Mathematical Theory of Top-$k$ Sparse Attention via Total Variation Distance","created":"2025-12-08","cited_by_count":4,"area":null},{"id":"2512.17452","title":"KV Admission: Learning What to Write for Efficient Long-Context LLM Inference","created":"2025-12-19","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":"2607.25380","title":"Memory for Large Language Models","created":"2026-07-28","cited_by_count":4,"area":null},{"id":"2505.24179","title":"SALE : Low-bit Estimation for Efficient Sparse Attention in Long-context LLM Prefilling","created":"2025-05-30","cited_by_count":3,"area":null},{"id":"2511.23319","title":"Every Token Counts: Generalizing 16M Ultra-Long Context in Large Language Models","created":"2025-11-28","cited_by_count":3,"area":null},{"id":"2602.03681","title":"Neural Attention Search Linear: Towards Adaptive Token-Level Hybrid Attention Models","created":"2026-02-03","cited_by_count":3,"area":null},{"id":"2602.13215","title":"When to Think Fast and Slow? AMOR: Adaptive Entropy Gate for Hybrid Models","created":"2026-01-22","cited_by_count":3,"area":null},{"id":"2505.11922","title":"Enhancing Complex Instruction Following for Large Language Models with Mixture-of-Contexts Fine-tuning","created":"2025-05-17","cited_by_count":2,"area":null},{"id":"2603.29494","title":"VecAttention: Vector-wise Sparse Attention for Accelerating Long Context Inference","created":"2026-03-31","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":"2604.22575","title":"SpikingBrain2.0: Brain-Inspired Foundation Models for Efficient Long-Context and Cross-Platform Inference","created":"2026-04-24","cited_by_count":2,"area":null},{"id":"2607.01538","title":"Can Language Models Actually Retrieve In-Context? Drowning in Documents at Million Token Scale","created":"2026-07-01","cited_by_count":2,"area":null},{"id":"2608.01662","title":"LongCat Sparse Attention: Taming the Lightning via Streaming-aware Hierarchical Cross-Layer Indexing","created":"2026-08-03","cited_by_count":2,"area":null},{"id":"2608.12435","title":"MARCH: Scaling Recurrent Memory with Content-Routed State Anchors","created":"2026-08-12","cited_by_count":2,"area":null},{"id":"2609.13141","title":"SAS: Simple Attention Sparsification via End-to-End Optimization of Context Ranking","created":"2026-09-11","cited_by_count":2,"area":null},{"id":"2506.11305","title":"Don't Pay Attention","created":"2025-06-12","cited_by_count":1,"area":null},{"id":"2506.15704","title":"Learn from the Past: Fast Sparse Indexing for Large Language Model Decoding","created":"2025-05-30","cited_by_count":1,"area":null},{"id":"2508.18850","title":"ClusterFusion: Expanding Operator Fusion Scope for LLM Inference via Cluster-Level Collective Primitive","created":"2025-08-26","cited_by_count":1,"area":null},{"id":"2509.10406","title":"Multipole Semantic Attention: A Fast Approximation of Softmax Attention for Pretraining","created":"2025-09-12","cited_by_count":1,"area":null},{"id":"2510.18830","title":"MTraining: Distributed Dynamic Sparse Attention for Efficient Ultra-Long Context Training","created":"2025-10-21","cited_by_count":1,"area":null},{"id":"2511.06010","title":"MoSKA: Mixture of Shared KV Attention for Efficient Long-Sequence LLM Inference","created":"2025-11-08","cited_by_count":1,"area":null},{"id":"2512.09723","title":"Mixture of Lookup Key-Value Experts","created":"2025-12-10","cited_by_count":1,"area":null},{"id":"2512.14082","title":"A Unified Sparse Attention via Multi-Granularity Compression","created":"2025-12-16","cited_by_count":1,"area":null},{"id":"2601.05647","title":"Transformer Is Inherently a Causal Learner","created":"2026-01-09","cited_by_count":1,"area":null},{"id":"2602.01763","title":"A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention","created":"2026-02-02","cited_by_count":1,"area":null},{"id":"2604.03260","title":"Why Attend to Everything? Focus is the Key","created":"2026-03-12","cited_by_count":1,"area":null},{"id":"2605.29157","title":"Parallax: Parameterized Local Linear Attention for Language Modeling","created":"2026-05-27","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":"2607.25291","title":"CoSA: Accelerating Long-Context Inference via Proxy-Kernel Co-Designed Sparse Attention","created":"2026-07-28","cited_by_count":1,"area":null},{"id":"2609.00092","title":"Safin-1: Safety from Within through Memory-Native State Evolution","created":"2026-08-31","cited_by_count":1,"area":null},{"id":"2510.02361","title":"ChunkLLM: A Lightweight Pluggable Framework for Accelerating LLMs Inference","created":"2025-09-28","cited_by_count":0,"area":null},{"id":"2601.17334","title":"Power-based Partial Attention: Bridging Linear-Complexity and Full Attention","created":"2026-01-24","cited_by_count":0,"area":null},{"id":"2601.18401","title":"Superlinear Multi-Step Attention","created":"2026-01-26","cited_by_count":0,"area":null},{"id":"2602.08237","title":"Document Reconstruction Unlocks Scalable Long-Context RLVR","created":"2026-02-09","cited_by_count":0,"area":null},{"id":"2602.09038","title":"Scaling GraphLLM with Bilevel-Optimized Sparse Querying","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2603.18572","title":"UEPS: Robust and Efficient MRI Reconstruction","created":"2026-03-19","cited_by_count":0,"area":null},{"id":"2604.00754","title":"Stochastic Attention: Connectome-Inspired Randomized Routing for Expressive Linear-Time Attention","created":"2026-04-01","cited_by_count":0,"area":null},{"id":"2604.08077","title":"AdaSpark: Adaptive Sparsity for Efficient Long-Video Understanding","created":"2026-04-09","cited_by_count":0,"area":null},{"id":"2604.13847","title":"SparseBalance: Load-Balanced Long Context Training with Dynamic Sparse Attention","created":"2026-04-15","cited_by_count":0,"area":null},{"id":"2604.24820","title":"Salca: A Sparsity-Aware Hardware Accelerator for Efficient Long-Context Attention Decoding","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2605.06554","title":"Long Context Pre-Training with Lighthouse Attention","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.16839","title":"CompactAttention: Accelerating Chunked Prefill with Block-Union KV Selection","created":"2026-05-16","cited_by_count":0,"area":null},{"id":"2605.28384","title":"Meta-Attention: Bayesian Per-Token Routing for Efficient Transformer Inference","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.21075","title":"FiLM-Coordinated Dual-Branch Transformer for Global-Local Dependency Modeling in Language Modeling","created":"2026-06-19","cited_by_count":0,"area":null},{"id":"2607.07724","title":"Uncertainty-gated selection for block-sparse attention","created":"2026-07-04","cited_by_count":0,"area":null},{"id":"2608.00434","title":"AdaMTP: An Adaptive Training Paradigm for Multi-Token Prediction","created":"2026-08-01","cited_by_count":0,"area":null},{"id":"2608.05780","title":"Evidence-Driven Dynamic Visual Selector for Efficient Long Video Understanding","created":"2026-08-06","cited_by_count":0,"area":null},{"id":"2608.26965","title":"ClusterAttention: A training-free speedup of bidirectional attention","created":"2026-08-27","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.24202","title":"Opinion Leader Dynamics: How Sparse Attention Shapes Token Clustering","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2609.25802","title":"Latest Exact Match Attention","created":"2026-09-22","cited_by_count":0,"area":null},{"id":"2609.31093","title":"Block Sparse Attention with Log-Linear Complexity","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.31261","title":"MoSAR: Mixture of Semantic Attention Regimes for Learning Adaptive and Approximable Attention Geometries","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.32704","title":"CoWindow Attention: Full Causal Coverage Is a Collective Property","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.32712","title":"MassAlloc Attention: Let Attention Allocate Its Own Compute","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2609.32882","title":"Improving Video Sparse Attention with Fine-grained Router and Sparse Rebasing","created":"2026-09-26","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":"2609.38832","title":"Scaling Parameter and Context in Attention: Native Sparse Attention from Mixture-of-Head","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2609.39661","title":"The Evolution of Attention in Large Language Models: Mechanisms, Trade-offs, and Emerging Trends","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.01230","title":"HHR: Hierarchical Hash Retrieval for Efficient LLM Generation","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.04635","title":"LatentIndex: Cross-Layer Sharing with Layer-Specific Selection for Sparse Attention","created":"2026-10-03","cited_by_count":0,"area":null},{"id":"2610.05416","title":"Prism: Dynamic Sparse Attention for Native 2K Joint Video-Audio Generation Model Training","created":"2026-10-04","cited_by_count":0,"area":null},{"id":"2610.13990","title":"DoSA: Dots Sparse Attention","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2610.17191","title":"FreeSolo: Linear-time Sparse Attention with Zero-Shot Length Extrapolation","created":"2026-10-12","cited_by_count":0,"area":null},{"id":"2610.17901","title":"FlashMask-3: Efficient and Expressive Mask-Aware Distributed Attention","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}