{"list":"other","total":52,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"2103.00020","title":"Learning Transferable Visual Models From Natural Language Supervision","created":"2021-02-26","cited_by_count":33744},{"id":"1706.06083","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","created":"2017-06-19","cited_by_count":6415},{"id":"1903.12261","title":"Benchmarking Neural Network Robustness to Common Corruptions and Perturbations","created":"2019-03-28","cited_by_count":2877},{"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":"1810.02340","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","created":"2018-10-04","cited_by_count":812},{"id":"1812.05159","title":"An Empirical Study of Example Forgetting during Deep Neural Network Learning","created":"2018-12-12","cited_by_count":678},{"id":"2010.04592","title":"Contrastive Learning with Hard Negative Samples","created":"2020-10-09","cited_by_count":628},{"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":"2107.07075","title":"Deep Learning on a Data Diet: Finding Important Examples Early in Training","created":"2021-07-15","cited_by_count":533},{"id":"2002.11569","title":"Overfitting in adversarially robust deep learning","created":"2020-02-26","cited_by_count":506},{"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":"1801.00553","title":"Threat of Adversarial Attacks on Deep Learning in Computer Vision: A Survey","created":"2018-01-02","cited_by_count":460},{"id":"2009.10795","title":"Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamics","created":"2020-09-22","cited_by_count":425},{"id":"2305.16264","title":"Scaling Data-Constrained Language Models","created":"2023-05-25","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":"1803.00942","title":"Not All Samples Are Created Equal: Deep Learning with Importance Sampling","created":"2018-03-02","cited_by_count":328},{"id":"2005.04345","title":"An Investigation of Why Overparameterization Exacerbates Spurious Correlations","created":"2020-05-09","cited_by_count":310},{"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":"2206.07137","title":"Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learnt","created":"2022-06-14","cited_by_count":236},{"id":"1907.04840","title":"Sparse Networks from Scratch: Faster Training without Losing Performance","created":"2019-07-10","cited_by_count":213},{"id":"2111.05328","title":"Data Augmentation Can Improve Robustness","created":"2021-11-09","cited_by_count":194},{"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":"2102.04010","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","created":"2021-02-08","cited_by_count":179},{"id":"2210.11369","title":"On Feature Learning in the Presence of Spurious Correlations","created":"2022-10-20","cited_by_count":145},{"id":"2106.09647","title":"Deep Learning Through the Lens of Example Difficulty","created":"2021-06-17","cited_by_count":141},{"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":"1905.05934","title":"EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasis","created":"2019-05-15","cited_by_count":98},{"id":"2008.11600","title":"Estimating Example Difficulty Using Variance of Gradients","created":"2020-08-26","cited_by_count":97},{"id":"2106.03517","title":"Top-KAST: Top-K Always Sparse Training","created":"2021-06-07","cited_by_count":79},{"id":"2110.14032","title":"MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge","created":"2021-10-26","cited_by_count":79},{"id":"2306.05175","title":"Large-scale Dataset Pruning with Dynamic Uncertainty","created":"2023-06-08","cited_by_count":63},{"id":"2104.04448","title":"Relating Adversarially Robust Generalization to Flat Minima","created":"2021-04-09","cited_by_count":57},{"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":"2202.09844","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","created":"2022-02-20","cited_by_count":41},{"id":"1604.05978","title":"A topological insight into restricted Boltzmann machines","created":"2016-04-20","cited_by_count":32},{"id":"2210.13738","title":"Pruning's Effect on Generalization Through the Lens of Training and Regularization","created":"2022-10-25","cited_by_count":31},{"id":"2102.07861","title":"Low Curvature Activations Reduce Overfitting in Adversarial Training","created":"2021-02-15","cited_by_count":29},{"id":"2303.02141","title":"Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!","created":"2023-03-03","cited_by_count":27},{"id":"2206.08684","title":"Sparse Double Descent: Where Network Pruning Aggravates Overfitting","created":"2022-06-17","cited_by_count":26},{"id":"2212.09840","title":"Dynamic Sparse Network for Time Series Classification: Learning What to \"see''","created":"2022-12-19","cited_by_count":22},{"id":"2102.01732","title":"Truly Sparse Neural Networks at Scale","created":"2021-02-02","cited_by_count":16},{"id":"2312.04727","title":"E2ENet: Dynamic Sparse Feature Fusion for Accurate and Efficient 3D Medical Image Segmentation","created":"2023-12-07","cited_by_count":16},{"id":"2209.09658","title":"Lazy vs hasty: linearization in deep networks impacts learning schedule based on example difficulty","created":"2022-09-19","cited_by_count":5},{"id":"2406.18373","title":"Dynamic Data Pruning for Automatic Speech Recognition","created":"2024-06-26","cited_by_count":4},{"id":"2103.07674","title":"Efficient Sparse Artificial Neural Networks","created":"2021-03-13","cited_by_count":3},{"id":"2304.03486","title":"Can we learn better with hard samples?","created":"2023-04-07","cited_by_count":3}],"next_cursor":null}