{"list":"other","total":52,"rows":[{"id":"2103.00020","title":"Learning Transferable Visual Models From Natural Language Supervision","created":"2021-02-26","cited_by_count":33744},{"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":"2307.09288","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","created":"2023-07-18","cited_by_count":13028},{"id":"1503.02531","title":"Distilling the Knowledge in a Neural Network","created":"2015-03-09","cited_by_count":10324},{"id":"2204.06125","title":"Hierarchical Text-Conditional Image Generation with CLIP Latents","created":"2022-04-13","cited_by_count":6585},{"id":"1506.02626","title":"Learning both Weights and Connections for Efficient Neural Networks","created":"2015-06-08","cited_by_count":2031},{"id":"2010.01412","title":"Sharpness-Aware Minimization for Efficiently Improving Generalization","created":"2020-10-03","cited_by_count":1417},{"id":"2203.05482","title":"Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference time","created":"2022-03-10","cited_by_count":1396},{"id":"1608.08710","title":"Pruning Filters for Efficient ConvNets","created":"2016-08-31","cited_by_count":1143},{"id":"1712.09913","title":"Visualizing the Loss Landscape of Neural Nets","created":"2017-12-28","cited_by_count":1130},{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800},{"id":"1706.08947","title":"Exploring Generalization in Deep Learning","created":"2017-06-27","cited_by_count":600},{"id":"1608.03665","title":"Learning Structured Sparsity in Deep Neural Networks","created":"2016-08-12","cited_by_count":541},{"id":"1707.06342","title":"ThiNet: A Filter Level Pruning Method for Deep Neural Network Compression","created":"2017-07-20","cited_by_count":442},{"id":"2005.07683","title":"Movement Pruning: Adaptive Sparsity by Fine-Tuning","created":"2020-05-15","cited_by_count":403},{"id":"2110.06296","title":"The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networks","created":"2021-10-12","cited_by_count":291},{"id":"1711.04623","title":"Three Factors Influencing Minima in SGD","created":"2017-11-13","cited_by_count":273},{"id":"1705.08292","title":"The Marginal Value of Adaptive Gradient Methods in Machine Learning","created":"2017-05-23","cited_by_count":250},{"id":"2104.08378","title":"Accelerating Sparse Deep Neural Networks","created":"2021-04-16","cited_by_count":223},{"id":"1607.03250","title":"Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures","created":"2016-07-12","cited_by_count":221},{"id":"1904.01186","title":"Data-Free Learning of Student Networks","created":"2019-04-02","cited_by_count":204},{"id":"1412.6553","title":"Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decomposition","created":"2014-12-19","cited_by_count":203},{"id":"2305.03053","title":"ZipIt! Merging Models from Different Tasks without Training","created":"2023-05-04","cited_by_count":179},{"id":"1511.06530","title":"Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applications","created":"2015-11-20","cited_by_count":162},{"id":"1905.09768","title":"Zero-shot Knowledge Transfer via Adversarial Belief Matching","created":"2019-05-23","cited_by_count":129},{"id":"2010.05627","title":"Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learning","created":"2020-10-12","cited_by_count":126},{"id":"2211.08403","title":"REPAIR: REnormalizing Permuted Activations for Interpolation Repair","created":"2022-11-15","cited_by_count":120},{"id":"2203.07259","title":"The Optimal BERT Surgeon: Scalable and Accurate Second-Order Pruning for Large Language Models","created":"2022-03-14","cited_by_count":115},{"id":"2302.07011","title":"A Modern Look at the Relationship between Sharpness and Generalization","created":"2023-02-14","cited_by_count":92},{"id":"1912.11006","title":"Data-Free Adversarial Distillation","created":"2019-12-23","cited_by_count":90},{"id":"1906.04724","title":"Large Scale Structure of Neural Network Loss Landscapes","created":"2019-06-11","cited_by_count":68},{"id":"1912.01274","title":"The Knowledge Within: Methods for Data-Free Model Compression","created":"2019-12-03","cited_by_count":54},{"id":"2406.02214","title":"SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretraining","created":"2024-06-04","cited_by_count":45},{"id":"2110.15456","title":"FAST: DNN Training Under Variable Precision Block Floating Point with Stochastic Rounding","created":"2021-10-28","cited_by_count":31},{"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":"1804.09862","title":"Accelerator-Aware Pruning for Convolutional Neural Networks","created":"2018-04-26","cited_by_count":22},{"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.14306","title":"Adaptive Sharpness-Aware Pruning for Robust Sparse Networks","created":"2023-06-25","cited_by_count":17},{"id":"1907.09061","title":"Understanding Adversarial Robustness Through Loss Landscape Geometries","created":"2019-07-22","cited_by_count":12},{"id":"2310.06756","title":"Going Beyond Neural Network Feature Similarity: The Network Feature Complexity and Its Interpretation Using Category Theory","created":"2023-10-10","cited_by_count":12},{"id":"1512.07548","title":"k-Means Clustering Is Matrix Factorization","created":"2015-12-23","cited_by_count":11},{"id":"2306.14152","title":"Low-Rank Prune-And-Factorize for Language Model Compression","created":"2023-06-25","cited_by_count":11},{"id":"2306.05857","title":"How Sparse Can We Prune A Deep Network: A Fundamental Limit Perspective","created":"2023-06-09","cited_by_count":9},{"id":"2308.14929","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","created":"2023-08-28","cited_by_count":8},{"id":"2402.07839","title":"Towards Meta-Pruning via Optimal Transport","created":"2024-02-12","cited_by_count":8},{"id":"1909.10364","title":"Class-dependent Compression of Deep Neural Networks","created":"2019-09-23","cited_by_count":7},{"id":"2502.10216","title":"Forget the Data and Fine-Tuning! Just Fold the Network to Compress","created":"2025-02-14","cited_by_count":7},{"id":"2502.15790","title":"Signal Collapse in One-Shot Pruning: When Sparse Models Fail to Distinguish Neural Representations","created":"2025-02-18","cited_by_count":5},{"id":"2505.22922","title":"Scalable Parameter and Memory Efficient Pretraining for LLM: Recent Algorithmic Advances and Benchmarking","created":"2025-05-28","cited_by_count":5},{"id":"2505.24592","title":"A Flat Minima Perspective on Understanding Augmentations and Model Robustness","created":"2025-05-30","cited_by_count":1}],"next_cursor":null}