Research map / Architectures and efficiency / Pruning and efficient tuning
Probabilistic Connection Importance Inference and Lossless Compression of Deep Neural Networks
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- A Probabilistic Approach to Neural Network Pruning (ICML 2021 · similarity 0.88)
- Bayesian Compression for Deep Learning (NeurIPS 2017 · similarity 0.88)
- Importance Estimation for Neural Network Pruning (CVPR 2019 · similarity 0.87)
- "Lossless" Compression of Deep Neural Networks: A High-dimensional Neural Tangent Kernel Approach (NeurIPS 2022 · similarity 0.86)
- NISP: Pruning Networks Using Neuron Importance Score Propagation (CVPR 2018 · similarity 0.86)
- On Neural Networks as Infinite Tree-Structured Probabilistic Graphical Models (NeurIPS 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.