{"list":"other","total":51,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1810.04805","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","created":"2018-10-11","cited_by_count":40399},{"id":"1907.11692","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","created":"2019-07-26","cited_by_count":13372},{"id":"1910.01108","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","created":"2019-10-02","cited_by_count":4307},{"id":"1803.03635","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","created":"2018-03-09","cited_by_count":2262},{"id":"1710.03740","title":"Mixed Precision Training","created":"2017-10-10","cited_by_count":1156},{"id":"1604.06174","title":"Training Deep Nets with Sublinear Memory Cost","created":"2016-04-21","cited_by_count":848},{"id":"1912.05671","title":"Linear Mode Connectivity and the Lottery Ticket Hypothesis","created":"2019-12-11","cited_by_count":637},{"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":"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":"2104.08378","title":"Accelerating Sparse Deep Neural Networks","created":"2021-04-16","cited_by_count":223},{"id":"1907.04840","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","created":"2019-07-10","cited_by_count":213},{"id":"2002.00585","title":"Proving the Lottery Ticket Hypothesis: Pruning is All You Need","created":"2020-02-03","cited_by_count":201},{"id":"2006.10901","title":"Sparse GPU Kernels for Deep Learning","created":"2020-06-18","cited_by_count":141},{"id":"2006.07253","title":"Dynamic Model Pruning with Feedback","created":"2020-06-12","cited_by_count":125},{"id":"2102.02887","title":"Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training","created":"2021-02-04","cited_by_count":110},{"id":"1811.01727","title":"AttentionXML: Label Tree-based Attention-Aware Deep Model for High-Performance Extreme Multi-Label Text Classification","created":"2018-11-01","cited_by_count":102},{"id":"1506.08839","title":"Inferring Networks of Substitutable and Complementary Products","created":"2015-06-29","cited_by_count":92},{"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":"2010.03533","title":"Gradient Flow in Sparse Neural Networks and How Lottery Tickets Win","created":"2020-10-07","cited_by_count":77},{"id":"1810.09619","title":"Sparse DNNs with Improved Adversarial Robustness","created":"2018-10-23","cited_by_count":72},{"id":"1609.02521","title":"DiSMEC - Distributed Sparse Machines for Extreme Multi-label Classification","created":"2016-09-08","cited_by_count":71},{"id":"2110.00685","title":"Fast Multi-Resolution Transformer Fine-tuning for Extreme Multi-label Text Classification","created":"2021-10-01","cited_by_count":67},{"id":"2106.09129","title":"A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustness","created":"2021-06-16","cited_by_count":62},{"id":"2310.01382","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","created":"2023-10-02","cited_by_count":62},{"id":"2101.03305","title":"LightXML: Transformer with Dynamic Negative Sampling for High-Performance Extreme Multi-label Text Classification","created":"2021-01-09","cited_by_count":61},{"id":"2206.10369","title":"The State of Sparse Training in Deep Reinforcement Learning","created":"2022-06-17","cited_by_count":61},{"id":"1711.02017","title":"NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigm","created":"2017-11-06","cited_by_count":60},{"id":"2106.14568","title":"Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsity","created":"2021-06-28","cited_by_count":44},{"id":"2108.00261","title":"ECLARE: Extreme Classification with Label Graph Correlations","created":"2021-07-31","cited_by_count":38},{"id":"2305.02299","title":"Dynamic Sparse Training with Structured Sparsity","created":"2023-05-03","cited_by_count":38},{"id":"1910.13830","title":"Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products","created":"2019-10-28","cited_by_count":36},{"id":"2207.04452","title":"NGAME: Negative Mining-aware Mini-batching for Extreme Classification","created":"2022-07-10","cited_by_count":32},{"id":"2205.15043","title":"RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratch","created":"2022-05-30","cited_by_count":30},{"id":"2303.02141","title":"Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!","created":"2023-03-03","cited_by_count":27},{"id":"2302.02596","title":"Ten Lessons We Have Learned in the New \"Sparseland\": A Short Handbook for Sparse Neural Network Researchers","created":"2023-02-06","cited_by_count":25},{"id":"2402.04744","title":"Progressive Gradient Flow for Robust N:M Sparsity Training in Transformers","created":"2024-02-07","cited_by_count":18},{"id":"2306.12230","title":"Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training","created":"2023-06-21","cited_by_count":17},{"id":"2102.01732","title":"Truly Sparse Neural Networks at Scale","created":"2021-02-02","cited_by_count":16},{"id":"2207.13186","title":"On Missing Labels, Long-tails and Propensities in Extreme Multi-label Classification","created":"2022-07-26","cited_by_count":15},{"id":"2304.14082","title":"JaxPruner: A concise library for sparsity research","created":"2023-04-27","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":"2108.06277","title":"Towards Structured Dynamic Sparse Pre-Training of BERT","created":"2021-08-13","cited_by_count":12},{"id":"2211.00640","title":"CascadeXML: Rethinking Transformers for End-to-end Multi-resolution Training in Extreme Multi-label Classification","created":"2022-10-29","cited_by_count":12},{"id":"2102.07655","title":"Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset","created":"2021-02-12","cited_by_count":9},{"id":"2109.07319","title":"InceptionXML: A Lightweight Framework with Synchronized Negative Sampling for Short Text Extreme Classification","created":"2021-09-13","cited_by_count":8},{"id":"2306.03725","title":"Towards Memory-Efficient Training for Extremely Large Output Spaces -- Learning with 500k Labels on a Single Commodity GPU","created":"2023-06-06","cited_by_count":6},{"id":"2311.05081","title":"Generalized test utilities for long-tail performance in extreme multi-label classification","created":"2023-11-09","cited_by_count":6},{"id":"2109.11282","title":"Unbiased Loss Functions for Multilabel Classification with Missing Labels","created":"2021-09-23","cited_by_count":5},{"id":"2312.13547","title":"How to Prune Your Language Model: Recovering Accuracy on the \"Sparsity May Cry'' Benchmark","created":"2023-12-21","cited_by_count":2}],"next_cursor":null}