{"total":21,"rows":[{"id":"2202.02643","title":"The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training","created":"2022-02-05","cited_by_count":85,"area":null},{"id":"2209.00099","title":"Efficient Methods for Natural Language Processing: A Survey","created":"2022-08-31","cited_by_count":78,"area":null},{"id":"2201.05125","title":"GradMax: Growing Neural Networks using Gradient Information","created":"2022-01-13","cited_by_count":66,"area":null},{"id":"2106.11872","title":"Randomness In Neural Network Training: Characterizing The Impact of Tooling","created":"2021-06-22","cited_by_count":59,"area":null},{"id":"2110.03036","title":"The Low-Resource Double Bind: An Empirical Study of Pruning for Low-Resource Machine Translation","created":"2021-10-06","cited_by_count":47,"area":null},{"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,"area":null},{"id":"2210.06640","title":"Compute-Efficient Deep Learning: Algorithmic Trends and Opportunities","created":"2022-10-13","cited_by_count":38,"area":null},{"id":"2206.12755","title":"Training Your Sparse Neural Network Better with Any Mask","created":"2022-06-26","cited_by_count":26,"area":null},{"id":"2207.08629","title":"Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks","created":"2022-07-18","cited_by_count":18,"area":null},{"id":"2407.05694","title":"On the Limitations of Compute Thresholds as a Governance Strategy","created":"2024-07-08","cited_by_count":18,"area":null},{"id":"2405.15743","title":"Sparse maximal update parameterization: A holistic approach to sparse training dynamics","created":"2024-05-24","cited_by_count":16,"area":null},{"id":"2211.02738","title":"Intriguing Properties of Compression on Multilingual Models","created":"2022-11-04","cited_by_count":15,"area":null},{"id":"2103.01636","title":"Sparse Training Theory for Scalable and Efficient Agents","created":"2021-03-02","cited_by_count":13,"area":null},{"id":"2202.08064","title":"Learning a Single Neuron for Non-monotonic Activation Functions","created":"2022-02-16","cited_by_count":13,"area":null},{"id":"2108.06277","title":"Towards Structured Dynamic Sparse Pre-Training of BERT","created":"2021-08-13","cited_by_count":12,"area":null},{"id":"2308.02060","title":"Accurate Neural Network Pruning Requires Rethinking Sparse Optimization","created":"2023-08-03","cited_by_count":10,"area":null},{"id":"2303.13166","title":"Take 5: Interpretable Image Classification with a Handful of Features","created":"2023-03-23","cited_by_count":7,"area":null},{"id":"2410.16135","title":"Beyond 2:4: exploring V:N:M sparsity for efficient transformer inference on GPUs","created":"2024-10-21","cited_by_count":2,"area":null},{"id":"2305.10964","title":"Learning Activation Functions for Sparse Neural Networks","created":"2023-05-18","cited_by_count":1,"area":null},{"id":"2501.15592","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","created":"2025-01-26","cited_by_count":1,"area":null},{"id":"2312.12781","title":"DynaLay: An Introspective Approach to Dynamic Layer Selection for Deep Networks","created":"2023-12-20","cited_by_count":0,"area":null}],"next_cursor":null}