https://github.com/mohofar/beta-rank
공식 코드Beta-Rank: A Robust Convolutional Filter Pruning Method For Imbalanced Medical Image Analysis
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Network Pruning is a popular approach to reduce a heavy network to obtain a light-weight form by removing redundancy in the heavy network. In this approach, a complex over-parameterized network is first trained, then pruned based on come criterions, and finally fine-tuned to achieve comparable performance with reduced parameters.
Source: Ensemble Knowledge Distillation for Learning Improved and Efficient Networks
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Beta-Rank: A Robust Convolutional Filter Pruning Method For Imbalanced Medical Image Analysis
ReplaceMe: Network Simplification via Layer Pruning and Linear Transformations
SNIP: Single-shot Network Pruning based on Connection Sensitivity
A Signal Propagation Perspective for Pruning Neural Networks at Initialization
Automatic Neural Network Pruning that Efficiently Preserves the Model Accuracy
MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models
Pruning deep neural networks generates a sparse, bio-inspired nonlinear controller for insect flight
Filter Pruning for Efficient CNNs via Knowledge-driven Differential Filter Sampler
Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustness
How Sparse Can We Prune A Deep Network: A Fundamental Limit Viewpoint
Pruning neural network models for gene regulatory dynamics using data and domain knowledge
Distilling the Knowledge of Romanian BERTs Using Multiple Teachers
Lottery Tickets in Evolutionary Optimization: On Sparse Backpropagation-Free Trainability
Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models
LEAN: graph-based pruning for convolutional neural networks by extracting longest chains
UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformers
Pruning by Explaining: A Novel Criterion for Deep Neural Network Pruning
Scaling Up Semi-supervised Learning with Unconstrained Unlabelled Data
SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters
Iterative Network Pruning with Uncertainty Regularization for Lifelong Sentiment Classification
Self-supervised Feature-Gate Coupling for Dynamic Network Pruning
Efficient Latency-Aware CNN Depth Compression via Two-Stage Dynamic Programming
OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition
DeepSZ: A Novel Framework to Compress Deep Neural Networks by Using Error-Bounded Lossy Compression
How Not to Give a FLOP: Combining Regularization and Pruning for Efficient Inference
Do Localization Methods Actually Localize Memorized Data in LLMs? A Tale of Two Benchmarks
Do Localization Methods Actually Localize Memorized Data in LLMs? A Tale of Two Benchmarks
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.