{"total":247,"rows":[{"id":"2106.10199","title":"BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-models","created":"2021-06-18","cited_by_count":1245,"area":null},{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800,"area":null},{"id":"2111.01243","title":"Recent Advances in Natural Language Processing via Large Pre-Trained Language Models: A Survey","created":"2021-11-01","cited_by_count":463,"area":null},{"id":"2106.04647","title":"Compacter: Efficient Low-Rank Hypercomplex Adapter Layers","created":"2021-06-08","cited_by_count":460,"area":null},{"id":"2310.06694","title":"Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruning","created":"2023-10-10","cited_by_count":415,"area":null},{"id":"2110.07904","title":"SPoT: Better Frozen Model Adaptation through Soft Prompt Transfer","created":"2021-10-15","cited_by_count":235,"area":null},{"id":"2308.06767","title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations","created":"2023-08-13","cited_by_count":202,"area":null},{"id":"2106.04533","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","created":"2021-06-08","cited_by_count":183,"area":null},{"id":"2204.00408","title":"Structured Pruning Learns Compact and Accurate Models","created":"2022-04-01","cited_by_count":170,"area":null},{"id":"2204.09656","title":"A Fast Post-Training Pruning Framework for Transformers","created":"2022-03-29","cited_by_count":162,"area":null},{"id":"2306.05817","title":"How Can Recommender Systems Benefit from Large Language Models: A Survey","created":"2023-06-09","cited_by_count":142,"area":null},{"id":"2102.06790","title":"A Unified Lottery Ticket Hypothesis for Graph Neural Networks","created":"2021-02-12","cited_by_count":118,"area":null},{"id":"2402.11592","title":"Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark","created":"2024-02-18","cited_by_count":114,"area":null},{"id":"2105.06990","title":"BERT Busters: Outlier Dimensions that Disrupt Transformers","created":"2021-05-14","cited_by_count":112,"area":null},{"id":"2302.06600","title":"Task-Specific Skill Localization in Fine-tuned Language Models","created":"2023-02-13","cited_by_count":105,"area":null},{"id":"2308.06522","title":"SLoRA: Federated Parameter Efficient Fine-Tuning of Language Models","created":"2023-08-12","cited_by_count":93,"area":null},{"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":"2302.11529","title":"Modular Deep Learning","created":"2023-02-22","cited_by_count":83,"area":null},{"id":"2203.08243","title":"Unified Visual Transformer Compression","created":"2022-03-15","cited_by_count":79,"area":null},{"id":"2206.12562","title":"PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance","created":"2022-06-25","cited_by_count":79,"area":null},{"id":"2406.16937","title":"A Complete Survey on LLM-based AI Chatbots","created":"2024-06-17","cited_by_count":71,"area":null},{"id":"2303.04935","title":"X-Pruner: eXplainable Pruning for Vision Transformers","created":"2023-03-08","cited_by_count":68,"area":null},{"id":"2111.05754","title":"Prune Once for All: Sparse Pre-Trained Language Models","created":"2021-11-10","cited_by_count":66,"area":null},{"id":"2402.09748","title":"Model Compression and Efficient Inference for Large Language Models: A Survey","created":"2024-02-15","cited_by_count":64,"area":null},{"id":"2310.01382","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","created":"2023-10-02","cited_by_count":62,"area":null},{"id":"2105.12002","title":"Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization","created":"2021-05-25","cited_by_count":56,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"area":null},{"id":"2112.09824","title":"Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Better","created":"2021-12-18","cited_by_count":55,"area":null},{"id":"2205.11380","title":"Outliers Dimensions that Disrupt Transformers Are Driven by Frequency","created":"2022-05-23","cited_by_count":55,"area":null},{"id":"2301.13741","title":"UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformers","created":"2023-01-31","cited_by_count":54,"area":null},{"id":"2106.05933","title":"PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech Recognition","created":"2021-06-10","cited_by_count":53,"area":null},{"id":"2107.00166","title":"Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?","created":"2021-07-01","cited_by_count":52,"area":null},{"id":"2111.05193","title":"A Survey on Green Deep Learning","created":"2021-11-08","cited_by_count":52,"area":null},{"id":"2111.13445","title":"How Well Do Sparse Imagenet Models Transfer?","created":"2021-11-26","cited_by_count":50,"area":null},{"id":"2408.13656","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","created":"2024-08-24","cited_by_count":50,"area":null},{"id":"2102.01386","title":"AutoFreeze: Automatically Freezing Model Blocks to Accelerate Fine-tuning","created":"2021-02-02","cited_by_count":48,"area":null},{"id":"2104.11832","title":"Playing Lottery Tickets with Vision and Language","created":"2021-04-23","cited_by_count":45,"area":null},{"id":"2202.07105","title":"A Survey on Model Compression and Acceleration for Pretrained Language Models","created":"2022-02-15","cited_by_count":45,"area":null},{"id":"2106.03225","title":"Efficient Lottery Ticket Finding: Less Data is More","created":"2021-06-06","cited_by_count":44,"area":null},{"id":"2210.05528","title":"Model Cascading: Towards Jointly Improving Efficiency and Accuracy of NLP Systems","created":"2022-10-11","cited_by_count":44,"area":null},{"id":"2306.03805","title":"The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Matter","created":"2023-06-06","cited_by_count":42,"area":null},{"id":"2103.06460","title":"Recent Advances on Neural Network Pruning at Initialization","created":"2021-03-11","cited_by_count":41,"area":null},{"id":"2202.09844","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","created":"2022-02-20","cited_by_count":41,"area":null},{"id":"2104.08682","title":"Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigm","created":"2021-04-18","cited_by_count":40,"area":null},{"id":"2312.10136","title":"Gradient-based Parameter Selection for Efficient Fine-Tuning","created":"2023-12-15","cited_by_count":40,"area":null},{"id":"2406.02924","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","created":"2024-06-05","cited_by_count":40,"area":null},{"id":"2202.12002","title":"Rare Gems: Finding Lottery Tickets at Initialization","created":"2022-02-24","cited_by_count":34,"area":null},{"id":"2106.00134","title":"GANs Can Play Lottery Tickets Too","created":"2021-05-31","cited_by_count":32,"area":null},{"id":"2111.11146","title":"On the Existence of Universal Lottery Tickets","created":"2021-11-22","cited_by_count":30,"area":null},{"id":"2205.15043","title":"RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratch","created":"2022-05-30","cited_by_count":30,"area":null},{"id":"2205.12672","title":"Discovering Language-neutral Sub-networks in Multilingual Language Models","created":"2022-05-25","cited_by_count":28,"area":null},{"id":"2303.10464","title":"SPDF: Sparse Pre-training and Dense Fine-tuning for Large Language Models","created":"2023-03-18","cited_by_count":28,"area":null},{"id":"2110.10030","title":"Accelerating Framework of Transformer by Hardware Design and Model Compression Co-Optimization","created":"2021-10-19","cited_by_count":27,"area":null},{"id":"2201.06618","title":"VAQF: Fully Automatic Software-Hardware Co-Design Framework for Low-Bit Vision Transformer","created":"2022-01-17","cited_by_count":27,"area":null},{"id":"2202.04736","title":"Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets","created":"2022-02-09","cited_by_count":27,"area":null},{"id":"2303.02141","title":"Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!","created":"2023-03-03","cited_by_count":27,"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.01382","title":"Exploring Lottery Ticket Hypothesis in Spiking Neural Networks","created":"2022-07-04","cited_by_count":26,"area":null},{"id":"2303.04185","title":"Gradient-Free Structured Pruning with Unlabeled Data","created":"2023-03-07","cited_by_count":26,"area":null},{"id":"2103.00397","title":"Data-Efficient GAN Training Beyond (Just) Augmentations: A Lottery Ticket Perspective","created":"2021-02-28","cited_by_count":25,"area":null},{"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,"area":null},{"id":"2105.01648","title":"On Lottery Tickets and Minimal Task Representations in Deep Reinforcement Learning","created":"2021-05-04","cited_by_count":24,"area":null},{"id":"2111.11802","title":"Pruning Self-attentions into Convolutional Layers in Single Path","created":"2021-11-23","cited_by_count":24,"area":null},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2404.04612","title":"Spectral Graph Pruning Against Over-Squashing and Over-Smoothing","created":"2024-04-06","cited_by_count":24,"area":null},{"id":"2103.16547","title":"The Elastic Lottery Ticket Hypothesis","created":"2021-03-30","cited_by_count":23,"area":null},{"id":"2301.08986","title":"Adapting a Language Model While Preserving its General Knowledge","created":"2023-01-21","cited_by_count":23,"area":null},{"id":"2305.02190","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","created":"2023-05-03","cited_by_count":23,"area":null},{"id":"2312.01397","title":"Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective","created":"2023-12-03","cited_by_count":23,"area":null},{"id":"2102.11068","title":"Lottery Ticket Preserves Weight Correlation: Is It Desirable or Not?","created":"2021-02-19","cited_by_count":22,"area":null},{"id":"2110.08190","title":"Sparse Progressive Distillation: Resolving Overfitting under Pretrain-and-Finetune Paradigm","created":"2021-10-15","cited_by_count":21,"area":null},{"id":"2206.01278","title":"Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks","created":"2022-06-02","cited_by_count":21,"area":null},{"id":"2206.10451","title":"Winning the Lottery Ahead of Time: Efficient Early Network Pruning","created":"2022-06-21","cited_by_count":21,"area":null},{"id":"2205.12694","title":"Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Models","created":"2022-05-25","cited_by_count":20,"area":null},{"id":"2306.10460","title":"Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models","created":"2023-06-18","cited_by_count":20,"area":null},{"id":"2308.06619","title":"Can Unstructured Pruning Reduce the Depth in Deep Neural Networks?","created":"2023-08-12","cited_by_count":20,"area":null},{"id":"2108.12594","title":"Layer-wise Model Pruning based on Mutual Information","created":"2021-08-28","cited_by_count":19,"area":null},{"id":"2110.08616","title":"GradSign: Model Performance Inference with Theoretical Insights","created":"2021-10-16","cited_by_count":19,"area":null},{"id":"2110.15766","title":"NxMTransformer: Semi-Structured Sparsification for Natural Language Understanding via ADMM","created":"2021-10-28","cited_by_count":19,"area":null},{"id":"2305.17446","title":"Fine-tuning Happens in Tiny Subspaces: Exploring Intrinsic Task-specific Subspaces of Pre-trained Language Models","created":"2023-05-27","cited_by_count":19,"area":null},{"id":"2312.05662","title":"Understanding the Effect of Model Compression on Social Bias in Large Language Models","created":"2023-12-09","cited_by_count":19,"area":null},{"id":"2404.01847","title":"Accelerating Transformer Pre-training with 2:4 Sparsity","created":"2024-04-02","cited_by_count":19,"area":null},{"id":"2406.07831","title":"ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models","created":"2024-06-12","cited_by_count":19,"area":null},{"id":"2106.04563","title":"XtremeDistilTransformers: Task Transfer for Task-agnostic Distillation","created":"2021-06-08","cited_by_count":18,"area":null},{"id":"2111.00162","title":"You are caught stealing my winning lottery ticket! Making a lottery ticket claim its ownership","created":"2021-10-30","cited_by_count":18,"area":null},{"id":"2205.15171","title":"Modular and On-demand Bias Mitigation with Attribute-Removal Subnetworks","created":"2022-05-30","cited_by_count":18,"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":"2410.04368","title":"Algorithmic Capabilities of Random Transformers","created":"2024-10-06","cited_by_count":17,"area":null},{"id":"2501.02086","title":"Instruction-Following Pruning for Large Language Models","created":"2025-01-03","cited_by_count":17,"area":null},{"id":"2211.03013","title":"Robust Lottery Tickets for Pre-trained Language Models","created":"2022-11-06","cited_by_count":16,"area":null},{"id":"2104.07155","title":"Disentangling Representations of Text by Masking Transformers","created":"2021-04-14","cited_by_count":15,"area":null},{"id":"2202.02664","title":"No Parameters Left Behind: Sensitivity Guided Adaptive Learning Rate for Training Large Transformer Models","created":"2022-02-06","cited_by_count":15,"area":null},{"id":"2205.11819","title":"Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free","created":"2022-05-24","cited_by_count":15,"area":null},{"id":"2210.06384","title":"GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methods","created":"2022-10-12","cited_by_count":15,"area":null},{"id":"2504.07097","title":"Sculpting Subspaces: Constrained Full Fine-Tuning in LLMs for Continual Learning","created":"2025-04-09","cited_by_count":15,"area":null},{"id":"2106.01335","title":"On the Distribution, Sparsity, and Inference-time Quantization of Attention Values in Transformers","created":"2021-06-02","cited_by_count":14,"area":null},{"id":"2110.05667","title":"Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Pruned Neural Networks","created":"2021-10-12","cited_by_count":14,"area":null},{"id":"2210.12050","title":"Clip-Tuning: Towards Derivative-free Prompt Learning with a Mixture of Rewards","created":"2022-10-21","cited_by_count":14,"area":null},{"id":"2206.01838","title":"Differentially Private Model Compression","created":"2022-06-03","cited_by_count":13,"area":null},{"id":"2206.10461","title":"An Automatic and Efficient BERT Pruning for Edge AI Systems","created":"2022-06-21","cited_by_count":13,"area":null}],"next_cursor":"100"}