{"list":"other","total":69,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"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":"1409.1556","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","created":"2014-09-04","cited_by_count":15364},{"id":"1910.10683","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","created":"2019-10-23","cited_by_count":14599},{"id":"1412.6572","title":"Explaining and Harnessing Adversarial Examples","created":"2014-12-20","cited_by_count":7364},{"id":"1312.6199","title":"Intriguing properties of neural networks","created":"2013-12-21","cited_by_count":5155},{"id":"1706.04599","title":"On Calibration of Modern Neural Networks","created":"2017-06-14","cited_by_count":4960},{"id":"1612.01474","title":"Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles","created":"2016-12-05","cited_by_count":3926},{"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":"1605.07146","title":"Wide Residual Networks","created":"2016-05-23","cited_by_count":3070},{"id":"1903.12261","title":"Benchmarking Neural Network Robustness to Common Corruptions and Perturbations","created":"2019-03-28","cited_by_count":2877},{"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":"2006.16241","title":"The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalization","created":"2020-06-29","cited_by_count":1850},{"id":"1901.08573","title":"Theoretically Principled Trade-off between Robustness and Accuracy","created":"2019-01-24","cited_by_count":1517},{"id":"2006.10029","title":"Big Self-Supervised Models are Strong Semi-Supervised Learners","created":"2020-06-17","cited_by_count":1380},{"id":"1912.06680","title":"Dota 2 with Large Scale Deep Reinforcement Learning","created":"2019-12-13","cited_by_count":1103},{"id":"1805.12152","title":"Robustness May Be at Odds with Accuracy","created":"2018-05-30","cited_by_count":880},{"id":"1810.02340","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","created":"2018-10-04","cited_by_count":812},{"id":"1511.07528","title":"The Limitations of Deep Learning in Adversarial Settings","created":"2015-11-24","cited_by_count":790},{"id":"1811.03962","title":"A Convergence Theory for Deep Learning via Over-Parameterization","created":"2018-11-09","cited_by_count":787},{"id":"1707.06168","title":"Channel Pruning for Accelerating Very Deep Neural Networks","created":"2017-07-19","cited_by_count":702},{"id":"1912.05671","title":"Linear Mode Connectivity and the Lottery Ticket Hypothesis","created":"2019-12-11","cited_by_count":637},{"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":"1712.01312","title":"Learning Sparse Neural Networks through $L_0$ Regularization","created":"2017-12-04","cited_by_count":583},{"id":"1911.11134","title":"Rigging the Lottery: Making All Tickets Winners","created":"2019-11-25","cited_by_count":495},{"id":"2006.05467","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","created":"2020-06-09","cited_by_count":479},{"id":"1902.09574","title":"The State of Sparsity in Deep Neural Networks","created":"2019-02-25","cited_by_count":476},{"id":"2002.07376","title":"Picking Winning Tickets Before Training by Preserving Gradient Flow","created":"2020-02-18","cited_by_count":471},{"id":"2005.07683","title":"Movement Pruning: Adaptive Sparsity by Fine-Tuning","created":"2020-05-15","cited_by_count":403},{"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":"1812.05720","title":"Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problem","created":"2018-12-13","cited_by_count":323},{"id":"2007.12223","title":"The Lottery Ticket Hypothesis for Pre-trained BERT Networks","created":"2020-07-23","cited_by_count":275},{"id":"2003.02389","title":"Comparing Rewinding and Fine-tuning in Neural Network Pruning","created":"2020-03-05","cited_by_count":240},{"id":"1907.04840","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","created":"2019-07-10","cited_by_count":213},{"id":"1802.08760","title":"Sensitivity and Generalization in Neural Networks: an Empirical Study","created":"2018-02-23","cited_by_count":189},{"id":"1902.05967","title":"Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterization","created":"2019-02-15","cited_by_count":189},{"id":"1710.11342","title":"Generating Natural Adversarial Examples","created":"2017-10-31","cited_by_count":183},{"id":"2106.04533","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","created":"2021-06-08","cited_by_count":183},{"id":"2009.08576","title":"Pruning Neural Networks at Initialization: Why are We Missing the Mark?","created":"2020-09-18","cited_by_count":182},{"id":"1909.11957","title":"Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networks","created":"2019-09-26","cited_by_count":160},{"id":"2002.03231","title":"Soft Threshold Weight Reparameterization for Learnable Sparsity","created":"2020-02-08","cited_by_count":151},{"id":"1711.05136","title":"Deep Rewiring: Training very sparse deep networks","created":"2017-11-14","cited_by_count":139},{"id":"2010.07611","title":"Layer-adaptive sparsity for the Magnitude-based Pruning","created":"2020-10-15","cited_by_count":126},{"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":"1903.12561","title":"Adversarial Robustness vs Model Compression, or Both?","created":"2019-03-29","cited_by_count":98},{"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":"2106.10404","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","created":"2021-06-19","cited_by_count":84},{"id":"2101.00063","title":"EarlyBERT: Efficient BERT Training via Early-bird Lottery Tickets","created":"2020-12-31","cited_by_count":79},{"id":"2106.03517","title":"Top-KAST: Top-K Always Sparse Training","created":"2021-06-07","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":"2003.09461","title":"Adversarial Robustness on In- and Out-Distribution Improves Explainability","created":"2020-03-20","cited_by_count":73},{"id":"1810.09619","title":"Sparse DNNs with Improved Adversarial Robustness","created":"2018-10-23","cited_by_count":72},{"id":"1902.03538","title":"Model Compression with Adversarial Robustness: A Unified Optimization Framework","created":"2019-02-10","cited_by_count":71},{"id":"1909.12180","title":"Towards neural networks that provably know when they don't know","created":"2019-09-26","cited_by_count":69},{"id":"2009.11094","title":"Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpot","created":"2020-09-22","cited_by_count":66},{"id":"2006.09081","title":"Progressive Skeletonization: Trimming more fat from a network at initialization","created":"2020-06-16","cited_by_count":64},{"id":"1802.10399","title":"Compressing Neural Networks using the Variational Information Bottleneck","created":"2018-02-28","cited_by_count":59},{"id":"1901.09181","title":"Sparse evolutionary Deep Learning with over one million artificial neurons on commodity hardware","created":"2019-01-26","cited_by_count":48},{"id":"2002.10025","title":"Triple Wins: Boosting Accuracy, Robustness and Efficiency Together by Enabling Input-Adaptive Inference","created":"2020-02-24","cited_by_count":45},{"id":"1604.05978","title":"A topological insight into restricted Boltzmann machines","created":"2016-04-20","cited_by_count":32},{"id":"2006.08228","title":"Finding trainable sparse networks through Neural Tangent Transfer","created":"2020-06-15","cited_by_count":28},{"id":"2006.00896","title":"Pruning via Iterative Ranking of Sensitivity Statistics","created":"2020-06-01","cited_by_count":26},{"id":"1511.05077","title":"Diversity Networks: Neural Network Compression Using Determinantal Point Processes","created":"2015-11-16","cited_by_count":25},{"id":"1711.08757","title":"Deep Expander Networks: Efficient Deep Networks from Graph Theory","created":"2017-11-23","cited_by_count":23},{"id":"2006.14085","title":"Topological Insights into Sparse Neural Networks","created":"2020-06-24","cited_by_count":22},{"id":"2102.01670","title":"Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimization","created":"2021-02-02","cited_by_count":22},{"id":"1905.00416","title":"RadiX-Net: Structured Sparse Matrices for Deep Neural Networks","created":"2019-04-30","cited_by_count":12}],"next_cursor":null}