SNIP: Single-shot Network Pruning based on Connection Sensitivity
Not on the map. Why?
Cited by 24 in LLM safety and security, but placed by its own abstract, which didn’t fit.
Abstract (arXiv)
Pruning large neural networks while maintaining their performance is often desirable due to the reduced space and time complexity. In existing methods, pruning is done within an iterative optimization procedure with either heuristically designed pruning schedules or additional hyperparameters, undermining their utility. In this work, we present a new approach that prunes a given network once at initialization prior to training. To achieve this, we introduce a saliency criterion based on connection sensitivity that identifies structurally important connections in the network for the given task. This eliminates the need for both pretraining and the complex pruning schedule while making it robust to architecture variations. After pruning, the sparse network is trained in the standard way. Our method obtains extremely sparse networks with virtually the same accuracy as the reference network on the MNIST, CIFAR-10, and Tiny-ImageNet classification tasks and is broadly applicable to various architectures including convolutional, residual and recurrent networks. Unlike existing methods, our approach enables us to demonstrate that the retained connections are indeed relevant to the given task.
Key facts. Cited by 802 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 125; 2022: 137; 2023: 141; 2024: 170; 2025: 140; 2026: 89.
802 papers.
Sort:
By area:
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPScited by 420
- 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 259
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
- 2024Assessing the Brittleness of Safety Alignment via Pruning and Low-Rank Modificationscited by 220
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2023Model Sparsity Can Simplify Machine Unlearningcited by 206
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021Zero-Cost Proxies for Lightweight NAScited by 194
- 2021FjORD: Fair and Accurate Federated Learning under heterogeneous targets with Ordered Dropoutcited by 192
38 more
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2021Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspectivecited by 168
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2022More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsitycited by 142
- 2021Learned Token Pruning for Transformerscited by 138
- 2023Neural Architecture Search: Insights from 1000 Paperscited by 136
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2024An Adversarial Perspective on Machine Unlearning for AI Safetycited by 113
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2021How Powerful are Performance Predictors in Neural Architecture Search?cited by 88
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2023Not All Features Matter: Enhancing Few-shot CLIP with Adaptive Prior Refinementcited by 84
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
- 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
- 2022Unified Visual Transformer Compressioncited by 79
- 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 77
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
- 2021Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?cited by 75
- 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
- 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 60
- 2021Initialization and Regularization of Factorized Neural Layerscited by 58
- 2021AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networkscited by 58
- 2023ZiCo: Zero-shot NAS via Inverse Coefficient of Variation on Gradientscited by 57
- 2021Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Networkcited by 55
- 2022SparCL: Sparse Continual Learning on the Edgecited by 55
- 2022Advancing Model Pruning via Bi-level Optimizationcited by 55
- 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 54
- 2023LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuningcited by 53
- 2021Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?cited by 52
- 2021A Survey on Green Deep Learningcited by 52
- 2024ConceptPrune: Concept Editing in Diffusion Models via Skilled Neuron Pruningcited by 51
50 most cited of 802 All 802 (JSON)
- 2026Dissecting Representation Structure in Vision Transformers: A Rigorous Architectural Study8 Oct 2026
- 2026Prediction-powered Neural Architecture Search1 Oct 2026
- 2026Learning Perturbation Robust Policies for LLM Agents with Stable Optimization28 Sep 2026
- 2026Awaken, Then Scale: Tiny Adaptation for MRI Reconstruction25 Sep 2026
- 2026Beyond Sparsity: Weight Location and Network Context in Pruned MRI Reconstruction25 Sep 2026
- 2026Artificial Structure Function Search: Preserving Artificial Functional Connectivity for Structured Pruning21 Sep 2026
- 2026Neural Spectral Capacity: Measuring and Designing Architectures from Network Specification Alone19 Sep 2026
- 2026Layerwise Decoupling for Stable Structured Sparsification of Fully Connected Layers17 Sep 2026
- 2026Unified Response Geometry for Structured Pruning16 Sep 2026
- 2026Optimal Pruning for Neural Architectures using Fisher Information Distances14 Sep 2026
- 2026Sparsity-Adaptive Sharpness-Aware Minimization13 Sep 2026
- 2026ZAPS: Zero-Cost Active Proxy Search for Neural Architecture Search12 Sep 2026
38 more
- 2026FLoKD: Adaptive Knowledge Distillation for Federated Low-Rank LLM over Wireless Networks11 Sep 2026
- 2026CoRA-NAS: Coarse Ranking and Anchor-Residual Refinement for Neural Architecture Search10 Sep 2026
- 2026From Deep to Shallow: Unconstrained and Efficient Layer Merging Strategy4 Sep 2026
- 2026Physics-Informed Foresight Pruning for Sparse PINN Solvers of Nonlinear PDEs26 Aug 2026
- 2026Bi-EZP: LLM-Guided Bilevel Program Evolution for Ensemble Zero-Cost Proxy Discovery22 Aug 2026
- 2026Denoised Variance-Based Pruning with Optimal Brain Bias Compensation18 Aug 2026
- 2026Breaking the Compression Barrier: Cross-Architecture Compression Boundary Learning via Reverse Regrowth17 Aug 2026
- 2026Activation-Energy Pruning for Spiking Neural Networks: Unsupervised Personalization via Spike-Count Saliency11 Aug 2026
- 2026Prune Once: Retraining-Free Task-Agnostic Pruning for Vision-Language Models7 Aug 2026
- 2026Effective pruning of task-trained recurrent neural networks using noisy fluctuations and connection rescaling5 Aug 2026
- 2026Lottery Tickets Are Not Deployment Tickets29 Jul 2026
- 2026IFCLoRA: Topology-Aware Rank Allocation for Parameter-Efficient Fine-Tuning24 Jul 2026
- 2026FedASAP: Activation Statistics-driven Structured Adaptive Pruning for Efficient Personalized Federated Learning for Lesion Segmentation on brain MRI20 Jul 2026
- 2026Double-Scoring: Reliable Extraction of Strong Lottery Tickets15 Jul 2026
- 2026Requential Coding: Pushing the Limits of Model Compression with Self-Generated Training Data13 Jul 2026
- 2026Weight-Adjusted Gradients Reveal Parameter Importance and Failure Modes in LLMs12 Jul 2026
- 2026Structured Pruning of Large Language Models via Power Transformation and Sign-Preserving Score Aggregation with Adaptive Feature Retention9 Jul 2026
- 2026Knowing in Advance When an Evolutionary Outer Loop Will Not Help: A Pre-Registered Cheap-Baseline Screening Rule28 Jun 2026
- 2026Aurora: A Leverage-Aware Spectral Optimizer26 Jun 2026
- 2026CascadeFormer: Depth-Tapered Transformers Motivated by Gradient Fan-in Asymmetry25 Jun 2026
- 2026Efficient Network Inference via Hardware-Aware Architecture Search, Model Pruning & Quantization22 Jun 2026
- 2026InTrain: Intrinsic Trainability for Zero-Cost Neural Architecture Search17 Jun 2026
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compression16 Jun 2026
- 2026Squeeze-Release: Iterative Pruning with Exact Structural Minimization12 Jun 2026
- 2026Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning10 Jun 2026
- 2026Beyond Structural Symmetries: Linear Mode Connectivity via Neuron Identifiability3 Jun 2026
- 2026Aligned but Fragile: Enhancing LLM Safety Robustness via Zeroth-Order Optimization28 May 2026
- 2026Resource-Constrained Affect Modelling via Variance Regularisation Pruning26 May 2026
- 2026Toy Combinatorial Interpretability Models Reveal Lottery Tickets in Early Feature Space18 May 2026
- 2026Winning Lottery Tickets in Neural Networks via a Quantum-Inspired Classical Algorithm13 May 2026
- 2026Hybrid-LoRA: Bridging Full Fine-Tuning and Low-Rank Adaptation for Post-Training12 May 2026
- 2026Not How Many, But Which: Parameter Placement in Low-Rank Adaptation12 May 2026
- 2026XTinyU-Net: Training-Free U-Net Scaling via Initialization-Time Sensitivity10 May 2026
- 2026Relative Kinetic Utility for Reasoning-Aware Structural Pruning in Large Language Models9 May 2026
- 2026Different Prompts, Different Ranks: Prompt-aware Dynamic Rank Selection for SVD-based LLM Compression9 May 2026
- 2026Zero-Shot Neural Network Evaluation with Sample-Wise Activation Patterns8 May 2026
- 2026FED-FSTQ: Fisher-Guided Token Quantization for Communication-Efficient Federated Fine-Tuning of LLMs on Edge Devices28 Apr 2026
- 2026Pruning Unsafe Tickets: A Resource-Efficient Framework for Safer and More Robust LLMs17 Apr 2026
50 newest of 802 All 802 (JSON)
- 2023Model Sparsity Can Simplify Machine Unlearningcited by 206
- 2024An Adversarial Perspective on Machine Unlearning for AI Safetycited by 113
- 2024Scissorhands: Scrub Data Influence via Connection Sensitivity in Networkscited by 50
- 2025SaLoRA: Safety-Alignment Preserved Low-Rank Adaptationcited by 39
- 2024Towards Understanding the Fragility of Multilingual LLMs against Fine-Tuning Attackscited by 33
- 2024WAGLE: Strategic Weight Attribution for Effective and Modular Unlearning in Large Language Modelscited by 25
- 2025Learning to Unlearn while Retaining: Combating Gradient Conflicts in Machine Unlearningcited by 19
- 2025TwinBreak: Jailbreaking LLM Security Alignments based on Twin Promptscited by 12
- 2025Improving LLM Unlearning Robustness via Random Perturbationscited by 6
- 2026Large Language Models Generate Harmful Responses Using a Distinct Mechanism, Shared Across Harm Typescited by 3
- 2025LLM Unlearning Under the Microscope: A Full-Stack View on Methods and Metricscited by 1
- 2026Beyond Forgetting: Representation Misdirection Elicits Controllable Side Behaviors and Capabilitiescited by 1
12 most cited of 15 All 15 (JSON)
- 2026Pruning Unsafe Tickets: A Resource-Efficient Framework for Safer and More Robust LLMs17 Apr 2026
- 2026Large Language Models Generate Harmful Responses Using a Distinct Mechanism, Shared Across Harm Types10 Apr 2026
- 2026Can LLM Safety Be Ensured by Constraining Parameter Regions?6 Feb 2026
- 2026Beyond Forgetting: Representation Misdirection Elicits Controllable Side Behaviors and Capabilities29 Jan 2026
- 2025Forgetting by Pruning: Data Deletion in Join Cardinality Estimation25 Nov 2025
- 2025LLM Unlearning Under the Microscope: A Full-Stack View on Methods and Metrics8 Oct 2025
- 2025TwinBreak: Jailbreaking LLM Security Alignments based on Twin Prompts9 Jun 2025
- 2025Learning to Unlearn while Retaining: Combating Gradient Conflicts in Machine Unlearning8 Mar 2025
- 2025Improving LLM Unlearning Robustness via Random Perturbations31 Jan 2025
- 2025SaLoRA: Safety-Alignment Preserved Low-Rank Adaptation3 Jan 2025
- 2024Towards Understanding the Fragility of Multilingual LLMs against Fine-Tuning Attacks23 Oct 2024
- 2024WAGLE: Strategic Weight Attribution for Effective and Modular Unlearning in Large Language Models23 Oct 2024
12 newest of 15 All 15 (JSON)
- 2024ConceptPrune: Concept Editing in Diffusion Models via Skilled Neuron Pruningcited by 51
- 2024Memorized Images in Diffusion Models share a Subspace that can be Located and Deletedcited by 13
- 2024Unveiling Concept Attribution in Diffusion Modelscited by 11
- 2023DeepPCR: Parallelizing Sequential Operations in Neural Networkscited by 9
- 2025Continual Unlearning for Text-to-Image Diffusion Models: A Regularization Perspectivecited by 9
- 2024FreezeAsGuard: Mitigating Illegal Adaptation of Diffusion Models via Selective Tensor Freezingcited by 4
- 2025Towards efficient quantum algorithms for diffusion probabilistic modelscited by 4
- 2024Efficient Training with Denoised Neural Weightscited by 2
- 2024E2GAN: Efficient Training of Efficient GANs for Image-to-Image Translationcited by 1
- 2025Sparse-to-Sparse Training of Diffusion Modelscited by 1
- 2026Forget-It-All: Multi-Concept Machine Unlearning via Concept-Aware Neuron Maskingcited by 1
- 2026Forget-It-All: Multi-Concept Machine Unlearning via Concept-Aware Neuron Masking7 Jan 2026
- 2025Continual Unlearning for Text-to-Image Diffusion Models: A Regularization Perspective11 Nov 2025
- 2025Sparse-to-Sparse Training of Diffusion Models30 Apr 2025
- 2025Towards efficient quantum algorithms for diffusion probabilistic models20 Feb 2025
- 2024Unveiling Concept Attribution in Diffusion Models3 Dec 2024
- 2024Efficient Training with Denoised Neural Weights16 Jul 2024
- 2024Memorized Images in Diffusion Models share a Subspace that can be Located and Deleted1 Jun 2024
- 2024ConceptPrune: Concept Editing in Diffusion Models via Skilled Neuron Pruning29 May 2024
- 2024FreezeAsGuard: Mitigating Illegal Adaptation of Diffusion Models via Selective Tensor Freezing24 May 2024
- 2024E2GAN: Efficient Training of Efficient GANs for Image-to-Image Translation11 Jan 2024
- 2023DeepPCR: Parallelizing Sequential Operations in Neural Networks28 Sep 2023
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruningcited by 13
- 2024F3OCUS -- Federated Finetuning of Vision-Language Foundation Models with Optimal Client Layer Updating Strategy via Multi-objective Meta-Heuristicscited by 4
- 2025Breach in the Shield: Unveiling the Vulnerabilities of Large Language Modelscited by 4
- 2025Hierarchical Safety Realignment: Lightweight Restoration of Safety in Pruned Large Vision-Language Modelscited by 4
- 2025Corrupted but Not Broken: Understanding and Mitigating the Negative Impacts of Corrupted Data in Visual Instruction Tuningcited by 1
- 2025Safe Vision-Language Models via Unsafe Weights Manipulationcited by 1
- 2026Prune Once: Retraining-Free Task-Agnostic Pruning for Vision-Language Modelscited by 1
- 2025Sparse Neuron Ablation Triggers Catastrophic Collapse of the Language Core in Large Vision-Language Modelscited by 0
- 2026HiPP-Prune: Hierarchical Preference-Conditioned Structured Pruning for Vision-Language Modelscited by 0
- 2026Prune Once: Retraining-Free Task-Agnostic Pruning for Vision-Language Models7 Aug 2026
- 2026HiPP-Prune: Hierarchical Preference-Conditioned Structured Pruning for Vision-Language Models6 Mar 2026
- 2025Sparse Neuron Ablation Triggers Catastrophic Collapse of the Language Core in Large Vision-Language Models30 Nov 2025
- 2025Hierarchical Safety Realignment: Lightweight Restoration of Safety in Pruned Large Vision-Language Models22 May 2025
- 2025Breach in the Shield: Unveiling the Vulnerabilities of Large Language Models28 Mar 2025
- 2025Safe Vision-Language Models via Unsafe Weights Manipulation14 Mar 2025
- 2025Corrupted but Not Broken: Understanding and Mitigating the Negative Impacts of Corrupted Data in Visual Instruction Tuning18 Feb 2025
- 2024F3OCUS -- Federated Finetuning of Vision-Language Foundation Models with Optimal Client Layer Updating Strategy via Multi-objective Meta-Heuristics17 Nov 2024
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning8 Apr 2024
- 2024Assessing the Brittleness of Safety Alignment via Pruning and Low-Rank Modificationscited by 220
- 2024NLSR: Neuron-Level Safety Realignment of Large Language Models Against Harmful Fine-Tuningcited by 37
- 2024Towards Comprehensive Post Safety Alignment of Large Language Models via Safety Patchingcited by 16
- 2024Superficial Safety Alignment Hypothesiscited by 14
- 2025Safety Alignment via Constrained Knowledge Unlearningcited by 13
- 2024Dishonesty in Helpful and Harmless Alignmentcited by 3
- 2026Aligned but Fragile: Enhancing LLM Safety Robustness via Zeroth-Order Optimizationcited by 1
- 2025Data Curation Through the Lens of Spectral Dynamics: Static Limits, Dynamic Acceleration, and Practical Oraclescited by 0
- 2026Aligned but Fragile: Enhancing LLM Safety Robustness via Zeroth-Order Optimization28 May 2026
- 2025Data Curation Through the Lens of Spectral Dynamics: Static Limits, Dynamic Acceleration, and Practical Oracles2 Dec 2025
- 2025Safety Alignment via Constrained Knowledge Unlearning24 May 2025
- 2024NLSR: Neuron-Level Safety Realignment of Large Language Models Against Harmful Fine-Tuning17 Dec 2024
- 2024Superficial Safety Alignment Hypothesis7 Oct 2024
- 2024Dishonesty in Helpful and Harmless Alignment4 Jun 2024
- 2024Towards Comprehensive Post Safety Alignment of Large Language Models via Safety Patching22 May 2024
- 2024Assessing the Brittleness of Safety Alignment via Pruning and Low-Rank Modifications7 Feb 2024
- 2024LLaMA-MoE v2: Exploring Sparsity of LLaMA from Perspective of Mixture-of-Experts with Post-Trainingcited by 25
- 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Expertscited by 21
- 2025Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observationscited by 19
- 2024Graph Sparsification via Mixture of Graphscited by 17
- 2022PAD-Net: An Efficient Framework for Dynamic Networkscited by 9
- 2025DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMscited by 1
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compressioncited by 0
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compression16 Jun 2026
- 2025Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observations8 Apr 2025
- 2025DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMs18 Feb 2025
- 2024LLaMA-MoE v2: Exploring Sparsity of LLaMA from Perspective of Mixture-of-Experts with Post-Training24 Nov 2024
- 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts26 May 2024
- 2024Graph Sparsification via Mixture of Graphs23 May 2024
- 2022PAD-Net: An Efficient Framework for Dynamic Networks10 Nov 2022
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPScited by 420
- 2021Pruning and Quantization for Deep Neural Network Acceleration: A Surveycited by 259
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
- 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021Zero-Cost Proxies for Lightweight NAScited by 194
- 2021FjORD: Fair and Accurate Federated Learning under heterogeneous targets with Ordered Dropoutcited by 192
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
12 most cited of 737 All 737 (JSON)
- 2026Dissecting Representation Structure in Vision Transformers: A Rigorous Architectural Study8 Oct 2026
- 2026Prediction-powered Neural Architecture Search1 Oct 2026
- 2026Awaken, Then Scale: Tiny Adaptation for MRI Reconstruction25 Sep 2026
- 2026Beyond Sparsity: Weight Location and Network Context in Pruned MRI Reconstruction25 Sep 2026
- 2026Artificial Structure Function Search: Preserving Artificial Functional Connectivity for Structured Pruning21 Sep 2026
- 2026Neural Spectral Capacity: Measuring and Designing Architectures from Network Specification Alone19 Sep 2026
- 2026Layerwise Decoupling for Stable Structured Sparsification of Fully Connected Layers17 Sep 2026
- 2026Unified Response Geometry for Structured Pruning16 Sep 2026
- 2026Optimal Pruning for Neural Architectures using Fisher Information Distances14 Sep 2026
- 2026Sparsity-Adaptive Sharpness-Aware Minimization13 Sep 2026
- 2026ZAPS: Zero-Cost Active Proxy Search for Neural Architecture Search12 Sep 2026
- 2026FLoKD: Adaptive Knowledge Distillation for Federated Low-Rank LLM over Wireless Networks11 Sep 2026
12 newest of 737 All 737 (JSON)