{"list":"other","total":58,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"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":"2307.09288","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","created":"2023-07-18","cited_by_count":13028},{"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":"2205.01068","title":"OPT: Open Pre-trained Transformer Language Models","created":"2022-05-02","cited_by_count":3512},{"id":"2004.05150","title":"Longformer: The Long-Document Transformer","created":"2020-04-10","cited_by_count":3413},{"id":"2206.07682","title":"Emergent Abilities of Large Language Models","created":"2022-06-15","cited_by_count":2512},{"id":"1510.00149","title":"Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding","created":"2015-10-01","cited_by_count":2329},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"id":"1506.02626","title":"Learning both Weights and Connections for Efficient Neural Networks","created":"2015-06-08","cited_by_count":2031},{"id":"2001.04451","title":"Reformer: The Efficient Transformer","created":"2020-01-13","cited_by_count":1668},{"id":"1904.10509","title":"Generating Long Sequences with Sparse Transformers","created":"2019-04-23","cited_by_count":1546},{"id":"2111.09883","title":"Swin Transformer V2: Scaling Up Capacity and Resolution","created":"2021-11-18","cited_by_count":1228},{"id":"1608.08710","title":"Pruning Filters for Efficient ConvNets","created":"2016-08-31","cited_by_count":1143},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"1810.02340","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","created":"2018-10-04","cited_by_count":812},{"id":"2009.06732","title":"Efficient Transformers: A Survey","created":"2020-09-14","cited_by_count":790},{"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":"1810.05270","title":"Rethinking the Value of Network Pruning","created":"2018-10-11","cited_by_count":599},{"id":"1608.03665","title":"Learning Structured Sparsity in Deep Neural Networks","created":"2016-08-12","cited_by_count":541},{"id":"1906.10771","title":"Importance Estimation for Neural Network Pruning","created":"2019-06-25","cited_by_count":541},{"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":"1911.11134","title":"Rigging the Lottery: Making All Tickets Winners","created":"2019-11-25","cited_by_count":495},{"id":"1902.09574","title":"The State of Sparsity in Deep Neural Networks","created":"2019-02-25","cited_by_count":476},{"id":"1909.05840","title":"Q-BERT: Hessian Based Ultra Low Precision Quantization of BERT","created":"2019-09-12","cited_by_count":359},{"id":"1707.04780","title":"Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Science","created":"2017-07-15","cited_by_count":328},{"id":"1910.06188","title":"Q8BERT: Quantized 8Bit BERT","created":"2019-10-14","cited_by_count":300},{"id":"2101.01321","title":"I-BERT: Integer-only BERT Quantization","created":"2021-01-05","cited_by_count":255},{"id":"2003.02389","title":"Comparing Rewinding and Fine-tuning in Neural Network Pruning","created":"2020-03-05","cited_by_count":240},{"id":"1608.04493","title":"Dynamic Network Surgery for Efficient DNNs","created":"2016-08-16","cited_by_count":233},{"id":"1907.04840","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","created":"2019-07-10","cited_by_count":213},{"id":"2009.08576","title":"Pruning Neural Networks at Initialization: Why are We Missing the Mark?","created":"2020-09-18","cited_by_count":182},{"id":"2102.04010","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","created":"2021-02-08","cited_by_count":179},{"id":"2002.03231","title":"Soft Threshold Weight Reparameterization for Learnable Sparsity","created":"2020-02-08","cited_by_count":151},{"id":"2009.12812","title":"TernaryBERT: Distillation-aware Ultra-low Bit BERT","created":"2020-09-27","cited_by_count":148},{"id":"1711.05136","title":"Deep Rewiring: Training very sparse deep networks","created":"2017-11-14","cited_by_count":139},{"id":"1708.04485","title":"SCNN: An Accelerator for Compressed-sparse Convolutional Neural Networks","created":"2017-05-23","cited_by_count":135},{"id":"1912.08881","title":"Pruning by Explaining: A Novel Criterion for Deep Neural Network Pruning","created":"2019-12-18","cited_by_count":89},{"id":"1911.09723","title":"Fast Sparse ConvNets","created":"2019-11-21","cited_by_count":86},{"id":"2111.12763","title":"Sparse is Enough in Scaling Transformers","created":"2021-11-24","cited_by_count":86},{"id":"2102.02888","title":"1-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speed","created":"2021-02-04","cited_by_count":75},{"id":"1906.10732","title":"The Difficulty of Training Sparse Neural Networks","created":"2019-06-25","cited_by_count":62},{"id":"1906.00586","title":"Discovering Neural Wirings","created":"2019-06-03","cited_by_count":56},{"id":"1711.02782","title":"Block-Sparse Recurrent Neural Networks","created":"2017-11-08","cited_by_count":39},{"id":"1907.02124","title":"Non-Structured DNN Weight Pruning -- Is It Beneficial in Any Platform?","created":"2019-07-03","cited_by_count":32},{"id":"2206.06662","title":"Learning Best Combination for Efficient N:M Sparsity","created":"2022-06-14","cited_by_count":32},{"id":"1811.00206","title":"Balanced Sparsity for Efficient DNN Inference on GPU","created":"2018-11-01","cited_by_count":27},{"id":"2302.01172","title":"STEP: Learning N:M Structured Sparsity Masks from Scratch with Precondition","created":"2023-02-02","cited_by_count":26},{"id":"2104.06069","title":"1-bit LAMB: Communication Efficient Large-Scale Large-Batch Training with LAMB's Convergence Speed","created":"2021-04-13","cited_by_count":24},{"id":"1804.09862","title":"Accelerator-Aware Pruning for Convolutional Neural Networks","created":"2018-04-26","cited_by_count":22},{"id":"2001.08514","title":"Filter Sketch for Network Pruning","created":"2020-01-23","cited_by_count":20},{"id":"2107.07983","title":"S2TA: Exploiting Structured Sparsity for Energy-Efficient Mobile CNN Acceleration","created":"2021-07-16","cited_by_count":19},{"id":"2202.06009","title":"Maximizing Communication Efficiency for Large-scale Training via 0/1 Adam","created":"2022-02-12","cited_by_count":15},{"id":"2011.10520","title":"Rethinking Weight Decay For Efficient Neural Network Pruning","created":"2020-11-20","cited_by_count":10},{"id":"2302.08687","title":"VEGETA: Vertically-Integrated Extensions for Sparse/Dense GEMM Tile Acceleration on CPUs","created":"2023-02-17","cited_by_count":9},{"id":"2001.03253","title":"Campfire: Compressible, Regularization-Free, Structured Sparse Training for Hardware Accelerators","created":"2020-01-09","cited_by_count":7},{"id":"2103.10452","title":"Extending Sparse Tensor Accelerators to Support Multiple Compression Formats","created":"2021-03-18","cited_by_count":6},{"id":"2201.08916","title":"Enabling Flexibility for Sparse Tensor Acceleration via Heterogeneity","created":"2022-01-21","cited_by_count":4}],"next_cursor":null}