paper-with-me

Network Pruning

5개 벤치마크 · 논문 569편 · 이 태스크의 논문 보기 →

Benchmarks

ImageNet

결과 17개

CIFAR-10

결과 6개

CIFAR-100

결과 5개

MNIST

결과 1개

Most implemented

Pruning Filters for Efficient ConvNets

2016-08-31 · 구현 21개

Papers

CutClean: Neural Network Pruning for Privacy-Preserving Inference

2026-08-13 · Leonardo Magliolo, Vito Paolo Pastore, Giuseppe Valenzise, Enzo Tartaglione arxiv

Neural networks are increasingly deployed in high-stakes applications with growing privacy leakage concerns. We show that this privacy leakage can occur even in the absence of representation imbalances that lead to tradi…

Network Pruning

Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning

2026-06-10 · Romana Qureshi, Hafida Benhidour, Said Kerrache, Nahlah Aljeraisy arxiv

Neural network pruning reduces model size by removing less important parameters while aiming to preserve predictive performance. Although the Lottery Ticket Hypothesis (LTH) shows that sparse subnetworks can match dense …

Network Pruning

Relative Repairability: A Calibration-Based Diagnostic for High-Sparsity Post-Pruning Allocation

2026-05-25 · Qishi Zhan, Liang He, Minxuan Hu, Ziheng Chen arxiv

At very high sparsity, neural network pruning does more than decide which weights remain. It also determines where pruning induced damage is placed across the network, and whether that damage can be recovered by a fixed …

Network Pruning

Selection Plateau and a Sparsity-Dependent Hierarchy of Pruning Features

2026-05-10 · Guangqi Li, Yongxin Li arxiv

We identify a Selection Plateau phenomenon in one-shot neural network pruning: all rank-monotone weight scorers converge to identical accuracy at fixed sparsity, independent of functional form. We propose the Sparsity-In…

Network Pruning

Graph Normalization: Fast Binarizing Dynamics for Differentiable MWIS

2026-05-06 · Laurent Guigues arxiv

We introduce Graph Normalization (GN), a principled dynamical system on graphs that serves as a differentiable approximation engine for the NP-hard Maximum Weight Independent Set (MWIS) problem. MWIS encompasses many com…

Network Pruning

SubFLOT: Submodel Extraction for Efficient and Personalized Federated Learning via Optimal Transport

2026-04-08 · Zheng Jiang, Nan He, Yiming Chen, Lifeng Sun arxiv

Federated Learning (FL) enables collaborative model training while preserving data privacy, but its practical deployment is hampered by system and statistical heterogeneity. While federated network pruning offers a path …

Personalized Federated LearningNetwork Pruning

전체 569편 보기 →