{"list":"other","total":93,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"2103.00020","title":"Learning Transferable Visual Models From Natural Language Supervision","created":"2021-02-26","cited_by_count":33744},{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2010.11929","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","created":"2020-10-22","cited_by_count":30186},{"id":"2106.09685","title":"LoRA: Low-Rank Adaptation of Large Language Models","created":"2021-06-17","cited_by_count":14380},{"id":"2302.13971","title":"LLaMA: Open and Efficient Foundation Language Models","created":"2023-02-27","cited_by_count":14132},{"id":"1503.02531","title":"Distilling the Knowledge in a Neural Network","created":"2015-03-09","cited_by_count":10324},{"id":"2505.09388","title":"Qwen3 Technical Report","created":"2025-05-14","cited_by_count":8820},{"id":"2001.08361","title":"Scaling Laws for Neural Language Models","created":"2020-01-23","cited_by_count":6586},{"id":"1607.06450","title":"Layer Normalization","created":"2016-07-21","cited_by_count":5669},{"id":"1804.07461","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","created":"2018-04-20","cited_by_count":4899},{"id":"2102.12092","title":"Zero-Shot Text-to-Image Generation","created":"2021-02-24","cited_by_count":4288},{"id":"1701.06538","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","created":"2017-01-23","cited_by_count":3509},{"id":"2004.05150","title":"Longformer: The Long-Document Transformer","created":"2020-04-10","cited_by_count":3413},{"id":"2403.05530","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","created":"2024-03-08","cited_by_count":3224},{"id":"2101.03961","title":"Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity","created":"2021-01-11","cited_by_count":3073},{"id":"1308.3432","title":"Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computation","created":"2013-08-15","cited_by_count":2079},{"id":"2210.17323","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","created":"2022-10-31","cited_by_count":1919},{"id":"1909.08053","title":"Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism","created":"2019-09-17","cited_by_count":1868},{"id":"2007.14062","title":"Big Bird: Transformers for Longer Sequences","created":"2020-07-28","cited_by_count":1684},{"id":"2006.16668","title":"GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding","created":"2020-06-30","cited_by_count":1631},{"id":"2006.05525","title":"Knowledge Distillation: A Survey","created":"2020-06-09","cited_by_count":1603},{"id":"1904.10509","title":"Generating Long Sequences with Sparse Transformers","created":"2019-04-23","cited_by_count":1546},{"id":"1910.07467","title":"Root Mean Square Layer Normalization","created":"2019-10-16","cited_by_count":1480},{"id":"2305.13245","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","created":"2023-05-22","cited_by_count":1346},{"id":"2405.04434","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","created":"2024-05-07","cited_by_count":1135},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"1606.06031","title":"The LAMBADA dataset: Word prediction requiring a broad discourse context","created":"2016-06-20","cited_by_count":992},{"id":"1905.09418","title":"Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Pruned","created":"2019-05-23","cited_by_count":856},{"id":"1905.10650","title":"Are Sixteen Heads Really Better than One?","created":"2019-05-25","cited_by_count":816},{"id":"1810.02340","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","created":"2018-10-04","cited_by_count":812},{"id":"1802.05751","title":"Image Transformer","created":"2018-02-15","cited_by_count":772},{"id":"1911.02150","title":"Fast Transformer Decoding: One Write-Head is All You Need","created":"2019-11-06","cited_by_count":717},{"id":"1710.01878","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","created":"2017-10-05","cited_by_count":603},{"id":"2102.00554","title":"Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks","created":"2021-01-31","cited_by_count":527},{"id":"2106.08295","title":"A White Paper on Neural Network Quantization","created":"2021-06-15","cited_by_count":472},{"id":"1707.06342","title":"ThiNet: A Filter Level Pruning Method for Deep Neural Network Compression","created":"2017-07-20","cited_by_count":442},{"id":"1802.09568","title":"Shampoo: Preconditioned Stochastic Tensor Optimization","created":"2018-02-26","cited_by_count":426},{"id":"2502.11089","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","created":"2025-02-16","cited_by_count":407},{"id":"2005.07683","title":"Movement Pruning: Adaptive Sparsity by Fine-Tuning","created":"2020-05-15","cited_by_count":403},{"id":"2401.15024","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","created":"2024-01-26","cited_by_count":385},{"id":"1811.00250","title":"Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Acceleration","created":"2018-11-01","cited_by_count":367},{"id":"2306.03078","title":"SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compression","created":"2023-06-05","cited_by_count":367},{"id":"2007.12223","title":"The Lottery Ticket Hypothesis for Pre-trained BERT Networks","created":"2020-07-23","cited_by_count":275},{"id":"2309.12307","title":"LongLoRA: Efficient Fine-tuning of Long-Context Large Language Models","created":"2023-09-21","cited_by_count":244},{"id":"1905.12322","title":"A Study of BFLOAT16 for Deep Learning Training","created":"2019-05-29","cited_by_count":232},{"id":"2012.10630","title":"GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learning","created":"2020-12-19","cited_by_count":226},{"id":"2104.08378","title":"Accelerating Sparse Deep Neural Networks","created":"2021-04-16","cited_by_count":223},{"id":"1607.03250","title":"Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures","created":"2016-07-12","cited_by_count":221},{"id":"2105.06762","title":"DialogSum: A Real-Life Scenario Dialogue Summarization Dataset","created":"2021-05-14","cited_by_count":183},{"id":"2102.04010","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","created":"2021-02-08","cited_by_count":179},{"id":"1909.11957","title":"Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks","created":"2019-09-26","cited_by_count":160},{"id":"2407.14679","title":"Compact Language Models via Pruning and Knowledge Distillation","created":"2024-07-19","cited_by_count":148},{"id":"1602.01407","title":"A Kronecker-factored approximate Fisher matrix for convolution layers","created":"2016-02-03","cited_by_count":141},{"id":"2003.12140","title":"MetNet: A Neural Weather Model for Precipitation Forecasting","created":"2020-03-24","cited_by_count":131},{"id":"1909.08174","title":"Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networks","created":"2019-09-18","cited_by_count":118},{"id":"2203.07259","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","created":"2022-03-14","cited_by_count":115},{"id":"2005.00561","title":"When BERT Plays the Lottery, All Tickets Are Winning","created":"2020-05-01","cited_by_count":114},{"id":"2504.03624","title":"Nemotron-H: A Family of Accurate and Efficient Hybrid Mamba-Transformer Models","created":"2025-04-04","cited_by_count":100},{"id":"1902.09113","title":"Star-Transformer","created":"2019-02-25","cited_by_count":94},{"id":"2012.06908","title":"The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Models","created":"2020-12-12","cited_by_count":91},{"id":"2006.04862","title":"$O(n)$ Connections are Expressive Enough: Universal Approximability of Sparse Transformers","created":"2020-06-08","cited_by_count":83},{"id":"1803.04014","title":"NVIDIA Tensor Core Programmability, Performance & Precision","created":"2018-03-11","cited_by_count":79},{"id":"2010.03533","title":"Gradient Flow in Sparse Neural Networks and How Lottery Tickets Win","created":"2020-10-07","cited_by_count":77},{"id":"1912.11637","title":"Explicit Sparse Transformer: Concentrated Attention Through Explicit Selection","created":"2019-12-25","cited_by_count":62},{"id":"2105.01571","title":"Effective Sparsification of Neural Networks with Global Sparsity Constraint","created":"2021-05-03","cited_by_count":45},{"id":"2404.05567","title":"Dense Training, Sparse Inference: Rethinking Training of Mixture-of-Experts Language Models","created":"2024-04-08","cited_by_count":42},{"id":"2310.09259","title":"QUIK: Towards End-to-End 4-Bit Inference on Generative Large Language Models","created":"2023-10-13","cited_by_count":39},{"id":"2406.01775","title":"OLoRA: Orthonormal Low-Rank Adaptation of Large Language Models","created":"2024-06-03","cited_by_count":39},{"id":"2312.17244","title":"The LLM Surgeon","created":"2023-12-28","cited_by_count":38},{"id":"2402.13499","title":"Benchmarking and Dissecting the Nvidia Hopper GPU Architecture","created":"2024-02-21","cited_by_count":24},{"id":"2502.07864","title":"TransMLA: Multi-Head Latent Attention Is All You Need","created":"2025-02-11","cited_by_count":23},{"id":"2502.05003","title":"QuEST: Stable Training of LLMs with 1-Bit Weights and Activations","created":"2025-02-07","cited_by_count":22},{"id":"2404.01847","title":"Accelerating Transformer Pre-training with 2:4 Sparsity","created":"2024-04-02","cited_by_count":19},{"id":"2209.06979","title":"Efficient Quantized Sparse Matrix Operations on Tensor Cores","created":"2022-09-14","cited_by_count":16},{"id":"2003.09833","title":"SAC: Accelerating and Structuring Self-Attention via Sparse Adaptive Connection","created":"2020-03-22","cited_by_count":13},{"id":"2310.02065","title":"VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Cores","created":"2023-10-03","cited_by_count":13},{"id":"1606.07326","title":"DropNeuron: Simplifying the Structure of Deep Neural Networks","created":"2016-06-23","cited_by_count":11},{"id":"2002.11273","title":"A Systematic Survey of General Sparse Matrix-Matrix Multiplication","created":"2020-02-26","cited_by_count":10},{"id":"2009.14600","title":"Accelerating Sparse Matrix-Matrix Multiplication with GPU Tensor Cores","created":"2020-09-29","cited_by_count":9},{"id":"2203.10991","title":"Minimum Variance Unbiased N:M Sparsity for the Neural Gradients","created":"2022-03-21","cited_by_count":9},{"id":"2212.01076","title":"Are Straight-Through gradients and Soft-Thresholding all you need for Sparse Training?","created":"2022-12-02","cited_by_count":9},{"id":"2503.08223","title":"Will LLMs Scaling Hit the Wall? Breaking Barriers via Distributed Resources on Massive Edge Devices","created":"2025-03-11","cited_by_count":9},{"id":"2408.11551","title":"High Performance Unstructured SpMM Computation Using Tensor Cores","created":"2024-08-21","cited_by_count":8},{"id":"2406.17887","title":"Federated Dynamical Low-Rank Training with Global Loss Convergence Guarantees","created":"2024-06-25","cited_by_count":7},{"id":"2409.09099","title":"S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-training","created":"2024-09-13","cited_by_count":7},{"id":"2503.01253","title":"NM-SpMM: Accelerating Matrix Multiplication Using N:M Sparsity with GPGPU","created":"2025-03-03","cited_by_count":3},{"id":"2206.08301","title":"Deinsum: Practically I/O Optimal Multilinear Algebra","created":"2022-06-16","cited_by_count":2},{"id":"2501.00210","title":"Debunking the CUDA Myth Towards GPU-based AI Systems","created":"2024-12-31","cited_by_count":2},{"id":"2304.07613","title":"STen: Productive and Efficient Sparsity in PyTorch","created":"2023-04-15","cited_by_count":1},{"id":"2402.19364","title":"Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication","created":"2024-02-29","cited_by_count":1}],"next_cursor":null}