Skip to content
conftrace_

neural network pruning

309 papers

NNP

Papers

Efficient Plug-and-Play Weight Refinement for Sparse Large Models AAAI 2026 Forgetting by Pruning: Data Deletion in Join Cardinality Estimation AAAI 2026 GS^2: Graph-based Spatial Distribution Optimization for Compact 3D Gaussian Splatting CVPR 2026 Logit-Margin Repulsion for Backdoor Defense CVPR 2026 Neural Differentiation in Deep Networks: A Theoretical Framework for Expressivity and Representational Diversity CVPR 2026 ReLUPruner: Rethinking ReLU Importance with Taylor Expansion for Efficient Private Inference AAAI 2026 Stratified Knowledge-Density Super-Network for Scalable Vision Transformers AAAI 2026 The Strong Lottery Ticket Hypothesis for Multi-Head Attention Mechanisms AAAI 2026 Visual Detector Compression via Location-Aware Discriminant Analysis WACV 2026 1+1>2: A Synergistic Sparse and Low-Rank Compression Method for Large Language Models EMNLP 2025 Advancing Weight and Channel Sparsification with Enhanced Saliency WACV 2025 Are Spatial-Temporal Graph Convolution Networks for Human Action Recognition Over-Parameterized? CVPR 2025 DPaI: Differentiable Pruning at Initialization with Node-Path Balance Principle ICLR 2025 Efficient Test-time Adaptive Object Detection via Sensitivity-Guided Pruning CVPR 2025 Enhancing Large Language Model Performance with Gradient-Based Parameter Selection AAAI 2025 GliaNet: Adaptive Neural Network Structure Learning with Glia-Driven CVPR 2025 ICP: Immediate Compensation Pruning for Mid-to-high Sparsity CVPR 2025 LangCompress: Language-Aware Compression of Large Language Models IJCNLP 2025 Learning Compatible Multi-Prize Subnetworks for Asymmetric Retrieval CVPR 2025 Masks Can be Learned as an Alternative to Experts ACL 2025 OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition ICLR 2025 Optimal Brain Apoptosis ICLR 2025 OptiPrune: Effective Pruning Approach for Every Target Sparsity COLING 2025 PIP: Perturbation-based Iterative Pruning for Large Language Models EMNLP 2025 Probe Pruning: Accelerating LLMs through Dynamic Pruning via Model-Probing ICLR 2025