{"total":48,"rows":[{"id":"2203.08913","title":"Memorizing Transformers","created":"2022-03-16","cited_by_count":226,"area":null},{"id":"2303.08810","title":"BiFormer: Vision Transformer with Bi-Level Routing Attention","created":"2023-03-15","cited_by_count":151,"area":null},{"id":"2210.06313","title":"The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformers","created":"2022-10-12","cited_by_count":122,"area":null},{"id":"2406.02542","title":"Loki: Low-rank Keys for Efficient Sparse Attention","created":"2024-06-04","cited_by_count":89,"area":null},{"id":"2202.04557","title":"Universal Hopfield Networks: A General Framework for Single-Shot Associative Memory Models","created":"2022-02-09","cited_by_count":55,"area":null},{"id":"2406.16747","title":"Sparser is Faster and Less is More: Efficient Sparse Attention for Long-Range Transformers","created":"2024-06-24","cited_by_count":52,"area":null},{"id":"2310.13897","title":"Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages","created":"2023-10-21","cited_by_count":49,"area":null},{"id":"2412.16545","title":"Attention Entropy is a Key Factor: An Analysis of Parallel Context Encoding with Full-attention-based Pre-trained Language Models","created":"2024-12-21","cited_by_count":26,"area":null},{"id":"2506.16640","title":"Long-Context Generalization with Sparse Attention","created":"2025-06-19","cited_by_count":21,"area":null},{"id":"2408.03717","title":"Pick of the Bunch: Detecting Infrared Small Targets Beyond Hit-Miss Trade-Offs via Selective Rank-Aware Attention","created":"2024-08-07","cited_by_count":17,"area":null},{"id":"2404.03900","title":"Nonparametric Modern Hopfield Models","created":"2024-04-05","cited_by_count":16,"area":null},{"id":"2110.08323","title":"On Learning the Transformer Kernel","created":"2021-10-15","cited_by_count":15,"area":null},{"id":"2502.12082","title":"AdaSplash: Adaptive Sparse Flash Attention","created":"2025-02-17","cited_by_count":12,"area":null},{"id":"2208.09015","title":"Treeformer: Dense Gradient Trees for Efficient Attention Computation","created":"2022-08-18","cited_by_count":9,"area":null},{"id":"2501.14577","title":"ZETA: Leveraging Z-order Curves for Efficient Top-k Attention","created":"2025-01-24","cited_by_count":9,"area":null},{"id":"2405.02842","title":"IceFormer: Accelerated Inference with Long-Sequence Transformers on CPUs","created":"2024-05-05","cited_by_count":8,"area":null},{"id":"2209.10901","title":"Pretraining the Vision Transformer using self-supervised methods for vision based Deep Reinforcement Learning","created":"2022-09-22","cited_by_count":5,"area":null},{"id":"2405.02350","title":"What makes Models Compositional? A Theoretical View: With Supplement","created":"2024-05-02","cited_by_count":5,"area":null},{"id":"2406.01189","title":"MultiMax: Sparse and Multi-Modal Attention Learning","created":"2024-06-03","cited_by_count":5,"area":null},{"id":"2502.06766","title":"Exploiting Sparsity for Long Context Inference: Million Token Contexts on Commodity GPUs","created":"2025-02-10","cited_by_count":5,"area":null},{"id":"2506.06644","title":"Spark Transformer: Reactivating Sparsity in FFN and Attention","created":"2025-06-07","cited_by_count":5,"area":null},{"id":"2310.00229","title":"Consciousness-Inspired Spatio-Temporal Abstractions for Better Generalization in Reinforcement Learning","created":"2023-09-30","cited_by_count":4,"area":null},{"id":"2407.07179","title":"TrackFormers: In Search of Transformer-Based Particle Tracking for the High-Luminosity LHC Era","created":"2024-07-09","cited_by_count":4,"area":null},{"id":"2512.05865","title":"Intrinsically Interpretable Attention via Sparse Post-Training","created":"2025-12-05","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":"2406.19391","title":"Fibottention: Inceptive Visual Representation Learning with Diverse Attention Across Heads","created":"2024-06-27","cited_by_count":3,"area":null},{"id":"2410.05462","title":"LevAttention: Time, Space, and Streaming Efficient Algorithm for Heavy Attentions","created":"2024-10-07","cited_by_count":3,"area":null},{"id":"2602.06283","title":"SOCKET: SOft Collision Kernel EsTimator for Sparse Attention","created":"2026-02-06","cited_by_count":3,"area":null},{"id":"2309.04875","title":"Approximating ReLU on a Reduced Ring for Efficient MPC-based Private Inference","created":"2023-09-09","cited_by_count":2,"area":null},{"id":"2502.08363","title":"Top-Theta Attention: Sparsifying Transformers by Compensated Thresholding","created":"2025-02-12","cited_by_count":2,"area":null},{"id":"2512.07011","title":"Block Sparse Flash Attention","created":"2025-12-07","cited_by_count":2,"area":null},{"id":"2601.22766","title":"Sparse Attention as Compact Kernel Regression","created":"2026-01-30","cited_by_count":2,"area":null},{"id":"2602.07160","title":"Free Energy Mixer","created":"2026-02-06","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":"2406.02332","title":"Extended Mind Transformers","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2411.04013","title":"$k$NN Attention Demystified: A Theoretical Exploration for Scalable Transformers","created":"2024-11-06","cited_by_count":1,"area":null},{"id":"2506.05300","title":"Power Law Guided Dynamic Sifting for Efficient Attention","created":"2025-06-05","cited_by_count":1,"area":null},{"id":"2508.06016","title":"Crisp Attention: Regularizing Transformers via Structured Sparsity","created":"2025-08-08","cited_by_count":1,"area":null},{"id":"2602.14536","title":"Explainable Token-level Noise Filtering for LLM Fine-tuning Datasets","created":"2026-02-16","cited_by_count":1,"area":null},{"id":"2604.05438","title":"Residual-Mass Accounting for Partial-KV Decoding","created":"2026-04-07","cited_by_count":1,"area":null},{"id":"2605.13465","title":"Z-Order Transformer for Feed-Forward Gaussian Splatting","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2506.08139","title":"SoftStep: Learning Sparse Similarity Powers Deep Neighbor-Based Regression","created":"2025-06-09","cited_by_count":0,"area":null},{"id":"2506.19125","title":"Transformer Circuits Can Realize Clustering Algorithms","created":"2025-06-23","cited_by_count":0,"area":null},{"id":"2602.00777","title":"HyLRA: Hybrid Layer Reuse Attention for Efficient Long-Context Inference","created":"2026-01-31","cited_by_count":0,"area":null},{"id":"2604.03815","title":"k-Maximum Inner Product Attention for Graph Transformers and the Expressive Power of GraphGPS","created":"2026-04-04","cited_by_count":0,"area":null},{"id":"2609.24417","title":"ARM: Attention with Routed-Memory for Learnable Sparse Control","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2609.35629","title":"SANTA++: Sampling Attention through Representative Keys","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.04753","title":"More Value per Key: Asymmetric Sparse Attention for Faster LLM Decoding","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}